分硬币 |
Time Limit: 1000ms, Special Time Limit:2500ms, Memory Limit:32768KB |
Total submit users: 61, Accepted users: 50 |
Problem 10415 : No special judgement |
Problem description |
一个背包里面最多有100枚硬币,要将这些硬币分给两个人,使得两人得到的钱差距最小。每枚硬币的面值范围是1分到500分,不允许将一枚硬币分开。 |
Input |
第一行有一个非负整数m(m<=100),表示硬币数。第二行有m个正整数,表示每枚硬币的面值,中间用空格分开。 |
Output |
每组仅输出一个非负整数,表示两人所分到钱的最小差值。 |
Sample Input |
3 2 3 5 4 1 2 4 6 |
Sample Output |
0 1 |
Problem Source |
HNU Contest |
#include
<
iostream
>
#include < math.h >
using namespace std;
#define MAX 1000
#define MAX2 1000000
int num[MAX],rec[MAX2];
int n = 0 ,prec = 0 ;
void v( int dir, int l, int moneyup);
main()
{
int i,j;
int a,b,min = 0 ;
while ( scanf( " %d " , & n) > 0 ){
a = b = 0 ;
for (i = 0 ;i < n;i ++ )scanf( " %d " , & num[i]);
// for(i=0;i<n;i++)printf("%d== ",num[i]);
prec = 0 ;
// cout<<"n="<<n<<endl;
v( 0 , 0 , 0 );
// for(i=0;i<(j=pow(2,n));i++)printf("%d ",rec[i]);
j = pow( 2 ,n);
min = abs(rec[ 0 ] - rec[n - 1 ]);
for (i = 1 ;i < j / 2 ;i ++ ){
// printf("n=%d,rec[%d]=%d,rec[%d]=%d ",n,i,rec[i],j-1-i,rec[j-1-i]);
if (abs(rec[i] - rec[j - 1 - i]) < min)min = abs(rec[i] - rec[j - 1 - i]);
}
printf( " %d " ,min);
}
}
void v( int dir, int l, int moneyup)
{//moneyup存放此层以上各层的一条路径的总钱数和,l表示当前是第l层
// cout<<" l="<<l<<" moneyup="<<moneyup<<endl;
// system("PAUSE");
if (l == n){rec[prec] = moneyup;prec ++ ; return ;}
v( 1 ,l + 1 ,moneyup + num[l]);
v( 0 ,l + 1 ,moneyup);
}
#include < math.h >
using namespace std;
#define MAX 1000
#define MAX2 1000000
int num[MAX],rec[MAX2];
int n = 0 ,prec = 0 ;
void v( int dir, int l, int moneyup);
main()
{
int i,j;
int a,b,min = 0 ;
while ( scanf( " %d " , & n) > 0 ){
a = b = 0 ;
for (i = 0 ;i < n;i ++ )scanf( " %d " , & num[i]);
// for(i=0;i<n;i++)printf("%d== ",num[i]);
prec = 0 ;
// cout<<"n="<<n<<endl;
v( 0 , 0 , 0 );
// for(i=0;i<(j=pow(2,n));i++)printf("%d ",rec[i]);
j = pow( 2 ,n);
min = abs(rec[ 0 ] - rec[n - 1 ]);
for (i = 1 ;i < j / 2 ;i ++ ){
// printf("n=%d,rec[%d]=%d,rec[%d]=%d ",n,i,rec[i],j-1-i,rec[j-1-i]);
if (abs(rec[i] - rec[j - 1 - i]) < min)min = abs(rec[i] - rec[j - 1 - i]);
}
printf( " %d " ,min);
}
}
void v( int dir, int l, int moneyup)
{//moneyup存放此层以上各层的一条路径的总钱数和,l表示当前是第l层
// cout<<" l="<<l<<" moneyup="<<moneyup<<endl;
// system("PAUSE");
if (l == n){rec[prec] = moneyup;prec ++ ; return ;}
v( 1 ,l + 1 ,moneyup + num[l]);
v( 0 ,l + 1 ,moneyup);
}