# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
71031 | KLPP | 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<iostream>
#include<stdio.h>
using namespace std;
typedef long long lld;
long long gcd2(long long X, long long Y) {
long long tmp;
while (X != Y && Y != 0) {
tmp = X;
X = Y;
Y = tmp % Y;
}
return X;
}
struct node1{
node1 *left, *right;
int l, r;
lld vl;
} typedef node1;
struct node2{
node2 *left,*right;
node1 *segtree;
int l,r;
}typedef node2;
void build(node1 *n,int l,int r){
n->l=l;
n->r=r;
n->vl=0;
}
void extend(node1 *v){