CT26351

Opal's stamps Above Threshold

EasyL3 · Syntax SurferAcceptance: 0.0%XP: 20

Every season at the quartz ridge of Glimmerfell, someone must inspect the delivered goods. This year the task falls to Opal, armed only with the stamps register. 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 <= 924; 0 <= a[i],t <= 1000000000.

Example 1:

Input: 839 765653237 656841321 245662240 346517860 421593904 239782790 590248646 34901524 279676957 468038767 648631190 201170967 294385530 242760268 385650394 641556423 892550986 888188890 77292755 491727608 739454328 583665866 606409673 187508494 837112002 196116438 768690644 781671413 509181250 389290029 831088269 571698877 716249125 135628769 837908109 423766847 444710793 134254211 371594148 230541939 859504368 443749655 204527822 817618551 967696914 464681243 234874849 961408199 273461765 25256518 429123771 459546776 162670491 333571319 544601961 668417888 424894950 323121418 200968653 882949006 703988397 792994965 750365046 820280686 448209793 671339801 799234320 720631701 588568537 507661767 75067611 148371240 142615796 775224994 98641532 756303692 374577216 455221044 812635315 828402708 2…
Output: 194

Example 2:

Input: 461 489546021 532963069 490118305 180734087 28446060 586679191 892256930 405816867 197636762 279897477 169418969 782145789 175353738 249181267 792858011 266504441 418284474 69390761 668026630 310201454 423071959 856999283 417885851 701626650 584866077 874765800 275989239 709494782 317179891 496817112 687259013 339033441 624603286 867208826 800609412 145086389 3744229 791700604 909943034 589362280 976347046 566569806 810684508 460828121 870163480 383665545 168644685 479951344 708108199 406743203 193089519 459709789 97489510 400846247 980196043 905644460 435417211 628005231 742763903 105005063 115529244 924369863 608430879 466880478 975141909 263449335 685768194 22178482 805287680 822714549 989580238 158012771 893935207 829218710 653170286 635853915 58912521 257464183 194062060 456312909 706…
Output: 236

Example 3:

Input: 84 852941614 288505458 277712629 615774809 985431023 880434523 288558718 286787291 947940935 531803866 648239333 539741634 616910926 460207977 749991873 20979273 121174118 973003662 757544586 728830521 96577384 839693528 150613814 996458724 441125410 264652863 38793469 474579961 900433466 735913023 547494837 64598897 50181182 272056770 163310265 343438588 712855844 831891411 695065642 970339179 738528726 252868484 560612073 964096215 586773338 366869993 637065585 749554495 174313570 522668174 643694188 549785397 85690906 768230608 769777408 809671117 601189466 847276587 16841112 701528733 846529242 878260334 302375683 456519820 468284639 208471348 187712719 27751552 11636705 568999857 552326751 673213528 485147567 86731775 525480640 128482823 63315451 227142884 421969185 599912204 71465199…
Output: 10

Constraints:

1 <= n <= 924; 0 <= a[i],t <= 1000000000.

Loading...
Test Cases:No test cases
No test cases available.