# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
77257 | 2018-09-24T12:53:22 Z | MohamedAhmed0 | Secret (JOI14_secret) | C++14 | 0 ms | 0 KB |
#include <bits/stdc++.h> using namespace std ; #include "secret.h" #include "grader.h" int arr[1001] ; void Init(int N, int A[]) { for(int i = 0 ; i < N ; ++i) arr[i] = A[i] ; } int Query(int l, int r) { int x = arr[l] ; for(int i = l+1 ; i <= r ; ++i) x = Secret(x , arr[i]); return x ; }