CT27554

The Even Minus Odd of Vermilion

EasyL3 · Syntax SurferAcceptance: 0.0%XP: 20

Aria inherited the aviary at the cinnabar mines of Vermilion along with its curious bookkeeping system for lanterns. Time to make sense of it. Task: Read n integers and print the sum of values at even 1-based positions minus the sum at odd positions. Input format: First line: n. Second line: n space-separated integers. Output format: Print (sum of even-positioned) - (sum of odd-positioned). Constraints: 1 <= n <= 806; 0 <= a[i] <= 10; answers fit a signed 64-bit integer.

Example 1:

Input: 264 1 6 2 4 7 8 7 5 9 7 2 0 1 6 0 6 9 3 8 8 9 9 1 1 7 3 6 4 8 3 5 8 8 10 10 9 10 5 9 7 4 5 7 6 0 5 7 9 0 3 8 10 8 5 10 2 7 3 8 0 9 0 2 10 4 4 0 2 4 1 7 8 9 9 4 1 1 3 3 4 4 8 0 7 2 10 8 6 9 7 10 8 2 6 0 8 8 6 10 3 8 8 7 1 9 0 5 1 3 0 9 2 5 9 10 0 10 7 0 1 9 1 6 6 5 10 4 2 9 4 4 0 1 10 2 5 4 10 3 2 2 8 4 6 3 6 3 9 8 4 3 0 5 9 5 5 0 6 2 2 6 6 5 6 10 6 5 8 7 5 4 4 2 5 8 7 1 0 9 7 10 2 9 8 10 3 2 0 10 8 5 8 9 3 9 10 4 6 4 8 9 2 4 0 3 4 10 5 1 7 4 4 5 4 10 2 9 4 6 7 9 7 2 5 9 10 4 0 7 10 1 4 8 9 7 3 2 5 1 9 7 9 9 2 9 6 6 2 2 9 9 1 2 6 4 4 7 0 3 7 5 0 3 3
Output: 63

Example 2:

Input: 650 1 9 2 0 8 6 9 4 4 10 1 3 2 9 0 4 10 10 10 6 8 8 0 10 3 10 1 2 1 2 9 1 7 3 10 10 8 0 2 10 0 2 6 5 3 4 10 6 3 6 4 6 6 6 5 4 10 5 7 8 0 9 9 9 1 3 7 4 8 4 6 3 1 1 10 1 8 5 2 10 10 7 0 1 0 0 5 4 5 8 3 5 5 4 8 0 5 3 4 2 3 1 5 4 1 4 2 9 4 5 4 2 8 8 9 8 0 7 1 4 2 6 4 10 8 2 0 0 7 2 5 5 9 5 8 9 1 8 2 8 3 10 5 2 8 7 3 10 5 6 6 4 7 7 8 1 4 6 6 8 4 5 2 3 10 0 0 4 9 10 7 4 4 1 7 8 7 10 10 6 2 10 1 9 1 3 4 4 4 4 1 0 0 8 5 0 10 6 5 4 6 1 3 0 0 4 10 10 6 6 6 0 1 7 8 10 4 4 10 5 4 0 2 5 6 4 6 2 0 6 9 10 4 4 9 9 5 8 7 4 9 1 8 3 0 3 9 5 6 6 7 8 5 4 10 6 0 9 10 3 9 3 2 8 0 3 6 9 5 6 5 7 2 2 5 10 8 0 10 7 8 9 8 8 8 9 3 3 1 5 8 8 2 5 4 7 8 0 5 3 5 10 7 6 6 2 10 1 10 6 9 10 10 3 7 5 7 9 2 9 7 8 10 10 1 2 0 9 0 8 5 10 2 2 4 1 6 5 0 1 0 6 6 5 1 8 0 9 9 2 0 5 2 9 1 0 1 9 9 7 4 3 9 0 8 4 3 4 5 0 9 5 4 1 1 2 3 0 …
Output: -56

Example 3:

Input: 150 6 2 3 8 6 0 7 4 3 7 8 2 2 4 5 9 7 7 10 0 6 4 4 6 5 10 9 0 10 10 5 2 2 8 2 3 3 9 9 1 9 0 1 4 1 4 0 6 8 0 2 0 1 5 1 5 9 9 6 8 3 6 0 9 4 7 3 3 6 8 9 2 4 7 4 4 6 4 0 10 2 7 6 8 7 9 4 9 8 6 9 4 6 9 9 6 2 8 8 9 2 0 2 4 7 0 2 0 6 5 2 4 5 6 6 5 5 7 10 9 9 1 8 4 10 4 4 8 1 9 3 2 3 6 4 9 8 4 7 7 4 9 5 3 7 9 7 1 5 2
Output: -8

Constraints:

1 <= n <= 806; 0 <= a[i] <= 10; answers fit a signed 64-bit integer.

Loading...
Test Cases:No test cases
No test cases available.