Submission #1134303

---

Source Code Expand

#include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <cfloat>
#include <climits>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <map>
#include <unordered_map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.h>
#include <vector>
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
typedef pair<double, long long> pdl;

const long double pi = 3.141592653589793;

#define debug(x) cerr << #x << " = " << (x) << endl;
#define rep(i, n) for(int i = 0;i < n;i++)
#define pb push_back
#define mp make_pair
#define mod 1000000007

ll gcd(ll x, ll y) {
    if(y == 0)
        return x;
    else
        return gcd(y, x % y);
}

int main() {

    //freopen("input07.txt","r",stdin);
    //freopen("output_file_name.txt","w",stdout);
    int n;cin>>n;
    ll even = 0, odd = 0;
    ll A[n];
    rep(i, n) {cin>>A[i];if(A[i]%2==0) even++;else odd++;}
    if(n == 1) {
        cout<<"Second"<<endl;
        return 0;
    }

    if(even%2 != 0) {
        cout<<"First"<<endl;
        return 0;
    }

    if(odd >= 2) {
        cout<<"Second"<<endl;
        return 0;
    }

    int f = 1;
    while(true) {
        rep(i, n) {if(A[i]%2 != 0) {A[i]-=1;break;}}
        ll cgcd = 1;
        rep(i, n) cgcd = gcd(cgcd, A[i]);
        even = odd = 0;
        rep(i, n) {A[i]/=cgcd;if(A[i]%2==0) even++;else odd++;}
        f = 1^f;

        if(even%2 != 0) {
            if(f)
                cout<<"First"<<endl;
            else
                cout<<"Second"<<endl;
            return 0;
        }

        if(odd >= 2) {
            if(f)
                cout<<"Second"<<endl;
            else
                cout<<"First"<<endl;
            return 0;
        }
    }

    return 0;
}

Submission Info

Judge Result