CT1670

Gita's crates Reckoning

EasyL2 · Byte BanditAcceptance: 0.0%XP: 10

Legend says the vault under the peat bogs of Mossgrieve opens only for a perfect tally of crates. Gita means to find out. 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 <= 21; -1000000 <= a[i] <= 1000000; answers fit a signed 64-bit integer.

Example 1:

Input: 10 -490382 -932338 526159 725846 -89025 -790138 949588 -861347 583156 -262028
Output: 6

Example 2:

Input: 11 604727 274964 -385295 -939186 438872 669832 384786 -205824 337425 777858 7660
Output: 2

Example 3:

Input: 1 -697311
Output: 0

Constraints:

1 <= n <= 21; -1000000 <= a[i] <= 1000000; answers fit a signed 64-bit integer.

Loading...
Test Cases:No test cases
No test cases available.
Gita's crates Reckoning - EASY Coding Problem | CodeTikki