Project Euler problem 31

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
#include <stack>
#include <cmath>
#include <map>
#include <ctime>
#define MAXN 111111
#define INF 100000007
using namespace std;
int a[8] = {1, 2, 5, 10, 20, 50, 100, 200};
long long dp[222];
int main()
{
dp[0] = 1;
for(int i = 0; i < 8; i++)
for(int j = a[i]; j <= 200; j++)
dp[j] += dp[j - a[i]];
cout << dp[200] << endl;
return 0;
}