CodeForces - 841B Godsend——思路题

#include <bits/stdc++.h>
typedef long long LL;
const int maxn = 1e6 +10;
LL a[maxn];
using namespace std;
int main() {
    int n; scanf("%d", &n);
    LL sum = 0;
    bool ok = false;
    for (int i = 1; i <= n; i++) {
        scanf("%I64d", &a[i]);
        sum += a[i];
        if (a[i] % 2) ok = true;
    }
    if (sum % 2) printf("First\n");
    else {
        if (ok) {
            printf("First\n");
        }
        else printf("Second\n");
    }
    return 0;
}