# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
291473 | cig32 | Game (IOI13_game) | 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.
#include "game.h"
#include <bits/stdc++.h>
#define ll long long
using namespace std;
int grid[1000][1000];
void init(int R,int C){
for(int i=0;i<R;i++){
for(int j=0;j<C;j++){
grid[i][j]=0;
}
}
}
void update(int P,int Q,long long K){
grid[P][Q]=K;
}
long long calculate(int P,int Q,int U,int V){
ll GCD=grid[P][Q];
for(int i=P;i<=U;i++){
for(int j=Q;j<=V;j++){
if(grid[i][j]!=0) GCD=gcd2(GCD,grid[i][j]);
}
}
return GCD;
}