博客
关于我
强烈建议你试试无所不能的chatGPT,快点击我
HDU 1709 The Balance
阅读量:4488 次
发布时间:2019-06-08

本文共 2076 字,大约阅读时间需要 6 分钟。

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
 
Recommend
lcy   |   We have carefully selected several similar problems for you:             

 

 |   |   | 

 

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

给出一些质量兮,问你能称几个?

 

bitset水水,套个生成函数?

 

1 #include 
2 #include
3 4 std::bitset<100005> S; 5 6 signed main(void) 7 { 8 int n, m; 9 10 while (scanf("%d", &n) != EOF)11 {12 S.reset(), S.set(50000);13 14 int ans = 0, sum = 0;15 16 while (n--)17 scanf("%d", &m), sum += m,18 S = (S << m) | (S >> m) | S;19 20 S >>= 50000;21 22 for (int i = 1; i <= sum; ++i)23 if (!S[i])++ans;24 25 printf("%d\n", ans);26 27 if (ans)28 {29 bool flag = false;30 31 for (int i = 1; i <= sum; ++i)32 if (!S[i])33 {34 if (flag)35 printf(" %d", i);36 else37 printf("%d", i), flag = true;38 }39 40 puts("");41 }42 }43 }

 

@Author: YouSiki

 

转载于:https://www.cnblogs.com/yousiki/p/6424123.html

你可能感兴趣的文章
Java_Activiti5_菜鸟也来学Activiti5工作流_之入门简单例子(一)
查看>>
设计模式(一)工厂模式Factory(创建型)
查看>>
linux中安装软件的集中方法
查看>>
Express中间件,看这篇文章就够了(#^.^#)
查看>>
《构建之法》(五)
查看>>
创建django项目
查看>>
Linux Bash基本功能
查看>>
一则小脚本(工作中用)
查看>>
软件工程结对作业
查看>>
Keil 4.0 生成bin文件
查看>>
sql语句的进化--hibernate篇
查看>>
python爬虫之cookie
查看>>
2017年5月29号课堂笔记
查看>>
HDU4247【瞎搞】
查看>>
lightoj 1125【背包·从n个选m个】
查看>>
HDU 1243 反恐训练营(最长公共序列)
查看>>
mysql数据库隔离级别
查看>>
(六)buildroot使用详解
查看>>
chrome修改UserAgent,调试
查看>>
Source Insight4.0 试用。。试用。。试用。。
查看>>