URAL 2068. Game of Nuts（博弈）

2068. Game of Nuts Time limit: 1.0 second Memory limit: 64 MB The war for Westeros is still in process, manpower and supplies are coming to an end and the winter is as near as never before. The game of thrones is unpredictable so Daenerys and Stannis decided to determine the true ruler of Seven Kingdoms playing more predictable and shorter game. For example, the game of nuts is the ideal candidate. Rules of this game are quite simple. Players are given  n heaps of nuts. There is an odd number of nuts in each heap. Players alternate turns. In each turn player chooses an arbitrary heap and divides it into three non-empty heaps so as there is again an odd number of nuts in each heap. The player who cannot make a move loses. Daenerys has dragons so she moves first. Your task is to determine the winner assuming both Daenerys and Stannis play optimally. Please, do it and stop the war for Westeros! Input In the first line there is an odd integer  n (1 ≤  n ≤ 777). In the second line there are  n integers separated by spaces. These are the amounts of nuts in each heap at the beginning of the game. It is guaranteed that each heap contains not less than one and not more than 54321 nuts and this amount is an odd number. Output Output "Daenerys" (without quotes) in case of Daenerys’ win. Otherwise output "Stannis". Samples input output 1 3 Daenerys 3 1 1 1 Stannis 5 777 313 465 99 1 Daenerys Problem Author: Alexey Danilyuk Problem Source: Ural Regional School Programming Contest 2015 题目大体意思就是说有两个人要将奇数堆的坚果分成三堆都含有奇数个的坚果堆,直到一方没法分为止....对于每一堆坚果都可以看成含有2*k+1个坚果, #include<cstdio> #include<cstring> #include<iostream> #include<algorithm> using namespace std; int main() { int n; cin>>n; int ant=0,e; for(int i=0;i<n;i++) { cin>>e; ant+=e/2;///每堆石子可以被分n/2次 } if(ant%2==1) cout<<"Daenerys"<<endl; else cout<<"Stannis"<<endl; return 0; }