[BZOJ 1042][HAOI2008]硬币购物：容斥原理

/*
User:Small
Language:C++
Problem No.:1042
*/
#include<bits/stdc++.h>
#define ll long long
#define inf 999999999
using namespace std;
const int M=1e5+5;
int c[5],d[5],s;
ll f[M],ans;
void dfs(int now,int sum,int cnt){
if(now==5){
if(s-sum<0) return;
if(cnt&1) ans-=f[s-sum];
else ans+=f[s-sum];
return;
}
dfs(now+1,sum+(d[now]+1)*c[now],cnt+1);
dfs(now+1,sum,cnt);
}
void solve(){
ans=0;
for(int i=1;i<=4;i++) scanf("%d",&d[i]);
scanf("%d",&s);
dfs(1,0,0);
printf("%lld\n",ans);
}
int main(){
freopen("data.in","r",stdin);//
for(int i=1;i<=4;i++) scanf("%d",&c[i]);
f[0]=1;
for(int i=1;i<=4;i++)
for(int j=c[i];j<=1e5;j++) f[j]+=f[j-c[i]];
int t;
scanf("%d",&t);
while(t--) solve();
return 0;
}