nyoj--Divideing Jewels

#include<iostream>
#include<cstring>
#include<stdio.h>
using namespace std;
int num[15],sum;
bool dfs(int n,int m)
{
    if(n==0||m==0)
    {
        if(m==0)
            return true;
    }
    else
    {
        for(int i=num[n];i>=0;i--)
        {
            if(m>=n*i&&dfs(n-1,m-n*i))
            {
                return true;
            }
        }
    }
    return false;
}
int main()
{
    int temp=1;
    while(1)
    {
        sum=0;
        for(int i=1;i<=10;i++)
        {
            cin>>num[i];
            sum+=i*num[i];
        }
        if(sum==0)
            break;
        if(sum%2!=0)
            printf("#%d:Can‘t be divided.\n",temp);
        else
        {
            if(dfs(10,sum/2))
                printf("#%d:Can be divided.\n",temp);
            else 
                printf("#%d:Can‘t be divided.\n",temp);
        }
        temp++;
    } 
    system("pause");
    return 0;   
}