zoukankan      html  css  js  c++  java
  • hdu2304Electrical Outlets

    Problem 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
    #include<iostream>
    #include<cstring>
    #include<cstdio>
    #include<cmath>
    
    using namespace std;
    
    int main()
    {
        int z,n,i,j,k;
        cin>>z;
        while(z--)
        {
            cin>>n;
            int sum = 0;
            for(i = 0;i<n;i++)
            {
                int a;
                scanf("%d",&a);
                sum+=a;
            }
            sum-=n-1;
            cout<<sum<<endl;
        }
        return 0;
    }
  • 相关阅读:
    POJ2778 DNA Sequence AC自动机+矩阵二分
    POJ1204 Word Puzzles AC自动机 多串匹配
    与失散已久的小学同桌QQ聊天
    ZC公司员工评分系统——后台查询合成DataTable
    软考(2)编译原理
    GCT考试复习
    为自己加油!!!
    ZC公司员工评分系统——前台排版算法
    员工评分系统现场发布小感
    软考(3)操作系统
  • 原文地址:https://www.cnblogs.com/wos1239/p/4556918.html
Copyright © 2011-2022 走看看