亚洲精华国产欧美,国产精品99久久久久久白浆小说 ,欧美日本国产视频

re: ACM 1564 Sum it up

lu — Thu, 20 Aug 2009 08:03:00 GMT

#include
#include
int t,n;
int solnum;
int ans[120][14],mark[14];
int a[14],sumt[120];
void dfs(int start,int cursum)
{
int i,j,temp,tt;
for(i=start;i {
if(!mark[i]&&a[i]<=cursum)
{
mark[i]=1;
temp=cursum-a[i];
if(!temp)
{
tt=0;
for(j=0;j if(mark[j])
ans[solnum][tt++]=a[j];
sumt[solnum]=tt;
solnum++;
}
else
{
dfs(i+1,temp);
}
mark[i]=0;
}
j=i+1;
while(a[j]==a[i])
j++;
i=j;
}
}
int main()
{
int i,j;
while(scanf("%d%d",&t,&n)!=EOF&&n)
{
memset(ans,0,sizeof(ans));
memset(a,0,sizeof(a));
memset(mark,0,sizeof(mark));
memset(sumt,0,sizeof(sumt));
for(i=0;i scanf("%d",&a[i]);
dfs(0,t);
printf("Sums of %d:\n",t);
if(!solnum)
printf("NONE\n");
else
for(i=0;i {
for(j=0;j printf("%d+",ans[i][j]);
printf("%d\n",ans[i][j]);
}
solnum=0;
}
return 0;
}

lu 2009-08-20 16:03 发表评论