# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
29902 | 2017-07-21T10:19:13 Z | ozaslan | Game (IOI13_game) | C++14 | 0 ms | 33268 KB |
#include <bits/stdc++.h> #include <stdio.h> #include "game.h" #define max_N 100000 long long gcd2(long long X, long long Y) { //printf("X\n"); long long tmp; while (X != Y && Y != 0) { tmp = X; X = Y; Y = tmp % Y; } return X; } long long st[10][max_N * 4]; int sa, su; void init(int R, int C) { sa = R; su = C; } void update(int P, int Q, long long K) { // guncelle(1, 0, su-1, P, Q, K); } long long calculate(int P, int Q, int U, int V) { /* ... */ long long ekok;// = mat[P][Q]; return ekok; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 33268 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 33268 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 33268 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 33268 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 33268 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |