zoukankan      html  css  js  c++  java
  • POJ 2636:Electrical Outlets

    Electrical Outlets
    Time Limit: 1000MS   Memory Limit: 65536K
    Total Submissions: 9597   Accepted: 7186

    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

    你  离  开  了  ,  我  的  世  界  里  只  剩  下  雨  。  。  。

    #include<stdio.h>  
    int main()  
    {  
        int t, a, sum, n, i;  
        scanf("%d",&t);  
        while(t--)  
        {  
            scanf("%d",&n);  
            sum = 1 - n;
            for(i=0; i<n; i++)  
            {
                scanf("%d",&a);  
                sum += a;  
            }
            printf("%d
    ",sum);  
        }  
    }

  • 相关阅读:
    代理(reGeorg)
    弱口令爆破技巧
    无法解析@NotBlank
    LC 1723. Find Minimum Time to Finish All Jobs (dp+二分)
    帝国cms 联合多张表查询
    php 根据白名单替换字符转中的链接 封装的函数
    php 正则匹配域名后的整个链接和只匹配域名
    JVM系列(一):垃圾回收之MinorGC,MajorGC和FullGC的区别
    spring事务的执行原理
    java基础系列(八):Semphore,CountDownLatch和CyclicBarrier的使用
  • 原文地址:https://www.cnblogs.com/im0qianqian/p/5989584.html
Copyright © 2011-2022 走看看