| Time Limit: 1000MS | Memory Limit: 65536K | |
| Total Submissions: 3431 | Accepted: 1356 |
Description
1 @ US$3 + 1 @ US$2
1 @ US$3 + 2 @ US$1
1 @ US$2 + 3 @ US$1
2 @ US$2 + 1 @ US$1
5 @ US$1
Write a program than will compute the number of ways FJ can spend N dollars (1
<= N <= 1000) at The Cow Store for tools on sale with a cost of $1..$K (1
<= K <= 100).Input
Output
Sample Input
5 3
Sample Output
5
|
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29 |
#include<iostream>#include<cstring>using
namespace std;__int64
temp,a[1010],b[1010];int main(){ int
i,j,n,k; cin>>n>>k; temp=1; memset(a,0,sizeof(a)); memset(b,0,sizeof(b)); for(i=0;i<18;i++) temp*=10;//__int64存放18位。 a[0]=1; for(i=1;i<=k;i++)//i是金币 for(j=1;j<=n;j++)//j是总额。 { if(i>j) continue; b[j]=b[j]+b[j-i]+(a[j]+a[j-i])/temp;//加上进位，以18位为一个进位。 a[j]=(a[j]+a[j-i])%temp;//不能调换 } if(b[n]) cout<<b[n]; cout<<a[n]<<endl; return
0;} |
poj-3181 Dollar Dayz,布布扣,bubuko.com
原文：http://www.cnblogs.com/cancangood/p/3581216.html