G - Game of Nuts URAL - 2068 （博弈）

最新推荐文章于 2022-10-10 19:19:16 发布

nucleare

最新推荐文章于 2022-10-10 19:19:16 发布

阅读量233

点赞数

CC 4.0 BY-SA版权

分类专栏：博弈

本文链接：https://blog.csdn.net/nucleare/article/details/89844418

不明所以同时被 2 个专栏收录

4 篇文章

订阅专栏

博弈

2 篇文章

订阅专栏

博客围绕URAL - 2068的坚果游戏展开，介绍游戏规则：玩家轮流将奇数个坚果的堆分成三个奇数个坚果的非空堆，无法行动者输，丹妮莉丝先行动。还给出输入输出要求及示例，需判定双方最优玩法下的胜者。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

G - Game of Nuts

URAL - 2068

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".

Example

input	output
1 3	Daenerys
3 1 1 1	Stannis
5 777 313 465 99 1	Daenerys

#include <algorithm>
#include <iostream>
#include <cstring>
#include <vector>
#include <string>
#include <functional>
#include <cstdio>
#include <cmath>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
using namespace std;
#define ll long long
#define F first
#define S second
#define p_b push_back
#define m_p make_pair
const ll LINF = 0x3f3f3f3f3f3f3f3f;
const int INF = 0x3f3f3f3f;
const int mod = 1e9 + 7;
const int M = 1e7 + 7;
const int N = 1e6 + 7;
int main() {
	
	int n;
	scanf ("%d", &n);
	int x, ans = 0;
	for (int i = 1; i <= n; ++i) {
		scanf ("%d", &x);
		ans ^= ((x / 2) & 1);
	}
	if (ans) puts("Daenerys");
	else puts("Stannis");
	return 0;
}