CT57404

Smith and the Gleaming weights

MediumL6 · Pointer PhantomAcceptance: 0.0%XP: 100

Deep in the northern keep of Frostgate, Smith studies rows of weights entries. One clean number will settle the guild's oldest argument. 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 <= 1921; -1000000 <= a[i],x <= 1000000000.

Example 1:

Input: 972 46803488 389332679 757328639 171649130 665529246 736098649 134354869 284849951 177224469 551480443 947055400 336412229 695537085 -815572 7053375 817161540 133912544 663891694 855200960 814148707 357156710 575807154 667826867 736423964 976651130 763607911 626968909 319382556 897747699 39534541 543364256 159421867 810757996 735444598 673583408 802608013 770352516 390315779 768999199 9773562 599279859 208970940 683158593 936825778 519004851 131391171 665288055 328029372 469052739 585587046 458186666 870998833 743432482 589956241 180714691 85108532 418499707 244361064 872635489 143436520 242847952 313337741 816162761 962781589 473415293 912658212 431611770 74774244 531647744 648659304 532064449 913506908 169345853 409709643 80248439 840424320 76025108 224130352 201032664 816654620 62073090…
Output: 53 390 740 182 649 725 144 285 186 527 909 340 668 0 8 789 141 638 816 781 353 548 639 712 923 733 599 311 842 42 516 162 766 705 639 755 735 379 733 13 565 212 643 865 486 134 626 318 441 546 428 799 702 548 185 90 400 237 795 143 233 297 746 872 437 820 400 77 486 593 486 815 166 386 84 757 79 215 198 734 557 160 465 221 345 312 249 664 8 532 864 278 482 524 448 693 348 720 105 858 232 23 815 471 690 296 419 849 188 728 542 531 477 692 17 831 343 668 199 604 307 415 11 19 428 814 194 35 136 649 499 89 459 657 361 99 170 342 268 488 748 720 638 334 633 821 129 324 585 180 633 489 509 345 594 216 285 64 337 128 422 49 544 441 556 782 737 223 13 18 520 345 406 24 579 87 97 129 486 171 146 576 774 316 195 108 211 357 358 105 753 570 351 322 747 459 486 88 647 482 656 163 518 764 405 550 103 …

Example 2:

Input: 702 872260345 497777877 233568084 79716978 439317557 37828339 708414237 769110512 107038490 171078443 75555850 96378926 528611746 352260788 190211652 553706862 782298604 365797705 115206920 163304043 915084236 699404220 655902276 208140087 748896533 961505729 662305869 246071913 906553830 255879857 969953142 342347003 964068462 224435587 784032099 58090551 788014706 831797600 708109226 518105060 867203084 138778701 336769476 84193598 57673179 241979950 681034412 739175791 711697554 941708776 249137900 303548379 982143482 643019551 180928087 920645658 422279771 781678132 153088160 256384066 594016611 543027841 651097613 895794453 553516668 480059337 837573964 415218685 769672991 614997692 953558475 848565622 152157812 264918770 135531373 166325175 221635217 418647686 621430014 268959927 781…
Output: 614 347 158 52 309 18 503 534 70 113 46 60 361 239 122 375 539 248 70 102 624 483 444 132 508 650 449 158 610 168 652 227 645 143 528 38 527 552 482 341 571 85 219 49 36 149 459 485 475 613 155 190 644 423 111 596 273 510 91 159 384 344 419 577 352 305 532 260 491 393 602 535 89 164 82 99 132 259 391 161 491 152 539 97 515 269 193 613 247 428 477 177 197 241 202 353 336 543 20 514 129 339 423 465 574 409 436 236 37 222 21 541 484 479 66 332 196 570 399 376 429 300 334 68 60 501 240 218 352 528 424 85 442 211 310 448 217 301 126 433 191 429 330 94 528 54 58 549 411 460 457 446 130 24 318 157 412 524 266 387 112 378 321 457 44 453 260 442 502 32 17 349 321 187 33 87 108 43 6 18 301 490 372 229 137 299 484 476 278 323 254 457 440 444 69 31 466 464 180 327 31 200 473 437 346 342 383 120 136 22…

Example 3:

Input: 307 341977267 993345200 468514770 654955419 913304322 626105943 973330875 910676061 942976269 333204873 64434826 704928803 988742784 411787605 452156910 626880654 635698937 525909648 264020340 284920295 744609732 23662857 197457849 267079082 184748030 468442118 878464987 269170930 67997318 533691039 385141199 908805106 835690873 797003824 925285547 923208808 2556618 45999897 208269854 808920069 555618637 510459409 331592493 2209683 378651303 58535861 639514254 205129084 833560152 679262944 180871820 955771966 35857720 965864595 792425809 887154452 865682481 595862007 554694673 42865013 640443627 498483965 724695980 122288689 737616924 667026354 921962885 715951857 684019133 753648271 457935249 371026195 798135957 975869341 387413789 418945631 37930834 842048481 584593662 512642885 31606242…
Output: 101 305 141 188 279 179 295 277 289 98 23 199 294 120 129 175 177 152 75 82 206 9 52 73 51 130 244 73 23 145 101 253 229 214 257 256 3 14 51 213 144 133 85 2 93 15 156 46 215 165 45 248 7 249 197 225 217 146 135 10 150 121 171 29 174 153 227 167 157 174 112 85 186 230 89 98 8 196 135 120 73 92 69 155 179 157 135 135 182 200 25 13 116 19 10 67 50 94 160 167 193 83 136 178 23 189 128 2 57 128 50 101 24 50 63 130 78 188 144 133 170 1 106 115 156 36 81 50 32 139 8 97 113 120 103 158 15 2 159 111 60 11 93 84 138 10 21 83 118 94 13 58 97 148 125 139 111 73 119 22 5 138 93 102 65 81 70 59 107 106 9 17 62 77 16 11 46 2 105 86 6 59 10 12 96 18 0 92 36 111 22 24 19 87 38 60 83 80 18 106 66 16 36 23 19 26 65 56 2 64 68 37 41 84 39 1 62 7 17 54 7 40 74 45 9 9 60 54 15 27 46 66 17 8 59 50 4 14 68 49 34…

Constraints:

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

Loading...
Test Cases:No test cases
No test cases available.
Smith and the Gleaming weights - MEDIUM Coding Problem | CodeTikki