CT22264

Celestial stamps Dominant Values

EasyL3 · Syntax SurferAcceptance: 0.0%XP: 20

Aria found an old ledger of stamps in the shed attic at the ivory gates of Alabast. The margin notes pose a precise question. Task: Read n integers and print how many of the elements after the first are strictly greater than the first element. Input format: First line: n. Second line: n space-separated integers. Output format: Print the count of elements a[2..n] greater than a[1]. Constraints: 1 <= n <= 584; 0 <= a[i] <= 10; answers fit a signed 64-bit integer.

Example 1:

Input: 342 5 5 5 2 10 7 2 6 9 8 8 3 4 10 2 1 3 3 10 6 0 1 4 7 0 0 0 8 8 8 7 0 8 3 0 10 0 9 6 2 3 10 10 4 0 10 1 3 0 2 5 7 3 3 0 4 1 8 5 2 6 1 6 2 9 10 10 4 3 1 6 7 10 7 6 9 9 8 1 0 5 2 3 7 6 3 0 5 8 10 5 3 6 2 7 0 5 6 4 4 8 9 9 5 3 10 8 0 2 0 4 1 9 7 0 6 6 9 6 1 3 10 7 9 6 1 10 9 1 8 4 0 8 0 3 0 2 1 2 7 2 3 0 7 9 4 4 0 5 2 7 8 4 1 6 5 7 5 1 2 1 4 10 0 2 6 6 4 10 6 5 6 3 5 1 10 8 6 5 4 2 2 0 6 2 10 3 3 0 1 0 1 7 3 3 3 6 8 0 3 1 5 4 2 2 1 1 7 7 7 0 2 1 9 10 0 1 1 6 8 5 1 10 3 6 6 10 7 5 1 3 0 6 1 9 4 3 5 8 7 1 0 9 10 1 0 9 4 5 2 0 2 10 5 0 4 6 4 5 8 10 7 2 8 4 7 1 1 7 5 8 1 0 0 10 9 0 6 5 8 4 1 10 10 4 2 3 9 6 1 8 7 5 3 0 10 10 6 5 1 8 1 1 9 7 0 3 1 0 10 7 8 0 4 9 6 10 9 7 8 10 2 4 2 6 5 1 0 6 4 0 8 4 5 0 0 1 7 6 4 1 0
Output: 142

Example 2:

Input: 526 3 1 1 6 7 0 3 10 0 6 4 5 2 5 2 3 5 3 6 4 6 10 2 7 3 7 5 6 2 3 4 10 8 6 8 4 6 6 4 4 3 3 5 4 6 10 4 3 5 4 8 6 5 0 3 5 1 1 2 9 3 7 4 6 2 9 6 10 6 3 4 2 10 6 3 9 3 7 7 0 4 0 3 6 3 5 3 1 3 7 6 3 2 2 0 2 4 10 8 5 1 6 5 1 2 5 10 6 5 7 6 1 3 4 5 3 7 5 9 9 4 8 0 2 8 3 6 0 7 9 2 10 0 4 2 10 5 1 3 3 3 9 8 4 3 0 1 8 0 9 8 7 3 0 1 0 2 3 8 7 7 8 4 10 6 9 0 6 4 3 2 4 10 1 2 8 0 7 4 5 10 0 9 7 3 9 9 7 10 5 10 0 1 2 10 0 7 6 7 8 3 9 10 2 2 6 8 7 4 5 0 3 2 1 8 5 0 4 8 1 9 8 3 7 5 9 10 4 3 7 10 10 8 2 3 8 3 8 0 4 6 1 9 4 1 3 3 1 9 4 3 0 2 5 10 8 9 4 8 3 2 9 2 7 0 8 3 7 8 10 4 6 7 0 2 0 5 5 0 0 4 5 3 6 7 1 3 9 1 7 7 1 8 8 6 5 0 5 7 5 5 5 9 9 8 5 1 3 9 3 10 6 3 3 3 9 10 3 6 4 4 0 5 5 10 9 4 4 2 7 3 0 8 0 1 6 4 3 9 0 6 1 4 4 9 7 3 7 10 8 1 3 10 7 0 2 9 1 7 8 10 7 5 9 6 10 2 5 5 8 2 10 4 8 0 3 4 8 7 5 8 5 4 …
Output: 328

Example 3:

Input: 429 3 5 0 1 4 2 9 10 7 2 8 0 8 6 2 5 6 10 2 2 6 8 2 7 6 7 4 1 4 5 7 3 0 0 9 3 5 6 9 10 5 10 2 1 9 6 7 1 4 2 10 10 9 1 3 0 1 4 2 8 0 2 1 10 4 9 8 10 8 7 8 5 1 3 9 0 10 0 3 9 9 8 5 10 6 5 10 7 1 2 6 8 3 5 3 4 7 4 7 10 9 5 0 7 4 9 0 9 9 3 7 1 0 2 10 0 0 1 6 2 4 3 0 0 0 10 8 5 6 5 0 2 3 8 0 10 6 7 10 5 5 5 1 6 6 1 1 10 9 7 0 9 8 1 7 5 6 5 6 5 6 3 6 9 9 2 5 5 6 6 3 9 8 6 7 2 4 4 10 3 2 3 1 2 1 4 2 3 10 8 0 1 7 2 0 4 9 2 7 2 2 9 9 10 6 7 6 6 8 5 2 3 2 1 4 9 3 6 1 10 0 10 8 2 2 8 5 7 9 3 1 6 5 8 6 4 9 1 3 7 2 7 6 5 4 3 0 8 7 6 8 2 5 7 0 5 0 8 10 5 7 10 4 9 6 2 7 1 8 9 0 7 10 6 9 6 4 0 4 7 9 5 2 2 10 6 9 4 10 3 1 1 3 4 4 3 9 2 4 8 8 2 3 7 3 0 10 10 1 5 0 7 7 0 3 8 7 8 5 1 10 9 5 4 0 2 1 9 6 0 8 4 5 0 0 8 0 8 8 1 1 1 2 7 3 1 9 10 2 0 10 9 0 10 8 0 4 8 1 3 5 9 10 1 8 2 4 3 0 8 0 1 10 9 2 2 1 4 5 9 1…
Output: 265

Constraints:

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

Loading...
Test Cases:No test cases
No test cases available.
Celestial stamps Dominant Values - EASY Coding Problem | CodeTikki