```
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
using namespace std;
int f[10000001];
int num[10]={1,2,3,5,10,20};
int s[7];
int n,k;
void dfs(int x,int ans)
{
if (x>6)
{
f[ans]=1;
return;
}
for (int i=0; i<=s[x]; ++i)
{
ans+=num[x]*i;
dfs(++x,ans);
ans-=num[x]*i;
}
}
int main() {
memset(f,0,sizeof(f));
for (int i=1; i<=6; ++i)
{
scanf("%d",&k);
s[i]=k;
}
dfs(1,0);
long long kkk=0;
for (int i=1; i<=10000001; ++i)
if(f[i]==1) kkk++;
printf("Total=%I64d",kkk);
}
```
帮忙markdown
by Floatiy @ 2018-10-10 22:59:36
用%lld试一下
by Floatiy @ 2018-10-10 23:02:12
int num[10]={0,1,2,3,5,10,20};
by Floatiy @ 2018-10-10 23:07:12
@[四向搜](/space/show?uid=52200) 还是哇（WA）了
by 会唱歌的石榴 @ 2018-10-11 23:43:17
@[细水长流](/space/show?uid=35667) 大约是你搜索写挂了……下个测试点单调吧
by Floatiy @ 2018-10-12 07:33:01