forked from ngthanhtrung23/CompetitiveProgramming
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathC.cpp
More file actions
62 lines (52 loc) · 1.52 KB
/
C.cpp
File metadata and controls
62 lines (52 loc) · 1.52 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
#include <bits/stdc++.h>
#define FOR(i,a,b) for(int i=(a),_b=(b); i<=_b; i++)
#define FORD(i,a,b) for(int i=(a),_b=(b); i>=_b; i--)
#define REP(i,a) for(int i=0,_a=(a); i<_a; i++)
#define EACH(it,a) for(__typeof(a.begin()) it = a.begin(); it != a.end(); ++it)
#define DEBUG(x) { cout << #x << " = "; cout << (x) << endl; }
#define PR(a,n) { cout << #a << " = "; FOR(_,1,n) cout << a[_] << ' '; cout << endl; }
#define PR0(a,n) { cout << #a << " = "; REP(_,n) cout << a[_] << ' '; cout << endl; }
#define sqr(x) ((x) * (x))
#define ll long long
#define SZ(X) ((int) ((X).size()))
using namespace std;
#define SECOND "Daenerys"
#define FIRST "Stannis"
int n, k;
int odd, even;
string solve() {
if (n == k) {
if (odd % 2) return FIRST;
return SECOND;
}
int second = (n - k) / 2;
int first = n - k - second;
if (first > second) {
if (k % 2) {
if (second < odd) return FIRST;
return SECOND;
}
else {
if (second < odd && second < even) return FIRST;
return SECOND;
}
} else {
if (k % 2) {
if (first >= even) return FIRST;
return SECOND;
}
return SECOND;
}
}
int main() {
ios :: sync_with_stdio(false);
while (cin >> n >> k) {
odd = 0, even = 0;
FOR(i,1,n) {
int a; cin >> a;
if (a % 2) ++odd;
else ++even;
}
cout << solve() << endl;
}
}