HDOJ 2069 Coin Change

题意：有五种硬币，50元，25元，10元，5元，1元，并且不用超过100枚硬币，求n元能换成多少种不同的硬币

链接：http://acm.hdu.edu.cn/showproblem.php?pid=2069

思路：暴力枚举

注意点：无

以下为AC代码：

Run ID	Submit Time	Judge Status	Pro.ID	Exe.Time	Exe.Memory	Code Len.	Language	Author
12682242	2015-01-11 17:21:28	Accepted	2069	15MS	1216K	1316 B	G++	luminous11

#include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
#include <vector>
#include <deque>
#include <list>
#include <cctype>
#include <algorithm>
#include <climits>
#include <queue>
#include <stack>
#include <cmath>
#include <map>
#include <set>
#include <iomanip>
#include <cstdlib>
#include <ctime>
#define ll long long
#define ull unsigned long long
#define all(x) (x).begin(), (x).end()
#define clr(a, v) memset( a , v , sizeof(a) )
#define pb push_back
#define mp make_pair
#define read(f) freopen(f, "r", stdin)
#define write(f) freopen(f, "w", stdout)
using namespace std;
const double pi = acos(-1);

int main()
{
    ios::sync_with_stdio( false );
    int num[3000] = { 0 };
    for ( int i = 0; i < 6; i ++ ) {
        for ( int j = 0; j < 11; j ++ ) {
            for ( int k = 0; k < 26; k ++ ) {
                for  ( int l = 0; l < 51; l ++ ) {
                    for ( int p = 0; p < 251; p ++ ) {
                        if ( ( i + j + k + l + p ) > 100 ) {
                            break;
                        }
                        num[i*50+j*25+k*10+l*5+p] ++;
                    }
                }
            }
        }
    }
    int n;
    while ( cin >> n ) {
        cout << num[n] << endl;
    }
    return 0;
}