Points: 3 (partial)
Time limit: 1.0s
Memory limit: 1G
Given a list of integers, compute the sum of the nonzero ones.
In the event the list contains no nonzero integers, the desired sum is zero.
In tests worth 5 marks, all are nonzero.
The first line contains a single integer .
The next lines each contain a single integer, , representing the th integer in the list.
On a single line, output the sum of the nonzero integers.
Sample Input 1
10 0 0 0 0 0 0 0 0 0 0
Sample Output 1
Sample Input 2
2 1 -2
Sample Output 2
A few questions: Why do we get 1G and what's the point of emphasizing non-zero Integers, even if you were to add them, it would't make a difference.
Ohhh I get it now, thanks for telling me