Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include<cstdio>
- #include<cstring>
- using namespace std;
- #define M 50
- int num[27];
- int c1[M+1],c2[M+1];
- void solve()
- {
- memset(c1,0,sizeof(c1));
- memset(c2,0,sizeof(c2));
- int i,j,k;
- for(i=0;i<=num[1]*1;i++)
- c1[i]=1;
- for(i=2;i<=26;++i)
- {
- for(j=0;j<=M;++j)
- {
- for(k=0;k+j<=M&&k<=num[i]*i;k+=i)
- {
- c2[k+j]+=c1[j];
- }
- }
- for(j=0;j<=M;++j)
- {
- c1[j]=c2[j];
- c2[j]=0;
- }
- }
- }
- int main()
- {
- int i,t;
- scanf("%d",&t);
- while(t--)
- {
- for(i=1;i<=26;++i)
- scanf("%d",&num[i]);
- solve();
- int sum=0;
- for(i=1;i<=M;++i)
- {
- sum+=c1[i];
- // printf("%d=%d\n",i,c1[i]);
- }
- printf("%d\n",sum);
- }
- // cout << "Hello world!" << endl;
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment