動態規劃入門——Dividing

來源:互聯網
上載者:User

#include<stdio.h>int w[7];int packback(int s,int num){    if(num<=0)return 0;    if(s==0)return 1;    while(w[num]==0||s<num)        num--;    w[num]--;    return (packback(s-num,num)||packback(s,num-1));}int main(){    int cas=1;    while(scanf("%d",&w[1])!=EOF){        int sum=w[1];        for(int i=2;i<=6;i++){            scanf("%d",&w[i]);            sum+=(w[i]*i);        }        if(sum==0)break;        printf("Collection #%d:\n",cas);cas++;        int flag=0;        if(sum%2!=0){            flag=0;        }        else{            sum/=2;            flag=packback(sum,6);        }        if(flag==0)            printf("Can't be divided.\n");        else            printf("Can be divided.\n");        printf("\n");    }    return 0;}




相關文章

聯繫我們

該頁面正文內容均來源於網絡整理,並不代表阿里雲官方的觀點,該頁面所提到的產品和服務也與阿里云無關,如果該頁面內容對您造成了困擾,歡迎寫郵件給我們,收到郵件我們將在5個工作日內處理。

如果您發現本社區中有涉嫌抄襲的內容,歡迎發送郵件至: info-contact@alibabacloud.com 進行舉報並提供相關證據,工作人員會在 5 個工作天內聯絡您,一經查實,本站將立刻刪除涉嫌侵權內容。

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.