Big Event in HDU
来源:互联网 发布:淘宝的盈利模式分析 编辑:程序博客网 时间:2024/06/10 03:05
Big Event in HDU
Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 20349 Accepted Submission(s): 7138
Problem Description
Nowadays, we all know that Computer College is the biggest department in HDU. But, maybe you don't know that Computer College had ever been split into Computer College 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 be same if they have the same value. It is assumed that there is N (0<N<1000) kinds of facilities (different value, different kinds).
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 be same 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 test cases. 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 an integer M (0<M<=100 --corresponding number of the facilities) each. You can assume that all V are different.
A test case starting with a negative integer terminates input and this test case is not to be processed.
A test case starting with a negative integer terminates input and this test case is not to be processed.
Output
For each case, print one line containing two integers A and B which denote the value of Computer College and Software College will get respectively. A and B should be as equal as possible. At the same time, you should guarantee that A is not less than B.
Sample Input
210 120 1310 1 20 230 1-1
Sample Output
20 1040 40
Author
lcy
Recommend
We have carefully selected several similar problems for you: 2159 2955 1087 1176 1069
#include<iostream>#include<cstdio>#include<cstring>using namespace std;struct node{ int x; int y; int sum;} unit[250000];int c1[300000];int c2[300400];int main(){ int i,j,k,n,s; int va[100]; int nu[100]; while(scanf("%d",&n)!=EOF) { if(n<0) break; if(n==0) { //printf("0 0\n"); continue; } s=0; memset(c1,0,sizeof(c1)); memset(c2,0,sizeof(c2)); for(i=1; i<=n; i++) { //scanf("%d%d",&unit[i].x,&unit[i].y);//value num cin>>unit[i].x>>unit[i].y; unit[i].sum=unit[i].x*unit[i].y; s=s+unit[i].sum; } c1[0]=1; for(i=unit[1].x; i<=unit[1].sum; i=i+unit[1].x) c1[i]=1; for(i=2; i<=n; i++) { for(j=0; j<=s; j++) { for(k=0; k<=unit[i].sum&&k+j<=s; k=k+unit[i].x) { c2[j+k]+=c1[j]; } } for(j=0; j<=s; j++) { c1[j]=c2[j]; c2[j]=0; } } for(i=s/2; i>=0; i--) { if(c1[i]!=0) { cout<<s-i<<" "<<i<<endl; break; } } } return 0;}
0 0
- Big Event in HDU
- Big Event in HDU
- Big Event in HDU
- Big Event in HDU
- Big Event in HDU
- Big Event in HDU
- Big Event in HDU
- Big Event in HDU
- Big Event in HDU
- Big Event in HDU
- Big Event in HDU
- Big Event in HDU
- Big Event in HDU
- Big Event in HDU
- Big Event in HDU
- Big Event in HDU
- Big Event in HDU
- Big Event in HDU *
- 黑马程序员_正则表达式
- 事件、接口、类---对象数组
- 轻松搞定面试中的链表题目
- Balloon Comes!
- Apache 高可用性
- Big Event in HDU
- 诡异的楼梯
- STM32启动文件详解及SystemInit函数分析(转)
- 软件方法论之迭代式
- 完成项目的感想,与收获,及下面学习的进度于预习!
- 10件安装WordPress后需要做的事
- 变形课
- 特征值问题求解开源代码SLEPc
- Windows Multimedia API