1059.cpp

来自「杭电 acm部分代码 有兴趣的可以下载 谢谢」· C++ 代码 · 共 47 行

#include<stdio.h>
#include<string>
const int single[7]={1,2,3,4,5,6};
int c1[60001],c2[60001];
int main()
{
    int mav[6];
    int i,j,k,sum,haf,tst=0;
    while(true){
        sum=0;
        for(i=0;i<6;i++){
            scanf("%d",&mav[i]);
            if(mav[i]%2==1&&mav[i]>61)
                mav[i]=61;
            else if(mav[i]%2==0&&mav[i]>61)
                mav[i]=60;
            sum+=mav[i]*single[i];
        }
        if(mav[0]==0&&mav[1]==0&&mav[2]==0&&mav[3]==0&&mav[4]==0&mav[5]==0)
            break;
        printf("Collection #%d:\n",++tst);
        if(sum%2){
            printf("Can't be divided.\n\n");
            continue;
        }
        haf=sum/2;
        for(i=0;i<=haf;i++)
            c1[i]=c2[i]=0;
        c1[0]=1;
        for(i=0;i<6;i++){
            for(j=0;j<=haf;j++)
                if(c1[j])
                    for(k=j;k<=j+mav[i]*single[i]&&k<=haf;k+=single[i])
                        c2[k]+=c1[j];
            for(j=0;j<=haf;j++){
                c1[j]=c2[j];
                c2[j]=0;
            }
        }
        if(c1[haf]==0)
            printf("Can't be divided.\n\n");
        else
            printf("Can be divided.\n\n");
    }
    return 0;
}