CT26046

The Celestial Above Threshold

EasyL3 · Syntax SurferAcceptance: 0.0%XP: 20

At the otter slides of Sleekwater, Bhavi records each readings in a worn leather ledger. The guild wants answers, not guesses. 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 <= 971; -1000000 <= a[i],t <= 1000.

Example 1:

Input: 684 -763100 -555678 -920367 -75985 -212398 -349578 -374651 -631662 -719296 -479435 -83857 -581445 -453647 -240761 -667561 -682812 -788977 -808731 -57377 -472616 -379050 -174360 -733668 -655971 -933561 -404862 -358434 -652283 -948847 -368267 -746856 -784165 -315552 -574072 -484893 -966552 -591030 -472430 -347758 -326623 -285271 -828148 -704194 -620636 -277182 -972813 -777987 -303381 -880983 -781806 -260176 -918871 -621042 -91087 -369405 -336910 -517138 -732545 -131911 -796432 -805714 -595413 -22337 -80346 -245408 -899476 -898211 -712034 -425014 -324342 -749462 -408765 -984681 -163611 -193035 -809675 -23395 -558086 -464246 -630075 -895393 -144703 -955260 -220926 -737369 -535676 -915631 -509417 -129291 -648272 -383837 -972558 -490751 -910442 -691434 -599491 -121351 -303520 -153963 -582529 -51…
Output: 529

Example 2:

Input: 896 -340093 -942633 -788604 -8662 -666233 -101781 -456887 -890897 -233935 -14554 -666248 -523649 -69931 -708790 -584349 -316713 -561542 -890294 -859428 -990916 -700016 -611278 -816717 -496255 -256168 -268077 -134823 -766134 -640608 -889132 -361182 -978687 -334056 -951977 -231724 -217945 -680829 -358131 -348503 -604199 -649431 -269196 -985930 -80819 -930495 -379322 -847457 -526148 -568653 -195010 -654654 -231585 -113231 -414396 -362156 -195230 -610736 -165544 -405993 -349367 -500794 -152549 -458596 -397338 -462794 -424906 -608748 -728977 -890330 -953443 -463274 -726893 -108707 -47789 -297569 -620982 -849628 -894521 -353894 -576854 -636324 -441446 -85428 -880675 -371220 -137586 -223804 -8679 -839095 -62204 -558703 -32169 -475705 -780853 -588141 -120811 -551189 -306068 -840782 -78759 -553018 …
Output: 309

Example 3:

Input: 103 -59280 -519925 -664706 -457282 -664136 -368037 -228936 -740234 -239667 -495539 -574936 -373105 -121141 -762375 -801556 -169308 -287471 -129842 -173988 -950704 -923155 -696254 -14986 -206132 -154985 -789852 -298999 -485772 -43448 -64901 -627711 -5414 -887769 -970459 -388988 -133725 -270886 -268768 -26103 -805513 -738584 -721917 -854133 -678985 -9428 -96951 -978836 -233774 -547380 -177901 -171216 -990852 -529619 -11488 -292938 -339236 -382289 -573492 -979791 -357370 -112324 -85282 -742992 -123733 -244325 -676959 -651495 -794393 -457224 -73692 -762211 -306279 -704289 -221885 -408323 -978912 -474684 -725771 -375805 -762636 -615034 -243897 -280611 -629724 -526768 -223506 -477244 -757345 -538721 -940694 -934839 -243883 -487599 -768460 -488720 -36567 -610872 -256322 -52321 -445217 -808586 -35…
Output: 8

Constraints:

1 <= n <= 971; -1000000 <= a[i],t <= 1000.

Loading...
Test Cases:No test cases
No test cases available.
The Celestial Above Threshold - EASY Coding Problem | CodeTikki