# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
29901 | ozaslan | Game (IOI13_game) | C++14 | 0 ms | 33268 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 <bits/stdc++.h>
#include <stdio.h>
#include "game.h"
#define max_N 1000
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[max_N][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 (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |