Godsend CodeForces

简单博弈

只要有奇数存在，就是第一个赢
奇数个奇数的话：第一个人全取完就赢了
偶数个偶数的话：第一个人只要留下一个奇数取完其他的就赢了

#include <iostream>#include <cstdio>#include <cstdlib>#include <cstring>#include <cmath>#include <set>#include <map>#include <stack>#include <queue>#include <ctype.h>#include <vector>#include <algorithm>#define in freopen("in.txt", "r", stdin)#define out freopen("out.txt", "w", stdout)// cout << "  ===  " << endl;using namespace std;typedef long long ll;const int maxn = 1000000 + 7, INF = 0x7f7f7f7f, mod = 1e9+7;int T, n, k, v;int main() {    int cnt = 0;    scanf("%d", &n);    for(int i = 0; i < n; ++i) {        scanf("%d", &v);        if(v % 2 == 1) cnt++;    }    if(cnt) puts("First");    else puts("Second");    return 0;}