HDU2069暴力

#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<math.h>
#include<iostream>
#include<algorithm>
#include<queue>
#include<stack>
#include<set>
#include<string>
#include<map>
using namespace std;
#define MAX 11

int main()
{
	int a,b,c,d,i,book[251],s;
	memset(book,0,sizeof(book));
	book[0]=1;
	for(i=1;i<=250;i++)
		for(a=0;a*50<=i;a++)
			for(b=0;b*25<=i;b++)
				for(c=0;c*10<=i;c++)
					for(d=0;d*5<=i;d++)
					{
						s=i-(a*50+b*25+c*10+d*5);
						if(s<=100-(a+b+c+d) && s>=0)
							book[i]++;
					}
	while(cin>>i)
		cout<<book[i]<<endl;
	return 0;
}