Peli

#include <bits/stdc++.h>
using namespace std;
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int t;
    cin >> t;
    vector<vector<int>> d(2001, vector<int>(2001, 0));
    for(int i {}; i <= 2000; ++i) d[i][i] = d[0][i] = d[i][0] = 1;
    for(int i = 1; i <= 2000; ++i)
    {
        for(int j = i + 1; j <= 2000; ++j)
        {
            for(int k = 1; k <= j; ++k)
            {
                d[i][j] = max(d[i][j], d[min(i, j - k)][max(i, j - k)] ? 0 : 1);
                if(k <= i)
                {
                    d[i][j] = max(d[i][j], d[i - k][j - k] ? 0 : 1);
                    d[i][j] = max(d[i][j], d[i - k][j] ? 0 : 1);
                }
            }
        }
    }
    while(t--)
    {
        int a, b;
        cin >> a >> b;
        if(a > b) swap(a, b);
        cout << (d[a][b] ? "first\n" : "second\n");
    }
}

Test 1 (public)

Group: 1, 2, 3

Verdict: TIME LIMIT EXCEEDED

Test 2

Group: 1, 2, 3

Verdict: TIME LIMIT EXCEEDED

Test 3

Group: 2, 3

Verdict: TIME LIMIT EXCEEDED

Test 4

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 5

Group: 2, 3

Verdict: TIME LIMIT EXCEEDED

Test 6

Group: 3

Verdict: TIME LIMIT EXCEEDED