# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
931205 | parlimoos | 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.
//Be Name KHODA
#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
#include "secret.h"
using namespace std;
int n;
vector<int> a;
void Init(int N , int A[]){
n = N;
for(int i = 0 ; i < n ; i++) a.pb(A[i]);
}
int Query(int L , int R){
int res = a[L];
for(int i = L + 1 ; i <= R ; i++) res = Secret(res , a[i]);
return res;
}