sticks代码

#include

#include

#include

using namespace std;

int len[65];

int visit[65];

int lon,n,s;

bool cmp(int a,int b){

return a>=b;

}

bool dfs(int cnt,int index,int num){

if(num==s/lon)

return true;

int i;

for(i=index;i

if(i&&visit[i-1]==0&&(len[i]==len[i-1]))continue;

if(cnt+len[i]>lon)continue;

if(visit[i]==1)continue;

visit[i]=1;

if(cnt+len[i]==lon){

if(dfs(0,0,num+1))

return true;

visit[i]=false;

return false;

}

if(dfs(cnt+len[i],i+1,num))

return true;

visit[i]=false;

if(cnt==0)

return false;

}

return false;

}

int main(){

int i;

while(scanf("%d",&n)&&n){

s=0;

for(i=0;i

scanf("%d",&len[i]);

            s+=len[i];

}

sort(len,len+n,cmp);

        for(i=0;i

}

for(lon=len[0];lon<=s;lon++){

if(s%lon!=0)

continue;

memset(visit,0,sizeof(visit));

if(dfs(0,0,0)){

printf("%d\n",lon);

break;

            }

}

}

return 0;

}