CT62185

The Bloomhaven Lesser Followers

MediumL6 · Pointer PhantomAcceptance: 0.0%XP: 100

Caravans arrive at the tulip beds of Bloomhaven with crates of ledgers, and Dev the reckoner must account for every last one. Task: For each position i, print how many elements to its right are strictly smaller than a[i]. Input format: First line: n. Second line: n integers. Output format: Print n counts space-separated. Constraints: 1 <= n <= 2197; -1000000 <= a[i],x <= 1000000000.

Example 1:

Input: 1211 764970920 201921029 7226557 668641717 164408165 473938431 987441131 688824791 572330069 211091893 244131424 450920577 975030824 294916292 264387929 904261264 157074870 296007043 402699847 85336696 926834099 907625143 563958572 839366402 643849573 868019094 46839477 739526482 676814552 820512083 623358487 410543016 974147160 532655302 442010605 245051327 779508995 664639872 5336164 244727436 852125988 308516707 490215465 751900689 933515596 135568656 680901570 564586613 246147185 460359766 580623073 281720348 851487375 804300030 537695924 342897799 855194289 446978452 86953231 298493970 262541782 138310103 426816991 818887211 636237067 209898592 68360907 555514574 853968803 590232804 913127834 464237739 609431870 727302716 846514147 949501556 995161174 900084867 523672611 358214309 667…
Output: 929 234 7 813 192 574 1183 833 702 243 272 538 1156 334 296 1065 183 333 465 92 1083 1064 682 989 778 1021 53 869 804 969 750 476 1135 638 520 270 916 790 6 268 988 342 579 873 1068 145 798 673 269 539 687 308 975 929 637 375 978 514 91 325 284 153 488 934 748 235 69 645 965 684 1021 534 708 825 949 1054 1129 1008 598 386 764 144 921 770 111 597 897 216 618 587 866 509 548 96 936 547 635 1000 413 41 152 292 515 61 474 967 792 674 944 643 185 59 579 131 909 954 672 901 124 150 450 947 933 999 273 761 147 557 448 263 231 736 647 1016 753 1025 928 588 348 384 103 542 925 1006 622 160 600 473 847 593 925 63 359 939 454 444 583 840 86 217 467 926 863 413 421 347 44 256 718 33 821 579 381 816 535 1005 309 399 417 637 952 194 963 303 174 787 228 424 443 205 729 797 911 649 1007 850 215 149 649 19…

Example 2:

Input: 1243 671916151 522252696 808302626 741071496 34273035 415238734 748040857 166595976 587746017 811699213 184134258 482164539 860141798 25070182 328445359 884665777 425551312 894775642 963625242 410082931 336872413 375448793 161348945 367957849 412500108 940648559 560198680 42030354 981481557 12855742 599218524 274722049 135955194 129660174 392338670 240887951 703257605 971699754 583454524 126025826 453181414 735503548 247368664 236148750 685515549 242588302 793433046 394207804 838962383 573438148 146827702 318001693 741179454 792897501 860773435 703576669 491315025 198497111 314392283 963484907 699921152 883657819 89137161 632314035 332477244 517192118 414564015 10521109 116114488 170873991 804404666 320834304 999543839 64581035 758604050 1044217 788409924 831819141 161287032 273617426 6322…
Output: 836 652 998 919 45 516 925 193 731 995 215 603 1061 35 407 1085 527 1100 1174 505 417 460 185 453 504 1137 682 50 1188 16 729 342 153 146 476 292 856 1165 705 140 552 886 301 280 832 293 945 471 999 686 158 377 883 938 1027 846 590 229 373 1135 838 1045 93 746 395 609 487 14 124 188 937 380 1170 62 888 2 913 962 173 324 734 471 405 543 722 54 938 322 225 451 670 299 369 186 621 719 880 1082 905 192 576 559 951 1137 757 1099 286 1105 32 956 427 208 130 342 164 766 995 114 72 1104 364 732 796 723 275 548 270 126 1091 824 679 587 11 785 1009 61 826 917 632 517 718 723 856 381 255 527 1010 541 323 831 72 427 414 243 1052 284 625 480 113 1023 980 328 219 637 119 162 498 594 204 936 662 385 379 1032 323 141 626 427 185 725 236 514 88 508 251 303 359 116 231 96 433 639 196 1019 237 460 555 123 96…

Example 3:

Input: 2036 249205296 76704466 788606274 442261903 868440783 620406104 33972987 462721666 446487912 308526367 403913408 640134777 511896848 301847735 104279320 629580071 32655918 450226920 638590702 626713367 368470412 300259347 133962078 597162955 846692717 199468638 43914048 286888596 161381558 205486633 558538272 447433423 859407095 786870598 230619708 976521034 749084221 971689560 381346622 839483041 148474166 293322475 754236720 611815786 479600262 967371479 152250927 323367921 178502276 406981221 323046818 673337520 54125397 265583150 750816297 830526071 550996502 44386090 504600499 987389379 50020617 58851933 786318702 807684468 702339589 312084485 242328568 195124613 585374218 107323401 125899740 698556481 66133392 42633620 396841345 418089267 221352813 790634288 547773027 860964438 85490…
Output: 482 167 1575 859 1762 1230 69 894 866 588 771 1275 994 571 220 1241 64 867 1261 1229 688 562 263 1169 1690 385 96 535 317 393 1089 854 1714 1545 444 1955 1475 1937 709 1663 291 537 1483 1187 904 1925 299 607 339 760 604 1306 125 497 1466 1628 1061 96 956 1958 111 132 1521 1564 1358 576 453 368 1121 218 248 1344 143 93 725 762 412 1519 1039 1672 1659 97 892 1904 1403 1834 747 1070 58 183 26 1415 1923 1174 171 1691 1400 970 754 1317 1903 1123 1471 73 588 382 1586 1223 1460 402 450 127 988 15 1902 450 941 170 205 715 1653 1323 1015 294 1685 996 348 1340 1012 766 819 1565 1738 363 1864 1818 536 818 1783 885 740 1157 907 1284 152 162 1022 1534 294 283 1449 1314 1306 418 1363 1839 1409 718 489 418 895 1315 226 961 1138 77 232 134 432 661 529 859 1221 1029 1689 1669 1403 1694 444 904 480 1377 929…

Constraints:

1 <= n <= 2197; -1000000 <= a[i],x <= 1000000000.

Loading...
Test Cases:No test cases
No test cases available.
The Bloomhaven Lesser Followers - MEDIUM Coding Problem | CodeTikki