HDU 1085 Holding Bin-Laden Captive!(母函数)

来源:互联网 发布:java date时间差 编辑:程序博客网 时间:2024/03/29 23:43
#include <iostream>#include <cstring>#include <cstdio>#include <cstdlib>using namespace std;const int MAXN = 8000 + 10;int c1[MAXN], c2[MAXN];int a[5], b[5];void solve(){memset(c1, 0, sizeof(c1));memset(c2, 0, sizeof(c2));for(int i=0;i<=b[1];i++)c1[i] = 1;for(int t=2;t<=3;t++){for(int i=0;i<=MAXN;i++){for(int j=0;j+i<=MAXN && j/a[t] <= b[t];j+=a[t])c2[i+j] += c1[i];}for(int i=0;i<=MAXN;i++){c1[i] = c2[i];c2[i] = 0;}}}int main(){while(scanf("%d%d%d", &b[1], &b[2], &b[3])!=EOF){if(b[1] == 0 && b[2] == 0 && b[3] == 0)break;a[1] = 1; a[2] = 2; a[3] = 5;solve();for(int i=0;i<=MAXN;i++){if(c1[i] == 0){printf("%d\n", i);break;}}}return 0;}

0 0
原创粉丝点击