Submission #773119

#	Time	Username	Problem	Language	Result	Execution time	Memory
773119		Ludissey	Game (IOI13_game)	C++14	0 / 100	1 ms	304 KiB

game

#include "game.h"
#include <iostream>
#include <string>
#include <set>
#include <map>
#include <cstring>
#include <unordered_map>
#include <vector>
#include <fstream>
#include <bitset>
#include <tuple>
#include <cmath>
#include <cstdint>
#include <stack>
#include <cassert>
#include <cstdio>
#include <queue>
#include <iterator>
#include <iomanip>
#include <algorithm>
#include <sstream>

const int MAX_C = 100;
const int MAX_R = 100;

int grid[MAX_R][MAX_C];
using namespace std;

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;
}

void init(int R, int C) {
    return;
}

void update(int P, int Q, long long K) {
    grid[P][Q] = K;
}

long long calculate(int P, int Q, int U, int V) {
    #define int long long
    int gcd = 0;
    for (int i = P; i <= U; i++)
    {
        for (int j = Q; j <= V; j++)
        {
            gcd = gcd2(grid[i][j], gcd);
        }
    }
    return gcd;
}

• Subtask 1: 0 / 10
• Subtask 2: 0 / 27
• Subtask 3: 0 / 26
• Subtask 4: 0 / 17
• Subtask 5: 0 / 20