CT22859

Morgana and the Even Count

EasyL3 · Syntax SurferAcceptance: 0.0%XP: 20

The harbor bell rings at the cinnabar mines of Vermilion; Morgana weighs the day's tickets manifests and starts the calculations. Task: Read n integers and print how many are even. Input format: First line: n. Second line: n space-separated integers. Output format: Print the count of even values. Constraints: 1 <= n <= 732; 0 <= a[i] <= 10; answers fit a signed 64-bit integer.

Example 1:

Input: 279 1 6 2 2 4 3 4 4 7 10 1 6 9 1 6 6 6 10 10 8 5 6 4 1 2 5 3 10 3 1 7 8 1 0 4 9 8 3 9 8 3 4 6 1 2 9 6 2 7 7 10 3 3 7 3 9 6 7 7 5 5 3 1 9 4 4 7 4 4 4 3 0 5 2 10 4 7 0 6 7 4 0 2 9 0 1 3 3 5 9 1 1 8 10 10 8 3 3 7 5 5 2 0 10 7 8 4 4 9 9 1 10 0 9 7 3 5 9 10 7 3 6 7 8 5 6 2 5 1 6 7 9 4 0 9 3 4 10 3 2 6 5 7 5 10 0 3 10 5 2 10 6 8 2 4 10 4 7 2 4 10 10 5 6 1 6 8 8 5 9 1 4 5 2 5 0 6 7 3 8 2 10 8 10 10 2 7 8 10 8 0 9 2 0 0 1 2 2 6 6 10 2 9 6 0 3 10 0 10 4 2 1 6 0 10 4 7 10 4 2 6 10 0 8 8 4 2 10 3 9 7 2 3 5 9 8 2 2 2 6 7 7 2 4 6 6 5 6 1 3 7 1 9 6 6 6 9 5 9 1 4 4 0 6 2 3 4 2 0 2 8 9 8 6 9 9 10 5 3
Output: 161

Example 2:

Input: 519 7 7 10 7 10 1 3 8 2 4 10 3 7 2 7 9 1 8 10 5 0 10 7 0 2 2 6 6 4 3 8 9 5 8 9 7 7 8 5 9 9 5 6 0 10 3 9 1 4 1 1 7 0 8 1 8 6 7 8 6 10 0 6 6 4 10 8 9 0 1 8 2 7 8 6 10 7 6 1 9 3 9 7 6 8 8 3 7 4 3 10 5 8 3 9 2 3 2 7 4 2 8 1 10 10 8 7 7 1 9 1 4 0 6 6 3 3 0 3 8 9 5 8 6 5 10 4 0 7 5 2 3 3 7 5 5 0 8 7 1 1 5 3 9 6 8 5 9 1 6 10 4 3 8 4 2 6 8 3 0 7 3 8 5 4 5 1 6 8 0 3 2 4 6 5 0 2 4 7 4 10 4 6 4 3 8 8 4 9 3 8 8 0 8 1 5 7 3 1 2 10 1 2 3 7 5 4 10 10 5 0 5 3 8 2 9 10 3 6 0 3 1 1 7 10 7 7 5 3 6 10 7 1 9 3 3 3 2 2 2 10 3 7 9 10 1 6 1 1 2 9 4 8 7 8 6 3 8 0 0 8 3 7 5 10 10 3 5 5 2 4 6 3 10 3 7 6 0 9 9 7 2 5 1 9 8 3 7 3 5 6 9 4 6 0 7 10 10 2 6 6 2 0 4 1 2 4 3 8 1 4 4 4 6 5 9 6 9 7 8 6 5 1 7 4 3 9 1 5 8 0 3 6 4 6 9 4 10 8 10 1 2 5 3 0 8 6 10 6 4 9 2 10 10 10 6 4 10 8 10 1 7 1 2 9 6 10 8 5 5 6 4 6 0 9 3 7 7 6 2…
Output: 280

Example 3:

Input: 272 3 4 0 3 6 5 0 8 9 9 10 4 1 9 10 6 10 1 5 8 7 2 9 2 3 0 1 8 6 0 4 5 3 8 8 5 9 4 1 4 8 0 2 5 8 5 8 7 9 1 10 9 2 8 8 6 4 6 1 9 0 2 2 4 5 10 2 6 1 10 1 10 4 3 3 2 0 9 2 4 0 0 5 8 1 3 3 1 0 10 10 0 8 9 0 7 3 0 7 4 1 8 1 0 2 7 10 1 10 6 3 7 6 5 9 6 8 5 10 6 5 4 10 2 0 1 4 5 6 9 9 10 1 6 6 7 10 5 5 1 4 4 6 7 10 1 10 7 10 4 0 4 9 10 1 6 7 5 2 4 8 6 8 5 7 5 3 9 9 6 1 2 7 5 3 4 8 0 6 5 1 2 2 7 10 1 6 6 8 2 1 5 0 10 6 5 9 0 9 2 4 8 6 9 10 3 8 2 2 0 7 10 2 2 6 3 7 1 10 4 4 1 10 0 5 1 0 3 4 0 6 7 10 3 4 9 1 7 1 8 2 10 4 6 5 0 3 7 5 1 7 7 4 7 7 8 3 10 2 4 8 7 10 7 2 7 10 0 0 5 1 2
Output: 155

Constraints:

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

Loading...
Test Cases:No test cases
No test cases available.
Morgana and the Even Count - EASY Coding Problem | CodeTikki