Codeforces Round #429 (Div2) B

最新推荐文章于 2022-08-21 01:05:54 发布

onepointo

最新推荐文章于 2022-08-21 01:05:54 发布

阅读量214

点赞数

分类专栏： ————博弈论———— 文章标签： codeforces

本文链接：https://blog.csdn.net/onepointo/article/details/77481283

版权

————博弈论———— 专栏收录该内容

4 篇文章 0 订阅

订阅专栏

B. Godsend

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 ≤ 106) — length of the array.
Next line contains n integers a1, a2, …, an (0 ≤ ai ≤ 109).

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

【解题报告】
首先分情况讨论：
——1.如果总和是奇数得话->第一个人赢（全部取完）
——2.如果总和是偶数的话->
————2.1如果数组里没有奇数->第二个人赢（显然）
————2.2里面数组里有奇数->那么一定有两个奇数
——————所以取数的流程是：
——————第一个人取出奇数和（现在总和为奇数）->
——————第二个人取出偶数和（现在总和为偶数）->
——————第一个人取出奇数和（现在总和为奇数）->
——————总和为奇数，参见情况1
所以
数组中有奇数->第一个人赢
没有->第二个人赢

代码如下：

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
#define N 1000010

int n,a;
bool flag=0;

int main()
{
    scanf("%d",&n);
    for(int i=1;i<=n;++i)
    {
        scanf("%d",&a);
        if(a%2) 
        {
            flag=1;
            break;
        }
    }
    puts(flag?"First":"Second");
    return 0;
}