HDU#2304:Electrical Outlets
来源:互联网 发布:电脑手写板软件下载 编辑:程序博客网 时间:2024/04/28 01:59
Time Limit: 1000MS
Memory Limit: 32768KB
64bit IO Format: %I64d & %I64u
Description
Roy has just moved into a new apartment. Well, actually the apartment itself is not very new, even dating back to the days before people had electricity in their houses. Because of this, Roy’s apartment has only one single wall outlet, so Roy can only power one of his electrical appliances at a time.
Roy likes to watch TV as he works on his computer, and to listen to his HiFi system (on high volume) while he vacuums, so using just the single outlet is not an option. Actually, he wants to have all his appliances connected to a powered outlet, all the time. The answer, of course, is power strips, and Roy has some old ones that he used in his old apartment. However, that apartment had many more wall outlets, so he is not sure whether his power strips will provide him with enough outlets now.
Your task is to help Roy compute how many appliances he can provide with electricity, given a set of power strips. Note that without any power strips, Roy can power one single appliance through the wall outlet. Also, remember that a power strip has to be powered itself to be of any use.
Input
Input will start with a single integer 1 <= N <= 20, indicating the number of test cases to follow. Then follow N lines, each describing a test case. Each test case starts with an integer 1 <= K <= 10, indicating the number of power strips in the test case. Then follow, on the same line, K integers separated by single spaces, O1 O2 … OK, where 2 <= Oi <= 10, indicating the number of outlets in each power strip.
Output
Output one line per test case, with the maximum number of appliances that can be powered.
Sample Input
3
3 2 3 4
10 4 4 4 4 4 4 4 4 4 4
4 10 10 10 10
Sample Output
7
31
37
Source
NCPC2005
AC代码如下:
#include<iostream>using namespace std;int main(){ int n; cin>>n; for(int i=0;i<n;i++) { int a[11],k,sum=0; cin>>k; for(int r=0;r<k;r++) { cin>>a[r]; } for(int s=0;s<k-1;s++) sum+=(a[s]-1); sum+=a[k-1]; cout<<sum<<endl; } return 0;}
- hdu-2304-Electrical Outlets
- HDU 2304 Electrical Outlets
- hdu 2304 Electrical Outlets
- HDU#2304:Electrical Outlets
- HDU 2304 Electrical Outlets
- HDU--杭电--2304--Electrical Outlets--水题
- HDOJ(HDU) 2304 Electrical Outlets(求和、、)
- HDU Electrical Outlets
- Electrical Outlets 2304
- POJ 2636 && HDU 2304 Electrical Outlets(水~)
- HDOJ 2304 Electrical Outlets(水题)
- Electrical Outlets
- POJ 2636 Electrical Outlets
- ZOJ 2807 Electrical Outlets
- 1232. Electrical Outlets
- zoj 2807 Electrical Outlets
- sicily--1232. Electrical Outlets
- poj 2636 Electrical Outlets
- 328. Odd Even Linked List
- spring cloud比较不错的文章
- UVA 1325 Hypertransmission(枚举)
- Android-Style样式表
- 关于如何在同一台电脑上的两个安卓模拟器之间的socket通信(图片传输)
- HDU#2304:Electrical Outlets
- HDU#2504:又见GCD
- Spring boot之you need to use @ContextConfiguration or @SpringBootTest(classes=...)问题原因
- UVa11235 Frequent values[RMQ]
- MobiCom 2016 --- 20161004 in New York, USA
- 382 linked list random node (待解决)
- P1908 逆序对
- 文献阅读(5)
- 微信小程序实战之天气预报