## Mock CCC '18 Contest 3 J1 - A Sum Problem

View as PDF

Points: 3 (partial)
Time limit: 1.0s
Memory limit: 1G

Problem type

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.

#### Constraints  In tests worth 5 marks, all are nonzero.

#### Input Specification

The first line contains a single integer .

The next lines each contain a single integer, , representing the th integer in the list.

#### Output Specification

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

0

#### Sample Input 2

2
1
-2

#### Sample Output 2

-1

## Comments

• commented on Dec. 3, 2019, 5:26 p.m.

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.

• commented on Dec. 3, 2019, 5:57 p.m. • commented on Dec. 3, 2019, 6:36 p.m.

Ohhh I get it now, thanks for telling me