# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
605803 | kawaii | Secret (JOI14_secret) | C++14 | 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 "secret.h"
void Init(int N, int A[]){
int x = Secret(0, 1000000000);
}
int Query(int L, int R){
int ans = A[L];
for(int i = L + 1; i <= R; i++) ans += A[i];
return ans;
}