zoukankan      html  css  js  c++  java
  • Codeforces 841B

    题目链接: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 ≤ 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
    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 }
  • 相关阅读:
    React源码 React ref
    数组算法 电话号码组合
    字符串算法 计算子串原理
    React源码 React.Component
    字符串算法 反转单词原理讲解
    React源码 ReactElement
    前端设计模式 中介者模式
    前端设计模式 备忘录模式
    前端设计模式 命令模式
    模拟退火
  • 原文地址:https://www.cnblogs.com/wydxry/p/7428307.html
Copyright © 2011-2022 走看看