UVA 10404 Bachet's Game

#include <map>
#include <set>
#include <list>
#include <cmath>
#include<cctype>
#include <ctime>
#include <deque>
#include <stack>
#include <queue>
#include <cstdio>
#include <string>
#include <vector>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>
#define LL long long
#define PI 3.1415926535897932626
using namespace std;
int gcd(int a, int b)
{
return a % b == 0 ? b : gcd(b, a % b);
}
#define MAXN 1000010
#define MAXD 20
int N,M;
int dp[MAXN],src[MAXD];
int main()
{
while (scanf("%d%d",&N,&M)!=EOF)
{
for (int i=0;i<M;i++) scanf("%d",&src[i]);
dp[0]=0;
for (int i=1;i<=N;i++)
{
dp[i]=0;
for (int j=0;j<M;j++)
if (i>=src[j]&&dp[i-src[j]]==0)
{
dp[i]=1;
break;
}
}
if (dp
) printf("Stan wins\n");
else printf("Ollie wins\n");
}
return 0;
}