yes
Time Limit: 1 seconds
Memory Limit: 1024 MB
Rating: 800
Problem StatementGiven an integer $N$ $(1 \le N \le 10^5)$, followed by $N$ integers $A_1, A_2, ..., A_n$, output the sum of the array $A$. $(-10^9 \le A_i \le 10^9)$
InputThe first line has integer $N$, followed by $N$ lines each containing one integer $A_i$.
OutputOutput the sum of the $N$ integers.
Sample CasesSample Input 1: 5 1 2 3 4 5 Sample Output 1: 15 Sample Input 2: 2 -3 2 Sample Output 2: -1Explanation
Not available for this problem.
SourcesIanOJ Contest #2 (Div. 4) > Problem B (Contributed by admin@ian@)
Submit | Back