CT43434

The Faded Lesser Followers

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

The bookkeeper Nina has been asked to catalog the new acquisitions. On the desk lies a long table of crates readings. 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 <= 1626; 0 <= a[i],x <= 1000000.

Example 1:

Input: 267 249772 254799 560704 418551 644725 239163 631384 110341 404285 157661 448251 22817 562393 278704 294301 989145 51002 183557 500908 768878 691944 360261 585641 828446 988056 218074 720309 558425 492539 663112 319937 373797 506341 675134 963238 470700 809877 133493 995910 308831 668009 307245 813809 222927 339845 907793 29282 543623 781165 497028 988173 906130 504812 636483 500410 400708 981349 16105 343758 696713 920117 384114 834804 408168 474173 753053 163963 93848 760524 223153 241658 41058 321382 686138 842648 889174 830923 51780 687201 678369 564732 19577 565223 197027 819719 929653 357596 110692 896798 437945 349960 962370 655212 665429 151467 60868 610610 394422 900115 346109 199989 351726 177435 296085 109698 104657 831408 194087 882581 621911 579230 827634 552642 921396 898241 …
Output: 68 68 140 109 161 63 156 28 101 38 111 7 134 66 68 248 13 43 116 179 164 88 132 189 238 50 167 124 111 146 72 87 112 150 218 104 172 31 227 70 144 69 169 52 71 197 8 109 159 102 214 191 103 129 102 84 205 2 69 138 185 79 163 81 93 143 34 20 141 48 50 9 61 127 153 161 149 10 126 124 99 5 98 37 137 162 67 21 152 77 60 164 108 110 26 12 96 65 147 57 35 58 30 49 18 16 124 30 132 89 82 119 77 135 131 117 150 14 9 63 15 139 48 80 110 114 6 0 116 102 33 56 48 123 28 70 46 34 40 62 68 110 90 36 90 37 117 76 37 71 52 53 54 48 66 95 31 97 55 35 106 42 36 72 18 82 16 65 21 18 43 64 31 25 20 33 64 49 71 87 74 38 35 69 21 70 56 7 57 74 34 55 53 61 47 65 56 13 7 23 23 8 26 13 18 19 10 31 22 25 13 3 39 7 11 36 44 12 45 22 28 26 27 5 20 31 11 25 13 20 15 27 34 3 29 21 1 2 9 1 3 2 10 3 21 9 2 6 8 9 3 1 14 …

Example 2:

Input: 1157 605934 704413 391879 797542 97955 800991 442034 809279 2210 376371 887002 609817 890249 16023 877006 973215 608004 51250 974147 262072 639760 965368 453140 358928 795220 995576 944048 904194 36768 193663 792360 598104 666631 141854 101659 510844 806158 258144 531468 407069 419826 656101 910921 339609 998349 30817 444935 694285 991004 728902 759958 214471 690251 678628 97224 675379 467240 867368 817308 726645 49851 624125 651837 144169 886098 685027 844761 575207 110116 664431 407516 411592 955973 425285 271873 411900 993592 420799 735626 666645 700774 448448 728395 450347 254033 642581 324868 583195 997389 833906 733861 265434 725703 220367 896583 168323 514908 121664 537858 287576 387454 851212 722675 403421 33448 783627 344179 780258 917225 3668 638222 432965 226884 183839 311894 70…
Output: 681 790 434 901 102 903 494 914 1 415 1016 680 1021 16 1000 1109 676 55 1109 282 702 1096 500 392 886 1126 1073 1028 40 206 882 659 732 145 103 570 888 272 581 446 460 712 1022 361 1111 31 479 752 1091 782 824 222 746 733 95 729 507 952 890 771 50 669 699 144 971 731 920 620 107 709 439 443 1039 456 277 442 1070 452 774 705 736 473 756 473 265 674 335 617 1067 889 763 271 747 226 956 165 545 119 562 291 404 902 738 422 33 805 353 798 970 3 654 447 232 187 312 719 446 323 796 190 374 571 969 993 388 274 114 782 59 914 635 279 544 293 676 628 940 683 938 236 776 524 974 667 946 321 425 576 572 831 822 518 452 542 991 403 486 905 403 358 330 846 620 96 231 297 523 149 593 191 205 606 74 155 689 946 529 34 123 564 200 342 428 353 901 522 607 964 852 617 342 691 302 163 795 234 126 484 304 0 61…

Example 3:

Input: 481 357499 446344 302210 923073 24284 107934 417499 134428 332559 123831 90850 876252 966203 245408 584634 398174 691825 140477 45973 766225 664606 356976 544740 902933 442860 290874 613424 672054 61652 859866 871614 27634 359692 725446 737063 186052 959569 987303 594322 311496 456784 535462 983616 912871 564826 846136 932666 126560 900031 236190 274400 983569 490145 777827 86692 523475 646460 113975 629366 333807 602694 42836 439475 757229 164999 132513 64054 868898 813591 770020 365718 706327 703461 350678 734996 697790 125467 273813 926420 317571 919756 270965 335825 819708 151085 597819 801907 508538 304940 478633 375501 314803 970815 962889 626358 120359 109344 914873 42365 592656 735319 264763 548020 171054 75930 406932 821051 263034 5646 177310 352873 663539 633555 925660 826327 414…
Output: 164 211 134 441 6 37 196 53 146 47 31 408 449 93 265 180 317 54 15 354 303 152 238 410 194 121 274 301 21 384 390 6 152 325 330 67 423 437 259 127 196 224 429 399 239 370 407 44 390 81 108 420 207 336 27 216 274 35 263 131 252 11 179 320 54 43 19 360 335 321 143 295 290 134 302 282 39 100 374 121 371 96 123 326 46 234 318 197 110 184 138 117 377 372 239 37 31 352 10 225 284 85 201 49 20 146 307 82 2 48 117 244 228 341 302 147 29 94 184 63 117 100 140 227 157 255 34 38 129 97 256 43 86 160 102 286 221 332 220 234 173 18 295 123 128 19 54 238 174 317 69 46 270 108 19 259 12 175 231 20 55 194 53 141 266 9 2 32 102 294 232 163 105 198 181 51 192 245 289 171 4 184 133 39 73 120 292 120 284 31 287 145 86 30 172 234 108 165 270 171 239 185 144 244 264 150 46 224 102 264 179 158 20 203 84 52 142 2…

Constraints:

1 <= n <= 1626; 0 <= a[i],x <= 1000000.

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