題目鏈接：http://codeforces.com/problemset/problem/841/B

Leha somehow found an array consisting of n integers. Looking at it, he came up with a task. Two players play the game on the array. Players move one by one. The first player can choose for his move a subsegment of non-zero length with an odd sum of numbers and remove it from the array, after that the remaining parts are glued together into one array and the game continues. The second player can choose a subsegment of non-zero length with an even sum and remove it. Loses the one who can not make a move. Who will win if both play optimally?

Input

First line of input data contains single integer n (1?≤?n?≤?10⁶) — length of the array.

Next line contains n integers a₁,?a₂,?...,?a_n (0?≤?a_i?≤?10⁹).

Output

Output answer in single line. "First", if first player wins, and "Second" otherwise (without quotes).

Examples Input 4
1 3 2 3 Output First Input 2
2 2 Output Second Note

In first sample first player remove whole array in one move and win.

In second sample first player can't make a move and lose.

?題解：和為奇數第一個贏 和為偶數 沒有奇數的話第二個贏 否則 還是第一個贏

1 #include <iostream> 2 #include <cstdio> 3 #include <cstring> 4 #include <string> 5 #include <algorithm> 6 #include <cmath> 7 using namespace std; 8 #define ll long long 9 const int N=10005; 10 int main() 11 { 12 int n,k; 13 while(cin>>n){ 14 int t=0; 15 ll sum=0; 16 for(int i=0;i<n;i++){ 17 cin>>k; 18 sum+=k; 19 if(k%2==1) t=1; 20 } 21 if(sum%2==1) cout<<"First"<<endl; 22 else { 23 if(!t) cout<<"Second"<<endl; 24 else cout<<"First"<<endl; 25 } 26 } 27 return 0; 28 }

轉載于:https://www.cnblogs.com/shixinzei/p/7428307.html

總結

以上是生活随笔為你收集整理的Codeforces 841B - Godsend的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。