2013华为上机-装满篮子问题-回溯法

http://blog.csdn.net/limaoguang2/article/details/11721711

#include<stdlib.h>
#include <stdio.h>


#define N 20




int  main()
{
int i,count = 0;
int a[N]={0};
int Y[N];
int sum = 0,j,k;
char c;
c=' ';
while(c==' ')
{
scanf("%d%c",&a[count],&c);
count++;
}
count = count - 1;//数组的数量
printf("%d",count);
i = 1;
sum = a[1];
Y[1] = 1;
while(i<=count&&sum!=a[0])
{
if (sum<a[0])
{
for (j = count;j>0;j--)
{
if (Y[j] == 1)
{
break;
}
}
if (j==count)
{
Y[count] = 0;
for (k = count;k>0;k--)
{
if (Y[k] == 1)
{
break;
}
}
Y[k] = 0;
Y[k+1] = 1;
sum = sum - a[count];
sum = sum - a[k];
sum += a[k+1];
for (j = 1;j<=count;j++)
{
if(Y[j] ==1)
break;
}
for (k = count;k>0;k--)
{
if (Y[k] == 1)
{
break;
}
}
if (j == k)
{
i++;
}
}
else
{
sum += a[j+1];
Y[j+1] = 1;
}
}
else if(sum>a[0])
{
for (j = count;j>0;j--)
{
if (Y[j]==1)
{
break;
}
}
if (j==count)
{
Y[count] = 0;
for (k = count;k>0;k--)
{
if (Y[k] == 1)
{
break;
}
}
Y[k] = 0;
Y[k+1] = 1;
sum = sum - a[count];
sum = sum - a[k];
sum += a[k+1];
for (j = 1;j<=count;j++)
{
if(Y[j] ==1)
break;
}
for (k = count;k>0;k--)
{
if (Y[k] == 1)
{
break;
}
}
if (j == k)
{
i++;
}
}
else
{
sum = sum - a[j];
Y[j] = 0;
sum += a[j+1];
Y[j+1] = 1;
}


}
else
{
break;
}
}
if (a[0] == sum)
{
printf("YES");
printf(" %d:",a[0]);
for(i = 0;i<=count;i++)
{
if (Y[i] == 1)
{
printf(" %d",a[i]);
}
}
}
else
{
printf("No solution");
}
return 0;
}