Submission #1474542

---

Source Code Expand

#include "bits/stdc++.h"
using namespace std;

int n;

int get_grundy(vector<int> a) {
        set<int> s;
        bool f = true;
        for (int i = 0; i < n; i ++) if (a[i] != 1) f = false;
        if (f) return 0;
        for (int i = 0; i < n; i ++) {
                if (a[i] == 1) continue;
                a[i] --;
                int gcd = a[0];
                for (int j = 1; j < n; j ++) {
                        gcd = __gcd(gcd, a[j]);
                }
                for (int j = 0; j < n; j ++) {
                        a[j] /= gcd;
                }
                s.insert(get_grundy(a));
                for (int j = 0; j < n; j ++) {
                        a[j] *= gcd;
                }
                a[i] ++;
        }
        int g = 0;
        while (s.count(g)) g ++;
        return g;
}

int main() {
        cin >> n;
        vector<int> a(n);
        for (int i = 0; i < n; i ++) cin >> a[i];
        int ans = get_grundy(a);
        cout << (ans ? "First" : "Second") << endl;
        return 0;
}

Submission Info

Judge Result