Codeforces 841B - Godsend
题目链接: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?
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 answer in single line. "First", if first player wins, and "Second" otherwise (without quotes).
4
1 3 2 3
First
2
2 2
Second
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.
题解:和为奇数第一个赢 和为偶数 没有奇数的话第二个赢 否则 还是第一个赢
#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <algorithm>
#include <cmath>
using namespace std;
#define ll long long
const int N=;
int main()
{
int n,k;
while(cin>>n){
int t=;
ll sum=;
for(int i=;i<n;i++){
cin>>k;
sum+=k;
if(k%==) t=;
}
if(sum%==) cout<<"First"<<endl;
else {
if(!t) cout<<"Second"<<endl;
else cout<<"First"<<endl;
}
}
return ;
}
最新文章
- Windows Phone 8.1 新特性 - 常用的启动器
- codeforces 732
- Linux ubuntu 10.10安装OpenCv
- windows装liunx双系统
- Storyboards vs NIB vs Code 大辩论
- hdu 4570 Multi-bit Trie 区间DP入门
- 微信小程序 JS动态修改样式
- Time Complexity of Loop with Powers
- 进阶-Redis 知识梳理
- IO复用(较详细)
- AL32UTF8 and UTF8 and ZHS16GBK
- poj 2763(RMQ+BIT\树链剖分)
- Qt简单项目--加法计算器(详细代码注释)
- 列表(list)的增删改查
- #个人博客作业Week1——浏览教材后提出的5个问题
- Java 在匿名内部函数中为外部函数变量赋值的解决方案
- C# Serializable对象序列化的作用
- SQL Server Profiler查询跟踪的简单使用
- BZOJ4017 小Q的无敌异或(位运算)
- isinstance 和 type 的区别