hdu 1094 A+B for Input-Output Practice (VI)

Posted 琴影

tags:

篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了hdu 1094 A+B for Input-Output Practice (VI)相关的知识,希望对你有一定的参考价值。

A+B for Input-Output Practice (VI)

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 63087    Accepted Submission(s): 42387

Problem Description
Your task is to calculate the sum of some integers.
 
Input
Input contains multiple test cases, and one case one line. Each case starts with an integer N, and then N integers follow in the same line.
 
Output
For each test case you should output the sum of N integers in one line, and with one line of output for each line in input.
 
Sample Input
4 1 2 3 4
5 1 2 3 4 5
 
Sample Output
10
15
 1 #include <iostream>
 2 using namespace std;
 3 int main() {
 4     int n;
 5     int test;
 6     //cin >> test;
 7     
 8     while(cin >> n)
 9     {
10         int sum = 0;
11         //cin >> n;
12         int temp;
13         for(int i = 1; i <= n; i++)
14         {
15             cin >> temp;
16             sum += temp;
17         }
18         cout << sum << endl;
19     }
20     
21     return 0;
22 }
View Code

 

以上是关于hdu 1094 A+B for Input-Output Practice (VI)的主要内容,如果未能解决你的问题,请参考以下文章

POJ 1094 (传递闭包 + 拓扑排序)

poj1094-Sorting It All Out-拓扑排序

POJ1094

HDU 1867 A + B for you again

HDU1867 A + B for you againKMP

hdu 1867 A + B for you again