注意PE……
#include<iostream>
#include<map>
#include<string>
#include<cstring>
#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<queue>
#include<vector>
#include<algorithm>
using namespace std;
int coin[5]={1,5,10,25,50};
long long dp[30010];
int main()
{
int i,j;
dp[0]=1;
for(i=0;i<5;i++)
for(j=coin[i];j<=30000;j++)
dp[j]+=dp[j-coin[i]];
while(cin>>i)
if(dp[i]==1)
printf("There is only 1 way to......
阅读全文