Submit solution

Points: 3 (partial)
Time limit: 0.2s
Memory limit: 64M

Problem type

Allowed languages
Assembly , C , C++ , Forth , Fortran , Pascal , Racket , Rust , Text , Turing

Inaho has arrived at the gates to return to his petty 3-dimensional world, but the gates are locked! He wants to get home as quickly as possible to continue playing his Graph Simulater 2015, that is within 0.2 seconds, but the gates are preventing him from leaving. On the gates are M nonpositive integers, and he believes finding the sum will allow him back into his 3-dimensional world. Of course, he is still stuck in the N-dimensional hole, and therefore cannot comprehend the complexities of N-dimensions, so he needs your help again.

Input Specification

The first line will contain the integer M\ (1 \le M \le 1000), the number of integers on the gates.

The second line will contain M space-separated nonpositive integers, (a_1,\ a_2,\ldots,\ a_M) (-2^{54} \le a_i \le 0)


For 1 of the 3 available marks, -2^{52} \le a_i \le 0

Output Specification

Output the sum of the M nonpositive integers.

Sample Input 1

-1 -4

Sample Output 1


Sample Input 2

-4503599627370496 -4503599627370496 -4503599627370496 -4503599627370496 -4503599627370496

Sample Output 2

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.3 or any later version published by the Free Software Foundation.


There are no comments at the moment.