CT2266

The Faded tickets of Omkar

EasyL2 · Byte BanditAcceptance: 0.0%XP: 10

The scribe Omkar has been asked to track down a clerical error. On the desk lies a long table of tickets readings. Task: Read n integers and a threshold t; print how many exceed t. Input format: First line: n and t. Second line: n space-separated integers. Output format: Print the count of values strictly greater than t. Constraints: 1 <= n <= 42; -100 <= a[i],t <= 10.

Example 1:

Input: 4 -92 -35 -63 -22 -44
Output: 4

Example 2:

Input: 37 -23 -26 -83 -19 -3 -11 -58 -45 -45 -16 -65 -5 -21 -49 -42 -11 -90 -14 -54 -79 -97 -43 -10 -61 -44 -36 5 -38 -26 -94 -72 -57 9 -8 -77 -73 -88 -6
Output: 13

Example 3:

Input: 24 -73 -88 -63 -34 -32 -51 -54 10 -79 -60 5 -9 -24 3 -63 -27 -9 -89 -23 -21 -70 -57 -73 -12 -12
Output: 20

Constraints:

1 <= n <= 42; -100 <= a[i],t <= 10.

Loading...
Test Cases:No test cases
No test cases available.
The Faded tickets of Omkar - EASY Coding Problem | CodeTikki