zoukankan      html  css  js  c++  java
  • HDU 1171 Big Event in HDU

    Big Event in HDU

    Time Limit: 10000/5000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)

    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). 
    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. 
    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
    2 10 1 20 1 3 10 1 20 2 30 1 -1
     
    Sample Output
    20 10 40 40
     
    Author
    lcy
     
    Recommend
    We have carefully selected several similar problems for you:  2602 1203 2159 2955 2844 
     
    Statistic | Submit | Discuss | Note

    有是一道生成函数。

    $F(x)=prod_{i=1}^{N}{sum_{j=0}^{j<=M_{i}}{x^{j*V_{i}}}}$

    先求出所有可以组成的数字,再选取一个最接近$frac{sum}{2}$的作为答案即可。

     1 #include <cstdio>
     2 #include <bitset>
     3 
     4 int n, m, sum, ans;
     5 
     6 std::bitset<500005> S, T;
     7 
     8 signed main(void)
     9 {
    10     while (scanf("%d", &n), n >= 0)
    11     {
    12         S.reset(); S.set(0); sum = 0;
    13         
    14         while (n--)
    15         {
    16             int a, b; scanf("%d%d", &a, &b);
    17             
    18             {
    19                 T.reset();
    20                 
    21                 for (int i = 0; i <= b; ++i)
    22                     T |= (S << (i * a));
    23                 
    24                 S = T;
    25             }
    26             
    27             sum += a * b;
    28         }
    29         
    30         for (int i = sum >> 1; i <= sum; ++i)
    31             if (S[i] && (i << 1) >= sum)
    32                 { ans = i; break; }
    33                 
    34         printf("%d %d
    ", ans, sum - ans);
    35     }
    36 }

    @Author: YouSiki

  • 相关阅读:
    IOS开发教程--怎样使用点9图片
    Android studio 自己主动排版
    17 facade
    递归算法时间复杂度分析与改善
    __FUNCTION__, __LINE__ 有助于debug的宏定义
    表名在数据库中的存储大写和小写略解
    七夕节不撸代码你好意思说自己是程序员
    前端开发面试题收集(js部分)
    总体架构
    立即执行的匿名函数
  • 原文地址:https://www.cnblogs.com/yousiki/p/6422358.html
Copyright © 2011-2022 走看看