【HDU】1171【母函数】【Big Event in HDU】

原创 2013年12月03日 11:13:13

          Big Event in HDU

TimeLimit: 10000/5000 MS(Java/Others)    MemoryLimit: 65536/32768 K (Java/Others)
Total Submission(s):9181    AcceptedSubmission(s): 3173


ProblemDescription
Nowadays, we all know thatComputer College is the biggest department in HDU. But, maybe youdon't know that Computer College had ever been split into ComputerCollege and Software College in 2002.
The splitting is absolutely a big event in HDU! At the same time,it is a trouble thing too. All facilities must go halves. First,all facilities are assessed, and two facilities are thought to besame if they have the same value. It is assumed that there is N(0<N<1000) kinds of facilities(different value, different kinds).
 

Input
Input contains multiple testcases. Each test case starts with a number N (0 < N<= 50 -- the total number of different facilities).The next N lines contain an integer V(0<V<=50 --value of facility) and aninteger M (0<M<=100 --correspondingnumber of the facilities) each. You can assume that all V aredifferent.
A test case starting with a negative integer terminates input andthis test case is not to be processed.
 

Output
For each case, print one linecontaining two integers A and B which denote the value of ComputerCollege and Software College will get respectively. A and B shouldbe as equal as possible. At the same time, you should guaranteethat A is not less than B.
 

SampleInput
2 10 1 20 1 3 10 1 20 2 30 1 -1
 

SampleOutput
20 10 40 40

#include <iostream>
#include <cstdio>
using namespace std;
int date_value[51],date_num[51];//价值及个数
int c1[150000],c2[150000];//组成的最后价值
intmain(){
   int n;
   while(scanf("%d",&n),n>0){
       int i=0,j,k,len;
       memset(c1,0,sizeof(int)*130000);
       while(i<n){
           scanf("%d%d",&date_value[i],&date_num[i]);
           i++;
       }
       len=0;
       for(i=0;i<n;i++){
           c1[0]=1;
           len+=date_value[i]*date_num[i];
           for(j=0;j<=len;j++){
               for(k=0;k<=date_num[i];k++)
                   c2[k*date_value[i]+j]+=c1[j];
           }
           for(j=0;j<=len;j++){
               c1[j]=c2[j];
               c2[j]=0;
           }
       }
       for(i=len/2;i>=0;i--)
           if(c1[i]){
               printf("%d%d\n",len-i,i);
               break;
           }
   }
   return 0;
}


版权声明:本文为博主原创文章,未经博主允许不得转载。

相关文章推荐

hdoj 1171 Big Event in HDU (母函数)(背包)

Big Event in HDU Time Limit: 10000/5000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others...

HDoj-1171-Big Event in HDU-母函数

Big Event in HDU Time Limit: 10000/5000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Other...

母函数之Big Event in HDU hdoj 1171

/* Big Event in HDU Time Limit: 10000/5000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/O...

hdoj 1171 Big Event in HDU(母函数/多重背包)

题意很简单,n种物品,每个物品对应一个价值和数量。让你竟可能的分成相等的两份。 可以设背包容量为sum/2用多重背包解决。 也可以用母函数来解决,计算能组成的最接近sum/2的值。 母函数...

Big Event in HDU 【HDOJ-1171-母函数】

Big Event in HDU Time Limit: 10000/5000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others...

hdoj 1171 Big Event in HDU(背包dp+母函数)

【题目大意】:给出n种数,每种数有m个,问怎么把这n*m个数分成两部分,满足第一部分大于等于第二部分,且尽可能相等。 【解题思路】:dp,多重背包问题。                  ...

HDU 1171 Big Event in HDU【多重背包||母函数】

题目:http://acm.hdu.edu.cn/showproblem.php?pid=1171 题意:将财产尽可能对半分             可以以财产的总和的一半为背包上限,求背包最大值...

hdu1171Big Event in HDU(母函数或多重背包)

Big Event in HDU Time Limit: 10000/5000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Other...

HDU 1171 Big Event in HDU 【母函数】

Big Event in HDU Time Limit: 10000/5000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Other...

[母函数]HDU 1171 Big Event in HDU

传送门:Big Event in HDU Big Event in HDU Time Limit: 10000/5000 MS (Java/Others)    Memory Limit:...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

(最多只允许输入30个字)