forked from sitz/UVa-Online-Judge
-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy path10404.cpp
69 lines (67 loc) · 790 Bytes
/
10404.cpp
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
63
64
65
66
67
68
69
#include <bits/stdc++.h>
using namespace std;
/****
10404
****/
#define MAXN 1000005
char F[MAXN];
int N, T[12], S;
void Cal()
{
int i, j, diff, best;
F[0] = 2;
for (i = 1; i <= N; i++)
{
best = 1;
for (j = 0; j < S; j++)
{
diff = i - T[j];
if (diff >= 0)
{
if (F[diff] == 2)
{
best = 2;
break;
}
else if (F[diff] == 3 && best != 2)
{
best = 3;
}
}
}
if (best == 2)
{
F[i] = 3;
}
else if (best == 3)
{
F[i] = 2;
}
}
if (F[N] == 3)
{
printf("Stan wins\n");
}
else
{
printf("Ollie wins\n");
}
}
int main()
{
int i;
while (scanf("%d", &N) == 1)
{
scanf("%d", &S);
for (i = 0; i < S; i++)
{
scanf("%d", &T[i]);
}
for (i = 0; i <= N; i++)
{
F[i] = 1;
}
Cal();
}
return 0;
}