# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
22718 | 2000/4000 (#40) | Window Xor (KRIII5_WX) | C++14 | 296 ms | 1996 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 <cstdio>
#include <cstring>
const int MAXN = 100004;
typedef long long lli;
int N, K;
int T, G;
int D[MAXN];
int A[MAXN];
bool visited[MAXN];
int pow2mod(lli, int);
int gcd2(int, int);
int main() {
lli t, k = 1;
scanf("%d %d %lld", &N, &K, &t);
for (int i = 0; i < N; ++i) {
scanf("%d", &A[i]);
}
while (t) {
if (!(t & 1)) {
k <<= 1;
t >>= 1;
continue;
}
T = k % N;
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |