# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
13386 | dohyun0324 | Game (IOI13_game) | C++98 | 7901 ms | 70684 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<stdio.h>
#include "game.h"
typedef long long ll;
int x4,y4,x3,y3,n,m,x1,y1,x2,y2;
ll k;
ll gcd2(ll X, ll Y) {
if(X==0) return Y; if(Y==0) return X;
ll tmp;
while (X != Y && Y != 0) {
tmp = X;
X = Y;
Y = tmp % Y;
}
return X;
}
void finding(int y1,int x,int y)
{
int mi;
x3=1; y3=m;
while(1)
{
mi=(x3+y3)/2;
if(y1<=mi) y3=mi;
else x3=mi+1;
if(x3<=x && y<=y3) x4=x3, y4=y3;
else break;
}
}
struct data
{
# | 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... |