CT58258

The Golden weights of Bishop

MediumL6 · Pointer PhantomAcceptance: 0.0%XP: 100

Bishop inherited the tannery at the crane marshes of Stillwater along with its curious bookkeeping system for weights. Time to make sense of it. 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 <= 2103; 0 <= a[i],x <= 1000000000.

Example 1:

Input: 845 559241207 908946 410348949 335897828 545553697 540664640 597509666 403990112 264107269 635392448 19978114 915474766 784947721 181895509 519405588 72068008 612697452 834344098 733958055 639415088 680806587 33449847 851026411 887037702 560828572 38450313 941875368 537881634 726130103 678921845 819820136 930125368 302948758 337711441 557156575 911336491 521736943 547637968 546099378 294042530 933148020 651754365 516296185 650572880 320757364 379393789 430403346 841372076 20917552 630943073 428641237 408216541 425409422 405691547 248302068 682603449 444464111 287908511 55511406 214076445 862594886 248114346 175315848 329847080 617505418 743487026 911704166 881208242 363127057 613359077 622378853 920477134 305972532 549069867 793854005 798514927 436656392 689692629 43632505 462533602 704899…
Output: 469 1 344 281 456 448 501 336 221 535 11 762 654 167 430 57 507 685 605 534 561 25 698 728 457 29 772 437 592 554 666 757 248 275 450 733 427 444 443 237 754 532 421 529 261 307 352 670 12 509 349 328 345 325 207 537 359 232 43 186 676 204 155 259 484 580 704 684 282 480 485 710 242 424 612 616 347 529 31 358 539 133 316 347 667 106 280 114 115 455 653 318 471 214 649 287 680 569 634 222 269 103 148 253 100 214 446 326 26 552 134 4 333 601 48 433 450 454 363 177 372 626 528 255 284 539 412 448 600 246 66 410 317 22 426 250 601 355 15 504 327 307 215 348 444 116 192 485 177 364 198 429 206 428 636 86 484 680 36 444 646 633 648 249 621 508 224 72 259 628 182 538 506 5 354 189 621 569 40 610 309 439 412 411 294 528 327 310 305 586 119 564 323 394 157 136 121 40 495 65 299 341 616 431 372 6 32…

Example 2:

Input: 145 633437101 613279974 898162448 301959511 228324639 294921011 371125271 564857822 925371130 83123180 743374368 501529864 176897357 938670886 260540293 393527941 507631312 405605205 917828205 768722279 536962547 69041463 179066762 466831208 932756374 210642334 708805012 471457418 875520149 517510086 666333167 290702034 586913110 950205110 261001471 628236929 677538601 686214909 233781960 801200118 129490925 567975907 979001873 986673590 104533364 724156414 136512148 355716438 664079867 457436522 331042843 797794713 986114658 120924925 939931844 341885995 772993769 593748965 214908632 538710981 835901101 626350596 209711914 855974365 821880465 419147710 84623724 322177143 76847724 928544501 558900166 213625036 641587268 974413571 159289561 270730351 683342269 552396505 523624987 286977978 …
Output: 84 80 124 43 31 41 46 70 123 13 91 58 23 122 32 45 55 45 113 88 58 11 22 49 110 24 77 48 98 49 70 34 57 104 29 60 66 68 26 78 18 52 100 101 15 65 17 33 59 39 31 67 92 15 86 30 61 46 21 40 66 46 19 66 62 31 12 26 11 70 36 17 39 70 14 19 42 32 29 20 58 38 20 41 23 37 1 36 53 38 37 7 48 50 28 11 32 30 46 24 15 36 4 7 12 13 12 8 30 4 12 8 24 17 8 5 23 2 11 2 22 12 10 12 18 14 3 0 10 13 13 3 12 10 1 2 4 4 2 4 3 1 2 0 0

Example 3:

Input: 1939 48966945 556647827 296073576 553812735 468149776 704153889 269836785 572385161 402562509 874294504 204745633 453185057 97586800 137364529 609445888 855574974 535438937 107428508 340973346 537758122 78465337 635508246 829866041 47236318 600570804 773631655 972143032 581204137 446594568 389530681 958353399 129444107 258110741 506058486 464868567 60776557 96299151 386977428 2314964 772564867 35708034 91178088 888787870 936449468 278643765 575408233 210537689 164302891 770110467 447125120 2559707 274363774 263374138 923065266 333881488 683390559 604429946 899664294 656534475 697579962 422992699 326129461 420348780 96959147 173136973 194204506 668976453 830165735 652753308 472017775 396409484 640435408 492159358 667879245 104265525 589002541 394494205 775365693 282595472 392578496 23281340…
Output: 85 1043 543 1033 873 1345 498 1070 732 1687 367 836 172 246 1144 1649 989 191 610 992 133 1184 1588 84 1116 1473 1861 1076 818 708 1833 224 473 938 851 104 165 695 3 1460 59 155 1676 1765 497 1054 367 283 1447 807 4 487 470 1738 586 1260 1102 1688 1192 1286 756 570 749 162 293 336 1214 1550 1183 843 699 1160 881 1204 177 1054 695 1433 494 690 403 407 1162 754 1231 1030 30 1609 398 550 1388 354 419 938 1083 1195 1680 67 591 250 353 1400 457 1304 1336 518 477 1407 299 1407 1170 631 733 1070 1184 786 1171 1781 1071 214 579 1800 1398 699 1066 145 262 1473 970 1763 1261 862 1578 1288 606 1402 1583 616 1390 702 767 754 726 1025 1793 1672 566 1220 337 1649 364 1495 730 584 566 1655 75 1431 1370 95 1730 168 1357 320 514 1450 598 82 1409 1705 1661 269 1708 283 278 878 55 311 991 1391 64 1155 311 64…

Constraints:

1 <= n <= 2103; 0 <= a[i],x <= 1000000000.

Loading...
Test Cases:No test cases
No test cases available.
The Golden weights of Bishop - MEDIUM Coding Problem | CodeTikki