zoukankan      html  css  js  c++  java
  • sicily 1232. Electrical Outlets

    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.
     
    起床的菜鸟刷水题……
    计算方法很简单,可用插孔 = 所有插座提供的插孔 - 插座数(每个插座占用的插孔) + 1(墙上的那个插孔)
    (这么堆插座不会烧么,喷)
     
    做这种一次一个case的题总是忘记做完一个case就清零,希望熟了就不再犯了……
     
    View Code
     1 #include<stdio.h>
     2 int main()
     3 {
     4     int n, k, i, j, o, total = 0;
     5     
     6     scanf("%d", &n);
     7     
     8     for( i = 1; i <= n; i++)
     9     {
    10         scanf("%d", &k);
    11         
    12         for( j = 0; j < k; j++ )
    13         {
    14             scanf("%d", &o);
    15             total = total + o;
    16         }
    17         
    18         total = total - k + 1;
    19         
    20         printf("%d\n", total);
    21         
    22         total = 0;
    23     }
    24     
    25     return 0;
    26 } 
  • 相关阅读:
    链表 原文:http://canlynet.blog.163.com/blog/static/2550136520091120101712136/
    单向链表操作 原文:http://canlynet.blog.163.com/blog/static/255013652009113001041903/
    二叉树——根据遍历结果,画出对应的二叉树 转载至:http://canlynet.blog.163.com/blog/static/255013652009112602449178/
    数据结构经典问题——出栈顺序 转载至:canlynet微博
    sql server2005 常用语句
    禁止复制文字,下载图片的方法
    linux关机命令大全 来源于网络
    工厂模式
    设计模式的七大原则
    单例模式
  • 原文地址:https://www.cnblogs.com/joyeecheung/p/2763816.html
Copyright © 2011-2022 走看看