codeforces549CThe Game Of Parity+博弈

There are n cities in Westeros. The i-th city is inhabited by ai people. Daenerys and Stannis play the following game: in one single move, a player chooses a certain town and burns it to the ground. Thus all its residents, sadly, die. Stannis starts the game. The game ends when Westeros has exactly k cities left.

The prophecy says that if the total number of surviving residents is even, then Daenerys wins: Stannis gets beheaded, and Daenerys rises on the Iron Throne. If the total number of surviving residents is odd, Stannis wins and everything goes in the completely opposite way.

Lord Petyr Baelish wants to know which candidates to the throne he should support, and therefore he wonders, which one of them has a winning strategy. Answer to this question of Lord Baelish and maybe you will become the next Lord of Harrenholl.
Input

The first line contains two positive space-separated integers, n and k (1 ≤ k ≤ n ≤ 2·105) — the initial number of cities in Westeros and the number of cities at which the game ends.

The second line contains n space-separated positive integers ai (1 ≤ ai ≤ 106), which represent the population of each city in Westeros.
Output

Print string “Daenerys” (without the quotes), if Daenerys wins and “Stannis” (without the quotes), if Stannis wins.
Examples
Input

3 1
1 2 1

Output

Stannis

Input

3 1
2 2 1

Output

Daenerys

Input

6 3
5 20 12 7 14 101

Output

Stannis

Note

In the first sample Stannis will use his move to burn a city with two people and Daenerys will be forced to burn a city with one resident. The only survivor city will have one resident left, that is, the total sum is odd, and thus Stannis wins.

In the second sample, if Stannis burns a city with two people, Daenerys burns the city with one resident, or vice versa. In any case, the last remaining city will be inhabited by two people, that is, the total sum is even, and hence Daenerys wins.

n个城市，每个城市有ai人， Daenerys 和Stannis轮流每次灭掉一个城市，使得最后剩下k座城市 。Stannis 先手。剩下城市的人口数为偶数，Daenerys 胜，否则Stannis 胜。问谁必胜。

对于奇偶的个数进行博弈，（注意n==k时，wa了好几发）

#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<iostream>
#include<string>
#define LL long long
#define debug(x) cout<<x<<endl;

using namespace std;
int k,n;
int main(){
    scanf("%d %d",&n,&k);
    int ou=0,ji=0;
    for(int i=1;i<=n;i++){
        int x;
        scanf("%d",&x);
        if(x&1) ji++;
        else ou++;
    }
    int mov=n-k;   //双方一共需要炸几步
    if(mov==0){    //一步都没有，直接判断
        if(ji%2==1) printf("Stannis\n");
        else printf("Daenerys\n");
    }
    else if(mov%2==0){  //最后一步是Daenerys
        if(mov/2>=ji) printf("Daenerys\n");//把全部奇数扔掉
        else{
            if(mov/2>=ou&&k%2==1) printf("Stannis\n");
            else printf("Daenerys\n");
        }
    }
    else{     //最后一步是Stannis
        if(mov/2>=ji) printf("Daenerys\n");//把全部奇数扔掉
        else{
            if(mov/2>=ou&&k%2==0) printf("Daenerys\n");//把全部偶数扔掉
            else printf("Stannis\n");
        }
    }
    return 0;
}