Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include<cstdio>
- #include<cstring>
- using namespace std;
- #define M 8000
- #define N 1000
- int num[3];
- int c1[M+1],c2[M+1];
- int dis[]={1,2,5};
- int a,b,c,sum; //分别代表1元,2元,5元硬币的个数
- void solve()
- {
- memset(num,0,sizeof(num));
- memset(c1,0,sizeof(c1));
- memset(c2,0,sizeof(c1));
- num[0]=a;
- num[1]=b;
- num[2]=c;
- int i,j,k;
- for(i=0;i<=dis[0]*num[0];i++)
- c1[i]=1;
- for(i=1;i<3;++i)
- {
- for(j=0;j<=sum;++j)
- {
- for(k=0;k+j<=sum&&k<=num[i]*dis[i];k+=dis[i])
- {
- c2[k+j]+=c1[j];
- }
- }
- for(j=0;j<=sum;++j)
- {
- c1[j]=c2[j];
- c2[j]=0;
- }
- }
- }
- int main()
- {
- while(scanf("%d%d%d",&a,&b,&c)!=EOF&&(a||b||c))
- {
- int i;
- bool flag=false;
- sum=1*a+2*b+5*c;
- solve();
- for(i=1;i<=sum;++i)
- {
- if(!c1[i])
- {
- flag=true;
- break;
- }
- }
- if(flag)
- printf("%d\n",i);
- else
- printf("%d\n",sum+1);
- // printf("%d=%d\n",i,c1[i]);
- }
- // cout << "Hello world!" << endl;
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment