zoukankan      html  css  js  c++  java
  • The Solution of UESTC 2016 Summer Training #1 Div.2 Problem C

    Link

    http://acm.hust.edu.cn/vjudge/contest/121539#problem/C

    Description

    standard input/output 

    After a long ACM training day, Master Hasan invited his trainees for a light dinner in the cafeteria. The cafeteria has N tables, each with a number of chairs around it. Before accepting the trainees into the cafeteria, Master Hasan wants to know how many unused chairs are there in the cafeteria. If there isn't enough chairs, he might invite them to a well-known Indian restaurant.

    Input

    The first line of input contains a single integer N(1 ≤ N ≤ 100), the number of tables in the cafeteria.

    Each of the following N lines contains two integers describing a table, A and B(1 ≤ A ≤ B ≤ 100), where A represents the number of used chairs, and B represents the total number of chairs around that table.

    Output

    Print the number of unused chairs in the cafeteria.

    Sample Input

    Input
    3
    1 3
    4 4
    5 8
    Output
    5
    Solution
    This problem is a piece of cake.The number of unused chair of each table is B-A,and our task is to sum them up.
    C++ Code

    #include<iostream>
    using namespace std;
    int main()
    {
      int n,a,b,sum;
      cin>>n;sum=0;
      while(n--)
      {
        cin>>a>>b;
        sum+=b-a;
      }
      cout<<sum<<endl;
      return 0;
    }

  • 相关阅读:
    树的直径
    Codeforces 734E Anton and Tree(缩点+树的直径)
    Codeforces 948D Perfect Security(字典树)
    Codeforces 954D Fight Against Traffic(BFS 最短路)
    Codeforces 954C Matrix Walk (思维)
    Codeforces 950D A Leapfrog in the Array (思维)
    Codeforces 946D
    Invitation Cards POJ-1511 (spfa)
    spfa 单源最短路究极算法
    Currency Exchange POJ
  • 原文地址:https://www.cnblogs.com/cs-lyj1997/p/5712968.html
Copyright © 2011-2022 走看看