HDU 1709 The Balance

The Balance

Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)

Problem Description

Now you are asked to measure a dose of medicine with a balance and a number of weights. Certainly it is not always achievable. So you should find out the qualities which cannot be measured from the range [1,S]. S is the total quality of all the weights.

 

Input

The input consists of multiple test cases, and each case begins with a single positive integer N (1<=N<=100) on a line by itself indicating the number of weights you have. Followed by N integers Ai (1<=i<=N), indicating the quality of each weight where 1<=Ai<=100.

 

Output

For each input set, you should first print a line specifying the number of qualities which cannot be measured. Then print another line which consists all the irrealizable qualities if the number is not zero.

 

Sample Input

3 1 2 4 3 9 2 1

 

Sample Output

0 2 4 5

 

Source

HDU 2007-Spring Programming Contest

 

Recommend

lcy   |   We have carefully selected several similar problems for you:  2152 2069 1708 1721 1701  

 

Statistic | Submit | Discuss | Note

 

给出一个天平兮，还有一些砝码。

给出一些质量兮，问你能称几个？

 

bitset水水，套个生成函数？

 

#include <cstdio>
#include <bitset>

std::bitset<100005> S;

signed main(void)
{
    int n, m;
    
    while (scanf("%d", &n) != EOF)
    {
        S.reset(), S.set(50000);
        
        int ans = 0, sum = 0;
        
        while (n--)
            scanf("%d", &m), sum += m,
            S = (S << m) | (S >> m) | S;
            
        S >>= 50000;
        
        for (int i = 1; i <= sum; ++i)
            if (!S[i])++ans;
        
        printf("%d\n", ans);
        
        if (ans)
        {
            bool flag = false;
            
            for (int i = 1; i <= sum; ++i)
                if (!S[i])
                {
                    if (flag)
                        printf(" %d", i);
                    else
                        printf("%d", i), flag = true;
                }
            
            puts("");
        }
    }
}

 

@Author: YouSiki