# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
910002 | vjudge1 | Race (IOI11_race) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
int best_path(int N,int K,int H[][],L[]){
for (int i =1; i<n; i++){
int sum;
for (int ii = 0; ii <n-i;ii++){
for (int j = 0; j<i;j++){
sum += L[j+ii];
}
if (sum == K)return ii;
sum = 0;
}
}
}