# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
605803 | 2022-07-26T02:29:20 Z | kawaii | Secret (JOI14_secret) | C++14 | 0 ms | 0 KB |
#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; }