poj3181 背包+大数

http://poj.org/problem?id=3181

Dollar Dayz

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 7997		Accepted: 2992

Description

Farmer John goes to Dollar Days at The Cow Store and discovers an unlimited number of tools on sale. During his first visit, the tools are selling variously for $1, $2, and $3. Farmer John has exactly $5 to spend. He can buy 5 tools at $1 each or 1 tool at $3 and an additional 1 tool at $2. Of course, there are other combinations for a total of 5 different ways FJ can spend all his money on tools. Here they are:

        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

A single line with two space-separated integers: N and K.

Output

A single line with a single integer that is the number of unique ways FJ can spend his money.

Sample Input

5 3

Sample Output

5

Source

USACO 2006 January Silver

   大数加法写成shi我也是很无奈- -，ans的位数写的不对导致部分数据能过让我检查半天。

 #include<iostream>
 #include<cstdio>
 #include<cstring>
 using namespace std;
 struct Bign
 {
     int a[];
     void out()
     {
         for(int i=a[];i>=;--i)
             printf("%d",a[i]);puts("");
     }
 }f[];
 void add(Bign &e,Bign &x){
         int limit=max(e.a[],x.a[]);
         e.a[]=limit;
         for(int i=;i<=limit;++i)
             e.a[i]+=x.a[i];
         for(int i=;i<=e.a[];++i)
         {
             if(e.a[i]>){
                 e.a[i+]++;
                 e.a[i]%=;
             }
             if(e.a[e.a[]+]) e.a[]++;
         }
     }
 int main()
 {
     int N,K,i,j;
     while(cin>>N>>K){
         for(i=;i<=N;++i){
                 memset(f[i].a,,sizeof(f[i].a));
                 f[i].a[]=;
         }
         f[].a[]=;
         for(i=;i<=K;++i)
             for(j=i;j<=N;++j){
             add(f[j],f[j-i]);
             }
         f[N].out();
     }
     return ;
 }