Datasets:

WeixiangYan

/

CodeScope

like 2

["127", "130", "123456789101112131415161718192021222324"]

The first line contains a positive number n. It consists of no more than 100 digits and doesn't contain any leading zeros. The number n can't be represented as an empty string. Please, do not use %lld specificator to read or write 64-bit integers in C++. It is preffered to use cout (also you may use %I64d).

33041f1832fa7f641e37c4c638ab08a1

n = int(input()) if n >= -128 and n <= 127: print("byte") elif n >= -32768 and n <= 32767: print("short") elif n >= -2147483648 and n <= 2147483647: print("int") elif n >= -9223372036854775808 and n <= 9223372036854775807: print("long") else: print("BigInteger")

["byte", "short", "BigInteger"]

Python

Print the first type from the list "byte, short, int, long, BigInteger", that can store the natural number n, in accordance with the data given above.

Little Petya has recently started attending a programming club. Naturally he is facing the problem of choosing a programming language. After long considerations he realized that Java is the best choice. The main argument in favor of choosing Java was that it has a very large integer data type, called BigInteger.But having attended several classes of the club, Petya realized that not all tasks require using the BigInteger type. It turned out that in some tasks it is much easier to use small data types. That's why a question arises: "Which integer type to use if one wants to store a positive integer n?"Petya knows only 5 integer types:1) byte occupies 1 byte and allows you to store numbers from  - 128 to 1272) short occupies 2 bytes and allows you to store numbers from  - 32768 to 327673) int occupies 4 bytes and allows you to store numbers from  - 2147483648 to 21474836474) long occupies 8 bytes and allows you to store numbers from  - 9223372036854775808 to 92233720368547758075) BigInteger can store any integer number, but at that it is not a primitive type, and operations with it are much slower.For all the types given above the boundary values are included in the value range.From this list, Petya wants to choose the smallest type that can store a positive integer n. Since BigInteger works much slower, Peter regards it last. Help him.

[{"input": "127\r\n", "output": ["byte"]}, {"input": "130\r\n", "output": ["short"]}, {"input": "123456789101112131415161718192021222324\r\n", "output": ["BigInteger"]}, {"input": "6\r\n", "output": ["byte"]}, {"input": "16\r\n", "output": ["byte"]}, {"input": "126\r\n", "output": ["byte"]}, {"input": "128\r\n", "output": ["short"]}, {"input": "32766\r\n", "output": ["short"]}, {"input": "111111\r\n", "output": ["int"]}, {"input": "22222\r\n", "output": ["short"]}, {"input": "32767\r\n", "output": ["short"]}, {"input": "32768\r\n", "output": ["int"]}, {"input": "32769\r\n", "output": ["int"]}, {"input": "2147483645\r\n", "output": ["int"]}, {"input": "2147483646\r\n", "output": ["int"]}, {"input": "2147483647\r\n", "output": ["int"]}, {"input": "2147483648\r\n", "output": ["long"]}, {"input": "2147483649\r\n", "output": ["long"]}, {"input": "9223372036854775805\r\n", "output": ["long"]}, {"input": "9223372036854775806\r\n", "output": ["long"]}, {"input": "9223372036854775807\r\n", "output": ["long"]}, {"input": "9223372036854775808\r\n", "output": ["BigInteger"]}, {"input": "9223372036854775809\r\n", "output": ["BigInteger"]}, {"input": "1111111111111111111111111111111111111111111111\r\n", "output": ["BigInteger"]}, {"input": "232\r\n", "output": ["short"]}, {"input": "241796563564014133460267652699\r\n", "output": ["BigInteger"]}, {"input": "29360359146807441660707083821018832188095237636414144034857851003419752010124705615779249\r\n", "output": ["BigInteger"]}, {"input": "337300529263821789926982715723773719445001702036602052198530564\r\n", "output": ["BigInteger"]}, {"input": "381127467969689863953686682245136076127159921\r\n", "output": ["BigInteger"]}, {"input": "2158324958633591462\r\n", "output": ["long"]}, {"input": "268659422768117401499491767189496733446324586965055954729177892248858259490346\r\n", "output": ["BigInteger"]}, {"input": "3023764505449745844381036446038799100004717936344985\r\n", "output": ["BigInteger"]}, {"input": "13408349824892484976400774\r\n", "output": ["BigInteger"]}, {"input": "18880842614378213198381172973704766723997934818440985546083314104481253291692101136681\r\n", "output": ["BigInteger"]}, {"input": "1180990956946757129733650596194933741\r\n", "output": ["BigInteger"]}, {"input": "73795216631038776655609800540262114612084443385902708034055020082090470662930545328551\r\n", "output": ["BigInteger"]}, {"input": "1658370691480968202384509492140362150472696196949\r\n", "output": ["BigInteger"]}, {"input": "59662093286671707493190399502717308574459619342109544431740791973099298641871347858082458491958703\r\n", "output": ["BigInteger"]}, {"input": "205505005582428018613354752739589866670902346355933720701937\r\n", "output": ["BigInteger"]}, {"input": "53348890623013817139699\r\n", "output": ["BigInteger"]}, {"input": "262373979958859125198440634134122707574734706745701184688685117904709744\r\n", "output": ["BigInteger"]}, {"input": "69113784278456828987289369893745977\r\n", "output": ["BigInteger"]}, {"input": "2210209454022702335652564247406666491086662454147967686455330365147159266087\r\n", "output": ["BigInteger"]}, {"input": "630105816139991597267787581532092408135\r\n", "output": ["BigInteger"]}, {"input": "800461429306907809762708270\r\n", "output": ["BigInteger"]}, {"input": "7685166910821197056344900917707673568669808490600751439157\r\n", "output": ["BigInteger"]}, {"input": "713549841568602590705962611607726022334779480510421458817648621376683672722573289661127894\r\n", "output": ["BigInteger"]}, {"input": "680504312323996476676434432\r\n", "output": ["BigInteger"]}, {"input": "3376595620091080825479292544658464163405755746884100218035\r\n", "output": ["BigInteger"]}, {"input": "303681723783491968617491075591006152690484825330764215796396316561122383310011589365655481\r\n", "output": ["BigInteger"]}, {"input": "4868659422768117401499491767189496733446324586965055954729177892248858259490346614099717639491763430\r\n", "output": ["BigInteger"]}, {"input": "3502376450544974584438103644603879910000471793634498544789130945841846713263971487355748226237288709\r\n", "output": ["BigInteger"]}, {"input": "2334083498248924849764007740114454487565621932425948046430072197452845278935316358800789014185793377\r\n", "output": ["BigInteger"]}, {"input": "1988808426143782131983811729737047667239979348184409855460833141044812532916921011366813880911319644\r\n", "output": ["BigInteger"]}, {"input": "1018099095694675712973365059619493374113337270925179793757322992466016001294122941535439492265169131\r\n", "output": ["BigInteger"]}, {"input": "8437952166310387766556098005402621146120844433859027080340550200820904706629305453285512716464931911\r\n", "output": ["BigInteger"]}, {"input": "6965837069148096820238450949214036215047269619694967357734070611376013382163559966747678150791825071\r\n", "output": ["BigInteger"]}, {"input": "4596620932866717074931903995027173085744596193421095444317407919730992986418713478580824584919587030\r\n", "output": ["BigInteger"]}, {"input": "1905505005582428018613354752739589866670902346355933720701937408006000562951996789032987808118459990\r\n", "output": ["BigInteger"]}, {"input": "8433488906230138171396997888322916936677429522910871017295155818340819168386140293774243244435122950\r\n", "output": ["BigInteger"]}, {"input": "6862373979958859125198440634134122707574734706745701184688685117904709744830303784215298687654884810\r\n", "output": ["BigInteger"]}, {"input": "4491137842784568289872893698937459777201151060689848471272003426250808340375567208957554901863756992\r\n", "output": ["BigInteger"]}, {"input": "9721020945402270233565256424740666649108666245414796768645533036514715926608741510409618545180420952\r\n", "output": ["BigInteger"]}, {"input": "7330105816139991597267787581532092408135003429259616955239761315950805521264994021242873979309182812\r\n", "output": ["BigInteger"]}, {"input": "2000461429306907809762708270752707617318091579531521957022940951538737203583768926365382290530636885\r\n", "output": ["BigInteger"]}, {"input": "9868516691082119705634490091770767356866980849060075143915700796802700437762260163478754592094654326\r\n", "output": ["BigInteger"]}, {"input": "8713549841568602590705962611607726022334779480510421458817648621376683672722573289661127894678771177\r\n", "output": ["BigInteger"]}, {"input": "4580504312323996476676434432646986768872786931159974634901608445720467716981185426771899006352697916\r\n", "output": ["BigInteger"]}, {"input": "2537659562009108082547929254465846416340575574688410021803548570097340949141688442074263189944614467\r\n", "output": ["BigInteger"]}, {"input": "1403681723783491968617491075591006152690484825330764215796396316561122383310011589365655481428540208\r\n", "output": ["BigInteger"]}, {"input": "26\r\n", "output": ["byte"]}, {"input": "302376450544\r\n", "output": ["long"]}, {"input": "13\r\n", "output": ["byte"]}, {"input": "188808426143\r\n", "output": ["long"]}, {"input": "118099095694675\r\n", "output": ["long"]}, {"input": "73795216631038\r\n", "output": ["long"]}, {"input": "1658370691480\r\n", "output": ["long"]}, {"input": "596620932866\r\n", "output": ["long"]}, {"input": "2055050055\r\n", "output": ["int"]}, {"input": "533488906\r\n", "output": ["int"]}, {"input": "26237397\r\n", "output": ["int"]}, {"input": "6911378\r\n", "output": ["int"]}, {"input": "221020945402270233\r\n", "output": ["long"]}, {"input": "63010581613999159\r\n", "output": ["long"]}, {"input": "80046142930\r\n", "output": ["long"]}, {"input": "7685166910821197\r\n", "output": ["long"]}, {"input": "71\r\n", "output": ["byte"]}, {"input": "6805043123239964766\r\n", "output": ["long"]}, {"input": "3376\r\n", "output": ["short"]}, {"input": "3036817237\r\n", "output": ["long"]}]

[{'input': '130\r\n', 'output': ['short']}, {'input': '69113784278456828987289369893745977\r\n', 'output': ['BigInteger']}, {'input': '188808426143\r\n', 'output': ['long']}, {'input': '1658370691480968202384509492140362150472696196949\r\n', 'output': ['BigInteger']}, {'input': '2147483647\r\n', 'output': ['int']}]

[{'input': '1403681723783491968617491075591006152690484825330764215796396316561122383310011589365655481428540208\r\n', 'output': ['BigInteger']}, {'input': '4491137842784568289872893698937459777201151060689848471272003426250808340375567208957554901863756992\r\n', 'output': ['BigInteger']}, {'input': '16\r\n', 'output': ['byte']}, {'input': '1988808426143782131983811729737047667239979348184409855460833141044812532916921011366813880911319644\r\n', 'output': ['BigInteger']}, {'input': '128\r\n', 'output': ['short']}]

[{'input': '1111111111111111111111111111111111111111111111\r\n', 'output': ['BigInteger']}, {'input': '32768\r\n', 'output': ['int']}, {'input': '4491137842784568289872893698937459777201151060689848471272003426250808340375567208957554901863756992\r\n', 'output': ['BigInteger']}, {'input': '32766\r\n', 'output': ['short']}, {'input': '130\r\n', 'output': ['short']}]

[{'input': '4596620932866717074931903995027173085744596193421095444317407919730992986418713478580824584919587030\r\n', 'output': ['BigInteger']}, {'input': '221020945402270233\r\n', 'output': ['long']}, {'input': '8713549841568602590705962611607726022334779480510421458817648621376683672722573289661127894678771177\r\n', 'output': ['BigInteger']}, {'input': '2210209454022702335652564247406666491086662454147967686455330365147159266087\r\n', 'output': ['BigInteger']}, {'input': '73795216631038\r\n', 'output': ['long']}]

[{'input': '2334083498248924849764007740114454487565621932425948046430072197452845278935316358800789014185793377\r\n', 'output': ['BigInteger']}, {'input': '2147483648\r\n', 'output': ['long']}, {'input': '1988808426143782131983811729737047667239979348184409855460833141044812532916921011366813880911319644\r\n', 'output': ['BigInteger']}, {'input': '6862373979958859125198440634134122707574734706745701184688685117904709744830303784215298687654884810\r\n', 'output': ['BigInteger']}, {'input': '4491137842784568289872893698937459777201151060689848471272003426250808340375567208957554901863756992\r\n', 'output': ['BigInteger']}]

["6\n1 3 4 5 6 9", "3\n998 999 1000", "5\n1 2 3 4 5"]

The first line of the input contains a single integer $$$n$$$ ($$$1 \le n \le 100$$$) — the number of elements in the array. The second line of the input contains $$$n$$$ integers $$$a_i$$$ ($$$1 \le a_1&lt;a_2&lt;\dots&lt;a_n \le 10^3$$$) — the array written by Giraffe.

858b5e75e21c4cba6d08f3f66be0c198

n = int(input()) a = list(map(int,input().split())) count=ans=0 if(n>=2 and a[0]==1 and a[1]==2): count+=1 for i in range(1,n-1): if(a[i-1]+1==a[i] and a[i+1]-1==a[i]): count+=1 else: ans=max(ans,count) count=0 if(n>=2 and a[-1]==1000 and a[-2]==999): count+=1 ans=max(count,ans) print(ans)

["2", "2", "4"]

Python

NoteIn the first example, JATC can erase the third and fourth elements, leaving the array $$$[1, 3, \_, \_, 6, 9]$$$. As you can see, there is only one way to fill in the blanks.In the second example, JATC can erase the second and the third elements. The array will become $$$[998, \_, \_]$$$. Because all the elements are less than or equal to $$$1000$$$, the array is still can be restored. Note, that he can't erase the first $$$2$$$ elements.In the third example, JATC can erase the first $$$4$$$ elements. Since all the elements are greater than or equal to $$$1$$$, Giraffe can still restore the array. Note, that he can't erase the last $$$4$$$ elements.

Print a single integer — the maximum number of consecutive elements in the array that JATC can erase. If it is impossible to erase even a single element, print $$$0$$$.

JATC and his friend Giraffe are currently in their room, solving some problems. Giraffe has written on the board an array $$$a_1$$$, $$$a_2$$$, ..., $$$a_n$$$ of integers, such that $$$1 \le a_1 &lt; a_2 &lt; \ldots &lt; a_n \le 10^3$$$, and then went to the bathroom.JATC decided to prank his friend by erasing some consecutive elements in the array. Since he doesn't want for the prank to go too far, he will only erase in a way, such that Giraffe can still restore the array using the information from the remaining elements. Because Giraffe has created the array, he's also aware that it's an increasing array and all the elements are integers in the range $$$[1, 10^3]$$$.JATC wonders what is the greatest number of elements he can erase?

[{"input": "6\r\n1 3 4 5 6 9\r\n", "output": ["2"]}, {"input": "3\r\n998 999 1000\r\n", "output": ["2"]}, {"input": "5\r\n1 2 3 4 5\r\n", "output": ["4"]}, {"input": "1\r\n1\r\n", "output": ["0"]}, {"input": "2\r\n1 2\r\n", "output": ["1"]}, {"input": "2\r\n999 1000\r\n", "output": ["1"]}, {"input": "9\r\n1 4 5 6 7 100 101 102 103\r\n", "output": ["2"]}, {"input": "100\r\n1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100\r\n", "output": ["99"]}, {"input": "8\r\n6 8 9 11 14 18 19 20\r\n", "output": ["1"]}, {"input": "2\r\n1 7\r\n", "output": ["0"]}, {"input": "1\r\n779\r\n", "output": ["0"]}, {"input": "5\r\n3 8 25 37 43\r\n", "output": ["0"]}, {"input": "73\r\n38 45 46 95 98 99 103 157 164 175 184 193 208 251 258 276 279 282 319 329 336 344 349 419 444 452 490 499 507 508 519 542 544 553 562 576 579 590 594 603 634 635 648 659 680 686 687 688 695 698 743 752 757 774 776 779 792 809 860 879 892 911 918 927 928 945 947 951 953 958 959 960 983\r\n", "output": ["1"]}, {"input": "15\r\n1 2 3 4 5 6 7 8 9 10 11 12 13 14 15\r\n", "output": ["14"]}, {"input": "63\r\n1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63\r\n", "output": ["62"]}, {"input": "100\r\n252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 409 410 425 426 604 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895\r\n", "output": ["70"]}, {"input": "95\r\n34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 911 912 913\r\n", "output": ["35"]}, {"input": "90\r\n126 239 240 241 242 253 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 600 601 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 934 935\r\n", "output": ["44"]}, {"input": "85\r\n52 53 54 55 56 57 58 59 60 61 62 63 64 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 333 334 453 454 455 456 457 458 459 460 461 462 463 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624\r\n", "output": ["23"]}, {"input": "80\r\n237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 408 409 410 411 412 413 414 415 416 417 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985\r\n", "output": ["25"]}, {"input": "70\r\n72 73 74 75 76 77 78 79 80 81 82 354 355 356 357 358 359 360 361 362 363 364 365 366 367 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 764 765 766 767 768 769 770 794 795 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826\r\n", "output": ["19"]}, {"input": "75\r\n327 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653\r\n", "output": ["72"]}, {"input": "60\r\n12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 134 135 136 137 353 354 355 356 357 358 359 360 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815\r\n", "output": ["24"]}, {"input": "65\r\n253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 533 614 615 864\r\n", "output": ["59"]}, {"input": "55\r\n67 68 69 70 160 161 162 163 164 165 166 167 168 169 170 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 960\r\n", "output": ["21"]}, {"input": "50\r\n157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 632 633 634 635 636 637 638\r\n", "output": ["20"]}, {"input": "45\r\n145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 333 334 831 832 978 979 980 981\r\n", "output": ["35"]}, {"input": "100\r\n901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000\r\n", "output": ["99"]}, {"input": "10\r\n1 2 3 4 5 6 7 8 9 10\r\n", "output": ["9"]}, {"input": "10\r\n991 992 993 994 995 996 997 998 999 1000\r\n", "output": ["9"]}, {"input": "39\r\n1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39\r\n", "output": ["38"]}, {"input": "42\r\n959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000\r\n", "output": ["41"]}, {"input": "100\r\n144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 198 199 200 201 202 203 204 205 206 207 208 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 376 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 904 905 997\r\n", "output": ["16"]}, {"input": "95\r\n9 10 11 12 13 134 271 272 273 274 275 276 277 278 290 291 292 293 294 295 296 297 298 299 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 620 621 622 623 624 625 626 627 628 629 630 631 632 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 952\r\n", "output": ["20"]}, {"input": "90\r\n20 21 22 23 24 25 56 57 58 59 60 61 62 63 64 84 85 404 405 406 407 408 409 410 420 421 422 423 424 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 491 492 588 589 590 652 653 654 655 656 657 754 755 756 757 758 759 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 982 983 984 985 986 987 988 989 990 991 992 995\r\n", "output": ["15"]}, {"input": "85\r\n40 41 42 43 44 69 70 71 72 73 305 306 307 308 309 333 334 335 336 337 338 339 340 341 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 717 718 719 720 721 862 863 864 865 866 867 868 869 870 871 872 873 874 945 946 947 948 949 950\r\n", "output": ["18"]}, {"input": "80\r\n87 88 89 90 91 92 93 94 95 96 97 98 99 173 174 175 176 177 178 179 180 184 185 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 550 551 552 553 554 555 650 702 703 704 705 706 707 708 709 710 727 728 729 730 731 798 799 800 831 832 833 869 870 980 981 982 983 984 985 986 987 988 989 990 991 992\r\n", "output": ["13"]}, {"input": "1\r\n1000\r\n", "output": ["0"]}, {"input": "2\r\n998 999\r\n", "output": ["0"]}, {"input": "2\r\n3 4\r\n", "output": ["0"]}, {"input": "3\r\n9 10 11\r\n", "output": ["1"]}, {"input": "6\r\n4 5 6 7 8 9\r\n", "output": ["4"]}, {"input": "5\r\n5 6 7 8 9\r\n", "output": ["3"]}, {"input": "8\r\n1 2 5 6 7 8 9 11\r\n", "output": ["3"]}, {"input": "4\r\n1 2 3 6\r\n", "output": ["2"]}, {"input": "4\r\n1 2 3 66\r\n", "output": ["2"]}, {"input": "7\r\n1 2 5 6 7 8 9\r\n", "output": ["3"]}, {"input": "2\r\n2 4\r\n", "output": ["0"]}, {"input": "8\r\n1 2 5 6 7 8 9 1000\r\n", "output": ["3"]}, {"input": "2\r\n1 1000\r\n", "output": ["0"]}, {"input": "4\r\n3 4 5 6\r\n", "output": ["2"]}, {"input": "5\r\n2 3 4 5 6\r\n", "output": ["3"]}, {"input": "6\r\n1 2 3 4 5 7\r\n", "output": ["4"]}, {"input": "6\r\n1 996 997 998 999 1000\r\n", "output": ["4"]}, {"input": "5\r\n1 2 3 4 6\r\n", "output": ["3"]}, {"input": "6\r\n1 2 3 5 6 7\r\n", "output": ["2"]}, {"input": "3\r\n3 4 5\r\n", "output": ["1"]}, {"input": "1\r\n5\r\n", "output": ["0"]}, {"input": "3\r\n2 3 4\r\n", "output": ["1"]}, {"input": "7\r\n1 3 5 997 998 999 1000\r\n", "output": ["3"]}, {"input": "4\r\n3 4 5 10\r\n", "output": ["1"]}, {"input": "3\r\n997 998 999\r\n", "output": ["1"]}, {"input": "7\r\n1 2 3 4 6 7 8\r\n", "output": ["3"]}, {"input": "2\r\n2 3\r\n", "output": ["0"]}, {"input": "7\r\n2 3 4 6 997 998 999\r\n", "output": ["1"]}, {"input": "1\r\n2\r\n", "output": ["0"]}, {"input": "3\r\n4 5 6\r\n", "output": ["1"]}, {"input": "2\r\n5 6\r\n", "output": ["0"]}, {"input": "7\r\n1 2 3 997 998 999 1000\r\n", "output": ["3"]}, {"input": "4\r\n1 3 999 1000\r\n", "output": ["1"]}, {"input": "5\r\n1 3 5 7 9\r\n", "output": ["0"]}, {"input": "6\r\n1 2 3 4 5 10\r\n", "output": ["4"]}, {"input": "4\r\n1 2 999 1000\r\n", "output": ["1"]}, {"input": "2\r\n10 20\r\n", "output": ["0"]}, {"input": "5\r\n2 3 4 5 10\r\n", "output": ["2"]}, {"input": "4\r\n2 3 4 5\r\n", "output": ["2"]}, {"input": "42\r\n35 145 153 169 281 292 299 322 333 334 358 382 391 421 436 447 464 467 478 491 500 538 604 667 703 705 716 718 724 726 771 811 827 869 894 895 902 912 942 961 962 995\r\n", "output": ["0"]}, {"input": "3\r\n10 11 12\r\n", "output": ["1"]}, {"input": "7\r\n1 2 3 4 6 9 18\r\n", "output": ["3"]}, {"input": "5\r\n1 2 3 4 800\r\n", "output": ["3"]}, {"input": "5\r\n1 2 3 4 1000\r\n", "output": ["3"]}, {"input": "5\r\n1 997 998 999 1000\r\n", "output": ["3"]}, {"input": "6\r\n1 2 6 7 8 9\r\n", "output": ["2"]}, {"input": "4\r\n1 2 3 5\r\n", "output": ["2"]}, {"input": "9\r\n1 2 3 7 8 9 10 11 13\r\n", "output": ["3"]}, {"input": "4\r\n1 2 5 6\r\n", "output": ["1"]}, {"input": "6\r\n1 2 5 6 7 8\r\n", "output": ["2"]}, {"input": "5\r\n1 2 3 999 1000\r\n", "output": ["2"]}, {"input": "100\r\n656 658 660 662 664 666 668 670 672 674 676 678 680 682 684 686 688 690 692 694 696 698 700 702 704 706 708 710 712 714 716 718 720 722 724 726 728 730 732 734 736 738 740 742 744 746 748 750 752 754 756 758 760 762 764 766 768 770 772 774 776 778 780 782 784 786 788 790 792 794 796 798 800 802 804 806 808 810 812 814 816 818 820 822 824 826 828 830 832 834 836 838 840 842 844 848 850 852 999 1000\r\n", "output": ["1"]}, {"input": "3\r\n1 2 9\r\n", "output": ["1"]}, {"input": "8\r\n2 3 4 5 997 998 999 1000\r\n", "output": ["3"]}, {"input": "9\r\n1 2 3 4 6 7 9 10 12\r\n", "output": ["3"]}, {"input": "4\r\n1 2 7 8\r\n", "output": ["1"]}, {"input": "3\r\n1 2 5\r\n", "output": ["1"]}, {"input": "5\r\n1 2 998 999 1000\r\n", "output": ["2"]}, {"input": "4\r\n1 2 3 7\r\n", "output": ["2"]}, {"input": "7\r\n2 4 6 997 998 999 1000\r\n", "output": ["3"]}, {"input": "5\r\n1 2 3 5 6\r\n", "output": ["2"]}, {"input": "6\r\n3 4 5 998 999 1000\r\n", "output": ["2"]}]

[{'input': '2\r\n2 4\r\n', 'output': ['0']}, {'input': '4\r\n1 2 3 7\r\n', 'output': ['2']}, {'input': '4\r\n2 3 4 5\r\n', 'output': ['2']}, {'input': '8\r\n1 2 5 6 7 8 9 11\r\n', 'output': ['3']}, {'input': '4\r\n3 4 5 6\r\n', 'output': ['2']}]

[{'input': '8\r\n2 3 4 5 997 998 999 1000\r\n', 'output': ['3']}, {'input': '4\r\n3 4 5 6\r\n', 'output': ['2']}, {'input': '9\r\n1 2 3 4 6 7 9 10 12\r\n', 'output': ['3']}, {'input': '63\r\n1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63\r\n', 'output': ['62']}, {'input': '3\r\n2 3 4\r\n', 'output': ['1']}]

[{'input': '6\r\n1 2 3 5 6 7\r\n', 'output': ['2']}, {'input': '2\r\n1 1000\r\n', 'output': ['0']}, {'input': '2\r\n998 999\r\n', 'output': ['0']}, {'input': '2\r\n3 4\r\n', 'output': ['0']}, {'input': '7\r\n1 2 3 4 6 7 8\r\n', 'output': ['3']}]

[{'input': '39\r\n1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39\r\n', 'output': ['38']}, {'input': '4\r\n2 3 4 5\r\n', 'output': ['2']}, {'input': '7\r\n2 4 6 997 998 999 1000\r\n', 'output': ['3']}, {'input': '7\r\n1 2 3 4 6 9 18\r\n', 'output': ['3']}, {'input': '42\r\n959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000\r\n', 'output': ['41']}]

[{'input': '7\r\n1 2 3 4 6 7 8\r\n', 'output': ['3']}, {'input': '7\r\n2 3 4 6 997 998 999\r\n', 'output': ['1']}, {'input': '45\r\n145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 333 334 831 832 978 979 980 981\r\n', 'output': ['35']}, {'input': '8\r\n1 2 5 6 7 8 9 11\r\n', 'output': ['3']}, {'input': '5\r\n1 2 3 4 800\r\n', 'output': ['3']}]

["3 6", "3 4"]

The only line contains two integers p and y (2 ≤ p ≤ y ≤ 109).

b533203f488fa4caf105f3f46dd5844d

p, y = [int(x) for x in input().split()] res = -1 for i in range(y, p, -1): flag = True for a in range(2, min(p+1, int(i**0.5)+1)): if i % a == 0: flag = False break if flag: res = i break print(res)

["5", "-1"]

Python

NoteIn the first sample case grasshopper from branch 2 reaches branches 2, 4 and 6 while branch 3 is initially settled by another grasshopper. Therefore the answer is 5.It immediately follows that there are no valid branches in second sample case.

Output the number of the highest suitable branch. If there are none, print -1 instead.

The weather is fine today and hence it's high time to climb the nearby pine and enjoy the landscape.The pine's trunk includes several branches, located one above another and numbered from 2 to y. Some of them (more precise, from 2 to p) are occupied by tiny vile grasshoppers which you're at war with. These grasshoppers are known for their awesome jumping skills: the grasshopper at branch x can jump to branches .Keeping this in mind, you wisely decided to choose such a branch that none of the grasshoppers could interrupt you. At the same time you wanna settle as high as possible since the view from up there is simply breathtaking.In other words, your goal is to find the highest branch that cannot be reached by any of the grasshoppers or report that it's impossible.

[{"input": "3 6\r\n", "output": ["5"]}, {"input": "3 4\r\n", "output": ["-1"]}, {"input": "2 2\r\n", "output": ["-1"]}, {"input": "5 50\r\n", "output": ["49"]}, {"input": "944192806 944193066\r\n", "output": ["944192807"]}, {"input": "1000000000 1000000000\r\n", "output": ["-1"]}, {"input": "2 1000000000\r\n", "output": ["999999999"]}, {"input": "28788 944193066\r\n", "output": ["944192833"]}, {"input": "49 52\r\n", "output": ["-1"]}, {"input": "698964997 734575900\r\n", "output": ["734575871"]}, {"input": "287894773 723316271\r\n", "output": ["723316207"]}, {"input": "171837140 733094070\r\n", "output": ["733094069"]}, {"input": "37839169 350746807\r\n", "output": ["350746727"]}, {"input": "125764821 234689174\r\n", "output": ["234689137"]}, {"input": "413598841 430509920\r\n", "output": ["430509917"]}, {"input": "145320418 592508508\r\n", "output": ["592508479"]}, {"input": "155098216 476450875\r\n", "output": ["476450861"]}, {"input": "459843315 950327842\r\n", "output": ["950327831"]}, {"input": "469621113 834270209\r\n", "output": ["834270209"]}, {"input": "13179877 557546766\r\n", "output": ["557546753"]}, {"input": "541748242 723508350\r\n", "output": ["723508301"]}, {"input": "607450717 924641194\r\n", "output": ["924641189"]}, {"input": "786360384 934418993\r\n", "output": ["934418981"]}, {"input": "649229491 965270051\r\n", "output": ["965270051"]}, {"input": "144179719 953974590\r\n", "output": ["953974583"]}, {"input": "28122086 963752388\r\n", "output": ["963752347"]}, {"input": "268497487 501999053\r\n", "output": ["501999053"]}, {"input": "356423140 385941420\r\n", "output": ["385941419"]}, {"input": "71233638 269883787\r\n", "output": ["269883787"]}, {"input": "2601 698964997\r\n", "output": ["698964983"]}, {"input": "4096 287894773\r\n", "output": ["287894771"]}, {"input": "5675 171837140\r\n", "output": ["171837131"]}, {"input": "13067 350746807\r\n", "output": ["350746727"]}, {"input": "8699 234689174\r\n", "output": ["234689137"]}, {"input": "12190 413598841\r\n", "output": ["413598817"]}, {"input": "20555 592508508\r\n", "output": ["592508479"]}, {"input": "19137 476450875\r\n", "output": ["476450861"]}, {"input": "8793 950327842\r\n", "output": ["950327831"]}, {"input": "1541 834270209\r\n", "output": ["834270209"]}, {"input": "1082 13179877\r\n", "output": ["13179871"]}, {"input": "3888 723508350\r\n", "output": ["723508301"]}, {"input": "14078 607450717\r\n", "output": ["607450703"]}, {"input": "20869 786360384\r\n", "output": ["786360373"]}, {"input": "13689 965270051\r\n", "output": ["965270051"]}, {"input": "782 144179719\r\n", "output": ["144179719"]}, {"input": "404 28122086\r\n", "output": ["28122079"]}, {"input": "21992 501999053\r\n", "output": ["501999053"]}, {"input": "13745 385941420\r\n", "output": ["385941419"]}, {"input": "8711 269883787\r\n", "output": ["269883787"]}, {"input": "31333 981756889\r\n", "output": ["981756871"]}, {"input": "944192808 944193061\r\n", "output": ["-1"]}, {"input": "3 9\r\n", "output": ["7"]}, {"input": "4 5\r\n", "output": ["5"]}, {"input": "2 13\r\n", "output": ["13"]}, {"input": "7 53\r\n", "output": ["53"]}, {"input": "10 1000000000\r\n", "output": ["999999997"]}, {"input": "2 7\r\n", "output": ["7"]}, {"input": "4 9\r\n", "output": ["7"]}]

[{'input': '1541 834270209\r\n', 'output': ['834270209']}, {'input': '8793 950327842\r\n', 'output': ['950327831']}, {'input': '171837140 733094070\r\n', 'output': ['733094069']}, {'input': '649229491 965270051\r\n', 'output': ['965270051']}, {'input': '4 5\r\n', 'output': ['5']}]

[{'input': '404 28122086\r\n', 'output': ['28122079']}, {'input': '31333 981756889\r\n', 'output': ['981756871']}, {'input': '19137 476450875\r\n', 'output': ['476450861']}, {'input': '287894773 723316271\r\n', 'output': ['723316207']}, {'input': '5 50\r\n', 'output': ['49']}]

[{'input': '649229491 965270051\r\n', 'output': ['965270051']}, {'input': '404 28122086\r\n', 'output': ['28122079']}, {'input': '356423140 385941420\r\n', 'output': ['385941419']}, {'input': '20869 786360384\r\n', 'output': ['786360373']}, {'input': '3888 723508350\r\n', 'output': ['723508301']}]

[{'input': '3 4\r\n', 'output': ['-1']}, {'input': '14078 607450717\r\n', 'output': ['607450703']}, {'input': '37839169 350746807\r\n', 'output': ['350746727']}, {'input': '13067 350746807\r\n', 'output': ['350746727']}, {'input': '8699 234689174\r\n', 'output': ['234689137']}]

[{'input': '944192806 944193066\r\n', 'output': ['944192807']}, {'input': '2 7\r\n', 'output': ['7']}, {'input': '19137 476450875\r\n', 'output': ['476450861']}, {'input': '20869 786360384\r\n', 'output': ['786360373']}, {'input': '469621113 834270209\r\n', 'output': ['834270209']}]

["monday\ntuesday", "sunday\nsunday", "saturday\ntuesday"]

The input consists of two lines, each of them containing the name of exactly one day of the week. It's guaranteed that each string in the input is from the set "monday", "tuesday", "wednesday", "thursday", "friday", "saturday", "sunday".

2a75f68a7374b90b80bb362c6ead9a35

s1=input() s2=input() week=["monday", "tuesday", "wednesday", "thursday", "friday", "saturday", "sunday"] if week[(week.index(s1)+31)%7]==s2:print("YES") elif week[(week.index(s1)+28)%7]==s2:print("YES") elif week[(week.index(s1)+30)%7]==s2:print("YES") else:print("NO")

["NO", "YES", "YES"]

Python

NoteIn the second sample, one can consider February 1 and March 1 of year 2015. Both these days were Sundays.In the third sample, one can consider July 1 and August 1 of year 2017. First of these two days is Saturday, while the second one is Tuesday.

Print "YES" (without quotes) if such situation is possible during some non-leap year. Otherwise, print "NO" (without quotes).

You are given names of two days of the week.Please, determine whether it is possible that during some non-leap year the first day of some month was equal to the first day of the week you are given, while the first day of the next month was equal to the second day of the week you are given. Both months should belong to one year.In this problem, we consider the Gregorian calendar to be used. The number of months in this calendar is equal to 12. The number of days in months during any non-leap year is: 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31.Names of the days of the week are given with lowercase English letters: "monday", "tuesday", "wednesday", "thursday", "friday", "saturday", "sunday".

[{"input": "monday\r\ntuesday\r\n", "output": ["NO"]}, {"input": "sunday\r\nsunday\r\n", "output": ["YES"]}, {"input": "saturday\r\ntuesday\r\n", "output": ["YES"]}, {"input": "tuesday\r\nthursday\r\n", "output": ["YES"]}, {"input": "friday\r\nwednesday\r\n", "output": ["NO"]}, {"input": "sunday\r\nsaturday\r\n", "output": ["NO"]}, {"input": "monday\r\nmonday\r\n", "output": ["YES"]}, {"input": "monday\r\nwednesday\r\n", "output": ["YES"]}, {"input": "monday\r\nthursday\r\n", "output": ["YES"]}, {"input": "monday\r\nfriday\r\n", "output": ["NO"]}, {"input": "monday\r\nsaturday\r\n", "output": ["NO"]}, {"input": "monday\r\nsunday\r\n", "output": ["NO"]}, {"input": "tuesday\r\nmonday\r\n", "output": ["NO"]}, {"input": "tuesday\r\ntuesday\r\n", "output": ["YES"]}, {"input": "tuesday\r\nwednesday\r\n", "output": ["NO"]}, {"input": "tuesday\r\nfriday\r\n", "output": ["YES"]}, {"input": "tuesday\r\nsaturday\r\n", "output": ["NO"]}, {"input": "tuesday\r\nsunday\r\n", "output": ["NO"]}, {"input": "wednesday\r\nmonday\r\n", "output": ["NO"]}, {"input": "wednesday\r\ntuesday\r\n", "output": ["NO"]}, {"input": "wednesday\r\nwednesday\r\n", "output": ["YES"]}, {"input": "wednesday\r\nthursday\r\n", "output": ["NO"]}, {"input": "wednesday\r\nfriday\r\n", "output": ["YES"]}, {"input": "wednesday\r\nsaturday\r\n", "output": ["YES"]}, {"input": "wednesday\r\nsunday\r\n", "output": ["NO"]}, {"input": "thursday\r\nmonday\r\n", "output": ["NO"]}, {"input": "thursday\r\ntuesday\r\n", "output": ["NO"]}, {"input": "thursday\r\nwednesday\r\n", "output": ["NO"]}, {"input": "thursday\r\nthursday\r\n", "output": ["YES"]}, {"input": "thursday\r\nfriday\r\n", "output": ["NO"]}, {"input": "thursday\r\nsaturday\r\n", "output": ["YES"]}, {"input": "thursday\r\nsunday\r\n", "output": ["YES"]}, {"input": "friday\r\nmonday\r\n", "output": ["YES"]}, {"input": "friday\r\ntuesday\r\n", "output": ["NO"]}, {"input": "friday\r\nthursday\r\n", "output": ["NO"]}, {"input": "friday\r\nsaturday\r\n", "output": ["NO"]}, {"input": "friday\r\nsunday\r\n", "output": ["YES"]}, {"input": "saturday\r\nmonday\r\n", "output": ["YES"]}, {"input": "saturday\r\nwednesday\r\n", "output": ["NO"]}, {"input": "saturday\r\nthursday\r\n", "output": ["NO"]}, {"input": "saturday\r\nfriday\r\n", "output": ["NO"]}, {"input": "saturday\r\nsaturday\r\n", "output": ["YES"]}, {"input": "saturday\r\nsunday\r\n", "output": ["NO"]}, {"input": "sunday\r\nmonday\r\n", "output": ["NO"]}, {"input": "sunday\r\ntuesday\r\n", "output": ["YES"]}, {"input": "sunday\r\nwednesday\r\n", "output": ["YES"]}, {"input": "sunday\r\nthursday\r\n", "output": ["NO"]}, {"input": "sunday\r\nfriday\r\n", "output": ["NO"]}, {"input": "friday\r\nfriday\r\n", "output": ["YES"]}]

[{'input': 'friday\r\nthursday\r\n', 'output': ['NO']}, {'input': 'tuesday\r\nwednesday\r\n', 'output': ['NO']}, {'input': 'thursday\r\nmonday\r\n', 'output': ['NO']}, {'input': 'wednesday\r\nmonday\r\n', 'output': ['NO']}, {'input': 'tuesday\r\nsaturday\r\n', 'output': ['NO']}]

[{'input': 'monday\r\nsaturday\r\n', 'output': ['NO']}, {'input': 'tuesday\r\nmonday\r\n', 'output': ['NO']}, {'input': 'friday\r\nmonday\r\n', 'output': ['YES']}, {'input': 'monday\r\nsunday\r\n', 'output': ['NO']}, {'input': 'wednesday\r\nmonday\r\n', 'output': ['NO']}]

[{'input': 'friday\r\nwednesday\r\n', 'output': ['NO']}, {'input': 'saturday\r\nsunday\r\n', 'output': ['NO']}, {'input': 'thursday\r\ntuesday\r\n', 'output': ['NO']}, {'input': 'saturday\r\nmonday\r\n', 'output': ['YES']}, {'input': 'wednesday\r\ntuesday\r\n', 'output': ['NO']}]

[{'input': 'thursday\r\nthursday\r\n', 'output': ['YES']}, {'input': 'tuesday\r\ntuesday\r\n', 'output': ['YES']}, {'input': 'friday\r\nsunday\r\n', 'output': ['YES']}, {'input': 'wednesday\r\nmonday\r\n', 'output': ['NO']}, {'input': 'sunday\r\nfriday\r\n', 'output': ['NO']}]

[{'input': 'friday\r\nfriday\r\n', 'output': ['YES']}, {'input': 'tuesday\r\nwednesday\r\n', 'output': ['NO']}, {'input': 'monday\r\nsunday\r\n', 'output': ['NO']}, {'input': 'thursday\r\nwednesday\r\n', 'output': ['NO']}, {'input': 'wednesday\r\nsunday\r\n', 'output': ['NO']}]

["X0X\n.0.\n.X."]

The input consists of three lines, each of the lines contains characters ".", "X" or "0" (a period, a capital letter X, or a digit zero).

892680e26369325fb00d15543a96192c

def win(l,s): if l[0] == [s, s, s] or l[1] == [s, s, s] or l[2] == [s, s, s] or l[0][0] == s and l[1][0] == s and l[2][0] == s or \ l[0][1] == s and l[1][1] == s and l[2][1] == s or l[0][2] == s and l[1][2] == s and l[2][2] == s or l[0][ 0] == s and l[1][1] == s and l[2][2] == s or l[0][2] == s and l[1][1] == s and l[2][0] == s: return 1 else: return 0 a=list(input()) b=list(input()) c=list(input()) l=[a,b,c] mf=a.count('X')+b.count('X')+c.count('X') ms=a.count('0')+b.count('0')+c.count('0') me=a.count('.')+b.count('.')+c.count('.') if mf -ms!= 1 and mf -ms!=0 : print('illegal') else: n=win(l,'0') m=win(l,'X') if n==1 and m==1 or n==1 and mf-ms!=0 or m==1 and mf-ms!=1: print('illegal') elif n==1: print('the second player won') elif m==1: print('the first player won') else: if me==0: print('draw') elif mf-ms==1: print('second') else:print('first')

["second"]

Python

Print one of the six verdicts: first, second, illegal, the first player won, the second player won or draw.

Certainly, everyone is familiar with tic-tac-toe game. The rules are very simple indeed. Two players take turns marking the cells in a 3 × 3 grid (one player always draws crosses, the other — noughts). The player who succeeds first in placing three of his marks in a horizontal, vertical or diagonal line wins, and the game is finished. The player who draws crosses goes first. If the grid is filled, but neither Xs, nor 0s form the required line, a draw is announced.You are given a 3 × 3 grid, each grid cell is empty, or occupied by a cross or a nought. You have to find the player (first or second), whose turn is next, or print one of the verdicts below: illegal — if the given board layout can't appear during a valid game; the first player won — if in the given board layout the first player has just won; the second player won — if in the given board layout the second player has just won; draw — if the given board layout has just let to a draw.

[{"input": "X0X\r\n.0.\r\n.X.\r\n", "output": ["second"]}, {"input": "0.X\r\nXX.\r\n000\r\n", "output": ["illegal"]}, {"input": "XXX\r\n.0.\r\n000\r\n", "output": ["illegal"]}, {"input": "XXX\r\n...\r\n000\r\n", "output": ["illegal"]}, {"input": "X.X\r\nX..\r\n00.\r\n", "output": ["second"]}, {"input": "X.X\r\nX.0\r\n0.0\r\n", "output": ["first"]}, {"input": "0..\r\n...\r\n...\r\n", "output": ["illegal"]}, {"input": "XXX\r\nX00\r\nX00\r\n", "output": ["the first player won"]}, {"input": "000\r\nX.X\r\nX.X\r\n", "output": ["illegal"]}, {"input": "XXX\r\n0.0\r\n0..\r\n", "output": ["illegal"]}, {"input": "X0X\r\n0X0\r\nX0X\r\n", "output": ["the first player won"]}, {"input": "XX.\r\nX0X\r\nX..\r\n", "output": ["illegal"]}, {"input": "X0X\r\n0X0\r\nX..\r\n", "output": ["the first player won"]}, {"input": "XX0\r\n0..\r\n000\r\n", "output": ["illegal"]}, {"input": "XXX\r\n0..\r\n.0.\r\n", "output": ["the first player won"]}, {"input": "XXX\r\nX..\r\n.00\r\n", "output": ["illegal"]}, {"input": "X00\r\n0.0\r\nXX0\r\n", "output": ["illegal"]}, {"input": "0.0\r\n0XX\r\n..0\r\n", "output": ["illegal"]}, {"input": ".00\r\nX.X\r\n0..\r\n", "output": ["illegal"]}, {"input": "..0\r\n.00\r\n.0X\r\n", "output": ["illegal"]}, {"input": "..0\r\n0..\r\n00X\r\n", "output": ["illegal"]}, {"input": "..0\r\n.XX\r\nX..\r\n", "output": ["illegal"]}, {"input": "0.X\r\n0X0\r\n.00\r\n", "output": ["illegal"]}, {"input": "..X\r\n0X0\r\n0X.\r\n", "output": ["first"]}, {"input": "0X0\r\nX..\r\nX.0\r\n", "output": ["first"]}, {"input": ".0.\r\nX.X\r\n0..\r\n", "output": ["first"]}, {"input": "0X0\r\n00X\r\n.00\r\n", "output": ["illegal"]}, {"input": ".0.\r\n.X0\r\nX..\r\n", "output": ["first"]}, {"input": "00X\r\n0.X\r\n00X\r\n", "output": ["illegal"]}, {"input": "00X\r\n0XX\r\n0X.\r\n", "output": ["the second player won"]}, {"input": "X00\r\n..0\r\nX.X\r\n", "output": ["first"]}, {"input": "X00\r\nX00\r\n.X0\r\n", "output": ["illegal"]}, {"input": "X0X\r\n.X0\r\n0..\r\n", "output": ["first"]}, {"input": "..0\r\nXXX\r\n000\r\n", "output": ["illegal"]}, {"input": "XXX\r\n...\r\n.0.\r\n", "output": ["illegal"]}, {"input": "0..\r\n000\r\nX0X\r\n", "output": ["illegal"]}, {"input": ".00\r\n0X.\r\n0.0\r\n", "output": ["illegal"]}, {"input": "X..\r\nX00\r\n0.0\r\n", "output": ["illegal"]}, {"input": ".X0\r\nXX0\r\nX.X\r\n", "output": ["illegal"]}, {"input": "X.X\r\n0.0\r\nX..\r\n", "output": ["second"]}, {"input": "00X\r\n.00\r\n..0\r\n", "output": ["illegal"]}, {"input": "..0\r\n0.X\r\n00.\r\n", "output": ["illegal"]}, {"input": "0.X\r\nX0X\r\n.X0\r\n", "output": ["illegal"]}, {"input": "0X.\r\n.X.\r\n0X0\r\n", "output": ["illegal"]}, {"input": "00.\r\nX0.\r\n..X\r\n", "output": ["illegal"]}, {"input": "..X\r\n.00\r\nXX.\r\n", "output": ["second"]}, {"input": ".00\r\n.0.\r\n.X.\r\n", "output": ["illegal"]}, {"input": "XX0\r\nX.0\r\nXX0\r\n", "output": ["illegal"]}, {"input": "00.\r\n00.\r\nX.X\r\n", "output": ["illegal"]}, {"input": "X00\r\nX.0\r\nX.0\r\n", "output": ["illegal"]}, {"input": "0X.\r\n0XX\r\n000\r\n", "output": ["illegal"]}, {"input": "00.\r\n00.\r\n.X.\r\n", "output": ["illegal"]}, {"input": "X0X\r\n00.\r\n0.X\r\n", "output": ["illegal"]}, {"input": "XX0\r\nXXX\r\n0X0\r\n", "output": ["illegal"]}, {"input": "XX0\r\n..X\r\nXX0\r\n", "output": ["illegal"]}, {"input": "0X.\r\n..X\r\nX..\r\n", "output": ["illegal"]}, {"input": "...\r\nX0.\r\nXX0\r\n", "output": ["second"]}, {"input": "..X\r\n.0.\r\n0..\r\n", "output": ["illegal"]}, {"input": "00X\r\nXX.\r\n00X\r\n", "output": ["first"]}, {"input": "..0\r\nXX0\r\n..X\r\n", "output": ["second"]}, {"input": ".0.\r\n.00\r\nX00\r\n", "output": ["illegal"]}, {"input": "X00\r\n.XX\r\n00.\r\n", "output": ["illegal"]}, {"input": ".00\r\n0.X\r\n000\r\n", "output": ["illegal"]}, {"input": "X0.\r\n..0\r\nX.0\r\n", "output": ["illegal"]}, {"input": "X0X\r\n.XX\r\n00.\r\n", "output": ["second"]}, {"input": "0X.\r\n00.\r\n.X.\r\n", "output": ["illegal"]}, {"input": "0..\r\n000\r\n...\r\n", "output": ["illegal"]}, {"input": ".0.\r\n...\r\n0.0\r\n", "output": ["illegal"]}, {"input": "..X\r\nX00\r\n0.0\r\n", "output": ["illegal"]}, {"input": "0XX\r\n...\r\nX0.\r\n", "output": ["second"]}, {"input": "X.X\r\n0X.\r\n.0X\r\n", "output": ["illegal"]}, {"input": "XX0\r\nX.X\r\n00.\r\n", "output": ["second"]}, {"input": ".0X\r\n.00\r\n00.\r\n", "output": ["illegal"]}, {"input": ".XX\r\nXXX\r\n0..\r\n", "output": ["illegal"]}, {"input": "XX0\r\n.X0\r\n.0.\r\n", "output": ["first"]}, {"input": "X00\r\n0.X\r\nX..\r\n", "output": ["first"]}, {"input": "X..\r\n.X0\r\nX0.\r\n", "output": ["second"]}, {"input": ".0X\r\nX..\r\nXXX\r\n", "output": ["illegal"]}, {"input": "X0X\r\nXXX\r\nX.X\r\n", "output": ["illegal"]}, {"input": ".00\r\nX0.\r\n00X\r\n", "output": ["illegal"]}, {"input": "0XX\r\n.X0\r\n0.0\r\n", "output": ["illegal"]}, {"input": "00X\r\nXXX\r\n..0\r\n", "output": ["the first player won"]}, {"input": "X0X\r\n...\r\n.X.\r\n", "output": ["illegal"]}, {"input": ".X0\r\n...\r\n0X.\r\n", "output": ["first"]}, {"input": "X..\r\n0X0\r\nX.0\r\n", "output": ["first"]}, {"input": "..0\r\n.00\r\nX.0\r\n", "output": ["illegal"]}, {"input": ".XX\r\n.0.\r\nX0X\r\n", "output": ["illegal"]}, {"input": "00.\r\n0XX\r\n..0\r\n", "output": ["illegal"]}, {"input": ".0.\r\n00.\r\n00.\r\n", "output": ["illegal"]}, {"input": "00.\r\n000\r\nX.X\r\n", "output": ["illegal"]}, {"input": "0X0\r\n.X0\r\n.X.\r\n", "output": ["illegal"]}, {"input": "00X\r\n0..\r\n0..\r\n", "output": ["illegal"]}, {"input": ".X.\r\n.X0\r\nX.0\r\n", "output": ["second"]}, {"input": ".0.\r\n0X0\r\nX0X\r\n", "output": ["illegal"]}, {"input": "...\r\nX.0\r\n0..\r\n", "output": ["illegal"]}, {"input": "..0\r\nXX.\r\n00X\r\n", "output": ["first"]}, {"input": "0.X\r\n.0X\r\nX00\r\n", "output": ["illegal"]}, {"input": "..X\r\n0X.\r\n.0.\r\n", "output": ["first"]}, {"input": "..X\r\nX.0\r\n.0X\r\n", "output": ["second"]}, {"input": "X0.\r\n.0X\r\nX0X\r\n", "output": ["illegal"]}, {"input": "...\r\n.0.\r\n.X0\r\n", "output": ["illegal"]}, {"input": ".X0\r\nXX0\r\n0..\r\n", "output": ["first"]}, {"input": "0X.\r\n...\r\nX..\r\n", "output": ["second"]}, {"input": ".0.\r\n0.0\r\n0.X\r\n", "output": ["illegal"]}, {"input": "XX.\r\n.X0\r\n.0X\r\n", "output": ["illegal"]}, {"input": ".0.\r\nX0X\r\nX00\r\n", "output": ["illegal"]}, {"input": "0X.\r\n.X0\r\nX..\r\n", "output": ["second"]}, {"input": "..0\r\n0X.\r\n000\r\n", "output": ["illegal"]}, {"input": "0.0\r\nX.X\r\nXX.\r\n", "output": ["illegal"]}, {"input": ".X.\r\n.XX\r\nX0.\r\n", "output": ["illegal"]}, {"input": "X.X\r\n.XX\r\n0X.\r\n", "output": ["illegal"]}, {"input": "...\r\n.X.\r\n...\r\n", "output": ["second"]}, {"input": "..0\r\n.X.\r\n...\r\n", "output": ["first"]}, {"input": "..0\r\n.XX\r\n...\r\n", "output": ["second"]}, {"input": "..0\r\n0XX\r\n...\r\n", "output": ["first"]}, {"input": "X.0\r\n0XX\r\n...\r\n", "output": ["second"]}, {"input": "X.0\r\n0XX\r\n..0\r\n", "output": ["first"]}, {"input": "X.0\r\n0XX\r\n.X0\r\n", "output": ["second"]}, {"input": "X00\r\n0XX\r\n.X0\r\n", "output": ["first"]}, {"input": "X00\r\n0XX\r\nXX0\r\n", "output": ["draw"]}, {"input": "X00\r\n0XX\r\n0X0\r\n", "output": ["illegal"]}, {"input": "XXX\r\nXXX\r\nXXX\r\n", "output": ["illegal"]}, {"input": "000\r\n000\r\n000\r\n", "output": ["illegal"]}, {"input": "XX0\r\n00X\r\nXX0\r\n", "output": ["draw"]}, {"input": "X00\r\n00X\r\nXX0\r\n", "output": ["illegal"]}, {"input": "X.0\r\n00.\r\nXXX\r\n", "output": ["the first player won"]}, {"input": "X..\r\nX0.\r\nX0.\r\n", "output": ["the first player won"]}, {"input": ".XX\r\n000\r\nXX0\r\n", "output": ["the second player won"]}, {"input": "X0.\r\nX.X\r\nX00\r\n", "output": ["the first player won"]}, {"input": "00X\r\nX00\r\nXXX\r\n", "output": ["the first player won"]}, {"input": "XXX\r\n.00\r\nX0.\r\n", "output": ["the first player won"]}, {"input": "XX0\r\n000\r\nXX.\r\n", "output": ["the second player won"]}, {"input": ".X0\r\n0.0\r\nXXX\r\n", "output": ["the first player won"]}, {"input": "0XX\r\nX00\r\n0XX\r\n", "output": ["draw"]}, {"input": "0XX\r\nX0X\r\n00X\r\n", "output": ["the first player won"]}, {"input": "XX0\r\n0XX\r\n0X0\r\n", "output": ["the first player won"]}, {"input": "0X0\r\nX0X\r\nX0X\r\n", "output": ["draw"]}, {"input": "XXX\r\n0.0\r\n...\r\n", "output": ["the first player won"]}, {"input": "X0X\r\n0XX\r\n00X\r\n", "output": ["the first player won"]}, {"input": "0XX\r\nX0.\r\nX00\r\n", "output": ["the second player won"]}, {"input": "X.0\r\n0X0\r\nXX0\r\n", "output": ["the second player won"]}, {"input": "X0X\r\nX0X\r\n0X0\r\n", "output": ["draw"]}, {"input": "X.0\r\n00X\r\n0XX\r\n", "output": ["the second player won"]}, {"input": "00X\r\nX0X\r\n.X0\r\n", "output": ["the second player won"]}, {"input": "X0X\r\n.00\r\nX0X\r\n", "output": ["the second player won"]}, {"input": "0XX\r\nX00\r\nX0X\r\n", "output": ["draw"]}, {"input": "000\r\nX0X\r\n.XX\r\n", "output": ["the second player won"]}, {"input": "0.0\r\n0.X\r\nXXX\r\n", "output": ["the first player won"]}, {"input": "X.0\r\nX0.\r\n0X.\r\n", "output": ["the second player won"]}, {"input": "X0X\r\n0X0\r\n..X\r\n", "output": ["the first player won"]}, {"input": "0X0\r\nXX0\r\n.X.\r\n", "output": ["the first player won"]}, {"input": "X0.\r\n.X.\r\n0.X\r\n", "output": ["the first player won"]}, {"input": "0XX\r\nX00\r\n.X0\r\n", "output": ["the second player won"]}, {"input": "0.0\r\nXXX\r\n0.X\r\n", "output": ["the first player won"]}, {"input": ".0X\r\n.X.\r\nX.0\r\n", "output": ["the first player won"]}, {"input": "XXX\r\nX.0\r\n0.0\r\n", "output": ["the first player won"]}, {"input": "XX0\r\nX..\r\nX00\r\n", "output": ["the first player won"]}, {"input": "XXX\r\n00X\r\n00X\r\n", "output": ["the first player won"]}, {"input": "X00\r\n00X\r\nXXX\r\n", "output": ["the first player won"]}, {"input": "0X0\r\nX0X\r\n0X.\r\n", "output": ["the second player won"]}, {"input": "XX0\r\nX00\r\n0X.\r\n", "output": ["the second player won"]}, {"input": "..X\r\n0X0\r\nX..\r\n", "output": ["the first player won"]}, {"input": "X0.\r\n00.\r\nXXX\r\n", "output": ["the first player won"]}, {"input": "0.X\r\nX00\r\nXX0\r\n", "output": ["the second player won"]}, {"input": "X0.\r\n0X.\r\n..X\r\n", "output": ["the first player won"]}, {"input": "00X\r\nX0.\r\nXX0\r\n", "output": ["the second player won"]}, {"input": "XX.\r\n000\r\n0XX\r\n", "output": ["the second player won"]}, {"input": "..X\r\n0.X\r\n.0X\r\n", "output": ["the first player won"]}, {"input": "X00\r\n.0X\r\n0XX\r\n", "output": ["the second player won"]}, {"input": "00X\r\n0X.\r\nXX.\r\n", "output": ["the first player won"]}, {"input": "X00\r\nXX.\r\n0.X\r\n", "output": ["the first player won"]}, {"input": "XXX\r\n00X\r\n0X0\r\n", "output": ["the first player won"]}, {"input": "X00\r\nXX0\r\n0XX\r\n", "output": ["the first player won"]}, {"input": "0X0\r\nX00\r\nXXX\r\n", "output": ["the first player won"]}, {"input": "XX0\r\nX00\r\n.X0\r\n", "output": ["the second player won"]}]

[{'input': 'X.0\r\n00.\r\nXXX\r\n', 'output': ['the first player won']}, {'input': 'X0.\r\n00.\r\nXXX\r\n', 'output': ['the first player won']}, {'input': '.0X\r\n.00\r\n00.\r\n', 'output': ['illegal']}, {'input': '..X\r\n0X.\r\n.0.\r\n', 'output': ['first']}, {'input': '00.\r\nX0.\r\n..X\r\n', 'output': ['illegal']}]

[{'input': '0..\r\n000\r\n...\r\n', 'output': ['illegal']}, {'input': '.0.\r\n00.\r\n00.\r\n', 'output': ['illegal']}, {'input': '0X0\r\nX00\r\nXXX\r\n', 'output': ['the first player won']}, {'input': 'X00\r\n0.X\r\nX..\r\n', 'output': ['first']}, {'input': '0X.\r\n.X.\r\n0X0\r\n', 'output': ['illegal']}]

[{'input': '0X0\r\nX..\r\nX.0\r\n', 'output': ['first']}, {'input': '.0X\r\n.X.\r\nX.0\r\n', 'output': ['the first player won']}, {'input': '.0.\r\n.X0\r\nX..\r\n', 'output': ['first']}, {'input': 'X.X\r\nX.0\r\n0.0\r\n', 'output': ['first']}, {'input': '.0.\r\n.00\r\nX00\r\n', 'output': ['illegal']}]

[{'input': 'X..\r\n.X0\r\nX0.\r\n', 'output': ['second']}, {'input': '.00\r\nX0.\r\n00X\r\n', 'output': ['illegal']}, {'input': '...\r\n.X.\r\n...\r\n', 'output': ['second']}, {'input': 'XXX\r\n0.0\r\n0..\r\n', 'output': ['illegal']}, {'input': '0.0\r\n0.X\r\nXXX\r\n', 'output': ['the first player won']}]

[{'input': '000\r\nX.X\r\nX.X\r\n', 'output': ['illegal']}, {'input': 'X00\r\n00X\r\nXXX\r\n', 'output': ['the first player won']}, {'input': '000\r\n000\r\n000\r\n', 'output': ['illegal']}, {'input': 'XX0\r\n0..\r\n000\r\n', 'output': ['illegal']}, {'input': '..0\r\nXX.\r\n00X\r\n', 'output': ['first']}]

["10\nrocesfedoc", "16\nplmaetwoxesisiht", "1\nz"]

The first line of input consists of a single integer $$$n$$$ ($$$1 \le n \le 100$$$) — the length of the string $$$t$$$. The second line of input consists of the string $$$t$$$. The length of $$$t$$$ is $$$n$$$, and it consists only of lowercase Latin letters.

1b0b2ee44c63cb0634cb63f2ad65cdd3

a = int(input()) s = list(input()) b = [] for i in range(a, 1, -1): if a % i == 0: b.append(i) for i in range(len(b)-1, -1, -1): s[0:b[i]] = reversed(s[0:b[i]]) s = "".join(s) print(s)

["codeforces", "thisisexampletwo", "z"]

Python

NoteThe first example is described in the problem statement.

Print a string $$$s$$$ such that the above algorithm results in $$$t$$$.

A string $$$s$$$ of length $$$n$$$ can be encrypted by the following algorithm: iterate over all divisors of $$$n$$$ in decreasing order (i.e. from $$$n$$$ to $$$1$$$), for each divisor $$$d$$$, reverse the substring $$$s[1 \dots d]$$$ (i.e. the substring which starts at position $$$1$$$ and ends at position $$$d$$$). For example, the above algorithm applied to the string $$$s$$$="codeforces" leads to the following changes: "codeforces" $$$\to$$$ "secrofedoc" $$$\to$$$ "orcesfedoc" $$$\to$$$ "rocesfedoc" $$$\to$$$ "rocesfedoc" (obviously, the last reverse operation doesn't change the string because $$$d=1$$$).You are given the encrypted string $$$t$$$. Your task is to decrypt this string, i.e., to find a string $$$s$$$ such that the above algorithm results in string $$$t$$$. It can be proven that this string $$$s$$$ always exists and is unique.

[{"input": "10\r\nrocesfedoc\r\n", "output": ["codeforces"]}, {"input": "16\r\nplmaetwoxesisiht\r\n", "output": ["thisisexampletwo"]}, {"input": "1\r\nz\r\n", "output": ["z"]}, {"input": "2\r\nir\r\n", "output": ["ri"]}, {"input": "3\r\nilj\r\n", "output": ["jli"]}, {"input": "4\r\njfyy\r\n", "output": ["yyjf"]}, {"input": "6\r\nkrdych\r\n", "output": ["hcyrkd"]}, {"input": "60\r\nfnebsopcvmlaoecpzmakqigyuutueuozjxutlwwiochekmhjgwxsgfbcrpqj\r\n", "output": ["jqprcbfgsxwgjhmkehcoiwwltuxjzokamzpalobnfespcvmoecqigyuutueu"]}, {"input": "64\r\nhnlzzhrvqnldswxfsrowfhmyzbxtyoxhogudasgywxycyhzgiseerbislcncvnwy\r\n", "output": ["ywnvcnclsibreesigzhycyxwygsadugofxwsdlnqzlhnzhrvsrowfhmyzbxtyoxh"]}, {"input": "97\r\nqnqrmdhmbubaijtwsecbidqouhlecladwgwcuxbigckrfzasnbfbslukoayhcgquuacygakhxoubibxtqkpyyhzjipylujgrc\r\n", "output": ["crgjulypijzhyypkqtxbibuoxhkagycauuqgchyaokulsbfbnsazfrkcgibxucwgwdalcelhuoqdibceswtjiabubmhdmrqnq"]}, {"input": "100\r\nedykhvzcntljuuoqghptioetqnfllwekzohiuaxelgecabvsbibgqodqxvyfkbyjwtgbyhvssntinkwsinwsmalusiwnjmtcoovf\r\n", "output": ["fvooctmjnwisulamswniswknitnssvhybgtwjybkfyvxqdoqgbqteoitnczvkyedhljuuoqghptnfllwekzohiuaxelgecabvsbi"]}, {"input": "96\r\nqtbcksuvxonzbkokhqlgkrvimzqmqnrvqlihrmksldyydacbtckfphenxszcnzhfjmpeykrvshgiboivkvabhrpphgavvprz\r\n", "output": ["zrpvvaghpprhbavkviobighsvrkyepmjfhznczsxnehpfkctvrnqmqzmkokbvuctqbksxonzhqlgkrviqlihrmksldyydacb"]}, {"input": "90\r\nmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmm\r\n", "output": ["mmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmm"]}, {"input": "89\r\nwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwww\r\n", "output": ["wwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwww"]}, {"input": "99\r\nqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqq\r\n", "output": ["qqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqq"]}, {"input": "100\r\noooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooo\r\n", "output": ["oooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooo"]}, {"input": "60\r\nwwwwwxwwwwwwfhwwhwwwwwwawwwwwwwwwwwwwnwwwwwwwwwwwwwwwwwwwwww\r\n", "output": ["wwwwwwwwwwwwwwwwwwwwwwnwwwwwwwwwwhwwwxwwwwwwwwwfhwwwwawwwwww"]}, {"input": "90\r\ncccchccccccccccccccccccccccccccwcccccccccgcccccchccccccccccccccccccccccxccccccncccccccuccc\r\n", "output": ["cccucccccccnccccccxcccccccccccccccccccccchccccccccccccccccccccccchccccccccccwcccccccccgccc"]}, {"input": "97\r\nfwffffffffffffffffffffffffrffffffffffffffzfffffffffffffffftfcfffffffqffffffffffffffffffffffyfffff\r\n", "output": ["fffffyffffffffffffffffffffffqfffffffcftffffffffffffffffzffffffffffffffrffffffffffffffffffffffffwf"]}, {"input": "100\r\ndjjjjjjjjjjgjjjjjjjjjjjjjjsvjjjjjjjjjjmjjjjjjjjjjjjjajjjjjjajjjjjjrjjjjjjjjjjjjrjjtjjjjjjjjjjjjjojjj\r\n", "output": ["jjjojjjjjjjjjjjjjtjjrjjjjjjjjjjjjrjjjjjjajjjjjjajjjjjjjjjjjjjjdjjjgjjjjjjjjjsvjjjjjjjjjjmjjjjjjjjjjj"]}]

[{'input': '96\r\nqtbcksuvxonzbkokhqlgkrvimzqmqnrvqlihrmksldyydacbtckfphenxszcnzhfjmpeykrvshgiboivkvabhrpphgavvprz\r\n', 'output': ['zrpvvaghpprhbavkviobighsvrkyepmjfhznczsxnehpfkctvrnqmqzmkokbvuctqbksxonzhqlgkrviqlihrmksldyydacb']}, {'input': '100\r\noooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooo\r\n', 'output': ['oooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooo']}, {'input': '99\r\nqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqq\r\n', 'output': ['qqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqq']}, {'input': '90\r\ncccchccccccccccccccccccccccccccwcccccccccgcccccchccccccccccccccccccccccxccccccncccccccuccc\r\n', 'output': ['cccucccccccnccccccxcccccccccccccccccccccchccccccccccccccccccccccchccccccccccwcccccccccgccc']}, {'input': '97\r\nfwffffffffffffffffffffffffrffffffffffffffzfffffffffffffffftfcfffffffqffffffffffffffffffffffyfffff\r\n', 'output': ['fffffyffffffffffffffffffffffqfffffffcftffffffffffffffffzffffffffffffffrffffffffffffffffffffffffwf']}]

[{'input': '97\r\nfwffffffffffffffffffffffffrffffffffffffffzfffffffffffffffftfcfffffffqffffffffffffffffffffffyfffff\r\n', 'output': ['fffffyffffffffffffffffffffffqfffffffcftffffffffffffffffzffffffffffffffrffffffffffffffffffffffffwf']}, {'input': '16\r\nplmaetwoxesisiht\r\n', 'output': ['thisisexampletwo']}, {'input': '1\r\nz\r\n', 'output': ['z']}, {'input': '90\r\ncccchccccccccccccccccccccccccccwcccccccccgcccccchccccccccccccccccccccccxccccccncccccccuccc\r\n', 'output': ['cccucccccccnccccccxcccccccccccccccccccccchccccccccccccccccccccccchccccccccccwcccccccccgccc']}, {'input': '100\r\nedykhvzcntljuuoqghptioetqnfllwekzohiuaxelgecabvsbibgqodqxvyfkbyjwtgbyhvssntinkwsinwsmalusiwnjmtcoovf\r\n', 'output': ['fvooctmjnwisulamswniswknitnssvhybgtwjybkfyvxqdoqgbqteoitnczvkyedhljuuoqghptnfllwekzohiuaxelgecabvsbi']}]

[{'input': '6\r\nkrdych\r\n', 'output': ['hcyrkd']}, {'input': '100\r\nedykhvzcntljuuoqghptioetqnfllwekzohiuaxelgecabvsbibgqodqxvyfkbyjwtgbyhvssntinkwsinwsmalusiwnjmtcoovf\r\n', 'output': ['fvooctmjnwisulamswniswknitnssvhybgtwjybkfyvxqdoqgbqteoitnczvkyedhljuuoqghptnfllwekzohiuaxelgecabvsbi']}, {'input': '10\r\nrocesfedoc\r\n', 'output': ['codeforces']}, {'input': '4\r\njfyy\r\n', 'output': ['yyjf']}, {'input': '3\r\nilj\r\n', 'output': ['jli']}]

[{'input': '100\r\ndjjjjjjjjjjgjjjjjjjjjjjjjjsvjjjjjjjjjjmjjjjjjjjjjjjjajjjjjjajjjjjjrjjjjjjjjjjjjrjjtjjjjjjjjjjjjjojjj\r\n', 'output': ['jjjojjjjjjjjjjjjjtjjrjjjjjjjjjjjjrjjjjjjajjjjjjajjjjjjjjjjjjjjdjjjgjjjjjjjjjsvjjjjjjjjjjmjjjjjjjjjjj']}, {'input': '99\r\nqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqq\r\n', 'output': ['qqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqq']}, {'input': '60\r\nfnebsopcvmlaoecpzmakqigyuutueuozjxutlwwiochekmhjgwxsgfbcrpqj\r\n', 'output': ['jqprcbfgsxwgjhmkehcoiwwltuxjzokamzpalobnfespcvmoecqigyuutueu']}, {'input': '16\r\nplmaetwoxesisiht\r\n', 'output': ['thisisexampletwo']}, {'input': '89\r\nwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwww\r\n', 'output': ['wwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwww']}]

[{'input': '60\r\nfnebsopcvmlaoecpzmakqigyuutueuozjxutlwwiochekmhjgwxsgfbcrpqj\r\n', 'output': ['jqprcbfgsxwgjhmkehcoiwwltuxjzokamzpalobnfespcvmoecqigyuutueu']}, {'input': '99\r\nqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqq\r\n', 'output': ['qqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqq']}, {'input': '16\r\nplmaetwoxesisiht\r\n', 'output': ['thisisexampletwo']}, {'input': '97\r\nfwffffffffffffffffffffffffrffffffffffffffzfffffffffffffffftfcfffffffqffffffffffffffffffffffyfffff\r\n', 'output': ['fffffyffffffffffffffffffffffqfffffffcftffffffffffffffffzffffffffffffffrffffffffffffffffffffffffwf']}, {'input': '100\r\ndjjjjjjjjjjgjjjjjjjjjjjjjjsvjjjjjjjjjjmjjjjjjjjjjjjjajjjjjjajjjjjjrjjjjjjjjjjjjrjjtjjjjjjjjjjjjjojjj\r\n', 'output': ['jjjojjjjjjjjjjjjjtjjrjjjjjjjjjjjjrjjjjjjajjjjjjajjjjjjjjjjjjjjdjjjgjjjjjjjjjsvjjjjjjjjjjmjjjjjjjjjjj']}]

["3 3", "6 5", "1000000000 1"]

The only line contains two integers $$$n$$$ and $$$m$$$ ($$$1 \le n \le 10^9$$$, $$$1 \le m \le 1000$$$) — the size of the field and the number of parts to split the sets into.

2ec9e7cddc634d7830575e14363a4657

n, m = [int(i) for i in input().split()] ans = 0 ar = [n // m] * m for i in range(1, n % m + 1, 1): ar[i] += 1 for i in range(m): for j in range(m): if ((i * i + j * j) % m == 0): ans += ar[i] * ar[j] print(ans)

["1", "13", "1000000000000000000"]

Python

NoteIn the first example, only the set for cell $$$(3, 3)$$$ can be split equally ($$$3^2 + 3^2 = 18$$$, which is divisible by $$$m=3$$$).In the second example, the sets for the following cells can be divided equally: $$$(1, 2)$$$ and $$$(2, 1)$$$, since $$$1^2 + 2^2 = 5$$$, which is divisible by $$$5$$$; $$$(1, 3)$$$ and $$$(3, 1)$$$; $$$(2, 4)$$$ and $$$(4, 2)$$$; $$$(2, 6)$$$ and $$$(6, 2)$$$; $$$(3, 4)$$$ and $$$(4, 3)$$$; $$$(3, 6)$$$ and $$$(6, 3)$$$; $$$(5, 5)$$$. In the third example, sets in all cells can be divided equally, since $$$m = 1$$$.

Print a single integer — the number of sets that can be split equally.

Arkady and his friends love playing checkers on an $$$n \times n$$$ field. The rows and the columns of the field are enumerated from $$$1$$$ to $$$n$$$.The friends have recently won a championship, so Arkady wants to please them with some candies. Remembering an old parable (but not its moral), Arkady wants to give to his friends one set of candies per each cell of the field: the set of candies for cell $$$(i, j)$$$ will have exactly $$$(i^2 + j^2)$$$ candies of unique type.There are $$$m$$$ friends who deserve the present. How many of these $$$n \times n$$$ sets of candies can be split equally into $$$m$$$ parts without cutting a candy into pieces? Note that each set has to be split independently since the types of candies in different sets are different.

[{"input": "3 3\r\n", "output": ["1"]}, {"input": "6 5\r\n", "output": ["13"]}, {"input": "1000000000 1\r\n", "output": ["1000000000000000000"]}, {"input": "1 1\r\n", "output": ["1"]}, {"input": "1000000000 81\r\n", "output": ["12345678987654321"]}, {"input": "10000 1\r\n", "output": ["100000000"]}, {"input": "10000 2\r\n", "output": ["50000000"]}, {"input": "10000 3\r\n", "output": ["11108889"]}, {"input": "15 1000\r\n", "output": ["0"]}, {"input": "10 200\r\n", "output": ["1"]}, {"input": "1000000000 1000\r\n", "output": ["3400000000000000"]}, {"input": "999999998 229\r\n", "output": ["8714555372170630"]}, {"input": "999999999 228\r\n", "output": ["76946738381041"]}, {"input": "1 2\r\n", "output": ["1"]}, {"input": "10000 5\r\n", "output": ["36000000"]}, {"input": "1 10\r\n", "output": ["0"]}, {"input": "100 100\r\n", "output": ["260"]}, {"input": "360 900\r\n", "output": ["374"]}, {"input": "1000 999\r\n", "output": ["657"]}, {"input": "12345 1\r\n", "output": ["152399025"]}]

[{'input': '15 1000\r\n', 'output': ['0']}, {'input': '1000000000 81\r\n', 'output': ['12345678987654321']}, {'input': '10 200\r\n', 'output': ['1']}, {'input': '100 100\r\n', 'output': ['260']}, {'input': '3 3\r\n', 'output': ['1']}]

[{'input': '100 100\r\n', 'output': ['260']}, {'input': '10000 2\r\n', 'output': ['50000000']}, {'input': '15 1000\r\n', 'output': ['0']}, {'input': '12345 1\r\n', 'output': ['152399025']}, {'input': '1 10\r\n', 'output': ['0']}]

[{'input': '1 2\r\n', 'output': ['1']}, {'input': '360 900\r\n', 'output': ['374']}, {'input': '15 1000\r\n', 'output': ['0']}, {'input': '10000 3\r\n', 'output': ['11108889']}, {'input': '3 3\r\n', 'output': ['1']}]

[{'input': '1 2\r\n', 'output': ['1']}, {'input': '3 3\r\n', 'output': ['1']}, {'input': '6 5\r\n', 'output': ['13']}, {'input': '10000 5\r\n', 'output': ['36000000']}, {'input': '1 1\r\n', 'output': ['1']}]

[{'input': '999999999 228\r\n', 'output': ['76946738381041']}, {'input': '10000 1\r\n', 'output': ['100000000']}, {'input': '10 200\r\n', 'output': ['1']}, {'input': '10000 2\r\n', 'output': ['50000000']}, {'input': '360 900\r\n', 'output': ['374']}]

["Is it a melon?", "Is it an apple?", "Is it a banana ?", "Is it an apple and a banana simultaneouSLY?"]

The single line contains a question represented by a non-empty line consisting of large and small Latin letters, spaces and a question mark. The line length does not exceed 100. It is guaranteed that the question mark occurs exactly once in the line — as the last symbol and that the line contains at least one letter.

dea7eb04e086a4c1b3924eff255b9648

s = input() vowels = 'aeiouyAEIOUY' if s.split()[-1] == '?': if s.split()[-2][-1] in vowels: print('YES') else: print('NO') else: if s.split()[-1][:-1][-1] in vowels: print('YES') else: print('NO')

["NO", "YES", "YES", "YES"]

Python

Print answer for the question in a single line: YES if the answer is "Yes", NO if the answer is "No". Remember that in the reply to the question the last letter, not the last character counts. I. e. the spaces and the question mark do not count as letters.

Vasya plays the sleuth with his friends. The rules of the game are as follows: those who play for the first time, that is Vasya is the sleuth, he should investigate a "crime" and find out what is happening. He can ask any questions whatsoever that can be answered with "Yes" or "No". All the rest agree beforehand to answer the questions like that: if the question’s last letter is a vowel, they answer "Yes" and if the last letter is a consonant, they answer "No". Of course, the sleuth knows nothing about it and his task is to understand that.Unfortunately, Vasya is not very smart. After 5 hours of endless stupid questions everybody except Vasya got bored. That’s why Vasya’s friends ask you to write a program that would give answers instead of them.The English alphabet vowels are: A, E, I, O, U, YThe English alphabet consonants are: B, C, D, F, G, H, J, K, L, M, N, P, Q, R, S, T, V, W, X, Z

[{"input": "Is it a melon?\r\n", "output": ["NO"]}, {"input": "Is it an apple?\r\n", "output": ["YES"]}, {"input": " Is it a banana ?\r\n", "output": ["YES"]}, {"input": "Is it an apple and a banana simultaneouSLY?\r\n", "output": ["YES"]}, {"input": "oHtSbDwzHb?\r\n", "output": ["NO"]}, {"input": "sZecYdUvZHrXx?\r\n", "output": ["NO"]}, {"input": "uMtXK?\r\n", "output": ["NO"]}, {"input": "U?\r\n", "output": ["YES"]}, {"input": "aqFDkCUKeHMyvZFcAyWlMUSQTFomtaWjoKLVyxLCw vcufPBFbaljOuHWiDCROYTcmbgzbaqHXKPOYEbuEtRqqoxBbOETCsQzhw?\r\n", "output": ["NO"]}, {"input": "dJcNqQiFXzcbsj fItCpBLyXOnrSBPebwyFHlxUJHqCUzzCmcAvMiKL NunwOXnKeIxUZmBVwiCUfPkjRAkTPbkYCmwRRnDSLaz?\r\n", "output": ["NO"]}, {"input": "gxzXbdcAQMuFKuuiPohtMgeypr wpDIoDSyOYTdvylcg SoEBZjnMHHYZGEqKgCgBeTbyTwyGuPZxkxsnSczotBdYyfcQsOVDVC?\r\n", "output": ["NO"]}, {"input": "FQXBisXaJFMiHFQlXjixBDMaQuIbyqSBKGsBfTmBKCjszlGVZxEOqYYqRTUkGpSDDAoOXyXcQbHcPaegeOUBNeSD JiKOdECPOF?\r\n", "output": ["NO"]}, {"input": "YhCuZnrWUBEed?\r\n", "output": ["NO"]}, {"input": "hh?\r\n", "output": ["NO"]}, {"input": "whU?\r\n", "output": ["YES"]}, {"input": "fgwg?\r\n", "output": ["NO"]}, {"input": "GlEmEPKrYcOnBNJUIFjszWUyVdvWw DGDjoCMtRJUburkPToCyDrOtMr?\r\n", "output": ["NO"]}, {"input": "n?\r\n", "output": ["NO"]}, {"input": "BueDOlxgzeNlxrzRrMbKiQdmGujEKmGxclvaPpTuHmTqBp?\r\n", "output": ["NO"]}, {"input": "iehvZNQXDGCuVmJPOEysLyUryTdfaIxIuTzTadDbqRQGoCLXkxnyfWSGoLXebNnQQNTqAQJebbyYvHOfpUnXeWdjx?\r\n", "output": ["NO"]}, {"input": " J ?\r\n", "output": ["NO"]}, {"input": " j ?\r\n", "output": ["NO"]}, {"input": " o ?\r\n", "output": ["YES"]}, {"input": " T ?\r\n", "output": ["NO"]}, {"input": " q ?\r\n", "output": ["NO"]}, {"input": " j ?\r\n", "output": ["NO"]}, {"input": " c ?\r\n", "output": ["NO"]}, {"input": " B ?\r\n", "output": ["NO"]}, {"input": "LuhxDHVwMPTtUIUMIQTuQETgXCOQPsfdFlyHvpfOVedjUTpGLAZGOHloIjJJtOLAlHPivzA?\r\n", "output": ["YES"]}, {"input": "wmztmzFfwbGyOmNHENUFMTsFEMWYA?\r\n", "output": ["YES"]}, {"input": "wGsfZCSwN PEUhNUrLfABrxA?\r\n", "output": ["YES"]}, {"input": "mCDHENXjYbgMdBimAdPnewaHfpGWowjWrVAdvWczjw iDcUbyzMsmsnwbviiKiAyGVA?\r\n", "output": ["YES"]}, {"input": "ARIWnwqFqxsQXsXXzHqvFjxOCttAGPUzDtWzsenPYdNXuFOIUGYZsLLK IaoxiyjBBRThoelwdPTkuCQfcBLUEJpCPIrVZlvUWA?\r\n", "output": ["YES"]}, {"input": " PslvVpgpN BXkMFBEVXsyZFIQbBEFxGkYTeXKrOdcmhbiTUatYRUoYAayrchqbksswIlfIjerZPqptvCGnMUhyrQSvwltRhFzA?\r\n", "output": ["YES"]}, {"input": "HpBkttwSjBXDmyleGiRWNUMPaAIE uzTrp KJDzaUiCdsMYOoWKHoUhWUoecCPmACymMUUbGav UMRpCytPETwNFAObZJA?\r\n", "output": ["YES"]}]

[{'input': ' q ?\r\n', 'output': ['NO']}, {'input': 'wmztmzFfwbGyOmNHENUFMTsFEMWYA?\r\n', 'output': ['YES']}, {'input': ' j ?\r\n', 'output': ['NO']}, {'input': 'YhCuZnrWUBEed?\r\n', 'output': ['NO']}, {'input': 'Is it an apple and a banana simultaneouSLY?\r\n', 'output': ['YES']}]

[{'input': 'iehvZNQXDGCuVmJPOEysLyUryTdfaIxIuTzTadDbqRQGoCLXkxnyfWSGoLXebNnQQNTqAQJebbyYvHOfpUnXeWdjx?\r\n', 'output': ['NO']}, {'input': 'n?\r\n', 'output': ['NO']}, {'input': ' T ?\r\n', 'output': ['NO']}, {'input': 'gxzXbdcAQMuFKuuiPohtMgeypr wpDIoDSyOYTdvylcg SoEBZjnMHHYZGEqKgCgBeTbyTwyGuPZxkxsnSczotBdYyfcQsOVDVC?\r\n', 'output': ['NO']}, {'input': 'sZecYdUvZHrXx?\r\n', 'output': ['NO']}]

[{'input': 'iehvZNQXDGCuVmJPOEysLyUryTdfaIxIuTzTadDbqRQGoCLXkxnyfWSGoLXebNnQQNTqAQJebbyYvHOfpUnXeWdjx?\r\n', 'output': ['NO']}, {'input': 'mCDHENXjYbgMdBimAdPnewaHfpGWowjWrVAdvWczjw iDcUbyzMsmsnwbviiKiAyGVA?\r\n', 'output': ['YES']}, {'input': 'GlEmEPKrYcOnBNJUIFjszWUyVdvWw DGDjoCMtRJUburkPToCyDrOtMr?\r\n', 'output': ['NO']}, {'input': 'Is it an apple?\r\n', 'output': ['YES']}, {'input': 'HpBkttwSjBXDmyleGiRWNUMPaAIE uzTrp KJDzaUiCdsMYOoWKHoUhWUoecCPmACymMUUbGav UMRpCytPETwNFAObZJA?\r\n', 'output': ['YES']}]

[{'input': 'wGsfZCSwN PEUhNUrLfABrxA?\r\n', 'output': ['YES']}, {'input': 'fgwg?\r\n', 'output': ['NO']}, {'input': 'n?\r\n', 'output': ['NO']}, {'input': ' T ?\r\n', 'output': ['NO']}, {'input': 'U?\r\n', 'output': ['YES']}]

[{'input': 'BueDOlxgzeNlxrzRrMbKiQdmGujEKmGxclvaPpTuHmTqBp?\r\n', 'output': ['NO']}, {'input': ' j ?\r\n', 'output': ['NO']}, {'input': 'FQXBisXaJFMiHFQlXjixBDMaQuIbyqSBKGsBfTmBKCjszlGVZxEOqYYqRTUkGpSDDAoOXyXcQbHcPaegeOUBNeSD JiKOdECPOF?\r\n', 'output': ['NO']}, {'input': 'wmztmzFfwbGyOmNHENUFMTsFEMWYA?\r\n', 'output': ['YES']}, {'input': ' PslvVpgpN BXkMFBEVXsyZFIQbBEFxGkYTeXKrOdcmhbiTUatYRUoYAayrchqbksswIlfIjerZPqptvCGnMUhyrQSvwltRhFzA?\r\n', 'output': ['YES']}]

["4", "6"]

The first line of the input contains integer n (1 ≤ n ≤ 1000).

62db589bad3b7023418107de05b7a8ee

P = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47] def power(a, b): res = 1 while (b): if (b & 1): res *= a a *= a b >>= 1 return res ans = [] ans.append(1e30) def solve(pos, n, res): if (n == 1): ans[0] = min(ans[0], res) for i in range(2, 62): if (n % i == 0): solve(pos + 1, n / i, res * power(P[pos], i - 1)) n = int(input()) solve(0, n, 1) print(ans[0])

["6", "12"]

Python

Output the smallest positive integer with exactly n divisors.

Given the number n, find the smallest positive integer which has exactly n divisors. It is guaranteed that for the given n the answer will not exceed 1018.

[{"input": "1\r\n", "output": ["1"]}, {"input": "7\r\n", "output": ["64"]}, {"input": "8\r\n", "output": ["24"]}, {"input": "9\r\n", "output": ["36"]}, {"input": "10\r\n", "output": ["48"]}, {"input": "15\r\n", "output": ["144"]}, {"input": "20\r\n", "output": ["240"]}, {"input": "47\r\n", "output": ["70368744177664"]}, {"input": "59\r\n", "output": ["288230376151711744"]}, {"input": "100\r\n", "output": ["45360"]}, {"input": "159\r\n", "output": ["40532396646334464"]}, {"input": "265\r\n", "output": ["364791569817010176"]}, {"input": "312\r\n", "output": ["14192640"]}, {"input": "473\r\n", "output": ["259700248434180096"]}, {"input": "637\r\n", "output": ["46656000000"]}, {"input": "500\r\n", "output": ["62370000"]}, {"input": "720\r\n", "output": ["61261200"]}, {"input": "902\r\n", "output": ["324625310542725120"]}, {"input": "940\r\n", "output": ["199495389743677440"]}, {"input": "1000\r\n", "output": ["810810000"]}, {"input": "999\r\n", "output": ["757632231014400"]}, {"input": "118\r\n", "output": ["864691128455135232"]}]

[{'input': '902\r\n', 'output': ['324625310542725120']}, {'input': '20\r\n', 'output': ['240']}, {'input': '7\r\n', 'output': ['64']}, {'input': '118\r\n', 'output': ['864691128455135232']}, {'input': '265\r\n', 'output': ['364791569817010176']}]

[{'input': '159\r\n', 'output': ['40532396646334464']}, {'input': '10\r\n', 'output': ['48']}, {'input': '265\r\n', 'output': ['364791569817010176']}, {'input': '720\r\n', 'output': ['61261200']}, {'input': '902\r\n', 'output': ['324625310542725120']}]

[{'input': '8\r\n', 'output': ['24']}, {'input': '7\r\n', 'output': ['64']}, {'input': '100\r\n', 'output': ['45360']}, {'input': '312\r\n', 'output': ['14192640']}, {'input': '720\r\n', 'output': ['61261200']}]

[{'input': '1000\r\n', 'output': ['810810000']}, {'input': '15\r\n', 'output': ['144']}, {'input': '10\r\n', 'output': ['48']}, {'input': '1\r\n', 'output': ['1']}, {'input': '9\r\n', 'output': ['36']}]

[{'input': '265\r\n', 'output': ['364791569817010176']}, {'input': '637\r\n', 'output': ['46656000000']}, {'input': '15\r\n', 'output': ['144']}, {'input': '10\r\n', 'output': ['48']}, {'input': '47\r\n', 'output': ['70368744177664']}]

[".......A\n........\n........\n........\n........\n........\n........\nM.......", ".......A\n........\n........\n........\n........\n........\nSS......\nM.......", ".......A\n........\n........\n........\n........\n.S......\nS.......\nMS......"]

You are given the 8 strings whose length equals 8, describing the initial position on the board. The first line represents the top row of the board, the next one — for the second from the top, and so on, the last line represents the bottom row. Each character string matches a single cell board in the appropriate row, and the characters are in the same manner as that of the corresponding cell. If the cell is empty, the corresponding character is ".". If a cell has Maria, then it is represented by character "M". If a cell has Anna, it is represented by the character "A". If a cell has a statue, then the cell is represented by character "S". It is guaranteed that the last character of the first row is always "A", the first character of the last line is always "M". The remaining characters are "." or "S".

f47e4ab041288ba9567c19930eb9a090

r, s = [63], ''.join(input() + 'T' for i in range(8)) + 'T' * 9 for i in range(0, 72, 9): t = set() for x in r: for y in (x, x - 1, x + 1, x - 9, x + 9, x - 10, x - 8, x + 10, x + 8): if s[y] == 'T': continue if (y < i or s[y - i] != 'S') and (y < i + 9 or s[y - i - 9] != 'S'): t.add(y) r = t print('WIN' if r else 'LOSE')

["WIN", "LOSE", "LOSE"]

Python

If Maria wins, print string "WIN". If the statues win, print string "LOSE".

In this task Anna and Maria play a game with a very unpleasant rival. Anna and Maria are in the opposite squares of a chessboard (8 × 8): Anna is in the upper right corner, and Maria is in the lower left one. Apart from them, the board has several statues. Each statue occupies exactly one square. A square that contains a statue cannot have anything or anyone — neither any other statues, nor Anna, nor Maria.Anna is present on the board as a figurant (she stands still and never moves), and Maria has been actively involved in the game. Her goal is — to come to Anna's square. Maria and statues move in turn, Maria moves first. During one move Maria can go to any adjacent on the side or diagonal cell in which there is no statue, or she can stay in the cell where she is. The statues during their move must go one square down simultaneously, and those statues that were in the bottom row fall from the board and are no longer appeared.At that moment, when one of the statues is in the cell in which the Maria is, the statues are declared winners. At the moment when Maria comes into the cell where Anna has been waiting, Maria is declared the winner.Obviously, nothing depends on the statues, so it all depends on Maria. Determine who will win, if Maria does not make a strategic error.

[{"input": ".......A\r\n........\r\n........\r\n........\r\n........\r\n........\r\n........\r\nM.......\r\n", "output": ["WIN"]}, {"input": ".......A\r\n........\r\n........\r\n........\r\n........\r\n........\r\nSS......\r\nM.......\r\n", "output": ["LOSE"]}, {"input": ".......A\r\n........\r\n........\r\n........\r\n........\r\n.S......\r\nS.......\r\nMS......\r\n", "output": ["LOSE"]}, {"input": ".......A\r\n........\r\n........\r\n........\r\n........\r\n.SSSSSSS\r\nS.......\r\nM.......\r\n", "output": ["WIN"]}, {"input": ".......A\r\n........\r\n........\r\n........\r\nS.......\r\n.SSSSSSS\r\nS.......\r\nM.......\r\n", "output": ["LOSE"]}, {"input": ".SSSSSSA\r\n.SSSSSSS\r\n.SSSSSSS\r\n.SSSSSSS\r\n.SSSSSSS\r\n.SSSSSSS\r\n.SSSSSSS\r\nMSSSSSSS\r\n", "output": ["WIN"]}, {"input": ".......A\r\n..SSSSSS\r\n........\r\n........\r\nSSS.....\r\n........\r\n........\r\nM.......\r\n", "output": ["WIN"]}, {"input": "SSSSSSSA\r\nSSSSSSSS\r\nSSSSSSSS\r\nSSSSSSSS\r\nSSSSSSSS\r\nSSSSSSSS\r\nSSSSSSSS\r\nMSSSSSSS\r\n", "output": ["LOSE"]}, {"input": ".......A\r\n........\r\n........\r\n........\r\n.S......\r\nS.......\r\n.S......\r\nM.......\r\n", "output": ["LOSE"]}, {"input": ".......A\r\n........\r\n........\r\n........\r\n........\r\nS.......\r\n.S......\r\nM.......\r\n", "output": ["WIN"]}, {"input": "SSSSSSSA\r\n......SS\r\n.......S\r\n.......S\r\n.......S\r\n.......S\r\n.......S\r\nM......S\r\n", "output": ["LOSE"]}, {"input": ".......A\r\nS.S.S.S.\r\n........\r\n.S.S.S.S\r\n........\r\nS.S.S.S.\r\n........\r\nMS.S.S.S\r\n", "output": ["WIN"]}, {"input": "SSSSSSSA\r\n......S.\r\n......S.\r\n.....SS.\r\n....SS..\r\n...SS...\r\n..SS....\r\nMSS.....\r\n", "output": ["LOSE"]}, {"input": ".S.....A\r\n..SS....\r\n.S......\r\nSS......\r\n..S.....\r\nS.......\r\n.S......\r\nM.......\r\n", "output": ["WIN"]}, {"input": "S..SSSSA\r\n...S.S.S\r\n.SS.SS.S\r\nSS....SS\r\n.S.SSSS.\r\n...S.S.S\r\n..S..S..\r\nMSSSSS.S\r\n", "output": ["WIN"]}, {"input": "SSSSSSSA\r\nSS.SSSSS\r\nSSSSSSSS\r\nSSSSSSSS\r\nS..SS.SS\r\nSSSS.SSS\r\nSSSS.SSS\r\nM.SSS.SS\r\n", "output": ["LOSE"]}, {"input": ".......A\r\n....S...\r\n...S....\r\n........\r\nS..S..SS\r\n.S....S.\r\nS....S..\r\nM....S.S\r\n", "output": ["WIN"]}, {"input": "S..SSSSA\r\n.S..S...\r\nS.S....S\r\nSS..S.S.\r\nSSSS.S..\r\n.SS..SS.\r\n....SS..\r\nMS..S...\r\n", "output": ["LOSE"]}, {"input": "...S.SSA\r\n.....S..\r\nSSS....S\r\n...S...S\r\n....SSSS\r\n.S.S...S\r\n..S....S\r\nM..SSSSS\r\n", "output": ["WIN"]}, {"input": "S..SS.SA\r\n.SSS.S.S\r\nSS.SSS.S\r\nSSS.S.S.\r\nSS.SSSSS\r\nSSSSSSSS\r\nSSSS.SS.\r\nM.SSS.S.\r\n", "output": ["LOSE"]}, {"input": "...SSS.A\r\n.....S..\r\n..S.S.SS\r\n.S.S...S\r\nS.S...S.\r\n....S...\r\n........\r\nM..S.SSS\r\n", "output": ["WIN"]}, {"input": ".S.S..SA\r\n.S...S.S\r\nS....S..\r\n...S....\r\n.S.SSSSS\r\nS.....SS\r\n.S.S.SSS\r\nM....S.S\r\n", "output": ["LOSE"]}, {"input": ".......A\r\n....S...\r\n........\r\n........\r\n........\r\n........\r\n.S......\r\nM.......\r\n", "output": ["WIN"]}, {"input": "SSSS.SSA\r\nSSS.SSSS\r\nSSSSSS.S\r\nSS.SSS.S\r\nSS.S.SS.\r\nSSSS.SS.\r\nSSSS.SSS\r\nMSS.SSS.\r\n", "output": ["LOSE"]}, {"input": "SSSS.SSA\r\nSSSSS.SS\r\nSSSS.SSS\r\nSSSSSSSS\r\nSS.SSSSS\r\nSSS.SSSS\r\nSSSSSSSS\r\nMSSS..SS\r\n", "output": ["LOSE"]}, {"input": "S.S.S..A\r\n...SSS.S\r\n.SSSSSS.\r\nSS.S..SS\r\nSSSS.SSS\r\n.S.SSS..\r\nSS.SSSSS\r\nMSSSS.S.\r\n", "output": ["LOSE"]}, {"input": "SSSSSSSA\r\nSS.SSS.S\r\nSSSSSS.S\r\nSSSSSSSS\r\nSSSSSSSS\r\nSSSSSSS.\r\nSSSSSSSS\r\nM.SSSSSS\r\n", "output": ["LOSE"]}, {"input": "...S...A\r\n........\r\n..S..S.S\r\n.S....S.\r\nS.......\r\n..S.S..S\r\n......S.\r\nM..SS..S\r\n", "output": ["WIN"]}, {"input": "SSSSSSSA\r\nSSSSSSSS\r\n.SSSSSSS\r\nSSSSSSSS\r\nSSSSSSSS\r\nSSSSS.SS\r\nSSSSSSSS\r\nMSSSSSSS\r\n", "output": ["LOSE"]}, {"input": "SSSSSSSA\r\nSSS.SSSS\r\nSSSSSSSS\r\nSSS.SSSS\r\nSSSSSSSS\r\nSSSSSSSS\r\nSSSSSSSS\r\nMSSSS.SS\r\n", "output": ["LOSE"]}, {"input": "S.S..SSA\r\n...S.S..\r\n.SS.SSS.\r\n......S.\r\n.S...S..\r\n..S.S..S\r\n..SS..S.\r\nM.SS..SS\r\n", "output": ["WIN"]}, {"input": "SSSSSSSA\r\nSSSSSSSS\r\nSSSSSSSS\r\nSSSSSSSS\r\nSSSSSSSS\r\nSSSSSSSS\r\nSSSSSSSS\r\nMSSSSSSS\r\n", "output": ["LOSE"]}, {"input": ".....S.A\r\n...S.S..\r\n.....S..\r\n........\r\n........\r\n........\r\n......S.\r\nM....S..\r\n", "output": ["WIN"]}, {"input": ".S.S.S.A\r\n.SS.S..S\r\n..S....S\r\n..S.....\r\nSSS.S...\r\n.S....S.\r\nSSSSSS..\r\nM..S....\r\n", "output": ["LOSE"]}, {"input": "SSSSS..A\r\nS.SS.SS.\r\n.S.SSS.S\r\n..SSSSS.\r\n.S..S.S.\r\n.SS.S..S\r\nSSS.S...\r\nM..S..S.\r\n", "output": ["LOSE"]}, {"input": ".......A\r\n........\r\n........\r\n........\r\n..S....S\r\n........\r\n........\r\nM.......\r\n", "output": ["WIN"]}, {"input": ".......A\r\n...S...S\r\n...S....\r\n....S..S\r\n........\r\nS.S...S.\r\nSS......\r\nMS......\r\n", "output": ["LOSE"]}, {"input": "S......A\r\n.SS..S..\r\nS....S..\r\nSSS...S.\r\n.SS.SSS.\r\n.S.SS...\r\n..S..S..\r\nM.SS....\r\n", "output": ["LOSE"]}, {"input": ".SSSS.SA\r\n.SS.SSS.\r\n..S.SS..\r\nSSSS.SS.\r\nS.S.....\r\nS.S.SSSS\r\nS..SS..S\r\nMS.SS.SS\r\n", "output": ["LOSE"]}, {"input": "SSS..SSA\r\nSSSSSSSS\r\n..SS..SS\r\n.S.S.SSS\r\n.SSS.SSS\r\nSSSS.S.S\r\n...SS..S\r\nMS..S.SS\r\n", "output": ["LOSE"]}, {"input": "S..SSS.A\r\nS.S.SSSS\r\nSSSSSSSS\r\n...SS...\r\nS.SSSSSS\r\nSS..SS.S\r\nSS..S.S.\r\nMSS..SSS\r\n", "output": ["LOSE"]}, {"input": "S.SS.SSA\r\n.S..SSS.\r\nSSS.SSS.\r\nSSSS.SSS\r\nS.SSSSSS\r\nSSSSSSSS\r\nSSSSS.SS\r\nMS.SSSSS\r\n", "output": ["LOSE"]}, {"input": "SSS.SSSA\r\nSSS....S\r\nSS...SSS\r\n..SSS..S\r\nS..SS...\r\nSS.SS...\r\n.S..SSSS\r\nM.SSSSSS\r\n", "output": ["LOSE"]}, {"input": "SSS.SSSA\r\nSSSSSSSS\r\nSSSSSSSS\r\nSS.SSS.S\r\nSSSSSSSS\r\nSSSSSSSS\r\nSSSSSSSS\r\nMSSSSSSS\r\n", "output": ["LOSE"]}, {"input": "SSSSSSSA\r\n........\r\n........\r\n........\r\n........\r\n........\r\n........\r\nM.......\r\n", "output": ["WIN"]}, {"input": ".......A\r\n........\r\nSSS.....\r\n........\r\n........\r\n.S......\r\n.S......\r\nMS......\r\n", "output": ["WIN"]}]

[{'input': 'SSSSSSSA\r\nSS.SSSSS\r\nSSSSSSSS\r\nSSSSSSSS\r\nS..SS.SS\r\nSSSS.SSS\r\nSSSS.SSS\r\nM.SSS.SS\r\n', 'output': ['LOSE']}, {'input': 'SSSSSSSA\r\nSSS.SSSS\r\nSSSSSSSS\r\nSSS.SSSS\r\nSSSSSSSS\r\nSSSSSSSS\r\nSSSSSSSS\r\nMSSSS.SS\r\n', 'output': ['LOSE']}, {'input': '.......A\r\n........\r\n........\r\n........\r\n........\r\n.SSSSSSS\r\nS.......\r\nM.......\r\n', 'output': ['WIN']}, {'input': 'SSS..SSA\r\nSSSSSSSS\r\n..SS..SS\r\n.S.S.SSS\r\n.SSS.SSS\r\nSSSS.S.S\r\n...SS..S\r\nMS..S.SS\r\n', 'output': ['LOSE']}, {'input': 'S.SS.SSA\r\n.S..SSS.\r\nSSS.SSS.\r\nSSSS.SSS\r\nS.SSSSSS\r\nSSSSSSSS\r\nSSSSS.SS\r\nMS.SSSSS\r\n', 'output': ['LOSE']}]

[{'input': '.......A\r\n........\r\n........\r\n........\r\nS.......\r\n.SSSSSSS\r\nS.......\r\nM.......\r\n', 'output': ['LOSE']}, {'input': '.S.S.S.A\r\n.SS.S..S\r\n..S....S\r\n..S.....\r\nSSS.S...\r\n.S....S.\r\nSSSSSS..\r\nM..S....\r\n', 'output': ['LOSE']}, {'input': 'SSSSSSSA\r\nSSSSSSSS\r\nSSSSSSSS\r\nSSSSSSSS\r\nSSSSSSSS\r\nSSSSSSSS\r\nSSSSSSSS\r\nMSSSSSSS\r\n', 'output': ['LOSE']}, {'input': 'SSSSSSSA\r\n......SS\r\n.......S\r\n.......S\r\n.......S\r\n.......S\r\n.......S\r\nM......S\r\n', 'output': ['LOSE']}, {'input': '.......A\r\n........\r\n........\r\n........\r\n........\r\n........\r\n........\r\nM.......\r\n', 'output': ['WIN']}]

[{'input': '.......A\r\n........\r\n........\r\n........\r\n........\r\n.SSSSSSS\r\nS.......\r\nM.......\r\n', 'output': ['WIN']}, {'input': '...S...A\r\n........\r\n..S..S.S\r\n.S....S.\r\nS.......\r\n..S.S..S\r\n......S.\r\nM..SS..S\r\n', 'output': ['WIN']}, {'input': '.......A\r\nS.S.S.S.\r\n........\r\n.S.S.S.S\r\n........\r\nS.S.S.S.\r\n........\r\nMS.S.S.S\r\n', 'output': ['WIN']}, {'input': 'SSSSSSSA\r\nSSS.SSSS\r\nSSSSSSSS\r\nSSS.SSSS\r\nSSSSSSSS\r\nSSSSSSSS\r\nSSSSSSSS\r\nMSSSS.SS\r\n', 'output': ['LOSE']}, {'input': '.SSSSSSA\r\n.SSSSSSS\r\n.SSSSSSS\r\n.SSSSSSS\r\n.SSSSSSS\r\n.SSSSSSS\r\n.SSSSSSS\r\nMSSSSSSS\r\n', 'output': ['WIN']}]

[{'input': '.....S.A\r\n...S.S..\r\n.....S..\r\n........\r\n........\r\n........\r\n......S.\r\nM....S..\r\n', 'output': ['WIN']}, {'input': '.S.S..SA\r\n.S...S.S\r\nS....S..\r\n...S....\r\n.S.SSSSS\r\nS.....SS\r\n.S.S.SSS\r\nM....S.S\r\n', 'output': ['LOSE']}, {'input': '.......A\r\n...S...S\r\n...S....\r\n....S..S\r\n........\r\nS.S...S.\r\nSS......\r\nMS......\r\n', 'output': ['LOSE']}, {'input': 'S.S.S..A\r\n...SSS.S\r\n.SSSSSS.\r\nSS.S..SS\r\nSSSS.SSS\r\n.S.SSS..\r\nSS.SSSSS\r\nMSSSS.S.\r\n', 'output': ['LOSE']}, {'input': 'SSSSSSSA\r\n......S.\r\n......S.\r\n.....SS.\r\n....SS..\r\n...SS...\r\n..SS....\r\nMSS.....\r\n', 'output': ['LOSE']}]

[{'input': '.......A\r\n....S...\r\n........\r\n........\r\n........\r\n........\r\n.S......\r\nM.......\r\n', 'output': ['WIN']}, {'input': '.......A\r\nS.S.S.S.\r\n........\r\n.S.S.S.S\r\n........\r\nS.S.S.S.\r\n........\r\nMS.S.S.S\r\n', 'output': ['WIN']}, {'input': '.S.S.S.A\r\n.SS.S..S\r\n..S....S\r\n..S.....\r\nSSS.S...\r\n.S....S.\r\nSSSSSS..\r\nM..S....\r\n', 'output': ['LOSE']}, {'input': 'SSSSSSSA\r\nSSSSSSSS\r\nSSSSSSSS\r\nSSSSSSSS\r\nSSSSSSSS\r\nSSSSSSSS\r\nSSSSSSSS\r\nMSSSSSSS\r\n', 'output': ['LOSE']}, {'input': '.......A\r\n........\r\n........\r\n........\r\n.S......\r\nS.......\r\n.S......\r\nM.......\r\n', 'output': ['LOSE']}]

["2 2 1 1", "1 2 1 2"]

The only line contains four integers $$$n$$$, $$$m$$$, $$$L$$$ and $$$R$$$ ($$$1\le n,m,L,R \le 10^9$$$, $$$L \le R$$$, $$$n \cdot m \ge 2$$$).

ded299fa1cd010822c60f2389a3ba1a3

n, m, L, R = map(int, input().split()) mod = 998244353 if n*m % 2: print(pow(R-L+1, n*m, mod)) else: print((pow(R-L+1, n*m, mod) + 1 - (R-L) % 2) * pow(2, mod-2, mod) % mod)

["1", "2"]

Python

NoteIn the first sample, the only initial grid that satisfies the requirements is $$$a_{1,1}=a_{2,1}=a_{1,2}=a_{2,2}=1$$$. Thus the answer should be $$$1$$$.In the second sample, initial grids that satisfy the requirements are $$$a_{1,1}=a_{1,2}=1$$$ and $$$a_{1,1}=a_{1,2}=2$$$. Thus the answer should be $$$2$$$.

Output one integer, representing the desired answer modulo $$$998,244,353$$$.

Alice has got addicted to a game called Sirtet recently.In Sirtet, player is given an $$$n \times m$$$ grid. Initially $$$a_{i,j}$$$ cubes are stacked up in the cell $$$(i,j)$$$. Two cells are called adjacent if they share a side. Player can perform the following operations: stack up one cube in two adjacent cells; stack up two cubes in one cell. Cubes mentioned above are identical in height.Here is an illustration of the game. States on the right are obtained by performing one of the above operations on the state on the left, and grey cubes are added due to the operation. Player's goal is to make the height of all cells the same (i.e. so that each cell has the same number of cubes in it) using above operations. Alice, however, has found out that on some starting grids she may never reach the goal no matter what strategy she uses. Thus, she is wondering the number of initial grids such that $$$L \le a_{i,j} \le R$$$ for all $$$1 \le i \le n$$$, $$$1 \le j \le m$$$; player can reach the goal using above operations. Please help Alice with it. Notice that the answer might be large, please output the desired value modulo $$$998,244,353$$$.

[{"input": "2 2 1 1\r\n", "output": ["1"]}, {"input": "1 2 1 2\r\n", "output": ["2"]}, {"input": "485 117 386829368 748204956\r\n", "output": ["735420370"]}, {"input": "564 558 305171115 960941497\r\n", "output": ["880111542"]}, {"input": "692 210 44175861 843331069\r\n", "output": ["714028205"]}, {"input": "741 806 424647372 965259389\r\n", "output": ["861647194"]}, {"input": "461 650 18427925 104278996\r\n", "output": ["936348652"]}, {"input": "589 790 462465375 766499149\r\n", "output": ["374887989"]}, {"input": "13 635 761278633 941090619\r\n", "output": ["893955177"]}, {"input": "140 713 711390561 727285861\r\n", "output": ["641355762"]}, {"input": "494587372 852064625 134519483 167992226\r\n", "output": ["552905694"]}, {"input": "672670796 425613469 728300037 940234946\r\n", "output": ["779704132"]}, {"input": "850754220 853938121 172337487 490664825\r\n", "output": ["237240423"]}, {"input": "28837644 722454262 471150744 905552093\r\n", "output": ["740846915"]}, {"input": "911953772 296003106 210155490 889555498\r\n", "output": ["225799480"]}, {"input": "795069900 869551950 803936044 964554424\r\n", "output": ["884379548"]}, {"input": "268120620 443100795 102749301 604856694\r\n", "output": ["834319192"]}, {"input": "151236748 16649639 841754047 855153000\r\n", "output": ["108988868"]}, {"input": "329320172 739941588 435534601 986184053\r\n", "output": ["425887732"]}, {"input": "1000000000 1 1000000000 1000000000\r\n", "output": ["1"]}, {"input": "1 1000000000 1 1000000000\r\n", "output": ["285141888"]}, {"input": "407070359 971940670 264302148 270591105\r\n", "output": ["992759231"]}, {"input": "290186487 840456810 858082702 987072033\r\n", "output": ["366829057"]}, {"input": "763237207 414005655 302120151 421405724\r\n", "output": ["193545831"]}, {"input": "646353335 282521795 600933409 772270276\r\n", "output": ["13680108"]}, {"input": "824436759 415879151 194713963 293553316\r\n", "output": ["453443939"]}, {"input": "707552887 989427996 933718708 955125306\r\n", "output": ["355610620"]}, {"input": "885636311 857944136 232531966 493119835\r\n", "output": ["779245677"]}, {"input": "63719735 431492981 971536712 994663491\r\n", "output": ["97582142"]}, {"input": "946835863 300009121 565317265 947272048\r\n", "output": ["337235143"]}, {"input": "124919287 578590669 9354715 32571540\r\n", "output": ["263200129"]}, {"input": "202669473 255300152 987865366 994537507\r\n", "output": ["926661352"]}, {"input": "2 2 1 998244353\r\n", "output": ["499122177"]}, {"input": "2 3 1 998244353\r\n", "output": ["499122177"]}, {"input": "3 3 1 998244353\r\n", "output": ["0"]}, {"input": "1000000000 1000000000 1 998244353\r\n", "output": ["499122177"]}, {"input": "999999999 999999999 1 998244353\r\n", "output": ["0"]}, {"input": "999999999 1000000000 1755648 1000000000\r\n", "output": ["499122177"]}, {"input": "1 2 1 86583718\r\n", "output": ["499122176"]}, {"input": "1 2 1 911660635\r\n", "output": ["0"]}, {"input": "2 2 2 4\r\n", "output": ["41"]}, {"input": "2 2 2 5\r\n", "output": ["128"]}, {"input": "2 2 3 4\r\n", "output": ["8"]}, {"input": "2 2 3 5\r\n", "output": ["41"]}, {"input": "2 3 2 4\r\n", "output": ["365"]}, {"input": "2 3 2 5\r\n", "output": ["2048"]}, {"input": "2 3 3 4\r\n", "output": ["32"]}, {"input": "2 3 3 5\r\n", "output": ["365"]}, {"input": "3 2 2 4\r\n", "output": ["365"]}, {"input": "3 2 2 5\r\n", "output": ["2048"]}, {"input": "3 2 3 4\r\n", "output": ["32"]}, {"input": "3 2 3 5\r\n", "output": ["365"]}, {"input": "3 3 2 4\r\n", "output": ["19683"]}, {"input": "3 3 2 5\r\n", "output": ["262144"]}, {"input": "3 3 3 4\r\n", "output": ["512"]}, {"input": "3 3 3 5\r\n", "output": ["19683"]}, {"input": "998244352 2 1 998244353\r\n", "output": ["499122177"]}, {"input": "3 3 1 1\r\n", "output": ["1"]}]

[{'input': '3 2 2 5\r\n', 'output': ['2048']}, {'input': '646353335 282521795 600933409 772270276\r\n', 'output': ['13680108']}, {'input': '461 650 18427925 104278996\r\n', 'output': ['936348652']}, {'input': '999999999 999999999 1 998244353\r\n', 'output': ['0']}, {'input': '2 3 3 4\r\n', 'output': ['32']}]

[{'input': '268120620 443100795 102749301 604856694\r\n', 'output': ['834319192']}, {'input': '2 3 3 5\r\n', 'output': ['365']}, {'input': '795069900 869551950 803936044 964554424\r\n', 'output': ['884379548']}, {'input': '202669473 255300152 987865366 994537507\r\n', 'output': ['926661352']}, {'input': '124919287 578590669 9354715 32571540\r\n', 'output': ['263200129']}]

[{'input': '824436759 415879151 194713963 293553316\r\n', 'output': ['453443939']}, {'input': '2 3 2 4\r\n', 'output': ['365']}, {'input': '63719735 431492981 971536712 994663491\r\n', 'output': ['97582142']}, {'input': '741 806 424647372 965259389\r\n', 'output': ['861647194']}, {'input': '1 1000000000 1 1000000000\r\n', 'output': ['285141888']}]

[{'input': '564 558 305171115 960941497\r\n', 'output': ['880111542']}, {'input': '999999999 999999999 1 998244353\r\n', 'output': ['0']}, {'input': '3 3 3 4\r\n', 'output': ['512']}, {'input': '1 2 1 2\r\n', 'output': ['2']}, {'input': '2 2 1 998244353\r\n', 'output': ['499122177']}]

[{'input': '3 2 3 4\r\n', 'output': ['32']}, {'input': '3 2 2 4\r\n', 'output': ['365']}, {'input': '63719735 431492981 971536712 994663491\r\n', 'output': ['97582142']}, {'input': '3 3 3 4\r\n', 'output': ['512']}, {'input': '2 3 1 998244353\r\n', 'output': ['499122177']}]

["0 1 1 0 0 0 0 0 0 7 0 0 0 0", "5 1 1 1 1 0 0 0 0 0 0 0 0 0"]

The only line contains 14 integers $$$a_1, a_2, \ldots, a_{14}$$$ ($$$0 \leq a_i \leq 10^9$$$) — the number of stones in each hole. It is guaranteed that for any $$$i$$$ ($$$1\leq i \leq 14$$$) $$$a_i$$$ is either zero or odd, and there is at least one stone in the board.

1ac11153e35509e755ea15f1d57d156b

A=list(map(int,input().split())) score=0 for i in range(14): score=max(score,sum([j for j in [(A[j] if i!=j else 0)+A[i]//14+(1 if (j+13-i)%14<A[i]%14 else 0) for j in range(14)] if j%2==0])) print(score)

["4", "8"]

Python

NoteIn the first test case the board after the move from the hole with $$$7$$$ stones will look like 1 2 2 0 0 0 0 0 0 0 1 1 1 1. Then the player collects the even numbers and ends up with a score equal to $$$4$$$.

Output one integer, the maximum possible score after one move.

Mancala is a game famous in the Middle East. It is played on a board that consists of 14 holes. Initially, each hole has $$$a_i$$$ stones. When a player makes a move, he chooses a hole which contains a positive number of stones. He takes all the stones inside it and then redistributes these stones one by one in the next holes in a counter-clockwise direction.Note that the counter-clockwise order means if the player takes the stones from hole $$$i$$$, he will put one stone in the $$$(i+1)$$$-th hole, then in the $$$(i+2)$$$-th, etc. If he puts a stone in the $$$14$$$-th hole, the next one will be put in the first hole.After the move, the player collects all the stones from holes that contain even number of stones. The number of stones collected by player is the score, according to Resli.Resli is a famous Mancala player. He wants to know the maximum score he can obtain after one move.

[{"input": "0 1 1 0 0 0 0 0 0 7 0 0 0 0\r\n", "output": ["4"]}, {"input": "5 1 1 1 1 0 0 0 0 0 0 0 0 0\r\n", "output": ["8"]}, {"input": "10001 10001 10001 10001 10001 10001 10001 10001 10001 10001 10001 10001 10001 1\r\n", "output": ["54294"]}, {"input": "0 0 0 0 0 0 0 0 0 0 0 0 0 15\r\n", "output": ["2"]}, {"input": "1 0 0 0 0 1 0 0 0 0 1 0 0 0\r\n", "output": ["0"]}, {"input": "5 5 1 1 1 3 3 3 5 7 5 3 7 5\r\n", "output": ["38"]}, {"input": "787 393 649 463 803 365 81 961 989 531 303 407 579 915\r\n", "output": ["7588"]}, {"input": "8789651 4466447 1218733 6728667 1796977 6198853 8263135 6309291 8242907 7136751 3071237 5397369 6780785 9420869\r\n", "output": ["81063456"]}, {"input": "0 0 0 0 0 0 0 0 0 0 0 0 0 29\r\n", "output": ["26"]}, {"input": "282019717 109496191 150951267 609856495 953855615 569750143 6317733 255875779 645191029 572053369 290936613 338480779 879775193 177172893\r\n", "output": ["5841732816"]}, {"input": "105413505 105413505 105413505 105413505 105413505 105413505 105413505 105413505 105413505 105413505 105413505 105413505 105413505 105413505\r\n", "output": ["120472578"]}, {"input": "404418821 993626161 346204297 122439813 461187221 628048227 625919459 628611733 938993057 701270099 398043779 684205961 630975553 575964835\r\n", "output": ["8139909016"]}, {"input": "170651077 730658441 824213789 583764177 129437345 717005779 675398017 314979709 380861369 265878463 746564659 797260041 506575735 335169317\r\n", "output": ["6770880638"]}, {"input": "622585025 48249287 678950449 891575125 637411965 457739735 829353393 235216425 284006447 875591469 492839209 296444305 513776057 810057753\r\n", "output": ["7673796644"]}, {"input": "475989857 930834747 786217439 927967137 489188151 869354161 276693267 56154399 131055697 509249443 143116853 426254423 44465165 105798821\r\n", "output": ["6172339560"]}, {"input": "360122921 409370351 226220005 604004145 85173909 600403773 624052991 138163383 729239967 189036661 619842883 270087537 749500483 243727913\r\n", "output": ["5848946922"]}, {"input": "997102881 755715147 273805839 436713689 547411799 72470207 522269145 647688957 137422311 422612659 197751751 679663349 821420227 387967237\r\n", "output": ["6900015198"]}, {"input": "690518849 754551537 652949719 760695679 491633619 477564457 11669279 700467439 470069297 782338983 718169393 884421719 24619427 215745577\r\n", "output": ["7635414974"]}, {"input": "248332749 486342237 662201929 917696895 555278549 252122023 850296207 463343655 832574345 954281071 168282553 825538865 996753493 461254663\r\n", "output": ["6400166934"]}, {"input": "590789361 636464947 404477303 337309187 476703809 426863069 120608741 703406277 645444697 761482231 996635839 33459441 677458865 483861751\r\n", "output": ["7294965518"]}, {"input": "297857621 238127103 749085829 139033277 597985489 202617713 982184715 183932743 278551059 297781685 330124279 338959601 682874531 187519685\r\n", "output": ["5201808164"]}, {"input": "1 1 1 1 1 0 0 0 0 0 0 0 0 0\r\n", "output": ["2"]}, {"input": "1 1 0 0 0 0 0 0 0 0 0 0 0 0\r\n", "output": ["2"]}, {"input": "1 1 1 1 1 1 1 1 1 1 1 1 1 1\r\n", "output": ["2"]}, {"input": "1 0 0 0 0 0 0 0 0 0 0 0 0 1\r\n", "output": ["2"]}, {"input": "0 0 0 0 0 0 0 0 0 0 0 0 1 1\r\n", "output": ["2"]}]

[{'input': '475989857 930834747 786217439 927967137 489188151 869354161 276693267 56154399 131055697 509249443 143116853 426254423 44465165 105798821\r\n', 'output': ['6172339560']}, {'input': '360122921 409370351 226220005 604004145 85173909 600403773 624052991 138163383 729239967 189036661 619842883 270087537 749500483 243727913\r\n', 'output': ['5848946922']}, {'input': '0 0 0 0 0 0 0 0 0 0 0 0 0 29\r\n', 'output': ['26']}, {'input': '248332749 486342237 662201929 917696895 555278549 252122023 850296207 463343655 832574345 954281071 168282553 825538865 996753493 461254663\r\n', 'output': ['6400166934']}, {'input': '997102881 755715147 273805839 436713689 547411799 72470207 522269145 647688957 137422311 422612659 197751751 679663349 821420227 387967237\r\n', 'output': ['6900015198']}]

[{'input': '1 0 0 0 0 1 0 0 0 0 1 0 0 0\r\n', 'output': ['0']}, {'input': '590789361 636464947 404477303 337309187 476703809 426863069 120608741 703406277 645444697 761482231 996635839 33459441 677458865 483861751\r\n', 'output': ['7294965518']}, {'input': '170651077 730658441 824213789 583764177 129437345 717005779 675398017 314979709 380861369 265878463 746564659 797260041 506575735 335169317\r\n', 'output': ['6770880638']}, {'input': '0 0 0 0 0 0 0 0 0 0 0 0 0 15\r\n', 'output': ['2']}, {'input': '0 1 1 0 0 0 0 0 0 7 0 0 0 0\r\n', 'output': ['4']}]

[{'input': '1 1 0 0 0 0 0 0 0 0 0 0 0 0\r\n', 'output': ['2']}, {'input': '0 1 1 0 0 0 0 0 0 7 0 0 0 0\r\n', 'output': ['4']}, {'input': '105413505 105413505 105413505 105413505 105413505 105413505 105413505 105413505 105413505 105413505 105413505 105413505 105413505 105413505\r\n', 'output': ['120472578']}, {'input': '622585025 48249287 678950449 891575125 637411965 457739735 829353393 235216425 284006447 875591469 492839209 296444305 513776057 810057753\r\n', 'output': ['7673796644']}, {'input': '690518849 754551537 652949719 760695679 491633619 477564457 11669279 700467439 470069297 782338983 718169393 884421719 24619427 215745577\r\n', 'output': ['7635414974']}]

[{'input': '787 393 649 463 803 365 81 961 989 531 303 407 579 915\r\n', 'output': ['7588']}, {'input': '590789361 636464947 404477303 337309187 476703809 426863069 120608741 703406277 645444697 761482231 996635839 33459441 677458865 483861751\r\n', 'output': ['7294965518']}, {'input': '105413505 105413505 105413505 105413505 105413505 105413505 105413505 105413505 105413505 105413505 105413505 105413505 105413505 105413505\r\n', 'output': ['120472578']}, {'input': '8789651 4466447 1218733 6728667 1796977 6198853 8263135 6309291 8242907 7136751 3071237 5397369 6780785 9420869\r\n', 'output': ['81063456']}, {'input': '5 5 1 1 1 3 3 3 5 7 5 3 7 5\r\n', 'output': ['38']}]

[{'input': '1 1 1 1 1 1 1 1 1 1 1 1 1 1\r\n', 'output': ['2']}, {'input': '0 0 0 0 0 0 0 0 0 0 0 0 1 1\r\n', 'output': ['2']}, {'input': '787 393 649 463 803 365 81 961 989 531 303 407 579 915\r\n', 'output': ['7588']}, {'input': '0 1 1 0 0 0 0 0 0 7 0 0 0 0\r\n', 'output': ['4']}, {'input': '5 1 1 1 1 0 0 0 0 0 0 0 0 0\r\n', 'output': ['8']}]

["abcd", "ababa", "zzz"]

The first input line contains the string. It's guaranteed, that the string is non-empty, consists of lower-case Latin letters, and its length doesn't exceed 100.

13b5cf94f2fabd053375a5ccf3fd44c7

S = input() ans = 0 met = set() for i in range(len(S)): for j in range(i, -1, -1): if S[j:i+1] in met: ans = max(ans, i - j + 1) else: met.add(S[j:i+1]) print(ans)

["0", "3", "2"]

Python

Output one number — length of the longest substring that can be met in the string at least twice.

You're given a string of lower-case Latin letters. Your task is to find the length of its longest substring that can be met in the string at least twice. These occurrences can overlap (see sample test 2).

[{"input": "abcd\r\n", "output": ["0"]}, {"input": "ababa\r\n", "output": ["3"]}, {"input": "zzz\r\n", "output": ["2"]}, {"input": "kmmm\r\n", "output": ["2"]}, {"input": "wzznz\r\n", "output": ["1"]}, {"input": "qlzazaaqll\r\n", "output": ["2"]}, {"input": "lzggglgpep\r\n", "output": ["2"]}, {"input": "iegdlraaidefgegiagrdfhihe\r\n", "output": ["2"]}, {"input": "esxpqmdrtidgtkxojuxyrcwxlycywtzbjzpxvbngnlepgzcaeg\r\n", "output": ["1"]}, {"input": "garvpaimjdjiivamusjdwfcaoswuhxyyxvrxzajoyihggvuxumaadycfphrzbprraicvjjlsdhojihaw\r\n", "output": ["2"]}, {"input": "ckvfndqgkmhcyojaqgdkenmbexufryhqejdhctxujmtrwkpbqxufxamgoeigzfyzbhevpbkvviwntdhqscvkmphnkkljizndnbjt\r\n", "output": ["3"]}, {"input": "bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb\r\n", "output": ["99"]}, {"input": "ikiikiikikiiikkkkkikkkkiiiiikkiiikkiikiikkkkikkkikikkikiiikkikikiiikikkkiiikkkikkikkikkkkiiikkiiiiii\r\n", "output": ["10"]}, {"input": "ovovhoovvhohhhvhhvhhvhovoohovhhoooooovohvooooohvvoooohvvovhhvhovhhvoovhvhvoovovvhooovhhooovohvhhovhv\r\n", "output": ["8"]}, {"input": "ccwckkkycccccckwckwkwkwkkkkyycykcccycyckwywcckwykcycykkkwcycwwcykcwkwkwwykwkwcykywwwyyykckkyycckwcwk\r\n", "output": ["5"]}, {"input": "ttketfkefktfztezzkzfkkeetkkfktftzktezekkeezkeeetteeteefetefkzzzetekfftkeffzkktffzkzzeftfeezfefzffeef\r\n", "output": ["4"]}, {"input": "rtharczpfznrgdnkltchafduydgbgkdjqrmjqyfmpwjwphrtsjbmswkanjlprbnduaqbcjqxlxmkspkhkcnzbqwxonzxxdmoigti\r\n", "output": ["2"]}, {"input": "fplrkfklvwdeiynbjgaypekambmbjfnoknlhczhkdmljicookdywdgpnlnqlpunnkebnikgcgcjefeqhknvlynmvjcegvcdgvvdb\r\n", "output": ["2"]}, {"input": "txbciieycswqpniwvzipwlottivvnfsysgzvzxwbctcchfpvlbcjikdofhpvsknptpjdbxemtmjcimetkemdbettqnbvzzbdyxxb\r\n", "output": ["2"]}, {"input": "fmubmfwefikoxtqvmaavwjxmoqltapexkqxcsztpezfcltqavuicefxovuswmqimuikoppgqpiapqutkczgcvxzutavkujxvpklv\r\n", "output": ["3"]}, {"input": "ipsrjylhpkjvlzncfixipstwcicxqygqcfrawpzzvckoveyqhathglblhpkjvlzncfixipfajaqobtzvthmhgbuawoxoknirclxg\r\n", "output": ["15"]}, {"input": "kcnjsntjzcbgzjscrsrjkrbytqsrptzspzctjrorsyggrtkcnjsntjzcbgzjscrsrjyqbrtpcgqirsrrjbbbrnyqstnrozcoztt\r\n", "output": ["20"]}, {"input": "unhcfnrhsqetuerjqcetrhlsqgfnqfntvkgxsscquolxxroqgtchffyccetrhlsqgfnqfntvkgxsscquolxxroqgtchffhfqvx\r\n", "output": ["37"]}, {"input": "kkcckkccckkcckcccckcckkkkcckkkkckkkcckckkkkkckkkkkcckkccckkcckcccckcckkkkcckkkkckkkcckckkkkkckckckkc\r\n", "output": ["46"]}, {"input": "mlhsyijxeydqxhtkmpdeqwzogjvxahmssyhfhqessbxzvydbrxdmlhsyijxeydqxhtkmpdeqwzogjvxahmssyhfhqessbxzvydik\r\n", "output": ["47"]}, {"input": "abcdefghijklmnopqrstuvwxyz\r\n", "output": ["0"]}, {"input": "tttttbttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttmttttttt\r\n", "output": ["85"]}, {"input": "ffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffbfffffffffffffffffffffffffffffffffffff\r\n", "output": ["61"]}, {"input": "cccccccccccccccccccccccwcccccccccccccccccccccuccccccccccccccnccccccccccccccccccccccccccccccccccccccc\r\n", "output": ["38"]}, {"input": "ffffffffffffffffffffffffffufffgfffffffffffffffffffffffffffffffffffffffgffffffftffffffgffffffffffffff\r\n", "output": ["38"]}, {"input": "rrrrrrrrrrrrrrrrrrrlhbrrrrrrrrurrrrrrrfrrqrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrewrrrrrrryrrxrrrrrrrrrrr\r\n", "output": ["33"]}, {"input": "vyvvvvvvvvzvvvvvzvvvwvvvvrvvvvvvvvvvvvvvvrvvvvvvvvvpkvvpvgvvvvvvvvvvvvvgvvvvvvvvvvvvvvvvvvysvvvbvvvv\r\n", "output": ["17"]}, {"input": "cbubbbbbbbbbbfbbbbbbbbjbobbbbbbbbbbibbubbbbjbbbnzgbbzbbfbbbbbbbbbbbfbpbbbbbbbbbbygbbbgbabbbbbbbhibbb\r\n", "output": ["12"]}, {"input": "lrqrrrrrrrjrrrrrcdrrgrrmwvrrrrrrrrrxfzrmrmrryrrrurrrdrrrrrrrrrrererrrsrrrrrrrrrrrqrrrrcrrwjsrrlrrrrr\r\n", "output": ["10"]}, {"input": "ssssusisisosscssssztzessssyspskjssvosiissussszsosssslsssdsssvssvsssslsssmsfjasjsssssowscsjsssszsspss\r\n", "output": ["8"]}, {"input": "uukuuuumueuuuujuukgdhbztuuuubbguuocuozfaunqufjujuguyuuvkuuauubuubuucuvtjuuuuuusduduuuuuuuueunuuuuuzu\r\n", "output": ["7"]}, {"input": "jpkkgwklngwqcfzmwkkpcwkkkkkekkkekkkdsykqwjkkkhkkkxdnukkkkkkmkqykkkxqklkskkrkkkkkqqjikkkkkkpknkkkkkoh\r\n", "output": ["7"]}, {"input": "bmzbbfbbhqxwthtbbisbbbbbtbbfbbpbfbbpbkbjfbcbbbbzbbbdwmbbbrnvqdbbtbbuglrnbbbbvmbyblebbabibrevaxbbjbqb\r\n", "output": ["6"]}, {"input": "qqqmqqqsbteqqopsuqiqumrqzpqnqgqeniqqkyqqyqqqpxzqeqqquhdqquhqqqfqjirqaqqaquxqoqqjqqqqbjbgqcqqqqicnkqc\r\n", "output": ["4"]}, {"input": "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaasaaaavaaaaaaauaaeaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa\r\n", "output": ["44"]}, {"input": "a\r\n", "output": ["0"]}, {"input": "fg\r\n", "output": ["0"]}, {"input": "yy\r\n", "output": ["1"]}, {"input": "abcabcabc\r\n", "output": ["6"]}, {"input": "qwerqwedqwes\r\n", "output": ["3"]}]

[{'input': 'abcd\r\n', 'output': ['0']}, {'input': 'rrrrrrrrrrrrrrrrrrrlhbrrrrrrrrurrrrrrrfrrqrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrewrrrrrrryrrxrrrrrrrrrrr\r\n', 'output': ['33']}, {'input': 'ababa\r\n', 'output': ['3']}, {'input': 'ikiikiikikiiikkkkkikkkkiiiiikkiiikkiikiikkkkikkkikikkikiiikkikikiiikikkkiiikkkikkikkikkkkiiikkiiiiii\r\n', 'output': ['10']}, {'input': 'lzggglgpep\r\n', 'output': ['2']}]

[{'input': 'qlzazaaqll\r\n', 'output': ['2']}, {'input': 'kmmm\r\n', 'output': ['2']}, {'input': 'qqqmqqqsbteqqopsuqiqumrqzpqnqgqeniqqkyqqyqqqpxzqeqqquhdqquhqqqfqjirqaqqaquxqoqqjqqqqbjbgqcqqqqicnkqc\r\n', 'output': ['4']}, {'input': 'a\r\n', 'output': ['0']}, {'input': 'ipsrjylhpkjvlzncfixipstwcicxqygqcfrawpzzvckoveyqhathglblhpkjvlzncfixipfajaqobtzvthmhgbuawoxoknirclxg\r\n', 'output': ['15']}]

[{'input': 'lrqrrrrrrrjrrrrrcdrrgrrmwvrrrrrrrrrxfzrmrmrryrrrurrrdrrrrrrrrrrererrrsrrrrrrrrrrrqrrrrcrrwjsrrlrrrrr\r\n', 'output': ['10']}, {'input': 'kkcckkccckkcckcccckcckkkkcckkkkckkkcckckkkkkckkkkkcckkccckkcckcccckcckkkkcckkkkckkkcckckkkkkckckckkc\r\n', 'output': ['46']}, {'input': 'jpkkgwklngwqcfzmwkkpcwkkkkkekkkekkkdsykqwjkkkhkkkxdnukkkkkkmkqykkkxqklkskkrkkkkkqqjikkkkkkpknkkkkkoh\r\n', 'output': ['7']}, {'input': 'bmzbbfbbhqxwthtbbisbbbbbtbbfbbpbfbbpbkbjfbcbbbbzbbbdwmbbbrnvqdbbtbbuglrnbbbbvmbyblebbabibrevaxbbjbqb\r\n', 'output': ['6']}, {'input': 'zzz\r\n', 'output': ['2']}]

[{'input': 'ipsrjylhpkjvlzncfixipstwcicxqygqcfrawpzzvckoveyqhathglblhpkjvlzncfixipfajaqobtzvthmhgbuawoxoknirclxg\r\n', 'output': ['15']}, {'input': 'tttttbttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttmttttttt\r\n', 'output': ['85']}, {'input': 'wzznz\r\n', 'output': ['1']}, {'input': 'bmzbbfbbhqxwthtbbisbbbbbtbbfbbpbfbbpbkbjfbcbbbbzbbbdwmbbbrnvqdbbtbbuglrnbbbbvmbyblebbabibrevaxbbjbqb\r\n', 'output': ['6']}, {'input': 'cbubbbbbbbbbbfbbbbbbbbjbobbbbbbbbbbibbubbbbjbbbnzgbbzbbfbbbbbbbbbbbfbpbbbbbbbbbbygbbbgbabbbbbbbhibbb\r\n', 'output': ['12']}]

[{'input': 'aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaasaaaavaaaaaaauaaeaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa\r\n', 'output': ['44']}, {'input': 'cbubbbbbbbbbbfbbbbbbbbjbobbbbbbbbbbibbubbbbjbbbnzgbbzbbfbbbbbbbbbbbfbpbbbbbbbbbbygbbbgbabbbbbbbhibbb\r\n', 'output': ['12']}, {'input': 'qqqmqqqsbteqqopsuqiqumrqzpqnqgqeniqqkyqqyqqqpxzqeqqquhdqquhqqqfqjirqaqqaquxqoqqjqqqqbjbgqcqqqqicnkqc\r\n', 'output': ['4']}, {'input': 'kmmm\r\n', 'output': ['2']}, {'input': 'kkcckkccckkcckcccckcckkkkcckkkkckkkcckckkkkkckkkkkcckkccckkcckcccckcckkkkcckkkkckkkcckckkkkkckckckkc\r\n', 'output': ['46']}]

["10 5", "-10 5"]

The first line contains two integers x, y ( - 109 ≤ x, y ≤ 109, x ≠ 0, y ≠ 0).

e2f15a9d9593eec2e19be3140a847712

x,y = map(int,input().split()) if x > 0 and y > 0: print(0, x + y, x + y, 0) elif x < 0 and y > 0: print(-y + x, 0, 0,-x + y) elif x > 0 and y < 0: print(0, y - x, x - y, 0) else: print(x + y, 0,0, x + y)

["0 15 15 0", "-15 0 0 15"]

Python

NoteFigure to the first sample

Print in the single line four integers x1, y1, x2, y2 — the coordinates of the required points.

Vasily the bear has a favorite rectangle, it has one vertex at point (0, 0), and the opposite vertex at point (x, y). Of course, the sides of Vasya's favorite rectangle are parallel to the coordinate axes. Vasya also loves triangles, if the triangles have one vertex at point B = (0, 0). That's why today he asks you to find two points A = (x1, y1) and C = (x2, y2), such that the following conditions hold: the coordinates of points: x1, x2, y1, y2 are integers. Besides, the following inequation holds: x1 &lt; x2; the triangle formed by point A, B and C is rectangular and isosceles ( is right); all points of the favorite rectangle are located inside or on the border of triangle ABC; the area of triangle ABC is as small as possible. Help the bear, find the required points. It is not so hard to proof that these points are unique.

[{"input": "10 5\r\n", "output": ["0 15 15 0"]}, {"input": "-10 5\r\n", "output": ["-15 0 0 15"]}, {"input": "20 -10\r\n", "output": ["0 -30 30 0"]}, {"input": "-10 -1000000000\r\n", "output": ["-1000000010 0 0 -1000000010"]}, {"input": "-1000000000 -1000000000\r\n", "output": ["-2000000000 0 0 -2000000000"]}, {"input": "1000000000 1000000000\r\n", "output": ["0 2000000000 2000000000 0"]}, {"input": "-123131 3123141\r\n", "output": ["-3246272 0 0 3246272"]}, {"input": "-23423 -243242423\r\n", "output": ["-243265846 0 0 -243265846"]}, {"input": "123112 4560954\r\n", "output": ["0 4684066 4684066 0"]}, {"input": "1321 -23131\r\n", "output": ["0 -24452 24452 0"]}, {"input": "1000000000 999999999\r\n", "output": ["0 1999999999 1999999999 0"]}, {"input": "54543 432423\r\n", "output": ["0 486966 486966 0"]}, {"input": "1 1\r\n", "output": ["0 2 2 0"]}, {"input": "-1 -1\r\n", "output": ["-2 0 0 -2"]}, {"input": "-1 1\r\n", "output": ["-2 0 0 2"]}, {"input": "1 -1\r\n", "output": ["0 -2 2 0"]}, {"input": "42 -2\r\n", "output": ["0 -44 44 0"]}, {"input": "2 -435\r\n", "output": ["0 -437 437 0"]}, {"input": "76 -76\r\n", "output": ["0 -152 152 0"]}, {"input": "1000000000 1\r\n", "output": ["0 1000000001 1000000001 0"]}, {"input": "1000000000 -1\r\n", "output": ["0 -1000000001 1000000001 0"]}, {"input": "-1000000000 1\r\n", "output": ["-1000000001 0 0 1000000001"]}, {"input": "-1000000000 -1\r\n", "output": ["-1000000001 0 0 -1000000001"]}, {"input": "1000000000 -999999999\r\n", "output": ["0 -1999999999 1999999999 0"]}, {"input": "-1000000000 999999999\r\n", "output": ["-1999999999 0 0 1999999999"]}, {"input": "-1000000000 -999999999\r\n", "output": ["-1999999999 0 0 -1999999999"]}, {"input": "999999999 1000000000\r\n", "output": ["0 1999999999 1999999999 0"]}, {"input": "-999999999 1000000000\r\n", "output": ["-1999999999 0 0 1999999999"]}, {"input": "999999999 -1000000000\r\n", "output": ["0 -1999999999 1999999999 0"]}, {"input": "-999999999 -1000000000\r\n", "output": ["-1999999999 0 0 -1999999999"]}]

[{'input': '1000000000 1\r\n', 'output': ['0 1000000001 1000000001 0']}, {'input': '-10 5\r\n', 'output': ['-15 0 0 15']}, {'input': '1000000000 -1\r\n', 'output': ['0 -1000000001 1000000001 0']}, {'input': '42 -2\r\n', 'output': ['0 -44 44 0']}, {'input': '1 -1\r\n', 'output': ['0 -2 2 0']}]

[{'input': '-10 -1000000000\r\n', 'output': ['-1000000010 0 0 -1000000010']}, {'input': '-10 5\r\n', 'output': ['-15 0 0 15']}, {'input': '-999999999 1000000000\r\n', 'output': ['-1999999999 0 0 1999999999']}, {'input': '-1000000000 -999999999\r\n', 'output': ['-1999999999 0 0 -1999999999']}, {'input': '10 5\r\n', 'output': ['0 15 15 0']}]

[{'input': '-1000000000 -1\r\n', 'output': ['-1000000001 0 0 -1000000001']}, {'input': '-1 1\r\n', 'output': ['-2 0 0 2']}, {'input': '-10 -1000000000\r\n', 'output': ['-1000000010 0 0 -1000000010']}, {'input': '999999999 1000000000\r\n', 'output': ['0 1999999999 1999999999 0']}, {'input': '-1000000000 999999999\r\n', 'output': ['-1999999999 0 0 1999999999']}]

[{'input': '2 -435\r\n', 'output': ['0 -437 437 0']}, {'input': '1000000000 1\r\n', 'output': ['0 1000000001 1000000001 0']}, {'input': '54543 432423\r\n', 'output': ['0 486966 486966 0']}, {'input': '20 -10\r\n', 'output': ['0 -30 30 0']}, {'input': '-1 1\r\n', 'output': ['-2 0 0 2']}]

[{'input': '76 -76\r\n', 'output': ['0 -152 152 0']}, {'input': '20 -10\r\n', 'output': ['0 -30 30 0']}, {'input': '-123131 3123141\r\n', 'output': ['-3246272 0 0 3246272']}, {'input': '1000000000 999999999\r\n', 'output': ['0 1999999999 1999999999 0']}, {'input': '1321 -23131\r\n', 'output': ['0 -24452 24452 0']}]

["4 4 0\n2 1 2", "5 6 1\n2 7 2", "3 3 3\n2 2 2"]

The first line of the input contains three integers a, b and c (0 ≤ a, b, c ≤ 1 000 000) — the number of blue, violet and orange spheres that are in the magician's disposal. The second line of the input contains three integers, x, y and z (0 ≤ x, y, z ≤ 1 000 000) — the number of blue, violet and orange spheres that he needs to get.

1db4ba9dc1000e26532bb73336cf12c3

a, b, c =[int(q) for q in input().split()] x, y, z =[int(q) for q in input().split()] if a>=x: a -=x x=0 else: x -=a a=0 if b>=y: b -=y y=0 else: y -=b b=0 if c>=z: c -=z z=0 else: z -=c c=0 if x+y+z<=a//2+b//2+c//2: print("Yes") else: print("No")

["Yes", "No", "Yes"]

Python

NoteIn the first sample the wizard has 4 blue and 4 violet spheres. In his first action he can turn two blue spheres into one violet one. After that he will have 2 blue and 5 violet spheres. Then he turns 4 violet spheres into 2 orange spheres and he ends up with 2 blue, 1 violet and 2 orange spheres, which is exactly what he needs.

If the wizard is able to obtain the required numbers of spheres, print "Yes". Otherwise, print "No".

Carl is a beginner magician. He has a blue, b violet and c orange magic spheres. In one move he can transform two spheres of the same color into one sphere of any other color. To make a spell that has never been seen before, he needs at least x blue, y violet and z orange spheres. Can he get them (possible, in multiple actions)?

[{"input": "4 4 0\r\n2 1 2\r\n", "output": ["YES", "Yes"]}, {"input": "5 6 1\r\n2 7 2\r\n", "output": ["No", "NO"]}, {"input": "3 3 3\r\n2 2 2\r\n", "output": ["YES", "Yes"]}, {"input": "0 0 0\r\n0 0 0\r\n", "output": ["YES", "Yes"]}, {"input": "0 0 0\r\n0 0 1\r\n", "output": ["No", "NO"]}, {"input": "0 1 0\r\n0 0 0\r\n", "output": ["YES", "Yes"]}, {"input": "1 0 0\r\n1 0 0\r\n", "output": ["YES", "Yes"]}, {"input": "2 2 1\r\n1 1 2\r\n", "output": ["No", "NO"]}, {"input": "1 3 1\r\n2 1 1\r\n", "output": ["YES", "Yes"]}, {"input": "1000000 1000000 1000000\r\n1000000 1000000 1000000\r\n", "output": ["YES", "Yes"]}, {"input": "1000000 500000 500000\r\n0 750000 750000\r\n", "output": ["YES", "Yes"]}, {"input": "500000 1000000 500000\r\n750001 0 750000\r\n", "output": ["No", "NO"]}, {"input": "499999 500000 1000000\r\n750000 750000 0\r\n", "output": ["No", "NO"]}, {"input": "500000 500000 0\r\n0 0 500000\r\n", "output": ["YES", "Yes"]}, {"input": "0 500001 499999\r\n500000 0 0\r\n", "output": ["No", "NO"]}, {"input": "1000000 500000 1000000\r\n500000 1000000 500000\r\n", "output": ["YES", "Yes"]}, {"input": "1000000 1000000 499999\r\n500000 500000 1000000\r\n", "output": ["No", "NO"]}, {"input": "500000 1000000 1000000\r\n1000000 500001 500000\r\n", "output": ["No", "NO"]}, {"input": "1000000 500000 500000\r\n0 1000000 500000\r\n", "output": ["YES", "Yes"]}, {"input": "500000 500000 1000000\r\n500001 1000000 0\r\n", "output": ["No", "NO"]}, {"input": "500000 999999 500000\r\n1000000 0 500000\r\n", "output": ["No", "NO"]}, {"input": "4 0 3\r\n2 2 1\r\n", "output": ["YES", "Yes"]}, {"input": "0 2 4\r\n2 0 2\r\n", "output": ["YES", "Yes"]}, {"input": "3 1 0\r\n1 1 1\r\n", "output": ["YES", "Yes"]}, {"input": "4 4 1\r\n1 3 2\r\n", "output": ["YES", "Yes"]}, {"input": "1 2 4\r\n2 1 3\r\n", "output": ["No", "NO"]}, {"input": "1 1 0\r\n0 0 1\r\n", "output": ["No", "NO"]}, {"input": "4 0 0\r\n0 1 1\r\n", "output": ["YES", "Yes"]}, {"input": "0 3 0\r\n1 0 1\r\n", "output": ["No", "NO"]}, {"input": "0 0 3\r\n1 0 1\r\n", "output": ["YES", "Yes"]}, {"input": "1 12 1\r\n4 0 4\r\n", "output": ["YES", "Yes"]}, {"input": "4 0 4\r\n1 2 1\r\n", "output": ["YES", "Yes"]}, {"input": "4 4 0\r\n1 1 3\r\n", "output": ["No", "NO"]}, {"input": "0 9 0\r\n2 2 2\r\n", "output": ["No", "NO"]}, {"input": "0 10 0\r\n2 2 2\r\n", "output": ["YES", "Yes"]}, {"input": "9 0 9\r\n0 8 0\r\n", "output": ["YES", "Yes"]}, {"input": "0 9 9\r\n9 0 0\r\n", "output": ["No", "NO"]}, {"input": "9 10 0\r\n0 0 9\r\n", "output": ["YES", "Yes"]}, {"input": "10 0 9\r\n0 10 0\r\n", "output": ["No", "NO"]}, {"input": "0 10 10\r\n10 0 0\r\n", "output": ["YES", "Yes"]}, {"input": "10 10 0\r\n0 0 11\r\n", "output": ["No", "NO"]}, {"input": "307075 152060 414033\r\n381653 222949 123101\r\n", "output": ["No", "NO"]}, {"input": "569950 228830 153718\r\n162186 357079 229352\r\n", "output": ["No", "NO"]}, {"input": "149416 303568 749016\r\n238307 493997 190377\r\n", "output": ["No", "NO"]}, {"input": "438332 298094 225324\r\n194220 400244 245231\r\n", "output": ["No", "NO"]}, {"input": "293792 300060 511272\r\n400687 382150 133304\r\n", "output": ["No", "NO"]}, {"input": "295449 518151 368838\r\n382897 137148 471892\r\n", "output": ["No", "NO"]}, {"input": "191789 291147 691092\r\n324321 416045 176232\r\n", "output": ["YES", "Yes"]}, {"input": "286845 704749 266526\r\n392296 104421 461239\r\n", "output": ["YES", "Yes"]}, {"input": "135522 188282 377041\r\n245719 212473 108265\r\n", "output": ["YES", "Yes"]}, {"input": "404239 359124 133292\r\n180069 184791 332544\r\n", "output": ["No", "NO"]}, {"input": "191906 624432 244408\r\n340002 367217 205432\r\n", "output": ["No", "NO"]}, {"input": "275980 429361 101824\r\n274288 302579 166062\r\n", "output": ["No", "NO"]}, {"input": "136092 364927 395302\r\n149173 343146 390922\r\n", "output": ["No", "NO"]}, {"input": "613852 334661 146012\r\n363786 326286 275233\r\n", "output": ["No", "NO"]}, {"input": "348369 104625 525203\r\n285621 215396 366411\r\n", "output": ["No", "NO"]}, {"input": "225307 153572 114545\r\n154753 153282 149967\r\n", "output": ["YES", "Yes"]}, {"input": "438576 124465 629784\r\n375118 276028 390116\r\n", "output": ["YES", "Yes"]}, {"input": "447521 327510 158732\r\n395759 178458 259139\r\n", "output": ["YES", "Yes"]}, {"input": "8 5 5\r\n5 5 5\r\n", "output": ["YES", "Yes"]}, {"input": "100 100 100\r\n1 1 1\r\n", "output": ["YES", "Yes"]}, {"input": "100 100 100\r\n0 0 0\r\n", "output": ["YES", "Yes"]}, {"input": "3 2 3\r\n2 3 2\r\n", "output": ["No", "NO"]}, {"input": "5 4 3\r\n2 2 2\r\n", "output": ["YES", "Yes"]}, {"input": "14 9 8\r\n12 5 10\r\n", "output": ["YES", "Yes"]}, {"input": "10 10 10\r\n1 1 1\r\n", "output": ["YES", "Yes"]}, {"input": "6 3 3\r\n3 3 3\r\n", "output": ["YES", "Yes"]}, {"input": "10 0 4\r\n2 4 2\r\n", "output": ["YES", "Yes"]}, {"input": "100 100 100\r\n2 2 2\r\n", "output": ["YES", "Yes"]}, {"input": "4 6 0\r\n2 1 2\r\n", "output": ["YES", "Yes"]}, {"input": "4 6 3\r\n4 2 3\r\n", "output": ["YES", "Yes"]}, {"input": "5 5 5\r\n1 1 1\r\n", "output": ["YES", "Yes"]}, {"input": "41 17 34\r\n0 19 24\r\n", "output": ["YES", "Yes"]}, {"input": "8 8 8\r\n3 3 3\r\n", "output": ["YES", "Yes"]}, {"input": "7 7 1\r\n1 1 2\r\n", "output": ["YES", "Yes"]}, {"input": "6 6 0\r\n2 2 2\r\n", "output": ["YES", "Yes"]}, {"input": "5 5 5\r\n2 2 2\r\n", "output": ["YES", "Yes"]}, {"input": "400 400 400\r\n1 1 1\r\n", "output": ["YES", "Yes"]}, {"input": "4 4 4\r\n2 2 2\r\n", "output": ["YES", "Yes"]}]

[{'input': '438332 298094 225324\r\n194220 400244 245231\r\n', 'output': ['No', 'NO']}, {'input': '438576 124465 629784\r\n375118 276028 390116\r\n', 'output': ['YES', 'Yes']}, {'input': '0 10 10\r\n10 0 0\r\n', 'output': ['YES', 'Yes']}, {'input': '1 3 1\r\n2 1 1\r\n', 'output': ['YES', 'Yes']}, {'input': '2 2 1\r\n1 1 2\r\n', 'output': ['No', 'NO']}]

[{'input': '4 0 3\r\n2 2 1\r\n', 'output': ['YES', 'Yes']}, {'input': '6 3 3\r\n3 3 3\r\n', 'output': ['YES', 'Yes']}, {'input': '14 9 8\r\n12 5 10\r\n', 'output': ['YES', 'Yes']}, {'input': '293792 300060 511272\r\n400687 382150 133304\r\n', 'output': ['No', 'NO']}, {'input': '286845 704749 266526\r\n392296 104421 461239\r\n', 'output': ['YES', 'Yes']}]

[{'input': '348369 104625 525203\r\n285621 215396 366411\r\n', 'output': ['No', 'NO']}, {'input': '6 6 0\r\n2 2 2\r\n', 'output': ['YES', 'Yes']}, {'input': '0 2 4\r\n2 0 2\r\n', 'output': ['YES', 'Yes']}, {'input': '404239 359124 133292\r\n180069 184791 332544\r\n', 'output': ['No', 'NO']}, {'input': '41 17 34\r\n0 19 24\r\n', 'output': ['YES', 'Yes']}]

[{'input': '500000 500000 1000000\r\n500001 1000000 0\r\n', 'output': ['No', 'NO']}, {'input': '0 9 9\r\n9 0 0\r\n', 'output': ['No', 'NO']}, {'input': '1000000 500000 1000000\r\n500000 1000000 500000\r\n', 'output': ['YES', 'Yes']}, {'input': '4 4 0\r\n1 1 3\r\n', 'output': ['No', 'NO']}, {'input': '0 0 3\r\n1 0 1\r\n', 'output': ['YES', 'Yes']}]

[{'input': '1 12 1\r\n4 0 4\r\n', 'output': ['YES', 'Yes']}, {'input': '4 0 0\r\n0 1 1\r\n', 'output': ['YES', 'Yes']}, {'input': '5 5 5\r\n2 2 2\r\n', 'output': ['YES', 'Yes']}, {'input': '500000 500000 1000000\r\n500001 1000000 0\r\n', 'output': ['No', 'NO']}, {'input': '0 0 0\r\n0 0 1\r\n', 'output': ['No', 'NO']}]

["1 7 3 3", "7 7 7 7"]

The first line contains four space-separated integers s1, s2, s3, s4 (1 ≤ s1, s2, s3, s4 ≤ 109) — the colors of horseshoes Valera has. Consider all possible colors indexed with integers.

38c4864937e57b35d3cce272f655e20f

s = [int(i) for i in input().split()] m=0 for i in s: if s.count(i) >= 2: s = list(set(s)) m = len(s) if m == 4: print(0) elif m == 3: print(1) elif m == 2: print(2) else: print(3)

["1", "3"]

Python

Print a single integer — the minimum number of horseshoes Valera needs to buy.

Valera the Horse is going to the party with friends. He has been following the fashion trends for a while, and he knows that it is very popular to wear all horseshoes of different color. Valera has got four horseshoes left from the last year, but maybe some of them have the same color. In this case he needs to go to the store and buy some few more horseshoes, not to lose face in front of his stylish comrades.Fortunately, the store sells horseshoes of all colors under the sun and Valera has enough money to buy any four of them. However, in order to save the money, he would like to spend as little money as possible, so you need to help Valera and determine what is the minimum number of horseshoes he needs to buy to wear four horseshoes of different colors to a party.

[{"input": "1 7 3 3\r\n", "output": ["1"]}, {"input": "7 7 7 7\r\n", "output": ["3"]}, {"input": "81170865 673572653 756938629 995577259\r\n", "output": ["0"]}, {"input": "3491663 217797045 522540872 715355328\r\n", "output": ["0"]}, {"input": "251590420 586975278 916631563 586975278\r\n", "output": ["1"]}, {"input": "259504825 377489979 588153796 377489979\r\n", "output": ["1"]}, {"input": "652588203 931100304 931100304 652588203\r\n", "output": ["2"]}, {"input": "391958720 651507265 391958720 651507265\r\n", "output": ["2"]}, {"input": "90793237 90793237 90793237 90793237\r\n", "output": ["3"]}, {"input": "551651653 551651653 551651653 551651653\r\n", "output": ["3"]}, {"input": "156630260 609654355 668943582 973622757\r\n", "output": ["0"]}, {"input": "17061017 110313588 434481173 796661222\r\n", "output": ["0"]}, {"input": "24975422 256716298 337790533 690960249\r\n", "output": ["0"]}, {"input": "255635360 732742923 798648949 883146723\r\n", "output": ["0"]}, {"input": "133315691 265159773 734556507 265159773\r\n", "output": ["1"]}, {"input": "28442865 741657755 978106882 978106882\r\n", "output": ["1"]}, {"input": "131245479 174845575 497483467 131245479\r\n", "output": ["1"]}, {"input": "139159884 616215581 958341883 616215581\r\n", "output": ["1"]}, {"input": "147784432 947653080 947653080 947653080\r\n", "output": ["2"]}, {"input": "94055790 756126496 756126496 94055790\r\n", "output": ["2"]}, {"input": "240458500 511952208 240458500 511952208\r\n", "output": ["2"]}, {"input": "681828506 972810624 972810624 681828506\r\n", "output": ["2"]}, {"input": "454961014 454961014 454961014 454961014\r\n", "output": ["3"]}, {"input": "915819430 915819430 915819430 915819430\r\n", "output": ["3"]}, {"input": "671645142 671645142 671645142 671645142\r\n", "output": ["3"]}, {"input": "132503558 132503558 132503558 132503558\r\n", "output": ["3"]}, {"input": "5 5 999999 6\r\n", "output": ["1"]}, {"input": "1 1 2 5\r\n", "output": ["1"]}, {"input": "2 1 2 3\r\n", "output": ["1"]}, {"input": "1 1 3 5\r\n", "output": ["1"]}, {"input": "1 1 3 3\r\n", "output": ["2"]}, {"input": "2 2 2 1\r\n", "output": ["2"]}, {"input": "3 1 1 1\r\n", "output": ["2"]}, {"input": "1 2 2 2\r\n", "output": ["2"]}]

[{'input': '133315691 265159773 734556507 265159773\r\n', 'output': ['1']}, {'input': '81170865 673572653 756938629 995577259\r\n', 'output': ['0']}, {'input': '251590420 586975278 916631563 586975278\r\n', 'output': ['1']}, {'input': '147784432 947653080 947653080 947653080\r\n', 'output': ['2']}, {'input': '1 1 2 5\r\n', 'output': ['1']}]

[{'input': '7 7 7 7\r\n', 'output': ['3']}, {'input': '551651653 551651653 551651653 551651653\r\n', 'output': ['3']}, {'input': '156630260 609654355 668943582 973622757\r\n', 'output': ['0']}, {'input': '3491663 217797045 522540872 715355328\r\n', 'output': ['0']}, {'input': '1 2 2 2\r\n', 'output': ['2']}]

[{'input': '81170865 673572653 756938629 995577259\r\n', 'output': ['0']}, {'input': '1 2 2 2\r\n', 'output': ['2']}, {'input': '1 1 3 5\r\n', 'output': ['1']}, {'input': '1 1 2 5\r\n', 'output': ['1']}, {'input': '3491663 217797045 522540872 715355328\r\n', 'output': ['0']}]

[{'input': '156630260 609654355 668943582 973622757\r\n', 'output': ['0']}, {'input': '255635360 732742923 798648949 883146723\r\n', 'output': ['0']}, {'input': '454961014 454961014 454961014 454961014\r\n', 'output': ['3']}, {'input': '915819430 915819430 915819430 915819430\r\n', 'output': ['3']}, {'input': '1 1 3 5\r\n', 'output': ['1']}]

[{'input': '551651653 551651653 551651653 551651653\r\n', 'output': ['3']}, {'input': '1 1 3 3\r\n', 'output': ['2']}, {'input': '17061017 110313588 434481173 796661222\r\n', 'output': ['0']}, {'input': '391958720 651507265 391958720 651507265\r\n', 'output': ['2']}, {'input': '132503558 132503558 132503558 132503558\r\n', 'output': ['3']}]

["code\nedoc", "abb\naba", "code\ncode"]

The first line contains word s, the second line contains word t. The words consist of lowercase Latin letters. The input data do not consist unnecessary spaces. The words are not empty and their lengths do not exceed 100 symbols.

35a4be326690b58bf9add547fb63a5a5

word1 = input() word2 = input() w1len = len(word1) w2len = len(word2) if w1len != w2len: print('NO') else: if (w1len % 2) == 0: # ES index = w1len - 1 cant = w1len i = 0 while cant != 0: a = word1[i] b = word2[index] if a == b: i += 1 index -= 1 cant -= 1 else: print('NO') break if cant == 0: print('YES') else: index = w1len - 1 cant = w1len i = 0 while cant != 0: a = word1[i] b = word2[index] if a == b: i += 1 index -= 1 cant -= 1 else: print('NO') break if cant == 0: print('YES')

["YES", "NO", "NO"]

Python

If the word t is a word s, written reversely, print YES, otherwise print NO.

The translation from the Berland language into the Birland language is not an easy task. Those languages are very similar: a berlandish word differs from a birlandish word with the same meaning a little: it is spelled (and pronounced) reversely. For example, a Berlandish word code corresponds to a Birlandish word edoc. However, it's easy to make a mistake during the «translation». Vasya translated word s from Berlandish into Birlandish as t. Help him: find out if he translated the word correctly.

[{"input": "code\r\nedoc\r\n", "output": ["YES"]}, {"input": "abb\r\naba\r\n", "output": ["NO"]}, {"input": "code\r\ncode\r\n", "output": ["NO"]}, {"input": "abacaba\r\nabacaba\r\n", "output": ["YES"]}, {"input": "q\r\nq\r\n", "output": ["YES"]}, {"input": "asrgdfngfnmfgnhweratgjkk\r\nasrgdfngfnmfgnhweratgjkk\r\n", "output": ["NO"]}, {"input": "z\r\na\r\n", "output": ["NO"]}, {"input": "asd\r\ndsa\r\n", "output": ["YES"]}, {"input": "abcdef\r\nfecdba\r\n", "output": ["NO"]}, {"input": "ywjjbirapvskozubvxoemscfwl\r\ngnduubaogtfaiowjizlvjcu\r\n", "output": ["NO"]}, {"input": "mfrmqxtzvgaeuleubcmcxcfqyruwzenguhgrmkuhdgnhgtgkdszwqyd\r\nmfxufheiperjnhyczclkmzyhcxntdfskzkzdwzzujdinf\r\n", "output": ["NO"]}, {"input": "bnbnemvybqizywlnghlykniaxxxlkhftppbdeqpesrtgkcpoeqowjwhrylpsziiwcldodcoonpimudvrxejjo\r\ntiynnekmlalogyvrgptbinkoqdwzuiyjlrldxhzjmmp\r\n", "output": ["NO"]}, {"input": "pwlpubwyhzqvcitemnhvvwkmwcaawjvdiwtoxyhbhbxerlypelevasmelpfqwjk\r\nstruuzebbcenziscuoecywugxncdwzyfozhljjyizpqcgkyonyetarcpwkqhuugsqjuixsxptmbnlfupdcfigacdhhrzb\r\n", "output": ["NO"]}, {"input": "gdvqjoyxnkypfvdxssgrihnwxkeojmnpdeobpecytkbdwujqfjtxsqspxvxpqioyfagzjxupqqzpgnpnpxcuipweunqch\r\nkkqkiwwasbhezqcfeceyngcyuogrkhqecwsyerdniqiocjehrpkljiljophqhyaiefjpavoom\r\n", "output": ["NO"]}, {"input": "umeszdawsvgkjhlqwzents\r\nhxqhdungbylhnikwviuh\r\n", "output": ["NO"]}, {"input": "juotpscvyfmgntshcealgbsrwwksgrwnrrbyaqqsxdlzhkbugdyx\r\nibqvffmfktyipgiopznsqtrtxiijntdbgyy\r\n", "output": ["NO"]}, {"input": "zbwueheveouatecaglziqmudxemhrsozmaujrwlqmppzoumxhamwugedikvkblvmxwuofmpafdprbcftew\r\nulczwrqhctbtbxrhhodwbcxwimncnexosksujlisgclllxokrsbnozthajnnlilyffmsyko\r\n", "output": ["NO"]}, {"input": "nkgwuugukzcv\r\nqktnpxedwxpxkrxdvgmfgoxkdfpbzvwsduyiybynbkouonhvmzakeiruhfmvrktghadbfkmwxduoqv\r\n", "output": ["NO"]}, {"input": "incenvizhqpcenhjhehvjvgbsnfixbatrrjstxjzhlmdmxijztphxbrldlqwdfimweepkggzcxsrwelodpnryntepioqpvk\r\ndhjbjjftlvnxibkklxquwmzhjfvnmwpapdrslioxisbyhhfymyiaqhlgecpxamqnocizwxniubrmpyubvpenoukhcobkdojlybxd\r\n", "output": ["NO"]}, {"input": "w\r\nw\r\n", "output": ["YES"]}, {"input": "vz\r\nzv\r\n", "output": ["YES"]}, {"input": "ry\r\nyr\r\n", "output": ["YES"]}, {"input": "xou\r\nuox\r\n", "output": ["YES"]}, {"input": "axg\r\ngax\r\n", "output": ["NO"]}, {"input": "zdsl\r\nlsdz\r\n", "output": ["YES"]}, {"input": "kudl\r\nldku\r\n", "output": ["NO"]}, {"input": "zzlzwnqlcl\r\nlclqnwzlzz\r\n", "output": ["YES"]}, {"input": "vzzgicnzqooejpjzads\r\nsdazjpjeooqzncigzzv\r\n", "output": ["YES"]}, {"input": "raqhmvmzuwaykjpyxsykr\r\nxkysrypjkyawuzmvmhqar\r\n", "output": ["NO"]}, {"input": "ngedczubzdcqbxksnxuavdjaqtmdwncjnoaicvmodcqvhfezew\r\nwezefhvqcdomvciaonjcnwdmtqajdvauxnskxbqcdzbuzcdegn\r\n", "output": ["YES"]}, {"input": "muooqttvrrljcxbroizkymuidvfmhhsjtumksdkcbwwpfqdyvxtrlymofendqvznzlmim\r\nmimlznzvqdnefomylrtxvydqfpwwbckdskmutjshhmfvdiumykziorbxcjlrrvttqooum\r\n", "output": ["YES"]}, {"input": "vxpqullmcbegsdskddortcvxyqlbvxmmkhevovnezubvpvnrcajpxraeaxizgaowtfkzywvhnbgzsxbhkaipcmoumtikkiyyaivg\r\ngviayyikkitmuomcpiakhbxszgbnhvwyzkftwoagzixaearxpjacrnvpvbuzenvovehkmmxvblqyxvctroddksdsgebcmlluqpxv\r\n", "output": ["YES"]}, {"input": "mnhaxtaopjzrkqlbroiyipitndczpunwygstmzevgyjdzyanxkdqnvgkikfabwouwkkbzuiuvgvxgpizsvqsbwepktpdrgdkmfdc\r\ncdfmkdgrdptkpewbsqvszipgxvgvuiuzbkkwuowbafkikgvnqdkxnayzdjygvezmtsgywnupocdntipiyiorblqkrzjpzatxahnm\r\n", "output": ["NO"]}, {"input": "dgxmzbqofstzcdgthbaewbwocowvhqpinehpjatnnbrijcolvsatbblsrxabzrpszoiecpwhfjmwuhqrapvtcgvikuxtzbftydkw\r\nwkdytfbztxukivgctvparqhuwmjfhwpceiozsprzbaxrslbbqasvlocjirbnntajphenipthvwocowbweabhtgdcztsfoqbzmxgd\r\n", "output": ["NO"]}, {"input": "gxoixiecetohtgjgbqzvlaobkhstejxdklghowtvwunnnvauriohuspsdmpzckprwajyxldoyckgjivjpmbfqtszmtocovxwgeh\r\nhegwxvocotmzstqfbmpjvijgkcyodlxyjawrpkczpmdspsuhoiruavnnnuwvtwohglkdxjetshkboalvzqbgjgthoteceixioxg\r\n", "output": ["YES"]}, {"input": "sihxuwvmaambplxvjfoskinghzicyfqebjtkysotattkahssumfcgrkheotdxwjckpvapbkaepqrxseyfrwtyaycmrzsrsngkh\r\nhkgnsrszrmcyaytwrfyesxrqpeakbpavpkcjwxdtoehkrgcfmusshakttatosyktjbeqfycizhgniksofjvxlpbmaamvwuxhis\r\n", "output": ["YES"]}, {"input": "ycnahksbughnonldzrhkysujmylcgcfuludjvjiahtkyzqvkopzqcnwhltbzfugzojqkjjlggmvnultascmygelkiktmfieok\r\nkoeifmtkiklegkmcsatlunvmggkjjlqjozgufzbtlhwncqzpokvqzykthaijvjdulufcgclymjusyyhrzdlnonhgubskhancy\r\n", "output": ["NO"]}, {"input": "wbqasaehtkfojruzyhrlgwmtyiovmzyfifslvlemhqheyaelzwnthrenjsbmntwaoryzwfbxmscmypvxlfmzpnkkjlvwvmtz\r\nztmvwvljkknpzmflxvpymcsmxbfwzyroawtnmbsjnerhtnwzleayehqhmelvlsfifyzmvoiytmwglrhyzurjofktheasaqbw\r\n", "output": ["YES"]}, {"input": "imippqurprbhfugngtgifelytadegwrgaefnfhbjjnmzikvjaccotqzemufqieqldgnbmviisgkynzeldlhqxuqphjfmyij\r\njiymfjhpquxqhldleznykgsiivmbngdlqeiqfumezqtoccajvkizmnjjbhfnfeagrwgedatylefigtgngufhbrpruqppimi\r\n", "output": ["YES"]}, {"input": "bikydffiuisckpvzqlteqfhegsagimodb\r\nbdomigasgehfqetlqzvpkcsiuiffdykib\r\n", "output": ["YES"]}]

[{'input': 'abcdef\r\nfecdba\r\n', 'output': ['NO']}, {'input': 'umeszdawsvgkjhlqwzents\r\nhxqhdungbylhnikwviuh\r\n', 'output': ['NO']}, {'input': 'code\r\nedoc\r\n', 'output': ['YES']}, {'input': 'q\r\nq\r\n', 'output': ['YES']}, {'input': 'bnbnemvybqizywlnghlykniaxxxlkhftppbdeqpesrtgkcpoeqowjwhrylpsziiwcldodcoonpimudvrxejjo\r\ntiynnekmlalogyvrgptbinkoqdwzuiyjlrldxhzjmmp\r\n', 'output': ['NO']}]

[{'input': 'z\r\na\r\n', 'output': ['NO']}, {'input': 'mfrmqxtzvgaeuleubcmcxcfqyruwzenguhgrmkuhdgnhgtgkdszwqyd\r\nmfxufheiperjnhyczclkmzyhcxntdfskzkzdwzzujdinf\r\n', 'output': ['NO']}, {'input': 'abcdef\r\nfecdba\r\n', 'output': ['NO']}, {'input': 'gxoixiecetohtgjgbqzvlaobkhstejxdklghowtvwunnnvauriohuspsdmpzckprwajyxldoyckgjivjpmbfqtszmtocovxwgeh\r\nhegwxvocotmzstqfbmpjvijgkcyodlxyjawrpkczpmdspsuhoiruavnnnuwvtwohglkdxjetshkboalvzqbgjgthoteceixioxg\r\n', 'output': ['YES']}, {'input': 'dgxmzbqofstzcdgthbaewbwocowvhqpinehpjatnnbrijcolvsatbblsrxabzrpszoiecpwhfjmwuhqrapvtcgvikuxtzbftydkw\r\nwkdytfbztxukivgctvparqhuwmjfhwpceiozsprzbaxrslbbqasvlocjirbnntajphenipthvwocowbweabhtgdcztsfoqbzmxgd\r\n', 'output': ['NO']}]

[{'input': 'asrgdfngfnmfgnhweratgjkk\r\nasrgdfngfnmfgnhweratgjkk\r\n', 'output': ['NO']}, {'input': 'abacaba\r\nabacaba\r\n', 'output': ['YES']}, {'input': 'kudl\r\nldku\r\n', 'output': ['NO']}, {'input': 'sihxuwvmaambplxvjfoskinghzicyfqebjtkysotattkahssumfcgrkheotdxwjckpvapbkaepqrxseyfrwtyaycmrzsrsngkh\r\nhkgnsrszrmcyaytwrfyesxrqpeakbpavpkcjwxdtoehkrgcfmusshakttatosyktjbeqfycizhgniksofjvxlpbmaamvwuxhis\r\n', 'output': ['YES']}, {'input': 'vxpqullmcbegsdskddortcvxyqlbvxmmkhevovnezubvpvnrcajpxraeaxizgaowtfkzywvhnbgzsxbhkaipcmoumtikkiyyaivg\r\ngviayyikkitmuomcpiakhbxszgbnhvwyzkftwoagzixaearxpjacrnvpvbuzenvovehkmmxvblqyxvctroddksdsgebcmlluqpxv\r\n', 'output': ['YES']}]

[{'input': 'w\r\nw\r\n', 'output': ['YES']}, {'input': 'abacaba\r\nabacaba\r\n', 'output': ['YES']}, {'input': 'muooqttvrrljcxbroizkymuidvfmhhsjtumksdkcbwwpfqdyvxtrlymofendqvznzlmim\r\nmimlznzvqdnefomylrtxvydqfpwwbckdskmutjshhmfvdiumykziorbxcjlrrvttqooum\r\n', 'output': ['YES']}, {'input': 'z\r\na\r\n', 'output': ['NO']}, {'input': 'zbwueheveouatecaglziqmudxemhrsozmaujrwlqmppzoumxhamwugedikvkblvmxwuofmpafdprbcftew\r\nulczwrqhctbtbxrhhodwbcxwimncnexosksujlisgclllxokrsbnozthajnnlilyffmsyko\r\n', 'output': ['NO']}]

[{'input': 'ywjjbirapvskozubvxoemscfwl\r\ngnduubaogtfaiowjizlvjcu\r\n', 'output': ['NO']}, {'input': 'vzzgicnzqooejpjzads\r\nsdazjpjeooqzncigzzv\r\n', 'output': ['YES']}, {'input': 'abb\r\naba\r\n', 'output': ['NO']}, {'input': 'abacaba\r\nabacaba\r\n', 'output': ['YES']}, {'input': 'mnhaxtaopjzrkqlbroiyipitndczpunwygstmzevgyjdzyanxkdqnvgkikfabwouwkkbzuiuvgvxgpizsvqsbwepktpdrgdkmfdc\r\ncdfmkdgrdptkpewbsqvszipgxvgvuiuzbkkwuowbafkikgvnqdkxnayzdjygvezmtsgywnupocdntipiyiorblqkrzjpzatxahnm\r\n', 'output': ['NO']}]

["3000"]

The only line of the input contains one integer n (1 ≤ n ≤ 1018) — the prediction on the number of people who will buy the game.

8551308e5ff435e0fc507b89a912408a

print(int(int(input())/2520))

["1"]

Python

Output one integer showing how many numbers from 1 to n are divisible by all numbers from 2 to 10.

IT City company developing computer games invented a new way to reward its employees. After a new game release users start buying it actively, and the company tracks the number of sales with precision to each transaction. Every time when the next number of sales is divisible by all numbers from 2 to 10 every developer of this game gets a small bonus.A game designer Petya knows that the company is just about to release a new game that was partly developed by him. On the basis of his experience he predicts that n people will buy the game during the first month. Now Petya wants to determine how many times he will get the bonus. Help him to know it.

[{"input": "3000\r\n", "output": ["1"]}, {"input": "2520\r\n", "output": ["1"]}, {"input": "2519\r\n", "output": ["0"]}, {"input": "2521\r\n", "output": ["1"]}, {"input": "1\r\n", "output": ["0"]}, {"input": "314159265\r\n", "output": ["124666"]}, {"input": "718281828459045235\r\n", "output": ["285032471610732"]}, {"input": "1000000000000000000\r\n", "output": ["396825396825396"]}, {"input": "987654321234567890\r\n", "output": ["391926317950225"]}, {"input": "3628800\r\n", "output": ["1440"]}, {"input": "504000000000000000\r\n", "output": ["200000000000000"]}]

[{'input': '3628800\r\n', 'output': ['1440']}, {'input': '1000000000000000000\r\n', 'output': ['396825396825396']}, {'input': '314159265\r\n', 'output': ['124666']}, {'input': '504000000000000000\r\n', 'output': ['200000000000000']}, {'input': '2520\r\n', 'output': ['1']}]

[{'input': '1000000000000000000\r\n', 'output': ['396825396825396']}, {'input': '314159265\r\n', 'output': ['124666']}, {'input': '3000\r\n', 'output': ['1']}, {'input': '1\r\n', 'output': ['0']}, {'input': '2521\r\n', 'output': ['1']}]

[{'input': '1000000000000000000\r\n', 'output': ['396825396825396']}, {'input': '314159265\r\n', 'output': ['124666']}, {'input': '2519\r\n', 'output': ['0']}, {'input': '3628800\r\n', 'output': ['1440']}, {'input': '2521\r\n', 'output': ['1']}]

[{'input': '718281828459045235\r\n', 'output': ['285032471610732']}, {'input': '1\r\n', 'output': ['0']}, {'input': '1000000000000000000\r\n', 'output': ['396825396825396']}, {'input': '3000\r\n', 'output': ['1']}, {'input': '2520\r\n', 'output': ['1']}]

[{'input': '1000000000000000000\r\n', 'output': ['396825396825396']}, {'input': '2520\r\n', 'output': ['1']}, {'input': '718281828459045235\r\n', 'output': ['285032471610732']}, {'input': '2521\r\n', 'output': ['1']}, {'input': '2519\r\n', 'output': ['0']}]

["1", "2", "3"]

The first line contains a single integer n (1 ≤ n ≤ 40).

c2cbc35012c6ff7ab0d6899e6015e4e7

# I've proven, that z takes form of 2 ** (k - 1) - 1, # where 2 ** k - 1 is prime, which are called 'Mersenne primes'. p = [2, 3, 5, 7, 13, 17, 19, 31, 61, 89, 107, 127,\ 521, 607, 1279, 2203, 2281, 3217, 4253, 4423, 9689,\ 9941, 11213, 19937, 21701, 23209, 44497, 86243, 110503,\ 132049, 216091, 756839, 859433, 1257787, 1398269,\ 2976221, 3021377, 6972593, 13466917, 20996011] n = int(input()) MOD = 10 ** 9 + 7 print((pow(2, p[n - 1] - 1, MOD) - 1) % MOD)

["1", "3", "15"]

Python

Print a single integer — the number zn modulo 1000000007 (109 + 7). It is guaranteed that the answer exists.

Consider the following equation: where sign [a] represents the integer part of number a.Let's find all integer z (z &gt; 0), for which this equation is unsolvable in positive integers. The phrase "unsolvable in positive integers" means that there are no such positive integers x and y (x, y &gt; 0), for which the given above equation holds.Let's write out all such z in the increasing order: z1, z2, z3, and so on (zi &lt; zi + 1). Your task is: given the number n, find the number zn.

[{"input": "1\r\n", "output": ["1"]}, {"input": "2\r\n", "output": ["3"]}, {"input": "3\r\n", "output": ["15"]}, {"input": "4\r\n", "output": ["63"]}, {"input": "5\r\n", "output": ["4095"]}, {"input": "6\r\n", "output": ["65535"]}, {"input": "7\r\n", "output": ["262143"]}, {"input": "8\r\n", "output": ["73741816"]}, {"input": "9\r\n", "output": ["536396503"]}, {"input": "10\r\n", "output": ["140130950"]}, {"input": "11\r\n", "output": ["487761805"]}, {"input": "12\r\n", "output": ["319908070"]}, {"input": "13\r\n", "output": ["106681874"]}, {"input": "14\r\n", "output": ["373391776"]}, {"input": "15\r\n", "output": ["317758023"]}, {"input": "16\r\n", "output": ["191994803"]}, {"input": "17\r\n", "output": ["416292236"]}, {"input": "18\r\n", "output": ["110940209"]}, {"input": "19\r\n", "output": ["599412198"]}, {"input": "20\r\n", "output": ["383601260"]}, {"input": "21\r\n", "output": ["910358878"]}, {"input": "22\r\n", "output": ["532737550"]}, {"input": "23\r\n", "output": ["348927936"]}, {"input": "24\r\n", "output": ["923450985"]}, {"input": "25\r\n", "output": ["470083777"]}, {"input": "26\r\n", "output": ["642578561"]}, {"input": "27\r\n", "output": ["428308066"]}, {"input": "28\r\n", "output": ["485739298"]}, {"input": "29\r\n", "output": ["419990027"]}, {"input": "30\r\n", "output": ["287292016"]}, {"input": "31\r\n", "output": ["202484167"]}, {"input": "32\r\n", "output": ["389339971"]}, {"input": "33\r\n", "output": ["848994100"]}, {"input": "34\r\n", "output": ["273206869"]}, {"input": "35\r\n", "output": ["853092282"]}, {"input": "36\r\n", "output": ["411696552"]}, {"input": "37\r\n", "output": ["876153853"]}, {"input": "38\r\n", "output": ["90046024"]}, {"input": "39\r\n", "output": ["828945523"]}, {"input": "40\r\n", "output": ["697988359"]}]

[{'input': '37\r\n', 'output': ['876153853']}, {'input': '22\r\n', 'output': ['532737550']}, {'input': '26\r\n', 'output': ['642578561']}, {'input': '15\r\n', 'output': ['317758023']}, {'input': '36\r\n', 'output': ['411696552']}]

[{'input': '15\r\n', 'output': ['317758023']}, {'input': '29\r\n', 'output': ['419990027']}, {'input': '7\r\n', 'output': ['262143']}, {'input': '39\r\n', 'output': ['828945523']}, {'input': '35\r\n', 'output': ['853092282']}]

[{'input': '24\r\n', 'output': ['923450985']}, {'input': '2\r\n', 'output': ['3']}, {'input': '13\r\n', 'output': ['106681874']}, {'input': '5\r\n', 'output': ['4095']}, {'input': '18\r\n', 'output': ['110940209']}]

[{'input': '28\r\n', 'output': ['485739298']}, {'input': '21\r\n', 'output': ['910358878']}, {'input': '13\r\n', 'output': ['106681874']}, {'input': '7\r\n', 'output': ['262143']}, {'input': '35\r\n', 'output': ['853092282']}]

[{'input': '30\r\n', 'output': ['287292016']}, {'input': '12\r\n', 'output': ['319908070']}, {'input': '31\r\n', 'output': ['202484167']}, {'input': '17\r\n', 'output': ['416292236']}, {'input': '1\r\n', 'output': ['1']}]

["1 2 1000", "2 2 1000", "5 3 1103"]

Input consists of three integers n, k, m (1 ≤ n ≤ 1000, 1 ≤ k ≤ 100, 1 ≤ m ≤ 109).

656bf8df1e79499aa2ab2c28712851f0

def get_input(): hahaha=input() (n,k,m)=hahaha.split(sep=None, maxsplit=1000) return (int(n),int(k),int(m)) (n,k,m)=get_input() f=[0 for i in range(k)] s=0 for v in range(n): tens = 10**v%k f=[ (sum( [f[(j+k-(x+1)*tens)%k] for x in range(9)] )+f[j])%m for j in range(k)] for x in range(9): f[(x+1)*tens%k]+=1 if n-v-1==0: s+=(f[0]%m) else: s+=f[0]*((10**(n-v-2)*9))%m f[0]=0 print(s%m)

["4", "45", "590"]

Python

NoteA suffix of a string S is a non-empty string that can be obtained by removing some number (possibly, zero) of first characters from S.

Print the required number modulo m.

Amr doesn't like Maths as he finds it really boring, so he usually sleeps in Maths lectures. But one day the teacher suspected that Amr is sleeping and asked him a question to make sure he wasn't.First he gave Amr two positive integers n and k. Then he asked Amr, how many integer numbers x &gt; 0 exist such that: Decimal representation of x (without leading zeroes) consists of exactly n digits; There exists some integer y &gt; 0 such that: ; decimal representation of y is a suffix of decimal representation of x. As the answer to this question may be pretty huge the teacher asked Amr to output only its remainder modulo a number m.Can you help Amr escape this embarrassing situation?

[{"input": "1 2 1000\r\n", "output": ["4"]}, {"input": "2 2 1000\r\n", "output": ["45"]}, {"input": "5 3 1103\r\n", "output": ["590"]}, {"input": "2 17 10000\r\n", "output": ["5"]}, {"input": "3 9 10000\r\n", "output": ["252"]}, {"input": "6 64 941761822\r\n", "output": ["46530"]}, {"input": "183 3 46847167\r\n", "output": ["29891566"]}, {"input": "472 44 364550669\r\n", "output": ["122479316"]}, {"input": "510 76 811693420\r\n", "output": ["546301720"]}, {"input": "783 30 602209107\r\n", "output": ["279682329"]}, {"input": "863 47 840397713\r\n", "output": ["433465398"]}, {"input": "422 22 411212542\r\n", "output": ["63862621"]}, {"input": "370 9 385481464\r\n", "output": ["163845824"]}, {"input": "312 41 915197716\r\n", "output": ["912219984"]}, {"input": "261 32 49719977\r\n", "output": ["19320923"]}, {"input": "434 6 56571287\r\n", "output": ["56257936"]}, {"input": "355 3 945669623\r\n", "output": ["219132384"]}, {"input": "905 71 999142682\r\n", "output": ["825882209"]}, {"input": "900 84 526417573\r\n", "output": ["281234824"]}, {"input": "387 3 521021345\r\n", "output": ["435545521"]}, {"input": "246 33 996704992\r\n", "output": ["385601286"]}, {"input": "443 29 106807555\r\n", "output": ["7872021"]}, {"input": "621 43 356382217\r\n", "output": ["251594310"]}, {"input": "782 84 643445347\r\n", "output": ["208138038"]}, {"input": "791 23 94030462\r\n", "output": ["41862326"]}, {"input": "543 98 508536403\r\n", "output": ["117587951"]}, {"input": "20 96 238661639\r\n", "output": ["198761428"]}, {"input": "845 60 888437864\r\n", "output": ["193926448"]}, {"input": "998 85 501663165\r\n", "output": ["145180249"]}, {"input": "123 72 56222855\r\n", "output": ["32350599"]}, {"input": "12 39 618421525\r\n", "output": ["115875938"]}, {"input": "462 35 144751085\r\n", "output": ["79931198"]}, {"input": "674 22 494819681\r\n", "output": ["19590614"]}, {"input": "650 66 579060528\r\n", "output": ["224930740"]}, {"input": "432 80 133016247\r\n", "output": ["25032672"]}, {"input": "176 70 196445230\r\n", "output": ["64904804"]}, {"input": "393 71 933802677\r\n", "output": ["366541352"]}, {"input": "37 92 9838905\r\n", "output": ["7980021"]}, {"input": "993 26 108974437\r\n", "output": ["87469631"]}, {"input": "433 93 36915724\r\n", "output": ["20722839"]}, {"input": "957 88 512982771\r\n", "output": ["161742313"]}, {"input": "170 94 82742818\r\n", "output": ["1117330"]}, {"input": "624 33 145653575\r\n", "output": ["99048377"]}, {"input": "56 48 961996131\r\n", "output": ["199203510"]}, {"input": "889 6 225765429\r\n", "output": ["193135878"]}, {"input": "1 93 727895661\r\n", "output": ["0"]}, {"input": "470 61 617307737\r\n", "output": ["428782123"]}, {"input": "520 94 712232167\r\n", "output": ["199435818"]}, {"input": "531 78 460047919\r\n", "output": ["117748792"]}, {"input": "776 32 523607700\r\n", "output": ["309970800"]}, {"input": "648 74 329538445\r\n", "output": ["177655063"]}, {"input": "885 6 743810885\r\n", "output": ["297512873"]}, {"input": "712 53 592302770\r\n", "output": ["147693148"]}, {"input": "426 72 589297447\r\n", "output": ["316207784"]}, {"input": "561 69 310141994\r\n", "output": ["245538618"]}, {"input": "604 97 26180786\r\n", "output": ["6950800"]}, {"input": "586 32 846994504\r\n", "output": ["579729448"]}, {"input": "514 67 260591607\r\n", "output": ["88291586"]}, {"input": "429 45 103817253\r\n", "output": ["41335161"]}, {"input": "767 27 364988776\r\n", "output": ["259490746"]}, {"input": "497 33 479662107\r\n", "output": ["84548778"]}, {"input": "262 71 404639692\r\n", "output": ["93447345"]}, {"input": "125 33 152527721\r\n", "output": ["59122415"]}, {"input": "857 98 70814341\r\n", "output": ["58423075"]}, {"input": "375 79 416634034\r\n", "output": ["175150318"]}, {"input": "886 10 902171654\r\n", "output": ["134375492"]}, {"input": "335 28 979397289\r\n", "output": ["675105408"]}, {"input": "769 30 474381420\r\n", "output": ["157049322"]}, {"input": "736 31 26855044\r\n", "output": ["24225276"]}, {"input": "891 7 814335325\r\n", "output": ["611862019"]}, {"input": "346 23 947672082\r\n", "output": ["59151110"]}, {"input": "1000 1 382210711\r\n", "output": ["372462157"]}, {"input": "1 1 10000\r\n", "output": ["9"]}, {"input": "1000 100 777767777\r\n", "output": ["577920877"]}, {"input": "1000 13 10619863\r\n", "output": ["8796170"]}, {"input": "1 100 1000\r\n", "output": ["0"]}, {"input": "11 11 11\r\n", "output": ["7"]}, {"input": "1 1 1\r\n", "output": ["0"]}, {"input": "1 2 2\r\n", "output": ["0"]}]

[{'input': '674 22 494819681\r\n', 'output': ['19590614']}, {'input': '900 84 526417573\r\n', 'output': ['281234824']}, {'input': '767 27 364988776\r\n', 'output': ['259490746']}, {'input': '520 94 712232167\r\n', 'output': ['199435818']}, {'input': '998 85 501663165\r\n', 'output': ['145180249']}]

[{'input': '2 2 1000\r\n', 'output': ['45']}, {'input': '1 1 1\r\n', 'output': ['0']}, {'input': '20 96 238661639\r\n', 'output': ['198761428']}, {'input': '561 69 310141994\r\n', 'output': ['245538618']}, {'input': '462 35 144751085\r\n', 'output': ['79931198']}]

[{'input': '712 53 592302770\r\n', 'output': ['147693148']}, {'input': '561 69 310141994\r\n', 'output': ['245538618']}, {'input': '429 45 103817253\r\n', 'output': ['41335161']}, {'input': '355 3 945669623\r\n', 'output': ['219132384']}, {'input': '20 96 238661639\r\n', 'output': ['198761428']}]

[{'input': '510 76 811693420\r\n', 'output': ['546301720']}, {'input': '426 72 589297447\r\n', 'output': ['316207784']}, {'input': '993 26 108974437\r\n', 'output': ['87469631']}, {'input': '1 1 1\r\n', 'output': ['0']}, {'input': '712 53 592302770\r\n', 'output': ['147693148']}]

[{'input': '170 94 82742818\r\n', 'output': ['1117330']}, {'input': '510 76 811693420\r\n', 'output': ['546301720']}, {'input': '998 85 501663165\r\n', 'output': ['145180249']}, {'input': '905 71 999142682\r\n', 'output': ['825882209']}, {'input': '56 48 961996131\r\n', 'output': ['199203510']}]

["42", "5"]

The only line contains an integer n (1 ≤ n ≤ 10000).

5d4f38ffd1849862623325fdbe06cd00

n=int(input()) a=n//3 b=n%3 if b==2: a=a+1 p=a//12 q=a%12 print(p,q)

["1 2", "0 2"]

Python

Print two non-negative space-separated integers a and b, where a is the numbers of feet and b is the number of inches.

Lengths are measures in Baden in inches and feet. To a length from centimeters it is enough to know that an inch equals three centimeters in Baden and one foot contains 12 inches.You are given a length equal to n centimeters. Your task is to convert it to feet and inches so that the number of feet was maximum. The result should be an integer rounded to the closest value containing an integral number of inches.Note that when you round up, 1 cm rounds up to 0 inches and 2 cm round up to 1 inch.

[{"input": "42\r\n", "output": ["1 2"]}, {"input": "5\r\n", "output": ["0 2"]}, {"input": "24\r\n", "output": ["0 8"]}, {"input": "1\r\n", "output": ["0 0"]}, {"input": "2\r\n", "output": ["0 1"]}, {"input": "3\r\n", "output": ["0 1"]}, {"input": "4\r\n", "output": ["0 1"]}, {"input": "8\r\n", "output": ["0 3"]}, {"input": "10\r\n", "output": ["0 3"]}, {"input": "12\r\n", "output": ["0 4"]}, {"input": "13\r\n", "output": ["0 4"]}, {"input": "100\r\n", "output": ["2 9"]}, {"input": "120\r\n", "output": ["3 4"]}, {"input": "199\r\n", "output": ["5 6"]}, {"input": "501\r\n", "output": ["13 11"]}, {"input": "1000\r\n", "output": ["27 9"]}, {"input": "1233\r\n", "output": ["34 3"]}, {"input": "9876\r\n", "output": ["274 4"]}, {"input": "9999\r\n", "output": ["277 9"]}, {"input": "10000\r\n", "output": ["277 9"]}, {"input": "35\r\n", "output": ["1 0"]}, {"input": "71\r\n", "output": ["2 0"]}]

[{'input': '199\r\n', 'output': ['5 6']}, {'input': '10000\r\n', 'output': ['277 9']}, {'input': '1\r\n', 'output': ['0 0']}, {'input': '1233\r\n', 'output': ['34 3']}, {'input': '120\r\n', 'output': ['3 4']}]

[{'input': '1000\r\n', 'output': ['27 9']}, {'input': '3\r\n', 'output': ['0 1']}, {'input': '1\r\n', 'output': ['0 0']}, {'input': '100\r\n', 'output': ['2 9']}, {'input': '10\r\n', 'output': ['0 3']}]

[{'input': '120\r\n', 'output': ['3 4']}, {'input': '501\r\n', 'output': ['13 11']}, {'input': '1\r\n', 'output': ['0 0']}, {'input': '1233\r\n', 'output': ['34 3']}, {'input': '8\r\n', 'output': ['0 3']}]

[{'input': '100\r\n', 'output': ['2 9']}, {'input': '199\r\n', 'output': ['5 6']}, {'input': '3\r\n', 'output': ['0 1']}, {'input': '10\r\n', 'output': ['0 3']}, {'input': '35\r\n', 'output': ['1 0']}]

[{'input': '35\r\n', 'output': ['1 0']}, {'input': '10\r\n', 'output': ['0 3']}, {'input': '199\r\n', 'output': ['5 6']}, {'input': '10000\r\n', 'output': ['277 9']}, {'input': '13\r\n', 'output': ['0 4']}]

["4", "5"]

The single line contains the positive integer n (1 ≤ n ≤ 1015).

689e7876048ee4eb7479e838c981f068

x=int(input()) if x%2==0: print(int(x/2)) else: print(-(int(x/2)+1))

["2", "-3"]

Python

Notef(4) =  - 1 + 2 - 3 + 4 = 2f(5) =  - 1 + 2 - 3 + 4 - 5 =  - 3

Print f(n) in a single line.

For a positive integer n let's define a function f:f(n) =  - 1 + 2 - 3 + .. + ( - 1)nn Your task is to calculate f(n) for a given integer n.

[{"input": "4\r\n", "output": ["2"]}, {"input": "5\r\n", "output": ["-3"]}, {"input": "1000000000\r\n", "output": ["500000000"]}, {"input": "1000000001\r\n", "output": ["-500000001"]}, {"input": "1000000000000000\r\n", "output": ["500000000000000"]}, {"input": "100\r\n", "output": ["50"]}, {"input": "101\r\n", "output": ["-51"]}, {"input": "102\r\n", "output": ["51"]}, {"input": "103\r\n", "output": ["-52"]}, {"input": "104\r\n", "output": ["52"]}, {"input": "105\r\n", "output": ["-53"]}, {"input": "106\r\n", "output": ["53"]}, {"input": "107\r\n", "output": ["-54"]}, {"input": "108\r\n", "output": ["54"]}, {"input": "109\r\n", "output": ["-55"]}, {"input": "208170109961052\r\n", "output": ["104085054980526"]}, {"input": "46017661651072\r\n", "output": ["23008830825536"]}, {"input": "4018154546667\r\n", "output": ["-2009077273334"]}, {"input": "288565475053\r\n", "output": ["-144282737527"]}, {"input": "3052460231\r\n", "output": ["-1526230116"]}, {"input": "29906716\r\n", "output": ["14953358"]}, {"input": "87897701693326\r\n", "output": ["43948850846663"]}, {"input": "8240\r\n", "output": ["4120"]}, {"input": "577935\r\n", "output": ["-288968"]}, {"input": "62\r\n", "output": ["31"]}, {"input": "1\r\n", "output": ["-1"]}, {"input": "2\r\n", "output": ["1"]}, {"input": "9999999999999\r\n", "output": ["-5000000000000"]}, {"input": "1000000000000\r\n", "output": ["500000000000"]}, {"input": "99999999999999\r\n", "output": ["-50000000000000"]}, {"input": "999999999999999\r\n", "output": ["-500000000000000"]}, {"input": "42191359342\r\n", "output": ["21095679671"]}, {"input": "100000000000000\r\n", "output": ["50000000000000"]}, {"input": "145645214654154\r\n", "output": ["72822607327077"]}, {"input": "4294967296\r\n", "output": ["2147483648"]}, {"input": "3037000499\r\n", "output": ["-1518500250"]}, {"input": "10000000000001\r\n", "output": ["-5000000000001"]}, {"input": "100000017040846\r\n", "output": ["50000008520423"]}, {"input": "98979894985999\r\n", "output": ["-49489947493000"]}]

[{'input': '101\r\n', 'output': ['-51']}, {'input': '100\r\n', 'output': ['50']}, {'input': '288565475053\r\n', 'output': ['-144282737527']}, {'input': '100000017040846\r\n', 'output': ['50000008520423']}, {'input': '145645214654154\r\n', 'output': ['72822607327077']}]

[{'input': '1\r\n', 'output': ['-1']}, {'input': '999999999999999\r\n', 'output': ['-500000000000000']}, {'input': '103\r\n', 'output': ['-52']}, {'input': '98979894985999\r\n', 'output': ['-49489947493000']}, {'input': '4294967296\r\n', 'output': ['2147483648']}]

[{'input': '3052460231\r\n', 'output': ['-1526230116']}, {'input': '105\r\n', 'output': ['-53']}, {'input': '999999999999999\r\n', 'output': ['-500000000000000']}, {'input': '103\r\n', 'output': ['-52']}, {'input': '99999999999999\r\n', 'output': ['-50000000000000']}]

[{'input': '100000017040846\r\n', 'output': ['50000008520423']}, {'input': '101\r\n', 'output': ['-51']}, {'input': '1000000000000\r\n', 'output': ['500000000000']}, {'input': '103\r\n', 'output': ['-52']}, {'input': '107\r\n', 'output': ['-54']}]

[{'input': '98979894985999\r\n', 'output': ['-49489947493000']}, {'input': '1000000000\r\n', 'output': ['500000000']}, {'input': '3037000499\r\n', 'output': ['-1518500250']}, {'input': '5\r\n', 'output': ['-3']}, {'input': '62\r\n', 'output': ['31']}]

["21", "20"]

The first line contains integer n (1 ≤ n ≤ 109).

ae20ae2a16273a0d379932d6e973f878

n = int(input()) m = str(n) g = len(m) l = [int(m[0])-1]+[9]*(g-1) h = 0 less = 0 while(h<len(l)): less = less + l[h] h = h + 1 a = n - less r = [] i = 0 while(a<n): j = 0 s = str(a) c = a while j<len(s): c = c + int(s[j]) j = j + 1 if(c==n): i +=1 r = r + [a] a = a + 1 if(i==0): print(0) else: print(i) j = 0 while(j<len(r)): print(r[j]) j = j + 1

["1\n15", "0"]

Python

NoteIn the first test case x = 15 there is only one variant: 15 + 1 + 5 = 21.In the second test case there are no such x.

In the first line print one integer k — number of different values of x satisfying the condition. In next k lines print these values in ascending order.

Eighth-grader Vova is on duty today in the class. After classes, he went into the office to wash the board, and found on it the number n. He asked what is this number and the teacher of mathematics Inna Petrovna answered Vova that n is the answer to the arithmetic task for first-graders. In the textbook, a certain positive integer x was given. The task was to add x to the sum of the digits of the number x written in decimal numeral system.Since the number n on the board was small, Vova quickly guessed which x could be in the textbook. Now he wants to get a program which will search for arbitrary values of the number n for all suitable values of x or determine that such x does not exist. Write such a program for Vova.

[{"input": "21\r\n", "output": ["1\r\n15"]}, {"input": "20\r\n", "output": ["0"]}, {"input": "1\r\n", "output": ["0"]}, {"input": "2\r\n", "output": ["1\r\n1"]}, {"input": "3\r\n", "output": ["0"]}, {"input": "100000001\r\n", "output": ["2\r\n99999937\r\n 100000000", "2\r\n99999937 100000000", "2\r\n99999937\r\n100000000"]}, {"input": "1000000000\r\n", "output": ["1\r\n999999932"]}, {"input": "999999979\r\n", "output": ["2\r\n999999899\r\n 999999908", "2\r\n999999899 999999908", "2\r\n999999899\r\n999999908"]}, {"input": "9\r\n", "output": ["0"]}, {"input": "10\r\n", "output": ["1\r\n5"]}, {"input": "11\r\n", "output": ["1\r\n10"]}, {"input": "39\r\n", "output": ["1\r\n33"]}, {"input": "66\r\n", "output": ["1\r\n60"]}, {"input": "75\r\n", "output": ["0"]}, {"input": "100\r\n", "output": ["1\r\n86"]}, {"input": "101\r\n", "output": ["2\r\n91\r\n100", "2\r\n91\r\n 100", "2\r\n91 100"]}, {"input": "2014\r\n", "output": ["2\r\n1988\r\n2006", "2\r\n1988 2006", "2\r\n1988\r\n 2006"]}, {"input": "999999994\r\n", "output": ["0"]}]

[{'input': '100000001\r\n', 'output': ['2\r\n99999937\r\n 100000000', '2\r\n99999937 100000000', '2\r\n99999937\r\n100000000']}, {'input': '100\r\n', 'output': ['1\r\n86']}, {'input': '999999994\r\n', 'output': ['0']}, {'input': '21\r\n', 'output': ['1\r\n15']}, {'input': '1000000000\r\n', 'output': ['1\r\n999999932']}]

[{'input': '75\r\n', 'output': ['0']}, {'input': '11\r\n', 'output': ['1\r\n10']}, {'input': '2014\r\n', 'output': ['2\r\n1988\r\n2006', '2\r\n1988 2006', '2\r\n1988\r\n 2006']}, {'input': '999999979\r\n', 'output': ['2\r\n999999899\r\n 999999908', '2\r\n999999899 999999908', '2\r\n999999899\r\n999999908']}, {'input': '9\r\n', 'output': ['0']}]

[{'input': '3\r\n', 'output': ['0']}, {'input': '39\r\n', 'output': ['1\r\n33']}, {'input': '1000000000\r\n', 'output': ['1\r\n999999932']}, {'input': '21\r\n', 'output': ['1\r\n15']}, {'input': '11\r\n', 'output': ['1\r\n10']}]

[{'input': '100\r\n', 'output': ['1\r\n86']}, {'input': '3\r\n', 'output': ['0']}, {'input': '1\r\n', 'output': ['0']}, {'input': '2014\r\n', 'output': ['2\r\n1988\r\n2006', '2\r\n1988 2006', '2\r\n1988\r\n 2006']}, {'input': '101\r\n', 'output': ['2\r\n91\r\n100', '2\r\n91\r\n 100', '2\r\n91 100']}]

[{'input': '9\r\n', 'output': ['0']}, {'input': '999999979\r\n', 'output': ['2\r\n999999899\r\n 999999908', '2\r\n999999899 999999908', '2\r\n999999899\r\n999999908']}, {'input': '66\r\n', 'output': ['1\r\n60']}, {'input': '2014\r\n', 'output': ['2\r\n1988\r\n2006', '2\r\n1988 2006', '2\r\n1988\r\n 2006']}, {'input': '21\r\n', 'output': ['1\r\n15']}]

["48", "6"]

The only line of the input contains one integer m (1 ≤ m ≤ 1015), meaning that Limak wants you to choose X between 1 and m, inclusive.

385cf3c40c96f0879788b766eeb25139

#D razbor 1 def func(n): if n<8: return n,n max_a = int(n**(1/3)) if (max_a+1)**3<=n: max_a += 1 v1=func(n-max_a**3) v1=(v1[0]+1,v1[1]+max_a**3) v2=func(max_a**3-1-(max_a-1)**3) v2=(v2[0]+1,v2[1]+(max_a-1)**3) if v2>v1: return v2 else: return v1 print(' '.join(map(str, func(int(input())))))

["9 42", "6 6"]

Python

NoteIn the first sample test, there will be 9 blocks if you choose X = 23 or X = 42. Limak wants to maximize X secondarily so you should choose 42.In more detail, after choosing X = 42 the process of building a tower is: Limak takes a block with side 3 because it's the biggest block with volume not greater than 42. The remaining volume is 42 - 27 = 15. The second added block has side 2, so the remaining volume is 15 - 8 = 7. Finally, Limak adds 7 blocks with side 1, one by one. So, there are 9 blocks in the tower. The total volume is is 33 + 23 + 7·13 = 27 + 8 + 7 = 42.

Print two integers — the maximum number of blocks in the tower and the maximum required total volume X, resulting in the maximum number of blocks.

Limak is a little polar bear. He plays by building towers from blocks. Every block is a cube with positive integer length of side. Limak has infinitely many blocks of each side length.A block with side a has volume a3. A tower consisting of blocks with sides a1, a2, ..., ak has the total volume a13 + a23 + ... + ak3.Limak is going to build a tower. First, he asks you to tell him a positive integer X — the required total volume of the tower. Then, Limak adds new blocks greedily, one by one. Each time he adds the biggest block such that the total volume doesn't exceed X.Limak asks you to choose X not greater than m. Also, he wants to maximize the number of blocks in the tower at the end (however, he still behaves greedily). Secondarily, he wants to maximize X.Can you help Limak? Find the maximum number of blocks his tower can have and the maximum X ≤ m that results this number of blocks.

[{"input": "48\r\n", "output": ["9 42"]}, {"input": "6\r\n", "output": ["6 6"]}, {"input": "1\r\n", "output": ["1 1"]}, {"input": "994\r\n", "output": ["12 941"]}, {"input": "567000123\r\n", "output": ["16 566998782"]}, {"input": "123830583943\r\n", "output": ["17 123830561521"]}, {"input": "3842529393411\r\n", "output": ["17 3842529383076"]}, {"input": "999999993700000\r\n", "output": ["18 999999993541753"]}, {"input": "2\r\n", "output": ["2 2"]}, {"input": "7\r\n", "output": ["7 7"]}, {"input": "8\r\n", "output": ["7 7"]}, {"input": "9\r\n", "output": ["7 7"]}, {"input": "112\r\n", "output": ["10 106"]}, {"input": "113\r\n", "output": ["10 113"]}, {"input": "114\r\n", "output": ["11 114"]}, {"input": "265\r\n", "output": ["11 212"]}, {"input": "995\r\n", "output": ["12 995"]}, {"input": "200385\r\n", "output": ["14 200355"]}, {"input": "909383000\r\n", "output": ["16 909381874"]}, {"input": "108000000057\r\n", "output": ["17 107986074062"]}, {"input": "385925923480002\r\n", "output": ["17 385925923479720"]}, {"input": "735412349812385\r\n", "output": ["18 735409591249436"]}, {"input": "980123123123123\r\n", "output": ["18 980123123116482"]}, {"input": "999088000000000\r\n", "output": ["18 999087986204952"]}, {"input": "409477218238716\r\n", "output": ["17 409477218238710"]}, {"input": "409477218238717\r\n", "output": ["17 409477218238717"]}, {"input": "409477218238718\r\n", "output": ["18 409477218238718"]}, {"input": "409477218238719\r\n", "output": ["18 409477218238718"]}, {"input": "419477218238718\r\n", "output": ["18 419466459294818"]}, {"input": "415000000238718\r\n", "output": ["18 414993991790735"]}, {"input": "850085504652042\r\n", "output": ["18 850085504652042"]}, {"input": "850085504652041\r\n", "output": ["18 850085504650655"]}, {"input": "936302451687000\r\n", "output": ["18 936302448662019"]}, {"input": "936302451687001\r\n", "output": ["18 936302448662019"]}, {"input": "936302451686999\r\n", "output": ["18 936302448662019"]}, {"input": "1000000000000000\r\n", "output": ["18 999999993541753"]}, {"input": "780869426483087\r\n", "output": ["18 780869407920631"]}, {"input": "1000000000000000\r\n", "output": ["18 999999993541753"]}, {"input": "990000000000000\r\n", "output": ["18 989983621692990"]}, {"input": "999998169714888\r\n", "output": ["18 999998150030846"]}, {"input": "999971000299999\r\n", "output": ["18 999969994441746"]}, {"input": "999999999999999\r\n", "output": ["18 999999993541753"]}, {"input": "999986542686123\r\n", "output": ["18 999969994441746"]}, {"input": "899990298504716\r\n", "output": ["18 899973747835553"]}, {"input": "409477318238718\r\n", "output": ["18 409477218238718"]}]

[{'input': '123830583943\r\n', 'output': ['17 123830561521']}, {'input': '995\r\n', 'output': ['12 995']}, {'input': '114\r\n', 'output': ['11 114']}, {'input': '1000000000000000\r\n', 'output': ['18 999999993541753']}, {'input': '112\r\n', 'output': ['10 106']}]

[{'input': '999998169714888\r\n', 'output': ['18 999998150030846']}, {'input': '415000000238718\r\n', 'output': ['18 414993991790735']}, {'input': '108000000057\r\n', 'output': ['17 107986074062']}, {'input': '990000000000000\r\n', 'output': ['18 989983621692990']}, {'input': '114\r\n', 'output': ['11 114']}]

[{'input': '108000000057\r\n', 'output': ['17 107986074062']}, {'input': '780869426483087\r\n', 'output': ['18 780869407920631']}, {'input': '8\r\n', 'output': ['7 7']}, {'input': '1000000000000000\r\n', 'output': ['18 999999993541753']}, {'input': '114\r\n', 'output': ['11 114']}]

[{'input': '909383000\r\n', 'output': ['16 909381874']}, {'input': '994\r\n', 'output': ['12 941']}, {'input': '567000123\r\n', 'output': ['16 566998782']}, {'input': '999998169714888\r\n', 'output': ['18 999998150030846']}, {'input': '999999999999999\r\n', 'output': ['18 999999993541753']}]

[{'input': '850085504652042\r\n', 'output': ['18 850085504652042']}, {'input': '6\r\n', 'output': ['6 6']}, {'input': '112\r\n', 'output': ['10 106']}, {'input': '999971000299999\r\n', 'output': ['18 999969994441746']}, {'input': '567000123\r\n', 'output': ['16 566998782']}]

["1 50\n50", "3 100\n50 50 100", "2 50\n50 50"]

The first line contains two integers n, k (1 ≤ n ≤ 50, 1 ≤ k ≤ 5000) — the number of people, including Greg, and the boat's weight limit. The next line contains n integers — the people's weights. A person's weight is either 50 kilos or 100 kilos. You can consider Greg and his friends indexed in some way.

ebb0323a854e19794c79ab559792a1f7

from collections import deque n, k = [int(i) for i in input().split()] a = [int(i) for i in input().split()] c50 = sum([1 for i in a if i == 50]) c100 = sum([1 for i in a if i == 100]) c = [[0] * 51 for i in range(51)] c[0][0] = 1 c[1][0] = 1 c[1][1] = 1 for x in range(2, 51): for y in range(x + 1): c[x][y] = c[x - 1][y - 1] + c[x - 1][y] d = [[[[0, float('inf')] for l in range(2)] for i in range(c100 + 1)] for j in range(c50 + 1)] # d[i][j][c] ответ, когда мы переправили i по 50 кг и j по 100 кг и лодка на берегу c d[0][0][0][0] = 1 d[0][0][0][1] = 0 q = deque() q.append([0, 0, 0]) while len(q) > 0: i, j, shore = q.popleft() for fifty in range(c50 - i + 1 if shore == 0 else i + 1): for hundreds in range(c100 - j + 1 if shore == 0 else j + 1): if fifty * 50 + hundreds * 100 > k or fifty + hundreds == 0: continue i1 = i + fifty if shore == 0 else i - fifty j1 = j + hundreds if shore == 0 else j - hundreds if d[i1][j1][1 ^ shore][1] > d[i][j][shore][1] + 1: d[i1][j1][1 ^ shore][1] = d[i][j][shore][1] + 1 d[i1][j1][1 ^ shore][0] = 0 q.append((i1, j1, 1 ^ shore)) if d[i1][j1][1 ^ shore][1] < d[i][j][shore][1] + 1: continue koeff = (c[c50 - i][fifty] if shore == 0 else c[i][fifty]) * ( c[c100 - j][hundreds] if shore == 0 else c[j][hundreds]) d[i1][j1][1 ^ shore][0] += d[i][j][shore][0] * koeff d[i1][j1][1 ^ shore][0] %= 10 ** 9 + 7 if d[c50][c100][1][1] == float('inf'): print(-1) print(0) else: print(d[c50][c100][1][1]) print(d[c50][c100][1][0])

["1\n1", "5\n2", "-1\n0"]

Python

NoteIn the first test Greg walks alone and consequently, he needs only one ride across the river.In the second test you should follow the plan: transport two 50 kg. people; transport one 50 kg. person back; transport one 100 kg. person; transport one 50 kg. person back; transport two 50 kg. people. That totals to 5 rides. Depending on which person to choose at step 2, we can get two distinct ways.

In the first line print an integer — the minimum number of rides. If transporting everyone to the other bank is impossible, print an integer -1. In the second line print the remainder after dividing the number of ways to transport the people in the minimum number of rides by number 1000000007 (109 + 7). If transporting everyone to the other bank is impossible, print integer 0.

One day Greg and his friends were walking in the forest. Overall there were n people walking, including Greg. Soon he found himself in front of a river. The guys immediately decided to get across the river. Luckily, there was a boat by the river bank, just where the guys were standing. We know that the boat can hold people with the total weight of at most k kilograms.Greg immediately took a piece of paper and listed there the weights of all people in his group (including himself). It turned out that each person weights either 50 or 100 kilograms. Now Greg wants to know what minimum number of times the boat needs to cross the river to transport the whole group to the other bank. The boat needs at least one person to navigate it from one bank to the other. As the boat crosses the river, it can have any non-zero number of passengers as long as their total weight doesn't exceed k.Also Greg is wondering, how many ways there are to transport everybody to the other side in the minimum number of boat rides. Two ways are considered distinct if during some ride they have distinct sets of people on the boat.Help Greg with this problem.

[{"input": "1 50\r\n50\r\n", "output": ["1\r\n1"]}, {"input": "3 100\r\n50 50 100\r\n", "output": ["5\r\n2"]}, {"input": "2 50\r\n50 50\r\n", "output": ["-1\r\n0"]}, {"input": "5 258\r\n100 100 50 50 50\r\n", "output": ["3\r\n72"]}, {"input": "8 191\r\n50 100 50 100 50 100 100 50\r\n", "output": ["11\r\n19318272"]}, {"input": "3 121\r\n100 100 50\r\n", "output": ["-1\r\n0"]}, {"input": "8 271\r\n100 50 100 50 50 50 100 50\r\n", "output": ["5\r\n78090"]}, {"input": "2 233\r\n50 100\r\n", "output": ["1\r\n1"]}, {"input": "2 153\r\n100 50\r\n", "output": ["1\r\n1"]}, {"input": "5 257\r\n50 50 50 50 50\r\n", "output": ["1\r\n1"]}, {"input": "49 290\r\n100 100 100 100 100 100 100 100 50 100 50 100 100 100 50 50 100 50 50 100 100 100 100 100 100 50 100 100 50 100 50 50 100 100 100 50 50 50 50 50 100 100 100 50 100 50 100 50 50\r\n", "output": ["39\r\n99624366"]}, {"input": "29 129\r\n50 50 50 100 100 100 50 100 50 50 50 100 50 100 100 100 50 100 100 100 50 50 50 50 50 50 50 50 50\r\n", "output": ["77\r\n37050209"]}, {"input": "32 121\r\n100 100 100 100 100 50 100 100 50 100 50 100 50 100 50 100 50 50 50 100 100 50 100 100 100 100 50 100 50 100 100 50\r\n", "output": ["101\r\n245361086"]}, {"input": "3 118\r\n100 100 100\r\n", "output": ["-1\r\n0"]}, {"input": "10 4894\r\n100 50 50 50 100 50 50 100 50 100\r\n", "output": ["1\r\n1"]}, {"input": "36 250\r\n50 100 100 50 100 100 100 50 50 100 50 50 50 50 50 50 100 50 100 100 100 100 100 100 100 50 50 100 50 50 100 100 100 100 100 50\r\n", "output": ["27\r\n77447096"]}, {"input": "31 291\r\n50 100 100 50 100 100 100 50 100 100 100 100 50 50 50 100 100 100 50 100 100 50 50 50 50 100 100 50 50 100 100\r\n", "output": ["23\r\n393964729"]}, {"input": "31 161\r\n100 50 50 50 50 100 50 100 50 100 100 50 50 100 100 50 100 50 50 100 50 100 100 50 50 100 50 50 100 50 100\r\n", "output": ["43\r\n670669365"]}, {"input": "5 123\r\n50 100 50 50 50\r\n", "output": ["9\r\n4536"]}, {"input": "43 293\r\n50 50 100 100 50 100 100 50 100 100 50 100 50 100 50 50 50 50 50 100 100 100 50 50 100 50 100 100 100 50 100 100 100 50 50 50 100 50 100 100 50 100 50\r\n", "output": ["31\r\n658920847"]}, {"input": "23 100\r\n50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50\r\n", "output": ["43\r\n689584957"]}, {"input": "41 218\r\n50 50 100 50 100 100 50 100 100 50 50 100 50 50 50 50 100 50 100 50 50 50 100 50 50 50 50 100 100 100 100 100 100 50 100 50 100 100 100 50 50\r\n", "output": ["39\r\n298372053"]}, {"input": "11 4668\r\n50 100 100 100 50 100 50 50 100 100 100\r\n", "output": ["1\r\n1"]}, {"input": "43 178\r\n50 50 100 100 100 50 100 100 50 100 100 100 50 100 50 100 50 50 100 100 50 100 100 50 50 50 100 50 50 50 100 50 100 100 100 50 100 50 50 50 50 100 100\r\n", "output": ["63\r\n503334985"]}, {"input": "33 226\r\n50 50 50 50 50 100 100 100 100 50 100 50 100 50 100 50 100 100 50 50 50 100 100 50 50 100 50 100 50 100 50 50 50\r\n", "output": ["31\r\n370884215"]}, {"input": "1 2994\r\n100\r\n", "output": ["1\r\n1"]}, {"input": "1 204\r\n50\r\n", "output": ["1\r\n1"]}, {"input": "33 123\r\n50 100 100 100 50 100 50 50 50 50 50 100 100 50 100 50 100 50 50 50 50 50 50 50 100 100 50 50 100 100 100 100 100\r\n", "output": ["93\r\n337243149"]}, {"input": "34 2964\r\n50 50 50 50 50 100 50 100 50 100 100 50 50 50 50 50 50 100 100 100 50 50 100 100 50 50 50 100 50 100 100 50 100 50\r\n", "output": ["1\r\n1"]}, {"input": "27 200\r\n50 50 50 50 100 100 50 50 100 100 100 50 100 50 100 50 50 100 100 100 50 100 100 50 50 50 100\r\n", "output": ["25\r\n271877303"]}, {"input": "31 197\r\n50 100 50 50 100 50 100 100 100 50 50 100 50 100 50 50 50 50 100 100 50 50 100 50 50 50 50 50 100 50 100\r\n", "output": ["41\r\n24368657"]}, {"input": "28 183\r\n50 100 100 50 100 50 100 100 50 100 50 100 100 100 50 50 100 50 50 50 100 50 100 50 50 100 100 100\r\n", "output": ["41\r\n844409785"]}, {"input": "48 204\r\n100 100 100 50 50 50 50 100 100 50 100 100 50 100 50 50 50 100 100 100 50 100 50 50 50 100 50 100 50 100 100 100 50 50 100 100 100 50 100 50 50 50 50 50 100 50 50 50\r\n", "output": ["45\r\n538567333"]}, {"input": "5 188\r\n50 50 50 50 50\r\n", "output": ["3\r\n30"]}, {"input": "29 108\r\n100 50 100 100 100 100 100 50 50 100 100 100 50 100 50 50 100 50 100 50 50 100 100 50 50 50 100 100 50\r\n", "output": ["87\r\n417423429"]}, {"input": "50 125\r\n50 50 50 100 100 50 100 100 50 50 100 100 100 100 100 100 50 50 100 50 100 100 50 50 50 100 100 50 100 100 100 100 100 100 100 50 50 50 100 50 50 50 50 100 100 100 100 100 50 50\r\n", "output": ["153\r\n971933773"]}, {"input": "50 2263\r\n50 100 50 100 50 100 100 100 50 50 50 100 100 100 100 100 100 50 50 100 50 100 50 50 100 50 50 100 100 50 100 100 100 50 50 50 100 50 100 50 50 50 50 50 100 100 50 50 100 50\r\n", "output": ["3\r\n211048352"]}, {"input": "50 110\r\n50 100 100 50 50 50 50 50 50 50 100 100 50 100 50 50 50 50 100 50 100 100 100 100 50 100 100 100 100 50 50 50 50 50 100 100 50 100 50 100 100 50 50 100 50 100 50 50 100 100\r\n", "output": ["143\r\n105841088"]}, {"input": "50 185\r\n100 50 50 50 50 50 100 50 100 50 100 100 50 50 100 100 100 50 50 100 50 100 50 50 100 100 100 100 100 50 50 100 100 100 50 100 50 100 50 50 100 50 100 50 50 100 50 50 100 100\r\n", "output": ["73\r\n930170107"]}, {"input": "50 207\r\n50 100 100 100 100 50 100 100 100 50 100 100 100 50 100 100 50 100 50 100 50 100 100 100 50 100 50 50 100 50 100 100 50 100 100 100 100 50 100 100 100 100 50 50 50 100 100 50 100 100\r\n", "output": ["55\r\n833060250"]}, {"input": "3 49\r\n50 50 50\r\n", "output": ["-1\r\n0"]}, {"input": "3 50\r\n50 50 50\r\n", "output": ["-1\r\n0"]}, {"input": "3 99\r\n100 50 50\r\n", "output": ["-1\r\n0"]}, {"input": "4 100\r\n100 100 100 50\r\n", "output": ["-1\r\n0"]}]

[{'input': '49 290\r\n100 100 100 100 100 100 100 100 50 100 50 100 100 100 50 50 100 50 50 100 100 100 100 100 100 50 100 100 50 100 50 50 100 100 100 50 50 50 50 50 100 100 100 50 100 50 100 50 50\r\n', 'output': ['39\r\n99624366']}, {'input': '11 4668\r\n50 100 100 100 50 100 50 50 100 100 100\r\n', 'output': ['1\r\n1']}, {'input': '36 250\r\n50 100 100 50 100 100 100 50 50 100 50 50 50 50 50 50 100 50 100 100 100 100 100 100 100 50 50 100 50 50 100 100 100 100 100 50\r\n', 'output': ['27\r\n77447096']}, {'input': '31 161\r\n100 50 50 50 50 100 50 100 50 100 100 50 50 100 100 50 100 50 50 100 50 100 100 50 50 100 50 50 100 50 100\r\n', 'output': ['43\r\n670669365']}, {'input': '50 185\r\n100 50 50 50 50 50 100 50 100 50 100 100 50 50 100 100 100 50 50 100 50 100 50 50 100 100 100 100 100 50 50 100 100 100 50 100 50 100 50 50 100 50 100 50 50 100 50 50 100 100\r\n', 'output': ['73\r\n930170107']}]

[{'input': '50 207\r\n50 100 100 100 100 50 100 100 100 50 100 100 100 50 100 100 50 100 50 100 50 100 100 100 50 100 50 50 100 50 100 100 50 100 100 100 100 50 100 100 100 100 50 50 50 100 100 50 100 100\r\n', 'output': ['55\r\n833060250']}, {'input': '3 121\r\n100 100 50\r\n', 'output': ['-1\r\n0']}, {'input': '31 161\r\n100 50 50 50 50 100 50 100 50 100 100 50 50 100 100 50 100 50 50 100 50 100 100 50 50 100 50 50 100 50 100\r\n', 'output': ['43\r\n670669365']}, {'input': '10 4894\r\n100 50 50 50 100 50 50 100 50 100\r\n', 'output': ['1\r\n1']}, {'input': '11 4668\r\n50 100 100 100 50 100 50 50 100 100 100\r\n', 'output': ['1\r\n1']}]

[{'input': '50 2263\r\n50 100 50 100 50 100 100 100 50 50 50 100 100 100 100 100 100 50 50 100 50 100 50 50 100 50 50 100 100 50 100 100 100 50 50 50 100 50 100 50 50 50 50 50 100 100 50 50 100 50\r\n', 'output': ['3\r\n211048352']}, {'input': '5 123\r\n50 100 50 50 50\r\n', 'output': ['9\r\n4536']}, {'input': '8 271\r\n100 50 100 50 50 50 100 50\r\n', 'output': ['5\r\n78090']}, {'input': '27 200\r\n50 50 50 50 100 100 50 50 100 100 100 50 100 50 100 50 50 100 100 100 50 100 100 50 50 50 100\r\n', 'output': ['25\r\n271877303']}, {'input': '41 218\r\n50 50 100 50 100 100 50 100 100 50 50 100 50 50 50 50 100 50 100 50 50 50 100 50 50 50 50 100 100 100 100 100 100 50 100 50 100 100 100 50 50\r\n', 'output': ['39\r\n298372053']}]

[{'input': '29 129\r\n50 50 50 100 100 100 50 100 50 50 50 100 50 100 100 100 50 100 100 100 50 50 50 50 50 50 50 50 50\r\n', 'output': ['77\r\n37050209']}, {'input': '31 161\r\n100 50 50 50 50 100 50 100 50 100 100 50 50 100 100 50 100 50 50 100 50 100 100 50 50 100 50 50 100 50 100\r\n', 'output': ['43\r\n670669365']}, {'input': '33 226\r\n50 50 50 50 50 100 100 100 100 50 100 50 100 50 100 50 100 100 50 50 50 100 100 50 50 100 50 100 50 100 50 50 50\r\n', 'output': ['31\r\n370884215']}, {'input': '50 185\r\n100 50 50 50 50 50 100 50 100 50 100 100 50 50 100 100 100 50 50 100 50 100 50 50 100 100 100 100 100 50 50 100 100 100 50 100 50 100 50 50 100 50 100 50 50 100 50 50 100 100\r\n', 'output': ['73\r\n930170107']}, {'input': '27 200\r\n50 50 50 50 100 100 50 50 100 100 100 50 100 50 100 50 50 100 100 100 50 100 100 50 50 50 100\r\n', 'output': ['25\r\n271877303']}]

[{'input': '43 178\r\n50 50 100 100 100 50 100 100 50 100 100 100 50 100 50 100 50 50 100 100 50 100 100 50 50 50 100 50 50 50 100 50 100 100 100 50 100 50 50 50 50 100 100\r\n', 'output': ['63\r\n503334985']}, {'input': '3 121\r\n100 100 50\r\n', 'output': ['-1\r\n0']}, {'input': '34 2964\r\n50 50 50 50 50 100 50 100 50 100 100 50 50 50 50 50 50 100 100 100 50 50 100 100 50 50 50 100 50 100 100 50 100 50\r\n', 'output': ['1\r\n1']}, {'input': '3 99\r\n100 50 50\r\n', 'output': ['-1\r\n0']}, {'input': '50 125\r\n50 50 50 100 100 50 100 100 50 50 100 100 100 100 100 100 50 50 100 50 100 100 50 50 50 100 100 50 100 100 100 100 100 100 100 50 50 50 100 50 50 50 50 100 100 100 100 100 50 50\r\n', 'output': ['153\r\n971933773']}]

["1 2 1 2", "1 12 1 12", "50 100 3 30"]

The only line contains four integers l, r, x, y (1 ≤ l ≤ r ≤ 109, 1 ≤ x ≤ y ≤ 109).

d37dde5841116352c9b37538631d0b15

import math def gcd(a, b): while b != 0: a, b = b, a % b return a def lcm(a, b): return a * b // (gcd(a, b)) def f(d): d = str(d) if d[len(d) - 2:] == '.0': return True return False l, r, x, y = [int(i) for i in input().split()] count = 0 for c in range(1, int(math.sqrt(y / x)) + 1): d = (y / x) / c if f(d): if l <= c * x and r >= d * x and gcd(c * x, d * x) == x and lcm(c * x, d * x) == y: if c != d: count += 2 else: count += 1 print(count)

["2", "4", "0"]

Python

NoteIn the first example there are two suitable good pairs of integers (a, b): (1, 2) and (2, 1).In the second example there are four suitable good pairs of integers (a, b): (1, 12), (12, 1), (3, 4) and (4, 3).In the third example there are good pairs of integers, for example, (3, 30), but none of them fits the condition l ≤ a, b ≤ r.

In the only line print the only integer — the answer for the problem.

Today on Informatics class Nastya learned about GCD and LCM (see links below). Nastya is very intelligent, so she solved all the tasks momentarily and now suggests you to solve one of them as well.We define a pair of integers (a, b) good, if GCD(a, b) = x and LCM(a, b) = y, where GCD(a, b) denotes the greatest common divisor of a and b, and LCM(a, b) denotes the least common multiple of a and b.You are given two integers x and y. You are to find the number of good pairs of integers (a, b) such that l ≤ a, b ≤ r. Note that pairs (a, b) and (b, a) are considered different if a ≠ b.

[{"input": "1 2 1 2\r\n", "output": ["2"]}, {"input": "1 12 1 12\r\n", "output": ["4"]}, {"input": "50 100 3 30\r\n", "output": ["0"]}, {"input": "1 1000000000 1 1000000000\r\n", "output": ["4"]}, {"input": "1 1000000000 158260522 200224287\r\n", "output": ["0"]}, {"input": "1 1000000000 2 755829150\r\n", "output": ["8"]}, {"input": "1 1000000000 158260522 158260522\r\n", "output": ["1"]}, {"input": "1 1000000000 877914575 877914575\r\n", "output": ["1"]}, {"input": "232 380232688 116 760465376\r\n", "output": ["30"]}, {"input": "47259 3393570 267 600661890\r\n", "output": ["30"]}, {"input": "1 1000000000 1 672672000\r\n", "output": ["64"]}, {"input": "1000000000 1000000000 1000000000 1000000000\r\n", "output": ["1"]}, {"input": "1 1000000000 1 649209600\r\n", "output": ["32"]}, {"input": "1 1000000000 1 682290000\r\n", "output": ["32"]}, {"input": "1 1000000000 1 228614400\r\n", "output": ["16"]}, {"input": "1 1000000000 1 800280000\r\n", "output": ["32"]}, {"input": "1 1000000000 1 919987200\r\n", "output": ["16"]}, {"input": "1 1000000000 1 456537870\r\n", "output": ["64"]}, {"input": "1 1000000000 1 7198102\r\n", "output": ["8"]}, {"input": "1 1000000000 1 58986263\r\n", "output": ["16"]}, {"input": "1 1000000000 1 316465536\r\n", "output": ["16"]}, {"input": "1 1000000000 1 9558312\r\n", "output": ["16"]}, {"input": "1 1000000000 1 5461344\r\n", "output": ["16"]}, {"input": "58 308939059 29 617878118\r\n", "output": ["62"]}, {"input": "837 16262937 27 504151047\r\n", "output": ["28"]}, {"input": "47275 402550 25 761222050\r\n", "output": ["12"]}, {"input": "22 944623394 22 944623394\r\n", "output": ["32"]}, {"input": "1032 8756124 12 753026664\r\n", "output": ["18"]}, {"input": "7238 939389 11 618117962\r\n", "output": ["10"]}, {"input": "58351 322621 23 818489477\r\n", "output": ["6"]}, {"input": "3450 7068875 25 975504750\r\n", "output": ["86"]}, {"input": "13266 1606792 22 968895576\r\n", "output": ["14"]}, {"input": "21930 632925 15 925336350\r\n", "output": ["42"]}, {"input": "2193 4224517 17 544962693\r\n", "output": ["42"]}, {"input": "526792 39807152 22904 915564496\r\n", "output": ["8"]}, {"input": "67728 122875524 16932 491502096\r\n", "output": ["12"]}, {"input": "319813 63298373 24601 822878849\r\n", "output": ["6"]}, {"input": "572464 23409136 15472 866138032\r\n", "output": ["4"]}, {"input": "39443 809059020 19716 777638472\r\n", "output": ["12"]}, {"input": "2544768 8906688 27072 837228672\r\n", "output": ["0"]}, {"input": "413592 46975344 21768 892531536\r\n", "output": ["10"]}, {"input": "11349 816231429 11349 816231429\r\n", "output": ["8"]}, {"input": "16578 939956022 16578 939956022\r\n", "output": ["4"]}, {"input": "2783175 6882425 21575 887832825\r\n", "output": ["2"]}, {"input": "2862252 7077972 22188 913058388\r\n", "output": ["2"]}, {"input": "1856828 13124976 25436 958123248\r\n", "output": ["6"]}, {"input": "100 1000000000 158260522 158260522\r\n", "output": ["1"]}, {"input": "100 1000000000 877914575 877914575\r\n", "output": ["1"]}, {"input": "100 1000000000 602436426 602436426\r\n", "output": ["1"]}, {"input": "100 1000000000 24979445 24979445\r\n", "output": ["1"]}, {"input": "1 1000000000 18470 112519240\r\n", "output": ["4"]}, {"input": "1 1000000000 22692 2201124\r\n", "output": ["2"]}, {"input": "1 1000000000 24190 400949250\r\n", "output": ["16"]}, {"input": "1 1000000000 33409 694005157\r\n", "output": ["2"]}, {"input": "1 1000000000 24967 470827686\r\n", "output": ["16"]}, {"input": "1 1000000000 35461 152517761\r\n", "output": ["8"]}, {"input": "2 1000000000 158260522 200224287\r\n", "output": ["0"]}, {"input": "2 1000000000 602436426 611751520\r\n", "output": ["0"]}, {"input": "2 1000000000 861648772 942726551\r\n", "output": ["0"]}, {"input": "2 1000000000 433933447 485982495\r\n", "output": ["0"]}, {"input": "2 1000000000 262703497 480832794\r\n", "output": ["0"]}, {"input": "2672374 422235092 1336187 844470184\r\n", "output": ["2"]}, {"input": "1321815 935845020 1321815 935845020\r\n", "output": ["8"]}, {"input": "29259607 69772909 2250739 907047817\r\n", "output": ["2"]}, {"input": "11678540 172842392 2335708 864211960\r\n", "output": ["4"]}, {"input": "297 173688298 2876112 851329152\r\n", "output": ["2"]}, {"input": "7249 55497026 659 610467286\r\n", "output": ["28"]}, {"input": "398520 1481490 810 728893080\r\n", "output": ["4"]}, {"input": "2354 369467362 1177 738934724\r\n", "output": ["14"]}, {"input": "407264 2497352 1144 889057312\r\n", "output": ["2"]}, {"input": "321399 1651014 603 879990462\r\n", "output": ["4"]}, {"input": "475640 486640 440 526057840\r\n", "output": ["2"]}, {"input": "631714 179724831 1136 717625968\r\n", "output": ["0"]}, {"input": "280476 1595832 588 761211864\r\n", "output": ["8"]}, {"input": "10455 39598005 615 673166085\r\n", "output": ["6"]}, {"input": "24725 19759875 575 849674625\r\n", "output": ["22"]}, {"input": "22 158 2 1738\r\n", "output": ["2"]}, {"input": "1 2623 1 2623\r\n", "output": ["4"]}, {"input": "7 163677675 3 18\r\n", "output": ["0"]}, {"input": "159 20749927 1 158\r\n", "output": ["0"]}, {"input": "5252 477594071 1 5251\r\n", "output": ["0"]}, {"input": "2202 449433679 3 6603\r\n", "output": ["0"]}, {"input": "6 111 3 222\r\n", "output": ["2"]}, {"input": "26 46 2 598\r\n", "output": ["2"]}, {"input": "26 82 2 1066\r\n", "output": ["2"]}, {"input": "1 2993 1 2993\r\n", "output": ["4"]}, {"input": "17 17 1 289\r\n", "output": ["0"]}, {"input": "177 267 3 15753\r\n", "output": ["2"]}, {"input": "7388 22705183 1 7387\r\n", "output": ["0"]}, {"input": "1 100 3 100\r\n", "output": ["0"]}, {"input": "1 1000 6 1024\r\n", "output": ["0"]}, {"input": "1 100 2 4\r\n", "output": ["2"]}, {"input": "1 10000 2 455\r\n", "output": ["0"]}, {"input": "1 1000000000 250000000 1000000000\r\n", "output": ["2"]}, {"input": "3 3 1 1\r\n", "output": ["0"]}, {"input": "1 1000000000 100000000 1000000000\r\n", "output": ["4"]}, {"input": "5 10 3 3\r\n", "output": ["0"]}, {"input": "1 1000 5 13\r\n", "output": ["0"]}, {"input": "2 2 3 3\r\n", "output": ["0"]}, {"input": "1 1000000000 499999993 999999986\r\n", "output": ["2"]}, {"input": "1 1 1 10\r\n", "output": ["0"]}, {"input": "1 10 10 100\r\n", "output": ["0"]}, {"input": "1 1000 4 36\r\n", "output": ["2"]}, {"input": "1 1000000000 10000000 20000000\r\n", "output": ["2"]}, {"input": "100 100 5 5\r\n", "output": ["0"]}, {"input": "3 3 3 9\r\n", "output": ["0"]}, {"input": "36 200 24 144\r\n", "output": ["2"]}, {"input": "1 100 3 10\r\n", "output": ["0"]}]

[{'input': '1 1000000000 24967 470827686\r\n', 'output': ['16']}, {'input': '29259607 69772909 2250739 907047817\r\n', 'output': ['2']}, {'input': '100 1000000000 877914575 877914575\r\n', 'output': ['1']}, {'input': '6 111 3 222\r\n', 'output': ['2']}, {'input': '5 10 3 3\r\n', 'output': ['0']}]

[{'input': '1 2993 1 2993\r\n', 'output': ['4']}, {'input': '1 1000000000 100000000 1000000000\r\n', 'output': ['4']}, {'input': '1 100 2 4\r\n', 'output': ['2']}, {'input': '3 3 3 9\r\n', 'output': ['0']}, {'input': '2672374 422235092 1336187 844470184\r\n', 'output': ['2']}]

[{'input': '29259607 69772909 2250739 907047817\r\n', 'output': ['2']}, {'input': '1 1000000000 33409 694005157\r\n', 'output': ['2']}, {'input': '1 1000000000 24190 400949250\r\n', 'output': ['16']}, {'input': '1032 8756124 12 753026664\r\n', 'output': ['18']}, {'input': '5 10 3 3\r\n', 'output': ['0']}]

[{'input': '13266 1606792 22 968895576\r\n', 'output': ['14']}, {'input': '6 111 3 222\r\n', 'output': ['2']}, {'input': '1 2993 1 2993\r\n', 'output': ['4']}, {'input': '47259 3393570 267 600661890\r\n', 'output': ['30']}, {'input': '26 82 2 1066\r\n', 'output': ['2']}]

[{'input': '2672374 422235092 1336187 844470184\r\n', 'output': ['2']}, {'input': '1 1000000000 1 7198102\r\n', 'output': ['8']}, {'input': '1 10000 2 455\r\n', 'output': ['0']}, {'input': '1 1000000000 499999993 999999986\r\n', 'output': ['2']}, {'input': '398520 1481490 810 728893080\r\n', 'output': ['4']}]

["5 2 2", "5 4 7", "6 2 3"]

The single line contains three integers T, S, q (2 ≤ q ≤ 104, 1 ≤ S &lt; T ≤ 105).

0d01bf286fb2c7950ce5d5fa59a17dd9

t,s,q=map(int,input().split()) res=0 while s<t:s*=q;res+=1 print(res)

["2", "1", "1"]

Python

NoteIn the first test, the song is played twice faster than it is downloaded, which means that during four first seconds Lesha reaches the moment that has not been downloaded, and starts the song again. After another two seconds, the song is downloaded completely, and thus, Lesha starts the song twice.In the second test, the song is almost downloaded, and Lesha will start it only once.In the third sample test the download finishes and Lesha finishes listening at the same moment. Note that song isn't restarted in this case.

Print a single integer — the number of times the song will be restarted.

Little Lesha loves listening to music via his smartphone. But the smartphone doesn't have much memory, so Lesha listens to his favorite songs in a well-known social network InTalk.Unfortunately, internet is not that fast in the city of Ekaterinozavodsk and the song takes a lot of time to download. But Lesha is quite impatient. The song's duration is T seconds. Lesha downloads the first S seconds of the song and plays it. When the playback reaches the point that has not yet been downloaded, Lesha immediately plays the song from the start (the loaded part of the song stays in his phone, and the download is continued from the same place), and it happens until the song is downloaded completely and Lesha listens to it to the end. For q seconds of real time the Internet allows you to download q - 1 seconds of the track.Tell Lesha, for how many times he will start the song, including the very first start.

[{"input": "5 2 2\r\n", "output": ["2"]}, {"input": "5 4 7\r\n", "output": ["1"]}, {"input": "6 2 3\r\n", "output": ["1"]}, {"input": "2 1 2\r\n", "output": ["1"]}, {"input": "2 1 3\r\n", "output": ["1"]}, {"input": "2 1 10000\r\n", "output": ["1"]}, {"input": "12326 6163 2\r\n", "output": ["1"]}, {"input": "10000 2500 4\r\n", "output": ["1"]}, {"input": "100000 99999 4\r\n", "output": ["1"]}, {"input": "12351 1223 6\r\n", "output": ["2"]}, {"input": "100000 1 10000\r\n", "output": ["2"]}, {"input": "10028 13 10000\r\n", "output": ["1"]}, {"input": "100000 99999 2\r\n", "output": ["1"]}, {"input": "100000 99999 3\r\n", "output": ["1"]}, {"input": "100000 1 2\r\n", "output": ["17"]}, {"input": "100000 1 3\r\n", "output": ["11"]}, {"input": "100000 1 4\r\n", "output": ["9"]}, {"input": "100000 1 5\r\n", "output": ["8"]}, {"input": "100000 3125 2\r\n", "output": ["5"]}, {"input": "12628 1804 7\r\n", "output": ["1"]}, {"input": "100000 45 13\r\n", "output": ["4"]}, {"input": "100000 500 3\r\n", "output": ["5"]}, {"input": "356 2 3\r\n", "output": ["5"]}, {"input": "50 2 2\r\n", "output": ["5"]}, {"input": "65465 12 3\r\n", "output": ["8"]}, {"input": "10033 3 8\r\n", "output": ["4"]}, {"input": "100000 3 2\r\n", "output": ["16"]}, {"input": "64 1 8\r\n", "output": ["2"]}, {"input": "10000 9 2\r\n", "output": ["11"]}, {"input": "25 2 2\r\n", "output": ["4"]}, {"input": "129 2 2\r\n", "output": ["7"]}, {"input": "6562 1 3\r\n", "output": ["9"]}, {"input": "100000 1 10\r\n", "output": ["5"]}]

[{'input': '100000 1 5\r\n', 'output': ['8']}, {'input': '25 2 2\r\n', 'output': ['4']}, {'input': '10033 3 8\r\n', 'output': ['4']}, {'input': '100000 1 10\r\n', 'output': ['5']}, {'input': '356 2 3\r\n', 'output': ['5']}]

[{'input': '2 1 10000\r\n', 'output': ['1']}, {'input': '64 1 8\r\n', 'output': ['2']}, {'input': '10000 2500 4\r\n', 'output': ['1']}, {'input': '2 1 3\r\n', 'output': ['1']}, {'input': '100000 1 5\r\n', 'output': ['8']}]

[{'input': '50 2 2\r\n', 'output': ['5']}, {'input': '65465 12 3\r\n', 'output': ['8']}, {'input': '10000 9 2\r\n', 'output': ['11']}, {'input': '100000 1 10000\r\n', 'output': ['2']}, {'input': '5 4 7\r\n', 'output': ['1']}]

[{'input': '5 4 7\r\n', 'output': ['1']}, {'input': '5 2 2\r\n', 'output': ['2']}, {'input': '100000 99999 4\r\n', 'output': ['1']}, {'input': '356 2 3\r\n', 'output': ['5']}, {'input': '2 1 2\r\n', 'output': ['1']}]

[{'input': '6562 1 3\r\n', 'output': ['9']}, {'input': '2 1 10000\r\n', 'output': ['1']}, {'input': '12628 1804 7\r\n', 'output': ['1']}, {'input': '100000 99999 3\r\n', 'output': ['1']}, {'input': '25 2 2\r\n', 'output': ['4']}]

["3\n2014 2016 2015", "1\n2050"]

The first line contains the positive odd integer n (1 ≤ n ≤ 5) — the number of groups which Igor joined. The next line contains n distinct integers a1, a2, ..., an (2010 ≤ ai ≤ 2100) — years of student's university entrance for each group in which Igor is the member. It is guaranteed that the input data is correct and the answer always exists. Groups are given randomly.

f03773118cca29ff8d5b4281d39e7c63

count = int(input()) sum = 0 years = input().split(' ') for y in years: sum += int(y) print(int(sum/count))

["2015", "2050"]

Python

NoteIn the first test the value x = 1. Igor entered the university in 2015. So he joined groups members of which are students who entered the university in 2014, 2015 and 2016.In the second test the value x = 0. Igor entered only the group which corresponds to the year of his university entrance.

Print the year of Igor's university entrance.

There is the faculty of Computer Science in Berland. In the social net "TheContact!" for each course of this faculty there is the special group whose name equals the year of university entrance of corresponding course of students at the university. Each of students joins the group of his course and joins all groups for which the year of student's university entrance differs by no more than x from the year of university entrance of this student, where x — some non-negative integer. A value x is not given, but it can be uniquely determined from the available data. Note that students don't join other groups. You are given the list of groups which the student Igor joined. According to this information you need to determine the year of Igor's university entrance.

[{"input": "3\r\n2014 2016 2015\r\n", "output": ["2015"]}, {"input": "1\r\n2050\r\n", "output": ["2050"]}, {"input": "1\r\n2010\r\n", "output": ["2010"]}, {"input": "1\r\n2011\r\n", "output": ["2011"]}, {"input": "3\r\n2010 2011 2012\r\n", "output": ["2011"]}, {"input": "3\r\n2049 2047 2048\r\n", "output": ["2048"]}, {"input": "5\r\n2043 2042 2041 2044 2040\r\n", "output": ["2042"]}, {"input": "5\r\n2012 2013 2014 2015 2016\r\n", "output": ["2014"]}, {"input": "1\r\n2045\r\n", "output": ["2045"]}, {"input": "1\r\n2046\r\n", "output": ["2046"]}, {"input": "1\r\n2099\r\n", "output": ["2099"]}, {"input": "1\r\n2100\r\n", "output": ["2100"]}, {"input": "3\r\n2011 2010 2012\r\n", "output": ["2011"]}, {"input": "3\r\n2011 2012 2010\r\n", "output": ["2011"]}, {"input": "3\r\n2012 2011 2010\r\n", "output": ["2011"]}, {"input": "3\r\n2010 2012 2011\r\n", "output": ["2011"]}, {"input": "3\r\n2012 2010 2011\r\n", "output": ["2011"]}, {"input": "3\r\n2047 2048 2049\r\n", "output": ["2048"]}, {"input": "3\r\n2047 2049 2048\r\n", "output": ["2048"]}, {"input": "3\r\n2048 2047 2049\r\n", "output": ["2048"]}, {"input": "3\r\n2048 2049 2047\r\n", "output": ["2048"]}, {"input": "3\r\n2049 2048 2047\r\n", "output": ["2048"]}, {"input": "5\r\n2011 2014 2012 2013 2010\r\n", "output": ["2012"]}, {"input": "5\r\n2014 2013 2011 2012 2015\r\n", "output": ["2013"]}, {"input": "5\r\n2021 2023 2024 2020 2022\r\n", "output": ["2022"]}, {"input": "5\r\n2081 2079 2078 2080 2077\r\n", "output": ["2079"]}, {"input": "5\r\n2095 2099 2097 2096 2098\r\n", "output": ["2097"]}, {"input": "5\r\n2097 2099 2100 2098 2096\r\n", "output": ["2098"]}, {"input": "5\r\n2012 2010 2014 2011 2013\r\n", "output": ["2012"]}, {"input": "5\r\n2012 2011 2013 2015 2014\r\n", "output": ["2013"]}, {"input": "5\r\n2023 2024 2022 2021 2020\r\n", "output": ["2022"]}, {"input": "5\r\n2077 2078 2080 2079 2081\r\n", "output": ["2079"]}, {"input": "5\r\n2099 2096 2095 2097 2098\r\n", "output": ["2097"]}, {"input": "5\r\n2097 2100 2098 2096 2099\r\n", "output": ["2098"]}, {"input": "5\r\n2011 2014 2013 2010 2012\r\n", "output": ["2012"]}, {"input": "5\r\n2013 2011 2015 2012 2014\r\n", "output": ["2013"]}, {"input": "5\r\n2024 2020 2021 2023 2022\r\n", "output": ["2022"]}, {"input": "5\r\n2079 2080 2077 2081 2078\r\n", "output": ["2079"]}, {"input": "5\r\n2095 2097 2096 2098 2099\r\n", "output": ["2097"]}, {"input": "5\r\n2099 2096 2100 2097 2098\r\n", "output": ["2098"]}, {"input": "5\r\n2034 2033 2036 2032 2035\r\n", "output": ["2034"]}, {"input": "5\r\n2030 2031 2033 2032 2029\r\n", "output": ["2031"]}, {"input": "5\r\n2093 2092 2094 2096 2095\r\n", "output": ["2094"]}, {"input": "5\r\n2012 2015 2014 2013 2011\r\n", "output": ["2013"]}, {"input": "5\r\n2056 2057 2058 2059 2060\r\n", "output": ["2058"]}]

[{'input': '1\r\n2099\r\n', 'output': ['2099']}, {'input': '5\r\n2077 2078 2080 2079 2081\r\n', 'output': ['2079']}, {'input': '3\r\n2012 2011 2010\r\n', 'output': ['2011']}, {'input': '5\r\n2099 2096 2095 2097 2098\r\n', 'output': ['2097']}, {'input': '1\r\n2045\r\n', 'output': ['2045']}]

[{'input': '5\r\n2081 2079 2078 2080 2077\r\n', 'output': ['2079']}, {'input': '1\r\n2045\r\n', 'output': ['2045']}, {'input': '3\r\n2047 2048 2049\r\n', 'output': ['2048']}, {'input': '5\r\n2012 2013 2014 2015 2016\r\n', 'output': ['2014']}, {'input': '5\r\n2024 2020 2021 2023 2022\r\n', 'output': ['2022']}]

[{'input': '3\r\n2049 2047 2048\r\n', 'output': ['2048']}, {'input': '1\r\n2100\r\n', 'output': ['2100']}, {'input': '5\r\n2056 2057 2058 2059 2060\r\n', 'output': ['2058']}, {'input': '3\r\n2049 2048 2047\r\n', 'output': ['2048']}, {'input': '5\r\n2011 2014 2013 2010 2012\r\n', 'output': ['2012']}]

[{'input': '5\r\n2030 2031 2033 2032 2029\r\n', 'output': ['2031']}, {'input': '3\r\n2048 2049 2047\r\n', 'output': ['2048']}, {'input': '5\r\n2079 2080 2077 2081 2078\r\n', 'output': ['2079']}, {'input': '5\r\n2097 2099 2100 2098 2096\r\n', 'output': ['2098']}, {'input': '3\r\n2010 2012 2011\r\n', 'output': ['2011']}]

[{'input': '5\r\n2024 2020 2021 2023 2022\r\n', 'output': ['2022']}, {'input': '3\r\n2049 2047 2048\r\n', 'output': ['2048']}, {'input': '5\r\n2043 2042 2041 2044 2040\r\n', 'output': ['2042']}, {'input': '5\r\n2093 2092 2094 2096 2095\r\n', 'output': ['2094']}, {'input': '1\r\n2011\r\n', 'output': ['2011']}]

["........\n........\n.B....B.\n....W...\n........\n..W.....\n........\n........", "..B.....\n..W.....\n......B.\n........\n.....W..\n......B.\n........\n........"]

The input consists of the board description given in eight lines, each line contains eight characters. Character 'B' is used to denote a black pawn, and character 'W' represents a white pawn. Empty cell is marked with '.'. It's guaranteed that there will not be white pawns on the first row neither black pawns on the last row.

0ddc839e17dee20e1a954c1289de7fbd

a = [input() for i in range(8)] ra, rb = 8, 8 for j in range(8) : for i in range(8) : if a[i][j] == 'W' : ra = min(ra, i) if a[i][j] != '.' : break for j in range(8) : for i in range(7,-1,-1) : if a[i][j] == 'B' : rb = min(rb, 7 - i) if a[i][j] != '.' : break print ('A' if ra <= rb else 'B')

["A", "B"]

Python

NoteIn the first sample player A is able to complete his goal in 3 steps by always moving a pawn initially located at (4, 5). Player B needs at least 5 steps for any of his pawns to reach the row 8. Hence, player A will be the winner.

Print 'A' if player A wins the game on the given board, and 'B' if player B will claim the victory. Again, it's guaranteed that there will always be a winner on the given board.

Galois is one of the strongest chess players of Byteforces. He has even invented a new variant of chess, which he named «PawnChess».This new game is played on a board consisting of 8 rows and 8 columns. At the beginning of every game some black and white pawns are placed on the board. The number of black pawns placed is not necessarily equal to the number of white pawns placed. Lets enumerate rows and columns with integers from 1 to 8. Rows are numbered from top to bottom, while columns are numbered from left to right. Now we denote as (r, c) the cell located at the row r and at the column c.There are always two players A and B playing the game. Player A plays with white pawns, while player B plays with black ones. The goal of player A is to put any of his pawns to the row 1, while player B tries to put any of his pawns to the row 8. As soon as any of the players completes his goal the game finishes immediately and the succeeded player is declared a winner.Player A moves first and then they alternate turns. On his move player A must choose exactly one white pawn and move it one step upward and player B (at his turn) must choose exactly one black pawn and move it one step down. Any move is possible only if the targeted cell is empty. It's guaranteed that for any scenario of the game there will always be at least one move available for any of the players.Moving upward means that the pawn located in (r, c) will go to the cell (r - 1, c), while moving down means the pawn located in (r, c) will go to the cell (r + 1, c). Again, the corresponding cell must be empty, i.e. not occupied by any other pawn of any color.Given the initial disposition of the board, determine who wins the game if both players play optimally. Note that there will always be a winner due to the restriction that for any game scenario both players will have some moves available.

[{"input": "........\r\n........\r\n.B....B.\r\n....W...\r\n........\r\n..W.....\r\n........\r\n........\r\n", "output": ["A"]}, {"input": "..B.....\r\n..W.....\r\n......B.\r\n........\r\n.....W..\r\n......B.\r\n........\r\n........\r\n", "output": ["B"]}, {"input": ".BB.B.B.\r\nB..B..B.\r\n.B.BB...\r\nBB.....B\r\nBBB....B\r\nB..BB...\r\nBB.B...B\r\n....WWW.\r\n", "output": ["B"]}, {"input": "..BB....\r\n........\r\nWW.W..WW\r\nW...W...\r\n.W...W..\r\n.W..W.WW\r\nW.....WW\r\nWW......\r\n", "output": ["A"]}, {"input": "BB....B.\r\nB.....B.\r\n.....B..\r\n..B...BB\r\n.W.BWBWB\r\n....W...\r\nWW.WWW..\r\n....W...\r\n", "output": ["B"]}, {"input": "B.B.BB.B\r\nW.WWW.WW\r\n.WWWWW.W\r\nW.BB.WBW\r\n.W..BBWB\r\nBB.WWBBB\r\n.W.W.WWB\r\nWWW..WW.\r\n", "output": ["A"]}, {"input": "BB..BB..\r\nBW.W.W.B\r\n..B.....\r\n.....BB.\r\n.B..B..B\r\n........\r\n...BB.B.\r\nW.WWWW.W\r\n", "output": ["A"]}, {"input": "BB......\r\nW....BBW\r\n........\r\n.B.B.BBB\r\n....BB..\r\nB....BB.\r\n...WWWW.\r\n....WW..\r\n", "output": ["A"]}, {"input": ".B.B..B.\r\nB.B....B\r\n...B.B.B\r\n..B.W..B\r\n.BBB.B.B\r\nB.BB.B.B\r\nBB..BBBB\r\nW.W.W.WW\r\n", "output": ["B"]}, {"input": "..BB....\r\n.B.B.B.B\r\n..B.B...\r\n..B..B.B\r\nWWWBWWB.\r\n.BB...B.\r\n..BBB...\r\n......W.\r\n", "output": ["B"]}, {"input": "..BB....\r\n.WBWBWBB\r\n.....BBB\r\n..WW....\r\n.W.W...W\r\nWWW...W.\r\n.W....W.\r\nW...W.W.\r\n", "output": ["A"]}, {"input": "B...BB..\r\nWWBBW.BB\r\n.W.W....\r\nWWWW....\r\nW....W..\r\nW..WW...\r\n...W....\r\nWW.W....\r\n", "output": ["A"]}, {"input": "B..BB..B\r\n..B.B...\r\nBW..BBW.\r\n...B.BBB\r\n.B..BB..\r\n..B.B.BB\r\n........\r\n........\r\n", "output": ["A"]}, {"input": "....BB..\r\nBB......\r\n.B.....B\r\nWW..WWW.\r\n...BB.B.\r\nB...BB..\r\n..W..WWW\r\n...W...W\r\n", "output": ["B"]}, {"input": "B...BBBB\r\n...BBB..\r\nBBWBWW.W\r\n.B..BB.B\r\nW..W..WW\r\nW.WW....\r\n........\r\nWW.....W\r\n", "output": ["A"]}, {"input": ".BB..B..\r\n.B.....B\r\n.B......\r\n.B...B..\r\n.......B\r\n.WWB.WWB\r\nW.....W.\r\n...W....\r\n", "output": ["B"]}, {"input": ".B......\r\n.B....B.\r\n...W....\r\n......W.\r\nW.WWWW.W\r\nW.WW....\r\n..WWW...\r\n..W...WW\r\n", "output": ["A"]}, {"input": "B.......\r\nBBB.....\r\n.B....B.\r\n.W.BWB.W\r\n......B.\r\nW..WW...\r\n...W....\r\nW...W..W\r\n", "output": ["A"]}, {"input": ".B......\r\n.B...B.B\r\n.B..B.BB\r\nW.......\r\n..W.....\r\n..WWW...\r\n.......W\r\n........\r\n", "output": ["A"]}, {"input": ".....B..\r\n........\r\n........\r\n.BB..B..\r\n..BB....\r\n........\r\n....WWW.\r\n......W.\r\n", "output": ["B"]}, {"input": "B.B...B.\r\n...BBBBB\r\n....B...\r\n...B...B\r\nB.B.B..B\r\n........\r\n........\r\nWWW..WW.\r\n", "output": ["B"]}, {"input": "B.B...B.\r\n........\r\n.......B\r\n.BB....B\r\n.....W..\r\n.W.WW.W.\r\n...W.WW.\r\nW..WW..W\r\n", "output": ["A"]}, {"input": "......B.\r\nB....B..\r\n...B.BB.\r\n...B....\r\n........\r\n..W....W\r\nWW......\r\n.W....W.\r\n", "output": ["B"]}, {"input": ".BBB....\r\nB.B.B...\r\nB.BB.B..\r\nB.BB.B.B\r\n........\r\n........\r\nW.....W.\r\n..WW..W.\r\n", "output": ["B"]}, {"input": "..B..BBB\r\n........\r\n........\r\n........\r\n...W.W..\r\n...W..W.\r\nW.......\r\n..W...W.\r\n", "output": ["A"]}, {"input": "........\r\n.B.B....\r\n...B..BB\r\n........\r\n........\r\nW...W...\r\nW...W...\r\nW.WW.W..\r\n", "output": ["A"]}, {"input": "...B..BB\r\n.B..B..B\r\n........\r\n........\r\n........\r\nW..W....\r\n.....WW.\r\n.W......\r\n", "output": ["A"]}, {"input": "B....BB.\r\n...B...B\r\n.B......\r\n........\r\n........\r\n........\r\n........\r\n....W..W\r\n", "output": ["B"]}, {"input": "...BB.BB\r\nBB...B..\r\n........\r\n........\r\n........\r\n........\r\n..W..W..\r\n......W.\r\n", "output": ["A"]}, {"input": "...BB...\r\n........\r\n........\r\n........\r\n........\r\n........\r\n......W.\r\nWW...WW.\r\n", "output": ["A"]}, {"input": "...B.B..\r\n........\r\n........\r\n........\r\n........\r\n........\r\n........\r\nWWW...WW\r\n", "output": ["A"]}, {"input": "BBBBBBB.\r\n........\r\n........\r\n........\r\n........\r\n........\r\n........\r\n.WWWWWWW\r\n", "output": ["A"]}, {"input": ".BBBBBB.\r\nB.......\r\n........\r\n........\r\n........\r\n........\r\n........\r\n.WWWWWWW\r\n", "output": ["B"]}, {"input": ".BBBBBBB\r\n........\r\n........\r\n........\r\n........\r\n........\r\n........\r\nWWWWWWW.\r\n", "output": ["A"]}, {"input": ".BBBBBB.\r\n.......B\r\n........\r\n........\r\n........\r\n........\r\n........\r\nWWWWWWW.\r\n", "output": ["B"]}, {"input": "B..BB...\r\n..B...B.\r\n.WBB...B\r\nBW......\r\nW.B...W.\r\n..BBW.B.\r\nBW..BB..\r\n......W.\r\n", "output": ["B"]}, {"input": "BBB.BBBB\r\nWB.W..B.\r\nBBBB...B\r\nB..B....\r\n.......W\r\n.BWB..BB\r\nB..BW.BW\r\n.W......\r\n", "output": ["A"]}, {"input": "B.BBBBBB\r\nB..BBB.B\r\nW.BB.W.B\r\nB.BWBB.B\r\nBWBWBBBB\r\n...BBBBB\r\nB.B...BB\r\nWW..WW.W\r\n", "output": ["B"]}, {"input": "BBBB.BBB\r\nBBBB.B.B\r\nB.B..BBB\r\nB.BB.BWW\r\nB.BB.BBB\r\nB.BB.BBB\r\n..BW.BB.\r\nW.WWWWWW\r\n", "output": ["B"]}, {"input": "BBBB.BBB\r\n.B....WB\r\nBB.B...B\r\nWWWW.WWB\r\nBB...BWW\r\nWWW..BBB\r\nW.BW.BB.\r\nWWWWWWW.\r\n", "output": ["B"]}, {"input": "B.BBBBBB\r\nW.WWBBBW\r\nW.BB.WBB\r\nW.W.BBBW\r\nW.BWW.WB\r\nB..B..BB\r\nB.B.W.BB\r\nWWWWW.WW\r\n", "output": ["B"]}, {"input": "BBBBBB.B\r\n.BBWBB.B\r\nWWW..B.W\r\n..WW.W.W\r\nBWB..W.W\r\n..BW.B.W\r\nB..B....\r\nWWWW.WWW\r\n", "output": ["B"]}, {"input": ".B...BB.\r\nWBB.BWBB\r\n.BWBW...\r\n..W...B.\r\nWB.BWW..\r\nWBW.....\r\n.W..W.B.\r\n.W.W.WW.\r\n", "output": ["A"]}, {"input": ".B..BBBB\r\nBB...WWB\r\nB..B.W.B\r\nWB.W...B\r\n...W.WW.\r\nW.....W.\r\nWB.W.W.W\r\n.WW...WW\r\n", "output": ["A"]}, {"input": "B.BBBBBB\r\nW.BB.W.B\r\nW.BBW...\r\n..WWWW.B\r\n....W..B\r\n.WW.W..W\r\n.W..WW.W\r\nW.W....W\r\n", "output": ["A"]}, {"input": "........\r\n.......W\r\n........\r\n........\r\n........\r\n........\r\n.......B\r\n........\r\n", "output": ["A"]}, {"input": "..B.....\r\n..W.....\r\n.W....B.\r\n........\r\n.B...W..\r\n......B.\r\n.W......\r\n........\r\n", "output": ["A"]}, {"input": "........\r\nB.......\r\n........\r\n........\r\n........\r\n........\r\n.......W\r\n........\r\n", "output": ["A"]}, {"input": "........\r\n........\r\n........\r\n.W......\r\n......B.\r\n........\r\n........\r\n........\r\n", "output": ["A"]}, {"input": "........\r\nB.......\r\nW.......\r\n.......B\r\n........\r\n........\r\n........\r\n...W....\r\n", "output": ["B"]}, {"input": "........\r\n.B......\r\n.W......\r\n........\r\n....B...\r\n........\r\n........\r\n.......W\r\n", "output": ["B"]}, {"input": "........\r\n..B.....\r\n..W...B.\r\n........\r\n.....W..\r\n......B.\r\n........\r\n........\r\n", "output": ["B"]}, {"input": "........\r\nW.......\r\n........\r\n........\r\n........\r\n........\r\n.......B\r\n........\r\n", "output": ["A"]}, {"input": "........\r\n........\r\n........\r\n........\r\nW.......\r\nB.......\r\n........\r\n........\r\n", "output": ["B"]}, {"input": "........\r\n........\r\n.W......\r\n........\r\n........\r\n........\r\n.B......\r\n........\r\n", "output": ["B"]}, {"input": "........\r\nB.......\r\nW.......\r\n.W......\r\n........\r\nB.......\r\n........\r\n........\r\n", "output": ["B"]}]

[{'input': 'BB....B.\r\nB.....B.\r\n.....B..\r\n..B...BB\r\n.W.BWBWB\r\n....W...\r\nWW.WWW..\r\n....W...\r\n', 'output': ['B']}, {'input': '......B.\r\nB....B..\r\n...B.BB.\r\n...B....\r\n........\r\n..W....W\r\nWW......\r\n.W....W.\r\n', 'output': ['B']}, {'input': '..B..BBB\r\n........\r\n........\r\n........\r\n...W.W..\r\n...W..W.\r\nW.......\r\n..W...W.\r\n', 'output': ['A']}, {'input': 'BBBB.BBB\r\n.B....WB\r\nBB.B...B\r\nWWWW.WWB\r\nBB...BWW\r\nWWW..BBB\r\nW.BW.BB.\r\nWWWWWWW.\r\n', 'output': ['B']}, {'input': '........\r\nB.......\r\nW.......\r\n.......B\r\n........\r\n........\r\n........\r\n...W....\r\n', 'output': ['B']}]

[{'input': 'B...BBBB\r\n...BBB..\r\nBBWBWW.W\r\n.B..BB.B\r\nW..W..WW\r\nW.WW....\r\n........\r\nWW.....W\r\n', 'output': ['A']}, {'input': '........\r\n........\r\n........\r\n........\r\nW.......\r\nB.......\r\n........\r\n........\r\n', 'output': ['B']}, {'input': '........\r\n..B.....\r\n..W...B.\r\n........\r\n.....W..\r\n......B.\r\n........\r\n........\r\n', 'output': ['B']}, {'input': 'B.B...B.\r\n...BBBBB\r\n....B...\r\n...B...B\r\nB.B.B..B\r\n........\r\n........\r\nWWW..WW.\r\n', 'output': ['B']}, {'input': '........\r\nB.......\r\n........\r\n........\r\n........\r\n........\r\n.......W\r\n........\r\n', 'output': ['A']}]

[{'input': 'BB..BB..\r\nBW.W.W.B\r\n..B.....\r\n.....BB.\r\n.B..B..B\r\n........\r\n...BB.B.\r\nW.WWWW.W\r\n', 'output': ['A']}, {'input': 'B...BB..\r\nWWBBW.BB\r\n.W.W....\r\nWWWW....\r\nW....W..\r\nW..WW...\r\n...W....\r\nWW.W....\r\n', 'output': ['A']}, {'input': 'B.B...B.\r\n........\r\n.......B\r\n.BB....B\r\n.....W..\r\n.W.WW.W.\r\n...W.WW.\r\nW..WW..W\r\n', 'output': ['A']}, {'input': '.B.B..B.\r\nB.B....B\r\n...B.B.B\r\n..B.W..B\r\n.BBB.B.B\r\nB.BB.B.B\r\nBB..BBBB\r\nW.W.W.WW\r\n', 'output': ['B']}, {'input': 'B.B...B.\r\n...BBBBB\r\n....B...\r\n...B...B\r\nB.B.B..B\r\n........\r\n........\r\nWWW..WW.\r\n', 'output': ['B']}]

[{'input': '........\r\n.B.B....\r\n...B..BB\r\n........\r\n........\r\nW...W...\r\nW...W...\r\nW.WW.W..\r\n', 'output': ['A']}, {'input': '.BBB....\r\nB.B.B...\r\nB.BB.B..\r\nB.BB.B.B\r\n........\r\n........\r\nW.....W.\r\n..WW..W.\r\n', 'output': ['B']}, {'input': 'B...BB..\r\nWWBBW.BB\r\n.W.W....\r\nWWWW....\r\nW....W..\r\nW..WW...\r\n...W....\r\nWW.W....\r\n', 'output': ['A']}, {'input': '.B.B..B.\r\nB.B....B\r\n...B.B.B\r\n..B.W..B\r\n.BBB.B.B\r\nB.BB.B.B\r\nBB..BBBB\r\nW.W.W.WW\r\n', 'output': ['B']}, {'input': '...BB.BB\r\nBB...B..\r\n........\r\n........\r\n........\r\n........\r\n..W..W..\r\n......W.\r\n', 'output': ['A']}]

[{'input': 'BB....B.\r\nB.....B.\r\n.....B..\r\n..B...BB\r\n.W.BWBWB\r\n....W...\r\nWW.WWW..\r\n....W...\r\n', 'output': ['B']}, {'input': '........\r\n.B.B....\r\n...B..BB\r\n........\r\n........\r\nW...W...\r\nW...W...\r\nW.WW.W..\r\n', 'output': ['A']}, {'input': '........\r\n........\r\n.B....B.\r\n....W...\r\n........\r\n..W.....\r\n........\r\n........\r\n', 'output': ['A']}, {'input': 'BBBBBB.B\r\n.BBWBB.B\r\nWWW..B.W\r\n..WW.W.W\r\nBWB..W.W\r\n..BW.B.W\r\nB..B....\r\nWWWW.WWW\r\n', 'output': ['B']}, {'input': 'BBB.BBBB\r\nWB.W..B.\r\nBBBB...B\r\nB..B....\r\n.......W\r\n.BWB..BB\r\nB..BW.BW\r\n.W......\r\n', 'output': ['A']}]

["1 1 -1", "1 3 1", "3 3 -1"]

The only line contains three integers n, m and k (1 ≤ n, m ≤ 1018, k is either 1 or -1).

6b9eff690fae14725885cbc891ff7243

mod=1000000007 n,m,k=list(map(int,input().split())) if k==-1: co=n+m if co%2!=0: print("0") else: n=n-1 m=m-1 n=n*m co=pow(2,n,mod) co%=1000000007 print(co) else: n=n-1 m=m-1 n=n*m co=pow(2,n,mod) co%=1000000007 print(co)

["1", "1", "16"]

Python

NoteIn the first example the only way is to put -1 into the only block.In the second example the only way is to put 1 into every block.

Print a single number denoting the answer modulo 1000000007.

Ralph has a magic field which is divided into n × m blocks. That is to say, there are n rows and m columns on the field. Ralph can put an integer in each block. However, the magic field doesn't always work properly. It works only if the product of integers in each row and each column equals to k, where k is either 1 or -1.Now Ralph wants you to figure out the number of ways to put numbers in each block in such a way that the magic field works properly. Two ways are considered different if and only if there exists at least one block where the numbers in the first way and in the second way are different. You are asked to output the answer modulo 1000000007 = 109 + 7.Note that there is no range of the numbers to put in the blocks, but we can prove that the answer is not infinity.

[{"input": "1 1 -1\r\n", "output": ["1"]}, {"input": "1 3 1\r\n", "output": ["1"]}, {"input": "3 3 -1\r\n", "output": ["16"]}, {"input": "2 7 1\r\n", "output": ["64"]}, {"input": "1 1 1\r\n", "output": ["1"]}, {"input": "2 4 -1\r\n", "output": ["8"]}, {"input": "173 69 -1\r\n", "output": ["814271739"]}, {"input": "110 142 1\r\n", "output": ["537040244"]}, {"input": "162 162 -1\r\n", "output": ["394042552"]}, {"input": "49 153 -1\r\n", "output": ["412796600"]}, {"input": "94 182 1\r\n", "output": ["33590706"]}, {"input": "106666666 233333333 1\r\n", "output": ["121241754"]}, {"input": "2 2 1\r\n", "output": ["2"]}, {"input": "146 34 -1\r\n", "output": ["742752757"]}, {"input": "94 86 -1\r\n", "output": ["476913727"]}, {"input": "2529756051797760 2682355969139391 -1\r\n", "output": ["0"]}, {"input": "3126690179932000 2474382898739836 -1\r\n", "output": ["917305624"]}, {"input": "3551499873841921 2512677762780671 -1\r\n", "output": ["350058339"]}, {"input": "3613456196418270 2872267429531501 1\r\n", "output": ["223552863"]}, {"input": "2886684369091916 3509787933422130 1\r\n", "output": ["341476979"]}, {"input": "3536041043537343 2416093514489183 1\r\n", "output": ["394974516"]}, {"input": "2273134852621270 2798005122439669 1\r\n", "output": ["901406364"]}, {"input": "2870150496178092 3171485931753811 -1\r\n", "output": ["0"]}, {"input": "999999999999999999 1000000000000000000 1\r\n", "output": ["102810659"]}, {"input": "987654321987654321 666666666666666666 1\r\n", "output": ["279028602"]}, {"input": "1 2 -1\r\n", "output": ["0"]}, {"input": "2 1 -1\r\n", "output": ["0"]}, {"input": "1000000000000000000 1 1\r\n", "output": ["1"]}, {"input": "1000000006 100000000000000000 1\r\n", "output": ["123624987"]}]

[{'input': '146 34 -1\r\n', 'output': ['742752757']}, {'input': '2886684369091916 3509787933422130 1\r\n', 'output': ['341476979']}, {'input': '987654321987654321 666666666666666666 1\r\n', 'output': ['279028602']}, {'input': '1000000006 100000000000000000 1\r\n', 'output': ['123624987']}, {'input': '173 69 -1\r\n', 'output': ['814271739']}]

[{'input': '2529756051797760 2682355969139391 -1\r\n', 'output': ['0']}, {'input': '3551499873841921 2512677762780671 -1\r\n', 'output': ['350058339']}, {'input': '3 3 -1\r\n', 'output': ['16']}, {'input': '1 1 1\r\n', 'output': ['1']}, {'input': '94 182 1\r\n', 'output': ['33590706']}]

[{'input': '2 2 1\r\n', 'output': ['2']}, {'input': '1 3 1\r\n', 'output': ['1']}, {'input': '94 182 1\r\n', 'output': ['33590706']}, {'input': '1 1 1\r\n', 'output': ['1']}, {'input': '3613456196418270 2872267429531501 1\r\n', 'output': ['223552863']}]

[{'input': '1 1 1\r\n', 'output': ['1']}, {'input': '173 69 -1\r\n', 'output': ['814271739']}, {'input': '3613456196418270 2872267429531501 1\r\n', 'output': ['223552863']}, {'input': '2 1 -1\r\n', 'output': ['0']}, {'input': '2273134852621270 2798005122439669 1\r\n', 'output': ['901406364']}]

[{'input': '987654321987654321 666666666666666666 1\r\n', 'output': ['279028602']}, {'input': '3536041043537343 2416093514489183 1\r\n', 'output': ['394974516']}, {'input': '1000000000000000000 1 1\r\n', 'output': ['1']}, {'input': '94 86 -1\r\n', 'output': ['476913727']}, {'input': '110 142 1\r\n', 'output': ['537040244']}]

["3 2", "5 4"]

The input consists of two space-separated integers p and k (3 ≤ p ≤ 1 000 000, 0 ≤ k ≤ p - 1) on a single line. It is guaranteed that p is an odd prime number.

580bf65af24fb7f08250ddbc4ca67e0e

__author__ = 'MoonBall' import sys # sys.stdin = open('data/D.in', 'r') T = 1 M = 1000000007 def process(): P, K = list(map(int, input().split())) k = [K * x % P for x in range(P)] # print(k) # f(0) = k[f(0)] # f(1) = k[f(4)] # f(2) = k[f(3)] # f(3) = k[f(2)] # f(4) = k[f(1)] if not K: print(pow(P, P - 1, M)) return if K == 1: print(pow(P, P, M)) return f = [0] * P c = [0] * P ans = 1 for i in range(P): if f[i]: continue cnt = 1 u = i f[u] = 1 while not f[k[u]]: u = k[u] f[u] = 1 cnt = cnt + 1 c[cnt] = c[cnt] + 1 # print(c) for i in range(2, P): if c[i] != 0: cnt = i * c[i] + 1 ans = ans * pow(cnt, c[i], M) % M print(ans) for _ in range(T): process()

["3", "25"]

Python

NoteIn the first sample, p = 3 and k = 2. The following functions work: f(0) = 0, f(1) = 1, f(2) = 2. f(0) = 0, f(1) = 2, f(2) = 1. f(0) = f(1) = f(2) = 0.

Print a single integer, the number of distinct functions f modulo 109 + 7.

As behooves any intelligent schoolboy, Kevin Sun is studying psycowlogy, cowculus, and cryptcowgraphy at the Bovinia State University (BGU) under Farmer Ivan. During his Mathematics of Olympiads (MoO) class, Kevin was confronted with a weird functional equation and needs your help. For two fixed integers k and p, where p is an odd prime number, the functional equation states that for some function . (This equation should hold for any integer x in the range 0 to p - 1, inclusive.)It turns out that f can actually be many different functions. Instead of finding a solution, Kevin wants you to count the number of distinct functions f that satisfy this equation. Since the answer may be very large, you should print your result modulo 109 + 7.

[{"input": "3 2\r\n", "output": ["3"]}, {"input": "5 4\r\n", "output": ["25"]}, {"input": "7 2\r\n", "output": ["49"]}, {"input": "7 6\r\n", "output": ["343"]}, {"input": "10007 25\r\n", "output": ["100140049"]}, {"input": "40037 4\r\n", "output": ["602961362"]}, {"input": "5 0\r\n", "output": ["625"]}, {"input": "5 3\r\n", "output": ["5"]}, {"input": "7 1\r\n", "output": ["823543"]}, {"input": "13 5\r\n", "output": ["2197"]}, {"input": "13 4\r\n", "output": ["169"]}, {"input": "5 2\r\n", "output": ["5"]}, {"input": "11 1\r\n", "output": ["311668616"]}, {"input": "11 10\r\n", "output": ["161051"]}, {"input": "6907 2590\r\n", "output": ["543643888"]}, {"input": "3229 153\r\n", "output": ["552691282"]}, {"input": "727 282\r\n", "output": ["471521101"]}, {"input": "7621 6195\r\n", "output": ["501036626"]}, {"input": "4649 4648\r\n", "output": ["460009811"]}, {"input": "5527 1711\r\n", "output": ["837297007"]}, {"input": "1901 633\r\n", "output": ["557576188"]}, {"input": "463 408\r\n", "output": ["853558215"]}, {"input": "6871 5566\r\n", "output": ["742783884"]}, {"input": "4177 556\r\n", "output": ["594173514"]}, {"input": "65213 29960\r\n", "output": ["65213"]}, {"input": "375103 52131\r\n", "output": ["947042280"]}, {"input": "990037 453792\r\n", "output": ["654009570"]}, {"input": "95531 94787\r\n", "output": ["95531"]}, {"input": "498653 116674\r\n", "output": ["625264514"]}, {"input": "561389 213181\r\n", "output": ["10668315"]}, {"input": "649849 339573\r\n", "output": ["649849"]}, {"input": "512287 359783\r\n", "output": ["542484357"]}, {"input": "337411 146419\r\n", "output": ["532279245"]}, {"input": "717887 1\r\n", "output": ["559281518"]}, {"input": "586189 189159\r\n", "output": ["168174057"]}, {"input": "613463 269592\r\n", "output": ["336849737"]}, {"input": "873781 51595\r\n", "output": ["226847774"]}, {"input": "203317 12108\r\n", "output": ["374893480"]}, {"input": "51419 21829\r\n", "output": ["643913547"]}, {"input": "115237 90311\r\n", "output": ["355904974"]}, {"input": "437071 24705\r\n", "output": ["743969711"]}, {"input": "278917 84398\r\n", "output": ["727771018"]}, {"input": "40867 37466\r\n", "output": ["560078799"]}, {"input": "274783 98997\r\n", "output": ["505696564"]}, {"input": "450431 344107\r\n", "output": ["450431"]}, {"input": "288179 113623\r\n", "output": ["124681010"]}, {"input": "807689 9869\r\n", "output": ["636680820"]}, {"input": "69833 569\r\n", "output": ["69833"]}, {"input": "805711 702149\r\n", "output": ["759894252"]}, {"input": "999983 999982\r\n", "output": ["794678399"]}, {"input": "999983 0\r\n", "output": ["416606930"]}, {"input": "999983 1\r\n", "output": ["844765997"]}, {"input": "823457 2\r\n", "output": ["203355139"]}, {"input": "999983 239239\r\n", "output": ["965993296"]}]

[{'input': '337411 146419\r\n', 'output': ['532279245']}, {'input': '6907 2590\r\n', 'output': ['543643888']}, {'input': '5 2\r\n', 'output': ['5']}, {'input': '7 2\r\n', 'output': ['49']}, {'input': '999983 999982\r\n', 'output': ['794678399']}]

[{'input': '40867 37466\r\n', 'output': ['560078799']}, {'input': '6907 2590\r\n', 'output': ['543643888']}, {'input': '807689 9869\r\n', 'output': ['636680820']}, {'input': '203317 12108\r\n', 'output': ['374893480']}, {'input': '5 3\r\n', 'output': ['5']}]

[{'input': '7621 6195\r\n', 'output': ['501036626']}, {'input': '999983 999982\r\n', 'output': ['794678399']}, {'input': '203317 12108\r\n', 'output': ['374893480']}, {'input': '5 2\r\n', 'output': ['5']}, {'input': '450431 344107\r\n', 'output': ['450431']}]

[{'input': '4177 556\r\n', 'output': ['594173514']}, {'input': '5 3\r\n', 'output': ['5']}, {'input': '7 2\r\n', 'output': ['49']}, {'input': '115237 90311\r\n', 'output': ['355904974']}, {'input': '873781 51595\r\n', 'output': ['226847774']}]

[{'input': '999983 1\r\n', 'output': ['844765997']}, {'input': '999983 0\r\n', 'output': ['416606930']}, {'input': '203317 12108\r\n', 'output': ['374893480']}, {'input': '873781 51595\r\n', 'output': ['226847774']}, {'input': '4649 4648\r\n', 'output': ['460009811']}]

["120 51840", "42 42", "48 72"]

The only line of the input contains two integers $$$n$$$ and $$$m$$$ ($$$1 \le n \le m \le 5\cdot10^8$$$).

3f9980ad292185f63a80bce10705e806

n2, n1 = (int(_) for _ in input().split()) if n1 % n2 == 0: n = n1 // n2 k = 0 f = True while n != 1: if n % 3 == 0: n //= 3 k += 1 elif n % 2 == 0: n //= 2 k += 1 else: print(-1) f = False break if f: print(k) else: print(-1)

["7", "0", "-1"]

Python

NoteIn the first example, the possible sequence of moves is: $$$120 \rightarrow 240 \rightarrow 720 \rightarrow 1440 \rightarrow 4320 \rightarrow 12960 \rightarrow 25920 \rightarrow 51840.$$$ The are $$$7$$$ steps in total.In the second example, no moves are needed. Thus, the answer is $$$0$$$.In the third example, it is impossible to transform $$$48$$$ to $$$72$$$.

Print the number of moves to transform $$$n$$$ to $$$m$$$, or -1 if there is no solution.

Polycarp plays "Game 23". Initially he has a number $$$n$$$ and his goal is to transform it to $$$m$$$. In one move, he can multiply $$$n$$$ by $$$2$$$ or multiply $$$n$$$ by $$$3$$$. He can perform any number of moves.Print the number of moves needed to transform $$$n$$$ to $$$m$$$. Print -1 if it is impossible to do so.It is easy to prove that any way to transform $$$n$$$ to $$$m$$$ contains the same number of moves (i.e. number of moves doesn't depend on the way of transformation).

[{"input": "120 51840\r\n", "output": ["7"]}, {"input": "42 42\r\n", "output": ["0"]}, {"input": "48 72\r\n", "output": ["-1"]}, {"input": "1 1\r\n", "output": ["0"]}, {"input": "1 2\r\n", "output": ["1"]}, {"input": "1 4\r\n", "output": ["2"]}, {"input": "1 5\r\n", "output": ["-1"]}, {"input": "1 6\r\n", "output": ["2"]}, {"input": "3024 94058496\r\n", "output": ["12"]}, {"input": "1953125 500000000\r\n", "output": ["8"]}, {"input": "139999978 419999934\r\n", "output": ["1"]}, {"input": "1 223092870\r\n", "output": ["-1"]}, {"input": "2 5\r\n", "output": ["-1"]}, {"input": "289777775 341477104\r\n", "output": ["-1"]}, {"input": "12 26\r\n", "output": ["-1"]}, {"input": "4 9\r\n", "output": ["-1"]}, {"input": "5 11\r\n", "output": ["-1"]}, {"input": "3 83\r\n", "output": ["-1"]}, {"input": "40 123\r\n", "output": ["-1"]}, {"input": "3 10\r\n", "output": ["-1"]}, {"input": "64 243\r\n", "output": ["-1"]}, {"input": "2 7\r\n", "output": ["-1"]}, {"input": "1 2048\r\n", "output": ["11"]}, {"input": "2 9\r\n", "output": ["-1"]}, {"input": "120 51841\r\n", "output": ["-1"]}, {"input": "1 512\r\n", "output": ["9"]}, {"input": "7 15\r\n", "output": ["-1"]}, {"input": "10001 10001\r\n", "output": ["0"]}, {"input": "300000007 300000007\r\n", "output": ["0"]}, {"input": "5 7\r\n", "output": ["-1"]}, {"input": "1001 1001\r\n", "output": ["0"]}, {"input": "120 1081\r\n", "output": ["-1"]}, {"input": "2 19\r\n", "output": ["-1"]}, {"input": "101 101\r\n", "output": ["0"]}, {"input": "1111 2223\r\n", "output": ["-1"]}, {"input": "201 201\r\n", "output": ["0"]}, {"input": "202 202\r\n", "output": ["0"]}, {"input": "203 203\r\n", "output": ["0"]}, {"input": "303 303\r\n", "output": ["0"]}, {"input": "403 403\r\n", "output": ["0"]}, {"input": "23 97\r\n", "output": ["-1"]}, {"input": "404 404\r\n", "output": ["0"]}, {"input": "405 405\r\n", "output": ["0"]}, {"input": "505 505\r\n", "output": ["0"]}, {"input": "3 9\r\n", "output": ["1"]}, {"input": "2 6\r\n", "output": ["1"]}, {"input": "11 67\r\n", "output": ["-1"]}, {"input": "1234 2469\r\n", "output": ["-1"]}, {"input": "1000 1000\r\n", "output": ["0"]}, {"input": "6 20\r\n", "output": ["-1"]}, {"input": "9 24\r\n", "output": ["-1"]}, {"input": "18782 37565\r\n", "output": ["-1"]}, {"input": "1 22\r\n", "output": ["-1"]}, {"input": "10 61\r\n", "output": ["-1"]}, {"input": "1000 2001\r\n", "output": ["-1"]}, {"input": "100000000 100000001\r\n", "output": ["-1"]}, {"input": "4000 8001\r\n", "output": ["-1"]}, {"input": "1 499999993\r\n", "output": ["-1"]}, {"input": "1 50331648\r\n", "output": ["25"]}, {"input": "3 13\r\n", "output": ["-1"]}, {"input": "10 24\r\n", "output": ["-1"]}, {"input": "2 22\r\n", "output": ["-1"]}, {"input": "6 29\r\n", "output": ["-1"]}, {"input": "1 7\r\n", "output": ["-1"]}, {"input": "6 21\r\n", "output": ["-1"]}, {"input": "50 64800\r\n", "output": ["8"]}, {"input": "5 16\r\n", "output": ["-1"]}, {"input": "2 18\r\n", "output": ["2"]}, {"input": "1 491280007\r\n", "output": ["-1"]}, {"input": "4 16\r\n", "output": ["2"]}, {"input": "2 13\r\n", "output": ["-1"]}, {"input": "1 262144\r\n", "output": ["18"]}, {"input": "1 16777216\r\n", "output": ["24"]}, {"input": "405691171 405691171\r\n", "output": ["0"]}, {"input": "5 12\r\n", "output": ["-1"]}, {"input": "1 500000000\r\n", "output": ["-1"]}, {"input": "1 362797056\r\n", "output": ["22"]}]

[{'input': '10 61\r\n', 'output': ['-1']}, {'input': '1 16777216\r\n', 'output': ['24']}, {'input': '1 262144\r\n', 'output': ['18']}, {'input': '50 64800\r\n', 'output': ['8']}, {'input': '203 203\r\n', 'output': ['0']}]

[{'input': '201 201\r\n', 'output': ['0']}, {'input': '1 500000000\r\n', 'output': ['-1']}, {'input': '1 223092870\r\n', 'output': ['-1']}, {'input': '505 505\r\n', 'output': ['0']}, {'input': '10 24\r\n', 'output': ['-1']}]

[{'input': '5 7\r\n', 'output': ['-1']}, {'input': '1001 1001\r\n', 'output': ['0']}, {'input': '201 201\r\n', 'output': ['0']}, {'input': '1 22\r\n', 'output': ['-1']}, {'input': '1 2\r\n', 'output': ['1']}]

[{'input': '120 51841\r\n', 'output': ['-1']}, {'input': '1 500000000\r\n', 'output': ['-1']}, {'input': '5 12\r\n', 'output': ['-1']}, {'input': '120 1081\r\n', 'output': ['-1']}, {'input': '1 6\r\n', 'output': ['2']}]

[{'input': '1 223092870\r\n', 'output': ['-1']}, {'input': '9 24\r\n', 'output': ['-1']}, {'input': '404 404\r\n', 'output': ['0']}, {'input': '5 7\r\n', 'output': ['-1']}, {'input': '1 1\r\n', 'output': ['0']}]

["25 3", "50 5"]

The only input line contains a pair of integers a, n (1 ≤ a, n ≤ 107; a + n - 1 ≤ 107).

915081861e391958dce6ee2a117abd4e

F = {} def f(k): if not k in F: s, i, j = 0, 4, 4 while i <= k: s += i * f(k // i) i += j + 1 j += 2 F[k] = (k * (k + 1)) // 2 - s return F[k] def g(k): s, i, j = 0, 4, 4 while i <= k: s += (i - 1) * f(k // i) i += j + 1 j += 2 return (k * (k + 1)) // 2 - s a, n = map(int, input().split()) print(g(a + n - 1) - g(a - 1))

["30", "125"]

Python

NoteA note to the first sample test. A year of 25 days will consist of one month containing 25 days. A year of 26 days will consist of 26 months, one day each. A year of 27 days will have three months, 9 days each.

Print the required number p. Please, do not use the %lld specifier to read or write 64-bit integers in C++. It is preferred to use cin, cout streams or the %I64d specifier.

Reforms have started in Berland again! At this time, the Parliament is discussing the reform of the calendar. To make the lives of citizens of Berland more varied, it was decided to change the calendar. As more and more people are complaining that "the years fly by...", it was decided that starting from the next year the number of days per year will begin to grow. So the coming year will have exactly a days, the next after coming year will have a + 1 days, the next one will have a + 2 days and so on. This schedule is planned for the coming n years (in the n-th year the length of the year will be equal a + n - 1 day).No one has yet decided what will become of months. An MP Palevny made the following proposal. The calendar for each month is comfortable to be printed on a square sheet of paper. We are proposed to make the number of days in each month be the square of some integer. The number of days per month should be the same for each month of any year, but may be different for different years. The number of days in each year must be divisible by the number of days per month in this year. This rule ensures that the number of months in each year is an integer. The number of days per month for each year must be chosen so as to save the maximum amount of paper to print the calendars. In other words, the number of days per month should be as much as possible. These rules provide an unambiguous method for choosing the number of days in each month for any given year length. For example, according to Palevny's proposition, a year that consists of 108 days will have three months, 36 days each. The year that consists of 99 days will have 11 months, 9 days each, and a year of 365 days will have 365 months, one day each.The proposal provoked heated discussion in the community, the famous mathematician Perelmanov quickly calculated that if the proposal is supported, then in a period of n years, beginning with the year that has a days, the country will spend p sheets of paper to print a set of calendars for these years. Perelmanov's calculations take into account the fact that the set will contain one calendar for each year and each month will be printed on a separate sheet.Repeat Perelmanov's achievement and print the required number p. You are given positive integers a and n. Perelmanov warns you that your program should not work longer than four seconds at the maximum test.

[{"input": "25 3\r\n", "output": ["30"]}, {"input": "50 5\r\n", "output": ["125"]}, {"input": "1 1\r\n", "output": ["1"]}, {"input": "1 2\r\n", "output": ["3"]}, {"input": "1 10\r\n", "output": ["38"]}, {"input": "1 5000000\r\n", "output": ["8224640917276"]}, {"input": "5000000 5000000\r\n", "output": ["24674231279431"]}, {"input": "4000000 5000000\r\n", "output": ["21384022194564"]}, {"input": "3000000 5000000\r\n", "output": ["18094224526592"]}, {"input": "1000000 5000000\r\n", "output": ["11514506860120"]}, {"input": "1 10000000\r\n", "output": ["32898872196712"]}]

[{'input': '1 5000000\r\n', 'output': ['8224640917276']}, {'input': '25 3\r\n', 'output': ['30']}, {'input': '1 10\r\n', 'output': ['38']}, {'input': '3000000 5000000\r\n', 'output': ['18094224526592']}, {'input': '5000000 5000000\r\n', 'output': ['24674231279431']}]

[{'input': '4000000 5000000\r\n', 'output': ['21384022194564']}, {'input': '1 1\r\n', 'output': ['1']}, {'input': '1 2\r\n', 'output': ['3']}, {'input': '25 3\r\n', 'output': ['30']}, {'input': '1 5000000\r\n', 'output': ['8224640917276']}]

[{'input': '1 1\r\n', 'output': ['1']}, {'input': '1 2\r\n', 'output': ['3']}, {'input': '1 10\r\n', 'output': ['38']}, {'input': '1 10000000\r\n', 'output': ['32898872196712']}, {'input': '3000000 5000000\r\n', 'output': ['18094224526592']}]

[{'input': '3000000 5000000\r\n', 'output': ['18094224526592']}, {'input': '25 3\r\n', 'output': ['30']}, {'input': '1 10\r\n', 'output': ['38']}, {'input': '1 5000000\r\n', 'output': ['8224640917276']}, {'input': '1000000 5000000\r\n', 'output': ['11514506860120']}]

[{'input': '4000000 5000000\r\n', 'output': ['21384022194564']}, {'input': '1 2\r\n', 'output': ['3']}, {'input': '1000000 5000000\r\n', 'output': ['11514506860120']}, {'input': '5000000 5000000\r\n', 'output': ['24674231279431']}, {'input': '3000000 5000000\r\n', 'output': ['18094224526592']}]

["4 2\naabb", "6 3\naacaab"]

The first line contains two integers n and k (1 ≤ n, k ≤ 100) — the number of baloons and friends. Next line contains string s — colors of baloons.

ceb3807aaffef60bcdbcc9a17a1391be

# -*- coding: utf-8 -*- """ Created on Sun Jun 30 16:47:42 2019 @author: avina """ n,m = map(int, input().split()) s = input() d = [] w = set(s) for i in w: d.append(s.count(i)) if max(d) > m: print('NO') else: print('YES')

["YES", "NO"]

Python

NoteIn the first sample Kefa can give 1-st and 3-rd baloon to the first friend, and 2-nd and 4-th to the second.In the second sample Kefa needs to give to all his friends baloons of color a, but one baloon will stay, thats why answer is «NO».

Answer to the task — «YES» or «NO» in a single line. You can choose the case (lower or upper) for each letter arbitrary.

One day Kefa found n baloons. For convenience, we denote color of i-th baloon as si — lowercase letter of the Latin alphabet. Also Kefa has k friends. Friend will be upset, If he get two baloons of the same color. Kefa want to give out all baloons to his friends. Help Kefa to find out, can he give out all his baloons, such that no one of his friens will be upset — print «YES», if he can, and «NO», otherwise. Note, that Kefa's friend will not upset, if he doesn't get baloons at all.

[{"input": "4 2\r\naabb\r\n", "output": ["YES"]}, {"input": "6 3\r\naacaab\r\n", "output": ["NO"]}, {"input": "2 2\r\nlu\r\n", "output": ["YES"]}, {"input": "5 3\r\novvoo\r\n", "output": ["YES"]}, {"input": "36 13\r\nbzbzcffczzcbcbzzfzbbfzfzzbfbbcbfccbf\r\n", "output": ["YES"]}, {"input": "81 3\r\nooycgmvvrophvcvpoupepqllqttwcocuilvyxbyumdmmfapvpnxhjhxfuagpnntonibicaqjvwfhwxhbv\r\n", "output": ["NO"]}, {"input": "100 100\r\nxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx\r\n", "output": ["YES"]}, {"input": "100 1\r\nnubcvvjvbjgnjsdkajimdcxvewbcytvfkihunycdrlconddlwgzjasjlsrttlrzsumzpyumpveglfqzmaofbshbojmwuwoxxvrod\r\n", "output": ["NO"]}, {"input": "100 13\r\nvyldolgryldqrvoldvzvrdrgorlorszddtgqvrlisxxrxdxlqtvtgsrqlzixoyrozxzogqxlsgzdddzqrgitxxritoolzolgrtvl\r\n", "output": ["YES"]}, {"input": "18 6\r\njzwtnkvmscqhmdlsxy\r\n", "output": ["YES"]}, {"input": "21 2\r\nfscegcqgzesefghhwcexs\r\n", "output": ["NO"]}, {"input": "32 22\r\ncduamsptaklqtxlyoutlzepxgyfkvngc\r\n", "output": ["YES"]}, {"input": "49 27\r\noxyorfnkzwsfllnyvdhdanppuzrnbxehugvmlkgeymqjlmfxd\r\n", "output": ["YES"]}, {"input": "50 24\r\nxxutzjwbggcwvxztttkmzovtmuwttzcbwoztttohzzxghuuthv\r\n", "output": ["YES"]}, {"input": "57 35\r\nglxshztrqqfyxthqamagvtmrdparhelnzrqvcwqxjytkbuitovkdxueul\r\n", "output": ["YES"]}, {"input": "75 23\r\nittttiiuitutuiiuuututiuttiuiuutuuuiuiuuuuttuuttuutuiiuiuiiuiitttuututuiuuii\r\n", "output": ["NO"]}, {"input": "81 66\r\nfeqevfqfebhvubhuuvfuqheuqhbeeuebehuvhffvbqvqvfbqqvvhevqffbqqhvvqhfeehuhqeqhueuqqq\r\n", "output": ["YES"]}, {"input": "93 42\r\npqeiafraiavfcteumflpcbpozcomlvpovlzdbldvoopnhdoeqaopzthiuzbzmeieiatthdeqovaqfipqlddllmfcrrnhb\r\n", "output": ["YES"]}, {"input": "100 53\r\nizszyqyndzwzyzgsdagdwdazadiawizinagqqgczaqqnawgijziziawzszdjdcqjdjqiwgadydcnqisaayjiqqsscwwzjzaycwwc\r\n", "output": ["YES"]}, {"input": "100 14\r\nvkrdcqbvkwuckpmnbydmczdxoagdsgtqxvhaxntdcxhjcrjyvukhugoglbmyoaqexgtcfdgemmizoniwtmisqqwcwfusmygollab\r\n", "output": ["YES"]}, {"input": "100 42\r\naaaaaiiiiaiiiaaiaiiaaiiiiiaaaaaiaiiiaiiiiaiiiaaaaaiiiaaaiiaaiiiaiiiaiaaaiaiiiiaaiiiaiiaiaiiaiiiaaaia\r\n", "output": ["NO"]}, {"input": "100 89\r\ntjbkmydejporbqhcbztkcumxjjgsrvxpuulbhzeeckkbchpbxwhedrlhjsabcexcohgdzouvsgphjdthpuqrlkgzxvqbuhqxdsmf\r\n", "output": ["YES"]}, {"input": "100 100\r\njhpyiuuzizhubhhpxbbhpyxzhbpjphzppuhiahihiappbhuypyauhizpbibzixjbzxzpbphuiaypyujappuxiyuyaajaxjupbahb\r\n", "output": ["YES"]}, {"input": "100 3\r\nsszoovvzysavsvzsozzvoozvysozsaszayaszasaysszzzysosyayyvzozovavzoyavsooaoyvoozvvozsaosvayyovazzszzssa\r\n", "output": ["NO"]}, {"input": "100 44\r\ndluthkxwnorabqsukgnxnvhmsmzilyulpursnxkdsavgemiuizbyzebhyjejgqrvuckhaqtuvdmpziesmpmewpvozdanjyvwcdgo\r\n", "output": ["YES"]}, {"input": "100 90\r\ntljonbnwnqounictqqctgonktiqoqlocgoblngijqokuquoolciqwnctgoggcbojtwjlculoikbggquqncittwnjbkgkgubnioib\r\n", "output": ["YES"]}, {"input": "100 79\r\nykxptzgvbqxlregvkvucewtydvnhqhuggdsyqlvcfiuaiddnrrnstityyehiamrggftsqyduwxpuldztyzgmfkehprrneyvtknmf\r\n", "output": ["YES"]}, {"input": "100 79\r\naagwekyovbviiqeuakbqbqifwavkfkutoriovgfmittulhwojaptacekdirgqoovlleeoqkkdukpadygfwavppohgdrmymmulgci\r\n", "output": ["YES"]}, {"input": "100 93\r\nearrehrehenaddhdnrdddhdahnadndheeennrearrhraharddreaeraddhehhhrdnredanndneheddrraaneerreedhnadnerhdn\r\n", "output": ["YES"]}, {"input": "100 48\r\nbmmaebaebmmmbbmxvmammbvvebvaemvbbaxvbvmaxvvmveaxmbbxaaemxmxvxxxvxbmmxaaaevvaxmvamvvmaxaxavexbmmbmmev\r\n", "output": ["YES"]}, {"input": "100 55\r\nhsavbkehaaesffaeeffakhkhfehbbvbeasahbbbvkesbfvkefeesesevbsvfkbffakvshsbkahfkfakebsvafkbvsskfhfvaasss\r\n", "output": ["YES"]}, {"input": "100 2\r\ncscffcffsccffsfsfffccssfsscfsfsssffcffsscfccssfffcfscfsscsccccfsssffffcfcfsfffcsfsccffscffcfccccfffs\r\n", "output": ["NO"]}, {"input": "100 3\r\nzrgznxgdpgfoiifrrrsjfuhvtqxjlgochhyemismjnanfvvpzzvsgajcbsulxyeoepjfwvhkqogiiwqxjkrpsyaqdlwffoockxnc\r\n", "output": ["NO"]}, {"input": "100 5\r\njbltyyfjakrjeodqepxpkjideulofbhqzxjwlarufwzwsoxhaexpydpqjvhybmvjvntuvhvflokhshpicbnfgsqsmrkrfzcrswwi\r\n", "output": ["NO"]}, {"input": "100 1\r\nfnslnqktlbmxqpvcvnemxcutebdwepoxikifkzaaixzzydffpdxodmsxjribmxuqhueifdlwzytxkklwhljswqvlejedyrgguvah\r\n", "output": ["NO"]}, {"input": "100 21\r\nddjenetwgwmdtjbpzssyoqrtirvoygkjlqhhdcjgeurqpunxpupwaepcqkbjjfhnvgpyqnozhhrmhfwararmlcvpgtnopvjqsrka\r\n", "output": ["YES"]}, {"input": "100 100\r\nnjrhiauqlgkkpkuvciwzivjbbplipvhslqgdkfnmqrxuxnycmpheenmnrglotzuyxycosfediqcuadklsnzjqzfxnbjwvfljnlvq\r\n", "output": ["YES"]}, {"input": "100 100\r\nbbbbbbbtbbttbtbbbttbttbtbbttttbbbtbttbbbtbttbtbbttttbbbbbtbbttbtbbtbttbbbtbtbtbtbtbtbbbttbbtbtbtbbtb\r\n", "output": ["YES"]}, {"input": "14 5\r\nfssmmsfffmfmmm\r\n", "output": ["NO"]}, {"input": "2 1\r\nff\r\n", "output": ["NO"]}, {"input": "2 1\r\nhw\r\n", "output": ["YES"]}, {"input": "2 2\r\nss\r\n", "output": ["YES"]}, {"input": "1 1\r\nl\r\n", "output": ["YES"]}, {"input": "100 50\r\nfffffttttttjjjuuuvvvvvdddxxxxwwwwgggbsssncccczzyyyyyhhhhhkrreeeeeeaaaaaiiillllllllooooqqqqqqmmpppppp\r\n", "output": ["YES"]}, {"input": "100 50\r\nbbbbbbbbgggggggggggaaaaaaaahhhhhhhhhhpppppppppsssssssrrrrrrrrllzzzzzzzeeeeeeekkkkkkkwwwwwwwwjjjjjjjj\r\n", "output": ["YES"]}, {"input": "100 50\r\nwwwwwwwwwwwwwwxxxxxxxxxxxxxxxxxxxxxxxxzzzzzzzzzzzzzzzzzzbbbbbbbbbbbbbbbbbbbbjjjjjjjjjjjjjjjjjjjjjjjj\r\n", "output": ["YES"]}, {"input": "100 80\r\nbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmm\r\n", "output": ["YES"]}, {"input": "100 10\r\nbbttthhhhiiiiiiijjjjjvvvvpppssssseeeeeeewwwwgggkkkkkkkkmmmddddduuuzzzzllllnnnnnxxyyyffffccraaaaooooq\r\n", "output": ["YES"]}, {"input": "100 20\r\nssssssssssbbbbbbbhhhhhhhyyyyyyyzzzzzzzzzzzzcccccxxxxxxxxxxddddmmmmmmmeeeeeeejjjjjjjjjwwwwwwwtttttttt\r\n", "output": ["YES"]}, {"input": "1 2\r\na\r\n", "output": ["YES"]}, {"input": "3 1\r\nabb\r\n", "output": ["NO"]}, {"input": "2 1\r\naa\r\n", "output": ["NO"]}, {"input": "2 1\r\nab\r\n", "output": ["YES"]}, {"input": "6 2\r\naaaaaa\r\n", "output": ["NO"]}, {"input": "8 4\r\naaaaaaaa\r\n", "output": ["NO"]}, {"input": "4 2\r\naaaa\r\n", "output": ["NO"]}, {"input": "4 3\r\naaaa\r\n", "output": ["NO"]}, {"input": "1 3\r\na\r\n", "output": ["YES"]}, {"input": "4 3\r\nzzzz\r\n", "output": ["NO"]}, {"input": "4 1\r\naaaa\r\n", "output": ["NO"]}, {"input": "3 4\r\nabc\r\n", "output": ["YES"]}, {"input": "2 5\r\nab\r\n", "output": ["YES"]}, {"input": "2 4\r\nab\r\n", "output": ["YES"]}, {"input": "1 10\r\na\r\n", "output": ["YES"]}, {"input": "5 2\r\nzzzzz\r\n", "output": ["NO"]}, {"input": "53 26\r\naaaaaaaaaaaaaaaaaaaaaaaaaabbbbbbbbbbbbbbbbbbbbbbbbbbb\r\n", "output": ["NO"]}, {"input": "4 1\r\nabab\r\n", "output": ["NO"]}, {"input": "4 1\r\nabcb\r\n", "output": ["NO"]}, {"input": "4 2\r\nabbb\r\n", "output": ["NO"]}, {"input": "5 2\r\nabccc\r\n", "output": ["NO"]}, {"input": "2 3\r\nab\r\n", "output": ["YES"]}, {"input": "4 3\r\nbbbs\r\n", "output": ["YES"]}, {"input": "10 2\r\nazzzzzzzzz\r\n", "output": ["NO"]}, {"input": "1 2\r\nb\r\n", "output": ["YES"]}, {"input": "1 3\r\nb\r\n", "output": ["YES"]}, {"input": "4 5\r\nabcd\r\n", "output": ["YES"]}, {"input": "4 6\r\naabb\r\n", "output": ["YES"]}, {"input": "5 2\r\naaaab\r\n", "output": ["NO"]}, {"input": "3 5\r\naaa\r\n", "output": ["YES"]}, {"input": "5 3\r\nazzzz\r\n", "output": ["NO"]}, {"input": "4 100\r\naabb\r\n", "output": ["YES"]}, {"input": "3 10\r\naaa\r\n", "output": ["YES"]}, {"input": "3 4\r\naaa\r\n", "output": ["YES"]}, {"input": "12 5\r\naaaaabbbbbbb\r\n", "output": ["NO"]}, {"input": "5 2\r\naabbb\r\n", "output": ["NO"]}, {"input": "10 5\r\nzzzzzzzzzz\r\n", "output": ["NO"]}, {"input": "2 4\r\naa\r\n", "output": ["YES"]}, {"input": "1 5\r\na\r\n", "output": ["YES"]}, {"input": "10 5\r\naaaaaaaaaa\r\n", "output": ["NO"]}, {"input": "6 3\r\naaaaaa\r\n", "output": ["NO"]}, {"input": "7 1\r\nabcdeee\r\n", "output": ["NO"]}, {"input": "18 3\r\naaaaaabbbbbbcccccc\r\n", "output": ["NO"]}, {"input": "8 2\r\naabbccdd\r\n", "output": ["YES"]}, {"input": "4 2\r\nzzzz\r\n", "output": ["NO"]}, {"input": "4 2\r\nabaa\r\n", "output": ["NO"]}, {"input": "3 2\r\naaa\r\n", "output": ["NO"]}, {"input": "3 1\r\nzzz\r\n", "output": ["NO"]}, {"input": "5 4\r\nzzzzz\r\n", "output": ["NO"]}, {"input": "6 2\r\naabbbc\r\n", "output": ["NO"]}, {"input": "3 6\r\naaa\r\n", "output": ["YES"]}, {"input": "2 1\r\nzz\r\n", "output": ["NO"]}, {"input": "10 3\r\naaaeeeeeee\r\n", "output": ["NO"]}, {"input": "4 5\r\naabb\r\n", "output": ["YES"]}, {"input": "3 1\r\naaa\r\n", "output": ["NO"]}, {"input": "5 2\r\naazzz\r\n", "output": ["NO"]}, {"input": "6 2\r\nabbbbc\r\n", "output": ["NO"]}, {"input": "4 2\r\nxxxx\r\n", "output": ["NO"]}, {"input": "6 3\r\nzzzzzz\r\n", "output": ["NO"]}, {"input": "3 2\r\nabb\r\n", "output": ["YES"]}, {"input": "3 2\r\nzzz\r\n", "output": ["NO"]}, {"input": "6 5\r\nzzzzzz\r\n", "output": ["NO"]}, {"input": "6 3\r\nbcaaaa\r\n", "output": ["NO"]}, {"input": "100 100\r\naaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa\r\n", "output": ["YES"]}, {"input": "3 6\r\nabc\r\n", "output": ["YES"]}]

[{'input': '5 2\r\nzzzzz\r\n', 'output': ['NO']}, {'input': '1 3\r\na\r\n', 'output': ['YES']}, {'input': '75 23\r\nittttiiuitutuiiuuututiuttiuiuutuuuiuiuuuuttuuttuutuiiuiuiiuiitttuututuiuuii\r\n', 'output': ['NO']}, {'input': '3 6\r\naaa\r\n', 'output': ['YES']}, {'input': '1 10\r\na\r\n', 'output': ['YES']}]

[{'input': '49 27\r\noxyorfnkzwsfllnyvdhdanppuzrnbxehugvmlkgeymqjlmfxd\r\n', 'output': ['YES']}, {'input': '100 100\r\nxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx\r\n', 'output': ['YES']}, {'input': '53 26\r\naaaaaaaaaaaaaaaaaaaaaaaaaabbbbbbbbbbbbbbbbbbbbbbbbbbb\r\n', 'output': ['NO']}, {'input': '4 1\r\nabcb\r\n', 'output': ['NO']}, {'input': '5 2\r\nabccc\r\n', 'output': ['NO']}]

[{'input': '3 6\r\naaa\r\n', 'output': ['YES']}, {'input': '7 1\r\nabcdeee\r\n', 'output': ['NO']}, {'input': '2 1\r\nhw\r\n', 'output': ['YES']}, {'input': '8 4\r\naaaaaaaa\r\n', 'output': ['NO']}, {'input': '100 100\r\nbbbbbbbtbbttbtbbbttbttbtbbttttbbbtbttbbbtbttbtbbttttbbbbbtbbttbtbbtbttbbbtbtbtbtbtbtbbbttbbtbtbtbbtb\r\n', 'output': ['YES']}]

[{'input': '100 50\r\nfffffttttttjjjuuuvvvvvdddxxxxwwwwgggbsssncccczzyyyyyhhhhhkrreeeeeeaaaaaiiillllllllooooqqqqqqmmpppppp\r\n', 'output': ['YES']}, {'input': '100 100\r\nbbbbbbbtbbttbtbbbttbttbtbbttttbbbtbttbbbtbttbtbbttttbbbbbtbbttbtbbtbttbbbtbtbtbtbtbtbbbttbbtbtbtbbtb\r\n', 'output': ['YES']}, {'input': '4 1\r\nabab\r\n', 'output': ['NO']}, {'input': '100 48\r\nbmmaebaebmmmbbmxvmammbvvebvaemvbbaxvbvmaxvvmveaxmbbxaaemxmxvxxxvxbmmxaaaevvaxmvamvvmaxaxavexbmmbmmev\r\n', 'output': ['YES']}, {'input': '4 1\r\naaaa\r\n', 'output': ['NO']}]

[{'input': '6 2\r\naabbbc\r\n', 'output': ['NO']}, {'input': '3 2\r\naaa\r\n', 'output': ['NO']}, {'input': '4 6\r\naabb\r\n', 'output': ['YES']}, {'input': '32 22\r\ncduamsptaklqtxlyoutlzepxgyfkvngc\r\n', 'output': ['YES']}, {'input': '1 2\r\na\r\n', 'output': ['YES']}]

["6\n4 1 7 8 3 8\n1"]

The first line of the input contains integer n (1 ≤ n ≤ 100), where n — the number of students shouted "Fly, freebie, fly!" The second line contains n positive integers ti (1 ≤ ti ≤ 1000). The last line contains integer T (1 ≤ T ≤ 1000) — the time interval during which the freebie was near the dormitory.

086d07bd6f9031df09bd6a6e8fe8f25c

n, t = input(), [0] * 1002 for i in map(int, input().split()): t[i] += 1 T = int(input()) + 1 for i in range(1000): t[i + 1] += t[i] print(max(t[i + T] - t[i] for i in range(-1, 1001 - T)))

["3"]

Python

Print a single integer — the largest number of people who will pass exam tomorrow because of the freebie visit.

Everyone loves a freebie. Especially students.It is well-known that if in the night before exam a student opens window, opens the student's record-book and shouts loudly three times "Fly, freebie, fly!" — then flown freebie helps him to pass the upcoming exam.In the night before the exam on mathematical analysis n students living in dormitory shouted treasured words. The i-th student made a sacrament at the time ti, where ti is the number of seconds elapsed since the beginning of the night.It is known that the freebie is a capricious and willful lady. That night the freebie was near dormitory only for T seconds. Therefore, if for two students their sacrament times differ for more than T, then the freebie didn't visit at least one of them.Since all students are optimists, they really want to know what is the maximal number of students visited by the freebie can be.

[{"input": "6\r\n4 1 7 8 3 8\r\n1\r\n", "output": ["3"]}, {"input": "4\r\n4 2 1 5\r\n2\r\n", "output": ["2"]}, {"input": "10\r\n4 7 1 3 8 5 2 1 8 4\r\n3\r\n", "output": ["6"]}, {"input": "8\r\n39 49 37 28 40 17 50 2\r\n10\r\n", "output": ["3"]}, {"input": "2\r\n1 1\r\n1\r\n", "output": ["2"]}, {"input": "2\r\n1 1\r\n2\r\n", "output": ["2"]}, {"input": "2\r\n1 1\r\n1000\r\n", "output": ["2"]}, {"input": "2\r\n1 2\r\n2\r\n", "output": ["2"]}, {"input": "2\r\n450 826\r\n1000\r\n", "output": ["2"]}, {"input": "3\r\n3 1 1\r\n1\r\n", "output": ["2"]}, {"input": "3\r\n3 1 2\r\n2\r\n", "output": ["3"]}, {"input": "3\r\n3 4 3\r\n1\r\n", "output": ["3"]}, {"input": "3\r\n3 4 3\r\n1\r\n", "output": ["3"]}, {"input": "100\r\n63 69 36 40 74 31 86 42 81 95 60 55 98 98 2 16 84 37 61 47 81 91 85 62 85 32 79 74 65 48 39 60 97 90 59 76 98 73 58 5 16 54 59 42 9 27 95 24 9 6 42 49 64 61 22 27 43 60 39 87 99 57 5 62 48 67 81 36 27 87 41 88 5 33 43 81 82 65 46 52 43 68 85 75 81 99 30 56 67 55 92 4 3 3 66 32 30 45 22 88\r\n5\r\n", "output": ["11"]}, {"input": "100\r\n97 29 39 42 68 100 44 54 6 70 17 100 52 85 67 1 43 49 1 47 98 35 5 38 37 73 84 20 13 15 78 65 29 92 20 40 38 11 12 100 24 94 29 92 83 47 25 63 23 85 85 93 61 60 35 40 96 50 19 15 28 19 98 59 42 14 54 65 2 53 38 9 15 69 43 63 63 8 55 12 81 57 69 21 57 11 99 45 23 31 59 2 16 61 43 36 12 39 42 13\r\n50\r\n", "output": ["62"]}, {"input": "100\r\n31 1 56 82 96 98 25 41 74 73 8 66 95 50 89 77 98 12 69 45 6 10 48 59 1 77 15 77 9 52 66 8 6 71 39 3 58 73 66 45 8 22 67 83 58 6 96 79 46 43 44 90 13 67 56 32 83 96 93 22 49 10 100 79 99 41 13 71 42 96 89 10 84 95 89 7 18 49 16 54 61 35 25 71 26 68 22 40 68 19 30 51 18 20 12 61 11 23 86 72\r\n1\r\n", "output": ["6"]}, {"input": "100\r\n30 74 20 6 3 63 48 45 36 26 33 24 60 71 45 5 19 37 74 100 98 82 67 76 37 46 68 48 56 29 33 19 15 84 76 92 50 53 42 19 5 91 23 38 93 50 39 45 89 17 57 14 86 81 31 6 16 5 80 6 86 49 18 75 30 30 85 94 38 33 50 76 72 32 73 96 28 3 18 20 96 84 89 48 71 64 6 59 87 31 94 24 9 64 15 86 66 11 32 40\r\n90\r\n", "output": ["94"]}, {"input": "100\r\n398 82 739 637 913 962 680 125 963 931 311 680 20 530 795 126 881 666 226 323 594 416 176 6 820 317 866 723 831 432 139 706 608 218 963 550 592 544 874 927 763 468 121 424 91 956 42 442 883 66 299 654 964 730 160 615 515 255 709 278 224 223 304 292 41 450 445 556 477 327 647 518 90 470 894 837 655 495 612 113 746 610 751 486 116 933 314 348 736 58 219 429 976 773 678 642 696 522 161 422\r\n1\r\n", "output": ["3"]}, {"input": "100\r\n760 621 622 793 66 684 411 813 474 404 304 934 319 411 99 965 722 156 681 400 481 462 571 726 696 244 124 350 403 566 564 641 381 494 703 3 348 213 343 390 27 660 46 591 990 931 477 823 890 21 936 267 282 753 599 269 387 443 622 673 473 745 646 224 911 7 155 880 332 932 51 994 144 666 789 691 323 738 192 372 191 246 903 666 929 252 132 614 11 938 298 286 309 596 210 18 143 760 759 584\r\n10\r\n", "output": ["6"]}, {"input": "100\r\n923 357 749 109 685 126 961 437 859 91 985 488 644 777 950 144 479 667 1 535 475 38 843 606 672 333 798 42 595 854 410 914 934 586 329 595 861 321 603 924 434 636 475 395 619 449 336 790 279 931 605 898 276 47 537 935 508 576 168 465 115 884 960 593 883 581 468 426 848 289 525 309 589 106 924 238 829 975 897 373 650 41 952 621 817 46 366 488 924 561 960 449 311 32 517 737 20 765 799 3\r\n100\r\n", "output": ["18"]}, {"input": "100\r\n98 63 672 100 254 218 623 415 426 986 920 915 736 795 407 541 382 213 935 743 961 59 660 512 134 935 248 378 739 356 543 714 28 667 602 596 759 791 103 564 225 520 159 542 966 332 983 655 517 273 95 242 593 940 286 236 41 318 941 727 384 225 319 627 982 359 232 769 854 172 643 598 215 231 305 30 347 469 929 919 90 294 739 641 368 270 932 452 234 741 309 234 357 392 707 873 808 398 417 483\r\n1000\r\n", "output": ["100"]}, {"input": "100\r\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1\r\n1\r\n", "output": ["100"]}, {"input": "100\r\n2 1 1 1 2 2 2 2 2 2 1 1 1 1 2 2 1 1 1 2 2 1 1 1 1 2 1 2 1 2 1 2 1 2 2 2 1 1 2 1 2 2 1 1 2 2 2 2 2 1 1 2 1 1 1 2 1 2 1 2 1 2 1 1 2 1 2 1 2 1 2 1 2 1 1 2 2 1 2 2 1 1 1 2 2 2 1 1 2 2 1 2 2 2 1 2 2 1 2 2\r\n1\r\n", "output": ["100"]}, {"input": "100\r\n3 3 1 2 3 3 1 3 3 2 2 2 2 1 2 3 2 1 2 2 2 2 3 2 1 3 3 3 2 1 3 1 2 1 1 2 2 3 2 2 3 1 1 3 1 2 1 3 3 1 1 3 1 3 2 3 3 2 2 2 2 1 1 1 2 1 1 2 1 1 1 1 1 3 2 2 1 3 1 1 3 1 2 2 1 3 1 1 1 1 2 2 2 3 2 2 3 1 1 3\r\n1\r\n", "output": ["72"]}, {"input": "100\r\n2 1 3 4 1 1 4 1 3 2 1 4 4 4 4 4 3 2 1 1 2 2 1 3 3 1 1 1 2 3 4 3 1 1 1 4 2 2 2 2 4 1 2 4 2 2 4 3 3 4 1 2 4 1 3 4 1 2 1 2 1 3 3 2 1 1 4 2 1 3 3 2 3 4 1 2 2 4 2 1 4 3 4 3 1 4 3 1 2 3 3 3 2 4 1 1 4 1 2 3\r\n1\r\n", "output": ["55"]}, {"input": "100\r\n5 1 3 1 2 3 2 5 5 2 5 1 1 4 1 1 3 5 3 3 3 3 4 4 3 5 4 1 1 3 1 4 2 5 2 5 4 2 3 5 1 3 5 5 5 2 2 5 1 4 1 5 1 5 1 3 3 2 2 4 3 2 1 4 2 5 4 1 2 1 4 3 3 5 4 3 5 5 1 2 4 1 4 2 1 1 2 5 3 3 4 1 3 3 3 5 4 1 1 1\r\n1\r\n", "output": ["41"]}, {"input": "100\r\n1 7 8 10 9 4 2 1 6 5 10 6 3 1 10 1 8 4 3 1 7 4 3 7 4 9 1 3 3 5 10 3 7 10 10 10 3 6 2 8 1 3 3 6 2 8 3 7 8 3 4 1 6 4 4 2 10 6 2 10 10 1 7 8 8 1 9 8 7 8 5 2 5 9 2 5 7 10 3 9 8 3 9 4 3 8 6 8 2 8 9 6 7 10 7 9 6 4 4 8\r\n1\r\n", "output": ["24"]}, {"input": "1\r\n1\r\n1\r\n", "output": ["1"]}, {"input": "1\r\n1\r\n1000\r\n", "output": ["1"]}, {"input": "1\r\n849\r\n1\r\n", "output": ["1"]}]

[{'input': '1\r\n849\r\n1\r\n', 'output': ['1']}, {'input': '3\r\n3 1 1\r\n1\r\n', 'output': ['2']}, {'input': '100\r\n923 357 749 109 685 126 961 437 859 91 985 488 644 777 950 144 479 667 1 535 475 38 843 606 672 333 798 42 595 854 410 914 934 586 329 595 861 321 603 924 434 636 475 395 619 449 336 790 279 931 605 898 276 47 537 935 508 576 168 465 115 884 960 593 883 581 468 426 848 289 525 309 589 106 924 238 829 975 897 373 650 41 952 621 817 46 366 488 924 561 960 449 311 32 517 737 20 765 799 3\r\n100\r\n', 'output': ['18']}, {'input': '100\r\n1 7 8 10 9 4 2 1 6 5 10 6 3 1 10 1 8 4 3 1 7 4 3 7 4 9 1 3 3 5 10 3 7 10 10 10 3 6 2 8 1 3 3 6 2 8 3 7 8 3 4 1 6 4 4 2 10 6 2 10 10 1 7 8 8 1 9 8 7 8 5 2 5 9 2 5 7 10 3 9 8 3 9 4 3 8 6 8 2 8 9 6 7 10 7 9 6 4 4 8\r\n1\r\n', 'output': ['24']}, {'input': '3\r\n3 4 3\r\n1\r\n', 'output': ['3']}]

[{'input': '2\r\n1 1\r\n1\r\n', 'output': ['2']}, {'input': '100\r\n30 74 20 6 3 63 48 45 36 26 33 24 60 71 45 5 19 37 74 100 98 82 67 76 37 46 68 48 56 29 33 19 15 84 76 92 50 53 42 19 5 91 23 38 93 50 39 45 89 17 57 14 86 81 31 6 16 5 80 6 86 49 18 75 30 30 85 94 38 33 50 76 72 32 73 96 28 3 18 20 96 84 89 48 71 64 6 59 87 31 94 24 9 64 15 86 66 11 32 40\r\n90\r\n', 'output': ['94']}, {'input': '3\r\n3 1 1\r\n1\r\n', 'output': ['2']}, {'input': '100\r\n2 1 1 1 2 2 2 2 2 2 1 1 1 1 2 2 1 1 1 2 2 1 1 1 1 2 1 2 1 2 1 2 1 2 2 2 1 1 2 1 2 2 1 1 2 2 2 2 2 1 1 2 1 1 1 2 1 2 1 2 1 2 1 1 2 1 2 1 2 1 2 1 2 1 1 2 2 1 2 2 1 1 1 2 2 2 1 1 2 2 1 2 2 2 1 2 2 1 2 2\r\n1\r\n', 'output': ['100']}, {'input': '3\r\n3 4 3\r\n1\r\n', 'output': ['3']}]

[{'input': '6\r\n4 1 7 8 3 8\r\n1\r\n', 'output': ['3']}, {'input': '100\r\n2 1 1 1 2 2 2 2 2 2 1 1 1 1 2 2 1 1 1 2 2 1 1 1 1 2 1 2 1 2 1 2 1 2 2 2 1 1 2 1 2 2 1 1 2 2 2 2 2 1 1 2 1 1 1 2 1 2 1 2 1 2 1 1 2 1 2 1 2 1 2 1 2 1 1 2 2 1 2 2 1 1 1 2 2 2 1 1 2 2 1 2 2 2 1 2 2 1 2 2\r\n1\r\n', 'output': ['100']}, {'input': '100\r\n30 74 20 6 3 63 48 45 36 26 33 24 60 71 45 5 19 37 74 100 98 82 67 76 37 46 68 48 56 29 33 19 15 84 76 92 50 53 42 19 5 91 23 38 93 50 39 45 89 17 57 14 86 81 31 6 16 5 80 6 86 49 18 75 30 30 85 94 38 33 50 76 72 32 73 96 28 3 18 20 96 84 89 48 71 64 6 59 87 31 94 24 9 64 15 86 66 11 32 40\r\n90\r\n', 'output': ['94']}, {'input': '1\r\n1\r\n1000\r\n', 'output': ['1']}, {'input': '2\r\n1 2\r\n2\r\n', 'output': ['2']}]

[{'input': '2\r\n450 826\r\n1000\r\n', 'output': ['2']}, {'input': '2\r\n1 1\r\n1\r\n', 'output': ['2']}, {'input': '8\r\n39 49 37 28 40 17 50 2\r\n10\r\n', 'output': ['3']}, {'input': '3\r\n3 4 3\r\n1\r\n', 'output': ['3']}, {'input': '2\r\n1 1\r\n2\r\n', 'output': ['2']}]

[{'input': '100\r\n923 357 749 109 685 126 961 437 859 91 985 488 644 777 950 144 479 667 1 535 475 38 843 606 672 333 798 42 595 854 410 914 934 586 329 595 861 321 603 924 434 636 475 395 619 449 336 790 279 931 605 898 276 47 537 935 508 576 168 465 115 884 960 593 883 581 468 426 848 289 525 309 589 106 924 238 829 975 897 373 650 41 952 621 817 46 366 488 924 561 960 449 311 32 517 737 20 765 799 3\r\n100\r\n', 'output': ['18']}, {'input': '100\r\n760 621 622 793 66 684 411 813 474 404 304 934 319 411 99 965 722 156 681 400 481 462 571 726 696 244 124 350 403 566 564 641 381 494 703 3 348 213 343 390 27 660 46 591 990 931 477 823 890 21 936 267 282 753 599 269 387 443 622 673 473 745 646 224 911 7 155 880 332 932 51 994 144 666 789 691 323 738 192 372 191 246 903 666 929 252 132 614 11 938 298 286 309 596 210 18 143 760 759 584\r\n10\r\n', 'output': ['6']}, {'input': '2\r\n1 1\r\n1\r\n', 'output': ['2']}, {'input': '3\r\n3 4 3\r\n1\r\n', 'output': ['3']}, {'input': '3\r\n3 1 1\r\n1\r\n', 'output': ['2']}]

["60 60 45 55\n80 80 8 32", "60 60 45 55\n80 60 15 25", "50 50 35 45\n90 50 35 45"]

The input contains two lines. Each line has four space-separated integers xi, yi, ri, Ri, that describe the i-th ring; xi and yi are coordinates of the ring's center, ri and Ri are the internal and external radii of the ring correspondingly ( - 100 ≤ xi, yi ≤ 100; 1 ≤ ri &lt; Ri ≤ 100). It is guaranteed that the centers of the rings do not coinside.

4c2865e4742a29460ca64860740b84f4

def is_intersect(r1, r2, R, x1, y1, x2, y2): d = (x1 - x2)**2 + (y1 - y2)**2 return d >= (r1 + R)**2 or r1 < r2 and d <= (r2 - r1)**2 or R < r1 and d <= (r1 - R)**2 x1, y1, r1, R1 = map(int, input().split()) x2, y2, r2, R2 = map(int, input().split()) res1 = is_intersect(r1, r2, R2, x1, y1, x2, y2) res2 = is_intersect(R1, r2, R2, x1, y1, x2, y2) res3 = is_intersect(r2, r1, R1, x2, y2, x1, y1) res4 = is_intersect(R2, r1, R1, x2, y2, x1, y1) print(res1 + res2 + res3 + res4)

["1", "4", "0"]

Python

NoteFigures for test samples are given below. The possible cuts are marked with red dotted line.

A single integer — the number of ways to cut out a circle from the canvas.

A renowned abstract artist Sasha, drawing inspiration from nowhere, decided to paint a picture entitled "Special Olympics". He justly thought that, if the regular Olympic games have five rings, then the Special ones will do with exactly two rings just fine.Let us remind you that a ring is a region located between two concentric circles with radii r and R (r &lt; R). These radii are called internal and external, respectively. Concentric circles are circles with centers located at the same point.Soon a white canvas, which can be considered as an infinite Cartesian plane, had two perfect rings, painted with solid black paint. As Sasha is very impulsive, the rings could have different radii and sizes, they intersect and overlap with each other in any way. We know only one thing for sure: the centers of the pair of rings are not the same.When Sasha got tired and fell into a deep sleep, a girl called Ilona came into the room and wanted to cut a circle for the sake of good memories. To make the circle beautiful, she decided to cut along the contour.We'll consider a contour to be a continuous closed line through which there is transition from one color to another (see notes for clarification). If the contour takes the form of a circle, then the result will be cutting out a circle, which Iona wants.But the girl's inquisitive mathematical mind does not rest: how many ways are there to cut a circle out of the canvas?

[{"input": "60 60 45 55\r\n80 80 8 32\r\n", "output": ["1"]}, {"input": "60 60 45 55\r\n80 60 15 25\r\n", "output": ["4"]}, {"input": "50 50 35 45\r\n90 50 35 45\r\n", "output": ["0"]}, {"input": "0 0 50 70\r\n1 0 60 80\r\n", "output": ["2"]}, {"input": "0 0 1 2\r\n10 0 2 20\r\n", "output": ["2"]}, {"input": "31 13 22 95\r\n48 63 21 98\r\n", "output": ["0"]}, {"input": "31 40 37 76\r\n48 65 66 98\r\n", "output": ["0"]}, {"input": "-65 -81 37 76\r\n48 65 66 98\r\n", "output": ["4"]}, {"input": "41 -14 37 76\r\n48 65 66 98\r\n", "output": ["0"]}, {"input": "41 -14 16 100\r\n48 17 37 66\r\n", "output": ["1"]}, {"input": "-75 -9 20 40\r\n25 55 99 100\r\n", "output": ["0"]}, {"input": "-45 6 20 40\r\n35 6 99 100\r\n", "output": ["0"]}, {"input": "-3 84 20 40\r\n76 96 96 100\r\n", "output": ["0"]}, {"input": "10 -91 20 40\r\n70 -91 79 100\r\n", "output": ["1"]}, {"input": "-64 -47 20 40\r\n-5 -37 79 100\r\n", "output": ["1"]}, {"input": "-63 97 20 40\r\n-34 97 11 48\r\n", "output": ["0"]}, {"input": "-67 47 20 40\r\n-38 47 11 49\r\n", "output": ["0"]}, {"input": "-100 -91 20 40\r\n-71 -91 11 68\r\n", "output": ["0"]}, {"input": "45 -76 20 40\r\n69 -69 15 65\r\n", "output": ["1"]}, {"input": "12 -43 20 40\r\n41 -43 11 97\r\n", "output": ["1"]}, {"input": "10 71 20 40\r\n39 78 10 49\r\n", "output": ["0"]}, {"input": "56 44 20 40\r\n83 44 12 13\r\n", "output": ["1"]}, {"input": "-20 78 20 40\r\n8 85 10 11\r\n", "output": ["1"]}, {"input": "65 -9 20 40\r\n94 -9 10 49\r\n", "output": ["0"]}, {"input": "-84 -59 20 40\r\n-74 -59 29 30\r\n", "output": ["1"]}, {"input": "33 -37 20 40\r\n42 -37 28 29\r\n", "output": ["1"]}, {"input": "-25 10 20 40\r\n4 17 10 69\r\n", "output": ["0"]}, {"input": "13 32 20 40\r\n42 32 10 69\r\n", "output": ["1"]}, {"input": "-12 -1 20 40\r\n-3 -1 28 31\r\n", "output": ["1"]}, {"input": "48 30 20 40\r\n77 37 10 99\r\n", "output": ["1"]}, {"input": "47 -50 20 40\r\n56 -46 28 30\r\n", "output": ["1"]}, {"input": "-26 -65 20 40\r\n52 -65 98 100\r\n", "output": ["1"]}, {"input": "-46 36 20 40\r\n14 36 80 100\r\n", "output": ["2"]}, {"input": "19 96 20 40\r\n77 96 78 99\r\n", "output": ["2"]}, {"input": "-42 -44 20 40\r\n-32 -44 30 48\r\n", "output": ["1"]}, {"input": "83 -23 20 40\r\n93 -23 30 50\r\n", "output": ["2"]}, {"input": "-100 -97 20 40\r\n-90 -97 30 100\r\n", "output": ["2"]}, {"input": "65 16 20 40\r\n74 16 29 48\r\n", "output": ["1"]}, {"input": "-66 78 20 40\r\n-62 81 25 45\r\n", "output": ["2"]}, {"input": "-11 63 20 40\r\n-2 63 29 31\r\n", "output": ["2"]}, {"input": "91 -59 20 40\r\n100 -59 29 100\r\n", "output": ["2"]}, {"input": "39 90 20 40\r\n47 90 28 31\r\n", "output": ["2"]}, {"input": "-100 40 20 40\r\n-81 40 1 38\r\n", "output": ["1"]}, {"input": "24 -24 20 40\r\n43 -24 1 21\r\n", "output": ["2"]}, {"input": "-8 35 20 40\r\n11 35 1 19\r\n", "output": ["2"]}, {"input": "-52 -94 20 40\r\n-33 -94 1 39\r\n", "output": ["1"]}, {"input": "61 2 20 40\r\n67 10 10 30\r\n", "output": ["2"]}, {"input": "49 -67 20 40\r\n57 -67 12 28\r\n", "output": ["2"]}, {"input": "65 17 20 40\r\n84 17 1 58\r\n", "output": ["1"]}, {"input": "-16 -18 20 40\r\n3 -18 1 59\r\n", "output": ["2"]}, {"input": "24 -16 20 40\r\n33 -16 11 31\r\n", "output": ["2"]}, {"input": "-83 96 20 40\r\n-64 96 1 98\r\n", "output": ["2"]}, {"input": "-10 89 20 40\r\n-2 89 12 29\r\n", "output": ["2"]}, {"input": "-40 -69 20 40\r\n60 -69 80 100\r\n", "output": ["0"]}, {"input": "-70 66 20 40\r\n8 66 58 98\r\n", "output": ["0"]}, {"input": "-11 -97 20 40\r\n67 -97 58 100\r\n", "output": ["0"]}, {"input": "-60 60 20 40\r\n0 60 40 100\r\n", "output": ["1"]}, {"input": "0 73 20 40\r\n59 73 39 100\r\n", "output": ["1"]}, {"input": "28 -91 20 40\r\n58 -91 10 49\r\n", "output": ["0"]}, {"input": "75 72 20 40\r\n99 90 10 50\r\n", "output": ["0"]}, {"input": "-84 74 20 40\r\n-54 74 10 63\r\n", "output": ["0"]}, {"input": "35 -6 20 40\r\n59 12 10 70\r\n", "output": ["1"]}, {"input": "67 41 20 40\r\n97 41 10 98\r\n", "output": ["1"]}, {"input": "-27 -68 20 40\r\n2 -68 9 48\r\n", "output": ["0"]}, {"input": "50 13 20 40\r\n78 13 8 12\r\n", "output": ["1"]}, {"input": "-73 36 20 40\r\n-44 36 9 10\r\n", "output": ["1"]}, {"input": "70 92 20 40\r\n99 92 9 49\r\n", "output": ["0"]}, {"input": "37 -80 20 40\r\n66 -80 9 66\r\n", "output": ["0"]}, {"input": "8 -95 20 40\r\n36 -95 8 68\r\n", "output": ["1"]}, {"input": "-9 77 20 40\r\n20 77 9 100\r\n", "output": ["1"]}, {"input": "-37 20 20 40\r\n41 31 99 100\r\n", "output": ["1"]}, {"input": "-36 28 20 40\r\n24 28 99 100\r\n", "output": ["2"]}, {"input": "-77 -16 20 40\r\n-18 -6 99 100\r\n", "output": ["2"]}, {"input": "-65 24 20 40\r\n-6 24 99 100\r\n", "output": ["4"]}, {"input": "-55 23 20 40\r\n-46 23 31 48\r\n", "output": ["1"]}, {"input": "-37 18 20 40\r\n-30 18 33 47\r\n", "output": ["2"]}, {"input": "-45 -93 20 40\r\n-36 -93 31 99\r\n", "output": ["2"]}, {"input": "-97 -29 20 40\r\n-39 -19 99 100\r\n", "output": ["4"]}, {"input": "14 18 20 40\r\n23 22 30 49\r\n", "output": ["1"]}, {"input": "-90 -38 20 40\r\n-81 -38 30 49\r\n", "output": ["2"]}, {"input": "52 -4 20 40\r\n61 -4 30 31\r\n", "output": ["2"]}, {"input": "-54 46 20 40\r\n-45 50 30 98\r\n", "output": ["2"]}, {"input": "74 -34 20 40\r\n82 -30 30 31\r\n", "output": ["2"]}, {"input": "23 -61 20 40\r\n41 -55 1 37\r\n", "output": ["1"]}, {"input": "57 -86 20 40\r\n75 -86 1 22\r\n", "output": ["2"]}, {"input": "-38 43 20 40\r\n-20 49 1 20\r\n", "output": ["2"]}, {"input": "-19 10 20 40\r\n-2 10 2 37\r\n", "output": ["1"]}, {"input": "64 58 20 40\r\n74 58 7 30\r\n", "output": ["2"]}, {"input": "53 49 20 40\r\n62 49 10 29\r\n", "output": ["2"]}, {"input": "53 80 20 40\r\n70 80 2 3\r\n", "output": ["4"]}, {"input": "73 -41 20 40\r\n91 -35 1 49\r\n", "output": ["1"]}, {"input": "-8 -34 20 40\r\n9 -34 2 57\r\n", "output": ["2"]}, {"input": "51 -40 20 40\r\n60 -40 9 31\r\n", "output": ["2"]}, {"input": "-29 87 20 40\r\n-11 93 1 94\r\n", "output": ["2"]}, {"input": "-64 3 20 40\r\n-55 7 6 30\r\n", "output": ["2"]}, {"input": "24 36 20 40\r\n41 39 1 2\r\n", "output": ["4"]}, {"input": "-56 -64 20 40\r\n44 2 96 100\r\n", "output": ["0"]}, {"input": "-59 -17 20 40\r\n21 -17 59 100\r\n", "output": ["0"]}, {"input": "-43 -3 20 40\r\n57 -3 79 80\r\n", "output": ["1"]}, {"input": "20 57 20 40\r\n99 69 58 100\r\n", "output": ["0"]}, {"input": "36 82 20 40\r\n96 82 38 100\r\n", "output": ["1"]}, {"input": "-55 37 20 40\r\n4 47 38 100\r\n", "output": ["1"]}, {"input": "-58 -4 20 40\r\n42 91 99 100\r\n", "output": ["1"]}, {"input": "28 51 20 40\r\n67 51 1 58\r\n", "output": ["0"]}, {"input": "-79 -62 20 40\r\n-41 -62 2 58\r\n", "output": ["0"]}, {"input": "-19 -10 20 40\r\n20 -10 1 19\r\n", "output": ["1"]}, {"input": "-95 -64 20 40\r\n-56 -64 1 78\r\n", "output": ["0"]}, {"input": "-17 -7 20 40\r\n22 -7 1 79\r\n", "output": ["1"]}, {"input": "-45 86 20 40\r\n-6 86 1 99\r\n", "output": ["1"]}, {"input": "-71 -23 20 40\r\n-32 -23 1 18\r\n", "output": ["1"]}, {"input": "-20 11 20 40\r\n80 11 60 100\r\n", "output": ["1"]}, {"input": "-27 97 20 40\r\n51 97 38 98\r\n", "output": ["1"]}, {"input": "-47 -84 20 40\r\n52 -64 61 81\r\n", "output": ["2"]}, {"input": "-81 99 20 40\r\n-3 99 38 99\r\n", "output": ["1"]}, {"input": "-54 25 20 40\r\n6 25 20 100\r\n", "output": ["2"]}, {"input": "-22 40 20 40\r\n36 40 18 100\r\n", "output": ["2"]}, {"input": "-71 15 20 40\r\n29 90 85 100\r\n", "output": ["2"]}, {"input": "31 -13 20 40\r\n69 -5 1 56\r\n", "output": ["0"]}, {"input": "-46 55 20 40\r\n-17 55 7 11\r\n", "output": ["1"]}, {"input": "-35 25 20 40\r\n-6 32 7 10\r\n", "output": ["1"]}, {"input": "27 -98 20 40\r\n65 -98 1 58\r\n", "output": ["0"]}, {"input": "-100 -19 20 40\r\n-62 -19 1 18\r\n", "output": ["1"]}, {"input": "48 66 20 40\r\n78 66 9 10\r\n", "output": ["2"]}, {"input": "-37 -22 20 40\r\n-8 -22 8 9\r\n", "output": ["2"]}, {"input": "-42 41 20 40\r\n-4 49 1 78\r\n", "output": ["0"]}, {"input": "-2 -27 20 40\r\n35 -27 1 77\r\n", "output": ["1"]}, {"input": "-28 -36 20 40\r\n10 -28 1 100\r\n", "output": ["1"]}, {"input": "-17 31 20 40\r\n21 39 1 14\r\n", "output": ["1"]}, {"input": "1 44 20 40\r\n39 44 1 2\r\n", "output": ["2"]}, {"input": "21 -99 20 40\r\n58 -97 1 2\r\n", "output": ["2"]}, {"input": "-86 -97 20 40\r\n14 -31 79 100\r\n", "output": ["1"]}, {"input": "-33 42 20 40\r\n47 42 39 100\r\n", "output": ["1"]}, {"input": "-79 45 20 40\r\n21 45 57 80\r\n", "output": ["2"]}, {"input": "-99 -66 20 40\r\n-20 -54 39 100\r\n", "output": ["1"]}, {"input": "39 -44 20 40\r\n99 -44 17 100\r\n", "output": ["2"]}, {"input": "10 86 20 40\r\n69 96 19 100\r\n", "output": ["2"]}, {"input": "-72 -4 20 40\r\n28 93 99 100\r\n", "output": ["2"]}, {"input": "-81 -55 20 40\r\n19 20 83 85\r\n", "output": ["4"]}, {"input": "-65 -34 20 40\r\n35 66 99 100\r\n", "output": ["4"]}, {"input": "-91 -46 10 50\r\n-73 -40 30 31\r\n", "output": ["2"]}]

[{'input': '-65 24 20 40\r\n-6 24 99 100\r\n', 'output': ['4']}, {'input': '31 40 37 76\r\n48 65 66 98\r\n', 'output': ['0']}, {'input': '-71 15 20 40\r\n29 90 85 100\r\n', 'output': ['2']}, {'input': '-20 78 20 40\r\n8 85 10 11\r\n', 'output': ['1']}, {'input': '49 -67 20 40\r\n57 -67 12 28\r\n', 'output': ['2']}]

[{'input': '19 96 20 40\r\n77 96 78 99\r\n', 'output': ['2']}, {'input': '-67 47 20 40\r\n-38 47 11 49\r\n', 'output': ['0']}, {'input': '-81 -55 20 40\r\n19 20 83 85\r\n', 'output': ['4']}, {'input': '-64 -47 20 40\r\n-5 -37 79 100\r\n', 'output': ['1']}, {'input': '8 -95 20 40\r\n36 -95 8 68\r\n', 'output': ['1']}]

[{'input': '1 44 20 40\r\n39 44 1 2\r\n', 'output': ['2']}, {'input': '-73 36 20 40\r\n-44 36 9 10\r\n', 'output': ['1']}, {'input': '-81 -55 20 40\r\n19 20 83 85\r\n', 'output': ['4']}, {'input': '-77 -16 20 40\r\n-18 -6 99 100\r\n', 'output': ['2']}, {'input': '28 -91 20 40\r\n58 -91 10 49\r\n', 'output': ['0']}]

[{'input': '19 96 20 40\r\n77 96 78 99\r\n', 'output': ['2']}, {'input': '41 -14 37 76\r\n48 65 66 98\r\n', 'output': ['0']}, {'input': '-67 47 20 40\r\n-38 47 11 49\r\n', 'output': ['0']}, {'input': '-100 -19 20 40\r\n-62 -19 1 18\r\n', 'output': ['1']}, {'input': '-86 -97 20 40\r\n14 -31 79 100\r\n', 'output': ['1']}]

[{'input': '57 -86 20 40\r\n75 -86 1 22\r\n', 'output': ['2']}, {'input': '1 44 20 40\r\n39 44 1 2\r\n', 'output': ['2']}, {'input': '31 40 37 76\r\n48 65 66 98\r\n', 'output': ['0']}, {'input': '-73 36 20 40\r\n-44 36 9 10\r\n', 'output': ['1']}, {'input': '-38 43 20 40\r\n-20 49 1 20\r\n', 'output': ['2']}]

["5 3 2 3", "5 3 100 1"]

The only line contains four integers $$$k$$$, $$$n$$$, $$$s$$$, $$$p$$$ ($$$1 \le k, n, s, p \le 10^4$$$) — the number of people, the number of airplanes each should make, the number of airplanes that can be made using one sheet and the number of sheets in one pack, respectively.

73f0c7cfc06a9b04e4766d6aa61fc780

from math import * k, n, s, p = map(int, input().split()) q = k * ceil(n / s) w = ceil(q / p) print(w)

["4", "5"]

Python

NoteIn the first sample they have to buy $$$4$$$ packs of paper: there will be $$$12$$$ sheets in total, and giving $$$2$$$ sheets to each person is enough to suit everyone's needs.In the second sample they have to buy a pack for each person as they can't share sheets.

Print a single integer — the minimum number of packs they should buy.

To make a paper airplane, one has to use a rectangular piece of paper. From a sheet of standard size you can make $$$s$$$ airplanes.A group of $$$k$$$ people decided to make $$$n$$$ airplanes each. They are going to buy several packs of paper, each of them containing $$$p$$$ sheets, and then distribute the sheets between the people. Each person should have enough sheets to make $$$n$$$ airplanes. How many packs should they buy?

[{"input": "5 3 2 3\r\n", "output": ["4"]}, {"input": "5 3 100 1\r\n", "output": ["5"]}, {"input": "10000 10000 1 1\r\n", "output": ["100000000"]}, {"input": "1 1 10000 10000\r\n", "output": ["1"]}, {"input": "300 300 21 23\r\n", "output": ["196"]}, {"input": "300 2 37 51\r\n", "output": ["6"]}, {"input": "2 400 23 57\r\n", "output": ["1"]}, {"input": "1 1 1 1\r\n", "output": ["1"]}, {"input": "10000 10000 3 2\r\n", "output": ["16670000"]}, {"input": "1 2 1 2\r\n", "output": ["1"]}, {"input": "1 1 2 2\r\n", "output": ["1"]}, {"input": "1 1 10 10\r\n", "output": ["1"]}, {"input": "5324 5439 32 13\r\n", "output": ["69622"]}, {"input": "9000 1 2432 1\r\n", "output": ["9000"]}, {"input": "230 1234 9124 23\r\n", "output": ["10"]}, {"input": "11 1 1 1\r\n", "output": ["11"]}, {"input": "6246 8489 1227 9\r\n", "output": ["4858"]}, {"input": "9 20 5 7\r\n", "output": ["6"]}]

[{'input': '1 1 2 2\r\n', 'output': ['1']}, {'input': '1 2 1 2\r\n', 'output': ['1']}, {'input': '9 20 5 7\r\n', 'output': ['6']}, {'input': '6246 8489 1227 9\r\n', 'output': ['4858']}, {'input': '10000 10000 3 2\r\n', 'output': ['16670000']}]

[{'input': '5 3 2 3\r\n', 'output': ['4']}, {'input': '10000 10000 1 1\r\n', 'output': ['100000000']}, {'input': '6246 8489 1227 9\r\n', 'output': ['4858']}, {'input': '5 3 100 1\r\n', 'output': ['5']}, {'input': '230 1234 9124 23\r\n', 'output': ['10']}]

[{'input': '300 2 37 51\r\n', 'output': ['6']}, {'input': '10000 10000 3 2\r\n', 'output': ['16670000']}, {'input': '5324 5439 32 13\r\n', 'output': ['69622']}, {'input': '1 1 10000 10000\r\n', 'output': ['1']}, {'input': '230 1234 9124 23\r\n', 'output': ['10']}]

[{'input': '1 2 1 2\r\n', 'output': ['1']}, {'input': '1 1 10000 10000\r\n', 'output': ['1']}, {'input': '300 2 37 51\r\n', 'output': ['6']}, {'input': '9 20 5 7\r\n', 'output': ['6']}, {'input': '10000 10000 3 2\r\n', 'output': ['16670000']}]

[{'input': '300 300 21 23\r\n', 'output': ['196']}, {'input': '6246 8489 1227 9\r\n', 'output': ['4858']}, {'input': '10000 10000 3 2\r\n', 'output': ['16670000']}, {'input': '1 1 1 1\r\n', 'output': ['1']}, {'input': '1 1 10 10\r\n', 'output': ['1']}]

["30 5 20 20 3 5", "10 4 100 5 5 1"]

The single line of the input contains six integers x, t, a, b, da, db (0 ≤ x ≤ 600; 1 ≤ t, a, b, da, db ≤ 300) — Valera's result, the contest's duration, the initial cost of the first problem, the initial cost of the second problem, the number of points that the first and the second problem lose per minute, correspondingly. It is guaranteed that at each minute of the contest each problem has a non-negative cost, that is, a - i·da ≥ 0 and b - i·db ≥ 0 for all 0 ≤ i ≤ t - 1.

f98168cdd72369303b82b5a7ac45c3af

x,t,a,b,c,d=map(int,input().split()) R=range(t) y=x==0 for i in R: if x==a-c*i or x==b-d*i:y=1 for j in R:y|=x==a+b-c*i-d*j print(['NO','YES'][y])

["YES", "NO"]

Python

NoteIn the first sample Valera could have acted like this: he could have submitted the first problem at minute 0 and the second problem — at minute 2. Then the first problem brings him 20 points and the second problem brings him 10 points, that in total gives the required 30 points.

If Valera could have earned exactly x points at a contest, print "YES", otherwise print "NO" (without the quotes).

A boy Valera registered on site Codeforces as Valera, and wrote his first Codeforces Round #300. He boasted to a friend Arkady about winning as much as x points for his first contest. But Arkady did not believe his friend's words and decided to check whether Valera could have shown such a result.He knows that the contest number 300 was unusual because there were only two problems. The contest lasted for t minutes, the minutes are numbered starting from zero. The first problem had the initial cost of a points, and every minute its cost reduced by da points. The second problem had the initial cost of b points, and every minute this cost reduced by db points. Thus, as soon as the zero minute of the contest is over, the first problem will cost a - da points, and the second problem will cost b - db points. It is guaranteed that at any moment of the contest each problem has a non-negative cost.Arkady asks you to find out whether Valera could have got exactly x points for this contest. You should assume that Valera could have solved any number of the offered problems. You should also assume that for each problem Valera made no more than one attempt, besides, he could have submitted both problems at the same minute of the contest, starting with minute 0 and ending with minute number t - 1. Please note that Valera can't submit a solution exactly t minutes after the start of the contest or later.

[{"input": "30 5 20 20 3 5\r\n", "output": ["YES"]}, {"input": "10 4 100 5 5 1\r\n", "output": ["NO"]}, {"input": "0 7 30 50 3 4\r\n", "output": ["YES"]}, {"input": "50 10 30 20 1 2\r\n", "output": ["YES"]}, {"input": "40 1 40 5 11 2\r\n", "output": ["YES"]}, {"input": "35 8 20 20 1 2\r\n", "output": ["YES"]}, {"input": "10 2 27 4 11 1\r\n", "output": ["NO"]}, {"input": "64 12 258 141 10 7\r\n", "output": ["YES"]}, {"input": "5 3 11 100 2 4\r\n", "output": ["NO"]}, {"input": "5 4 11 80 2 4\r\n", "output": ["YES"]}, {"input": "28 3 16 20 3 10\r\n", "output": ["NO"]}, {"input": "6 2 11 1 11 1\r\n", "output": ["NO"]}, {"input": "15 5 230 213 32 25\r\n", "output": ["NO"]}, {"input": "223 92 123 118 1 1\r\n", "output": ["YES"]}, {"input": "375 6 133 267 19 36\r\n", "output": ["NO"]}, {"input": "80 5 39 40 1 1\r\n", "output": ["NO"]}, {"input": "543 4 31 69 6 5\r\n", "output": ["NO"]}, {"input": "38 100 99 245 1 1\r\n", "output": ["YES"]}, {"input": "3 1 20 15 17 5\r\n", "output": ["NO"]}, {"input": "360 5 215 4 52 1\r\n", "output": ["NO"]}, {"input": "363 2 280 239 5 231\r\n", "output": ["NO"]}, {"input": "46 7 18 6 3 1\r\n", "output": ["NO"]}, {"input": "5 3 135 12 21 6\r\n", "output": ["NO"]}, {"input": "15 5 230 213 32 25\r\n", "output": ["NO"]}, {"input": "2 5 29 36 5 6\r\n", "output": ["NO"]}, {"input": "59 4 113 45 25 12\r\n", "output": ["YES"]}, {"input": "74 72 104 71 1 1\r\n", "output": ["YES"]}, {"input": "16 24 26 23 1 1\r\n", "output": ["YES"]}, {"input": "11 1 10 1 10 1\r\n", "output": ["YES"]}, {"input": "13 3 11 14 5 1\r\n", "output": ["YES"]}, {"input": "1 2 1 2 1 2\r\n", "output": ["YES"]}, {"input": "145 26 25 150 1 4\r\n", "output": ["YES"]}, {"input": "59 18 50 17 1 1\r\n", "output": ["YES"]}, {"input": "230 125 175 124 1 1\r\n", "output": ["YES"]}, {"input": "142 1 66 76 18 39\r\n", "output": ["YES"]}, {"input": "0 3 5 6 1 2\r\n", "output": ["YES"]}, {"input": "6 46 95 45 1 1\r\n", "output": ["YES"]}, {"input": "16 73 92 72 1 1\r\n", "output": ["YES"]}, {"input": "3 18 272 17 6 1\r\n", "output": ["YES"]}, {"input": "1 21 178 20 1 1\r\n", "output": ["YES"]}, {"input": "0 15 86 84 5 2\r\n", "output": ["YES"]}, {"input": "0 35 208 98 6 2\r\n", "output": ["YES"]}, {"input": "0 11 67 82 6 4\r\n", "output": ["YES"]}, {"input": "30 9 18 83 1 7\r\n", "output": ["NO"]}, {"input": "18 12 11 54 1 3\r\n", "output": ["NO"]}, {"input": "41 77 96 145 1 1\r\n", "output": ["YES"]}, {"input": "27 45 44 169 1 2\r\n", "output": ["YES"]}, {"input": "50 5 30 60 3 3\r\n", "output": ["NO"]}, {"input": "49 2 50 20 2 1\r\n", "output": ["NO"]}, {"input": "49 2 50 20 2 1\r\n", "output": ["NO"]}, {"input": "17 10 10 20 1 2\r\n", "output": ["YES"]}]

[{'input': '17 10 10 20 1 2\r\n', 'output': ['YES']}, {'input': '80 5 39 40 1 1\r\n', 'output': ['NO']}, {'input': '30 5 20 20 3 5\r\n', 'output': ['YES']}, {'input': '5 4 11 80 2 4\r\n', 'output': ['YES']}, {'input': '0 35 208 98 6 2\r\n', 'output': ['YES']}]

[{'input': '80 5 39 40 1 1\r\n', 'output': ['NO']}, {'input': '10 4 100 5 5 1\r\n', 'output': ['NO']}, {'input': '543 4 31 69 6 5\r\n', 'output': ['NO']}, {'input': '1 21 178 20 1 1\r\n', 'output': ['YES']}, {'input': '142 1 66 76 18 39\r\n', 'output': ['YES']}]

[{'input': '363 2 280 239 5 231\r\n', 'output': ['NO']}, {'input': '50 10 30 20 1 2\r\n', 'output': ['YES']}, {'input': '41 77 96 145 1 1\r\n', 'output': ['YES']}, {'input': '27 45 44 169 1 2\r\n', 'output': ['YES']}, {'input': '5 4 11 80 2 4\r\n', 'output': ['YES']}]

[{'input': '2 5 29 36 5 6\r\n', 'output': ['NO']}, {'input': '360 5 215 4 52 1\r\n', 'output': ['NO']}, {'input': '74 72 104 71 1 1\r\n', 'output': ['YES']}, {'input': '223 92 123 118 1 1\r\n', 'output': ['YES']}, {'input': '16 24 26 23 1 1\r\n', 'output': ['YES']}]

[{'input': '6 2 11 1 11 1\r\n', 'output': ['NO']}, {'input': '38 100 99 245 1 1\r\n', 'output': ['YES']}, {'input': '2 5 29 36 5 6\r\n', 'output': ['NO']}, {'input': '46 7 18 6 3 1\r\n', 'output': ['NO']}, {'input': '3 1 20 15 17 5\r\n', 'output': ['NO']}]

["6 4\n1 2 5 10 15 20", "4 10\n1 3 2 4", "6 100\n1 2 3 4 5 6"]

First line of the input contains an integer $$$n$$$ ($$$2 \le n \le 100$$$) and an integer $$$B$$$ ($$$1 \le B \le 100$$$) — the number of elements in the sequence and the number of bitcoins you have. Second line contains $$$n$$$ integers: $$$a_1$$$, $$$a_2$$$, ..., $$$a_n$$$ ($$$1 \le a_i \le 100$$$) — elements of the sequence, which contains the equal number of even and odd numbers

b3f8e769ee7719ea5c9f458428b16a4e

n, B = [int(x) for x in input().split()] arr = [int(x) for x in input().split()] poss_Splits = [] ps = 0 ptlan = 0 for i in range(n - 1): if arr[i] % 2 == 0: ps += 1 else: ptlan += 1 if ps == ptlan: poss_Splits.append((abs(arr[i] - arr[i + 1]), i)) poss_Splits = sorted(poss_Splits) i = 0 while i < len(poss_Splits) and B >= poss_Splits[i][0]: B -= poss_Splits[i][0] i += 1 print(i)

["1", "0", "2"]

Python

NoteIn the first sample the optimal answer is to split sequence between $$$2$$$ and $$$5$$$. Price of this cut is equal to $$$3$$$ bitcoins.In the second sample it is not possible to make even one cut even with unlimited number of bitcoins.In the third sample the sequence should be cut between $$$2$$$ and $$$3$$$, and between $$$4$$$ and $$$5$$$. The total price of the cuts is $$$1 + 1 = 2$$$ bitcoins.

Print the maximum possible number of cuts which can be made while spending no more than $$$B$$$ bitcoins.

There are a lot of things which could be cut — trees, paper, "the rope". In this problem you are going to cut a sequence of integers.There is a sequence of integers, which contains the equal number of even and odd numbers. Given a limited budget, you need to make maximum possible number of cuts such that each resulting segment will have the same number of odd and even integers.Cuts separate a sequence to continuous (contiguous) segments. You may think about each cut as a break between two adjacent elements in a sequence. So after cutting each element belongs to exactly one segment. Say, $$$[4, 1, 2, 3, 4, 5, 4, 4, 5, 5]$$$ $$$\to$$$ two cuts $$$\to$$$ $$$[4, 1 | 2, 3, 4, 5 | 4, 4, 5, 5]$$$. On each segment the number of even elements should be equal to the number of odd elements.The cost of the cut between $$$x$$$ and $$$y$$$ numbers is $$$|x - y|$$$ bitcoins. Find the maximum possible number of cuts that can be made while spending no more than $$$B$$$ bitcoins.

[{"input": "6 4\r\n1 2 5 10 15 20\r\n", "output": ["1"]}, {"input": "4 10\r\n1 3 2 4\r\n", "output": ["0"]}, {"input": "6 100\r\n1 2 3 4 5 6\r\n", "output": ["2"]}, {"input": "2 100\r\n13 78\r\n", "output": ["0"]}, {"input": "10 1\r\n56 56 98 2 11 64 97 41 95 53\r\n", "output": ["0"]}, {"input": "10 100\r\n94 65 24 47 29 98 20 65 6 17\r\n", "output": ["2"]}, {"input": "100 1\r\n35 6 19 84 49 64 36 91 50 65 21 86 20 89 10 52 50 24 98 74 11 48 58 98 51 85 1 29 44 83 9 97 68 41 83 57 1 57 46 42 87 2 32 50 3 57 17 77 22 100 36 27 3 34 55 8 90 61 34 20 15 39 43 46 60 60 14 23 4 22 75 51 98 23 69 22 99 57 63 30 79 7 16 8 34 84 13 47 93 40 48 25 93 1 80 6 82 93 6 21\r\n", "output": ["0"]}, {"input": "100 10\r\n3 20 3 29 90 69 2 30 70 28 71 99 22 99 34 70 87 48 3 92 71 61 26 90 14 38 51 81 16 33 49 71 14 52 50 95 65 16 80 57 87 47 29 14 40 31 74 15 87 76 71 61 30 91 44 10 87 48 84 12 77 51 25 68 49 38 79 8 7 9 39 19 48 40 15 53 29 4 60 86 76 84 6 37 45 71 46 38 80 68 94 71 64 72 41 51 71 60 79 7\r\n", "output": ["2"]}, {"input": "100 100\r\n60 83 82 16 17 7 89 6 83 100 85 41 72 44 23 28 64 84 3 23 33 52 93 30 81 38 67 25 26 97 94 78 41 74 74 17 53 51 54 17 20 81 95 76 42 16 16 56 74 69 30 9 82 91 32 13 47 45 97 40 56 57 27 28 84 98 91 5 61 20 3 43 42 26 83 40 34 100 5 63 62 61 72 5 32 58 93 79 7 18 50 43 17 24 77 73 87 74 98 2\r\n", "output": ["11"]}, {"input": "100 100\r\n70 54 10 72 81 84 56 15 27 19 43 100 49 44 52 33 63 40 95 17 58 2 51 39 22 18 82 1 16 99 32 29 24 94 9 98 5 37 47 14 42 73 41 31 79 64 12 6 53 26 68 67 89 13 90 4 21 93 46 74 75 88 66 57 23 7 25 48 92 62 30 8 50 61 38 87 71 34 97 28 80 11 60 91 3 35 86 96 36 20 59 65 83 45 76 77 78 69 85 55\r\n", "output": ["3"]}, {"input": "100 100\r\n1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100\r\n", "output": ["49"]}, {"input": "10 10\r\n94 32 87 13 4 22 85 81 18 95\r\n", "output": ["1"]}, {"input": "10 50\r\n40 40 9 3 64 96 67 19 21 30\r\n", "output": ["1"]}, {"input": "100 50\r\n13 31 29 86 46 10 2 87 94 2 28 31 29 15 64 3 94 71 37 76 9 91 89 38 12 46 53 33 58 11 98 4 37 72 30 52 6 86 40 98 28 6 34 80 61 47 45 69 100 47 91 64 87 41 67 58 88 75 13 81 36 58 66 29 10 27 54 83 44 15 11 33 49 36 61 18 89 26 87 1 99 19 57 21 55 84 20 74 14 43 15 51 2 76 22 92 43 14 72 77\r\n", "output": ["3"]}, {"input": "100 1\r\n78 52 95 76 96 49 53 59 77 100 64 11 9 48 15 17 44 46 21 54 39 68 43 4 32 28 73 6 16 62 72 84 65 86 98 75 33 45 25 3 91 82 2 92 63 88 7 50 97 93 14 22 20 42 60 55 80 85 29 34 56 71 83 38 26 47 90 70 51 41 40 31 37 12 35 99 67 94 1 87 57 8 61 19 23 79 36 18 66 74 5 27 81 69 24 58 13 10 89 30\r\n", "output": ["0"]}, {"input": "100 10\r\n19 55 91 50 31 23 60 84 38 1 22 51 27 76 28 98 11 44 61 63 15 93 52 3 66 16 53 36 18 62 35 85 78 37 73 64 87 74 46 26 82 69 49 33 83 89 56 67 71 25 39 94 96 17 21 6 47 68 34 42 57 81 13 10 54 2 48 80 20 77 4 5 59 30 90 95 45 75 8 88 24 41 40 14 97 32 7 9 65 70 100 99 72 58 92 29 79 12 86 43\r\n", "output": ["0"]}, {"input": "100 50\r\n2 4 82 12 47 63 52 91 87 45 53 1 17 25 64 50 9 13 22 54 21 30 43 24 38 33 68 11 41 78 99 23 28 18 58 67 79 10 71 56 49 61 26 29 59 20 90 74 5 75 89 8 39 95 72 42 66 98 44 32 88 35 92 3 97 55 65 51 77 27 81 76 84 69 73 85 19 46 62 100 60 37 7 36 57 6 14 83 40 48 16 70 96 15 31 93 80 86 94 34\r\n", "output": ["1"]}, {"input": "100 1\r\n1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100\r\n", "output": ["1"]}, {"input": "100 10\r\n1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100\r\n", "output": ["10"]}, {"input": "100 50\r\n1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100\r\n", "output": ["49"]}, {"input": "100 30\r\n2 1 2 2 2 2 1 1 1 2 1 1 2 2 1 2 1 2 2 2 2 1 2 1 2 1 1 2 1 1 2 2 2 1 1 2 1 2 2 2 1 1 1 1 1 2 1 1 1 1 1 2 2 2 2 1 2 1 1 1 2 2 2 2 1 2 2 1 1 1 1 2 2 2 1 2 2 1 2 1 1 2 2 2 1 2 2 1 2 1 1 2 1 1 1 1 2 1 1 2\r\n", "output": ["11"]}, {"input": "100 80\r\n1 1 1 2 2 1 1 2 1 1 1 1 2 2 2 1 2 2 2 2 1 1 2 2 1 1 1 1 2 2 2 1 1 1 1 1 1 1 2 2 2 2 1 2 2 1 2 1 1 1 1 2 2 1 2 2 1 2 2 2 2 2 1 1 2 2 2 2 2 2 1 1 2 1 1 1 2 1 1 2 1 2 1 2 2 1 1 2 1 1 1 1 2 2 2 1 2 2 1 2\r\n", "output": ["12"]}, {"input": "100 30\r\n100 99 100 99 99 100 100 99 100 99 99 100 100 100 99 99 99 100 99 99 99 99 100 99 99 100 100 99 100 99 99 99 100 99 100 100 99 100 100 100 100 100 99 99 100 99 99 100 99 100 99 99 100 100 99 100 99 99 100 99 100 100 100 100 99 99 99 100 99 100 99 100 100 100 99 100 100 100 99 100 99 99 100 100 100 100 99 99 99 100 99 100 100 99 99 99 100 100 99 99\r\n", "output": ["14"]}, {"input": "100 80\r\n99 100 100 100 99 99 99 99 100 99 99 99 99 99 99 99 99 100 100 99 99 99 99 99 100 99 100 99 100 100 100 100 100 99 100 100 99 99 100 100 100 100 100 99 100 99 100 99 99 99 100 99 99 99 99 99 99 99 99 100 99 100 100 99 99 99 99 100 100 100 99 100 100 100 100 100 99 100 100 100 100 100 100 100 100 99 99 99 99 100 99 100 100 100 100 100 99 100 99 100\r\n", "output": ["4"]}, {"input": "100 30\r\n100 100 39 39 39 100 100 39 39 100 39 39 100 39 100 39 100 100 100 100 100 39 100 100 100 39 39 39 100 39 100 100 39 39 100 39 39 39 100 100 39 100 39 100 39 39 100 100 39 100 39 100 39 39 39 100 39 100 39 39 39 100 39 39 100 100 39 39 39 100 100 39 39 39 100 100 100 100 39 100 100 100 39 39 100 39 100 100 39 100 39 100 39 39 100 39 39 100 100 100\r\n", "output": ["5"]}, {"input": "100 80\r\n39 100 39 100 100 100 100 39 39 100 100 39 39 100 39 39 39 39 100 39 39 39 39 100 100 100 100 39 100 39 39 100 100 39 39 100 39 100 39 100 100 39 39 100 39 39 39 100 39 100 39 100 100 100 100 100 100 100 39 100 39 100 100 100 39 39 39 39 39 100 100 100 39 100 100 100 100 39 100 100 39 39 100 39 39 39 100 39 100 39 39 100 100 39 100 39 39 39 100 39\r\n", "output": ["6"]}, {"input": "4 1\r\n1 2 3 4\r\n", "output": ["1"]}, {"input": "4 1\r\n1 2 1 2\r\n", "output": ["1"]}, {"input": "4 4\r\n1 2 6 7\r\n", "output": ["1"]}, {"input": "4 8\r\n1 2 10 11\r\n", "output": ["1"]}, {"input": "6 2\r\n1 2 3 4 5 6\r\n", "output": ["2"]}, {"input": "6 1\r\n1 2 1 2 1 2\r\n", "output": ["1"]}, {"input": "6 4\r\n1 2 4 5 7 8\r\n", "output": ["2"]}, {"input": "6 3\r\n1 2 5 10 15 20\r\n", "output": ["1"]}]

[{'input': '10 10\r\n94 32 87 13 4 22 85 81 18 95\r\n', 'output': ['1']}, {'input': '100 10\r\n3 20 3 29 90 69 2 30 70 28 71 99 22 99 34 70 87 48 3 92 71 61 26 90 14 38 51 81 16 33 49 71 14 52 50 95 65 16 80 57 87 47 29 14 40 31 74 15 87 76 71 61 30 91 44 10 87 48 84 12 77 51 25 68 49 38 79 8 7 9 39 19 48 40 15 53 29 4 60 86 76 84 6 37 45 71 46 38 80 68 94 71 64 72 41 51 71 60 79 7\r\n', 'output': ['2']}, {'input': '100 100\r\n60 83 82 16 17 7 89 6 83 100 85 41 72 44 23 28 64 84 3 23 33 52 93 30 81 38 67 25 26 97 94 78 41 74 74 17 53 51 54 17 20 81 95 76 42 16 16 56 74 69 30 9 82 91 32 13 47 45 97 40 56 57 27 28 84 98 91 5 61 20 3 43 42 26 83 40 34 100 5 63 62 61 72 5 32 58 93 79 7 18 50 43 17 24 77 73 87 74 98 2\r\n', 'output': ['11']}, {'input': '10 1\r\n56 56 98 2 11 64 97 41 95 53\r\n', 'output': ['0']}, {'input': '100 1\r\n35 6 19 84 49 64 36 91 50 65 21 86 20 89 10 52 50 24 98 74 11 48 58 98 51 85 1 29 44 83 9 97 68 41 83 57 1 57 46 42 87 2 32 50 3 57 17 77 22 100 36 27 3 34 55 8 90 61 34 20 15 39 43 46 60 60 14 23 4 22 75 51 98 23 69 22 99 57 63 30 79 7 16 8 34 84 13 47 93 40 48 25 93 1 80 6 82 93 6 21\r\n', 'output': ['0']}]

[{'input': '100 50\r\n13 31 29 86 46 10 2 87 94 2 28 31 29 15 64 3 94 71 37 76 9 91 89 38 12 46 53 33 58 11 98 4 37 72 30 52 6 86 40 98 28 6 34 80 61 47 45 69 100 47 91 64 87 41 67 58 88 75 13 81 36 58 66 29 10 27 54 83 44 15 11 33 49 36 61 18 89 26 87 1 99 19 57 21 55 84 20 74 14 43 15 51 2 76 22 92 43 14 72 77\r\n', 'output': ['3']}, {'input': '6 100\r\n1 2 3 4 5 6\r\n', 'output': ['2']}, {'input': '100 10\r\n19 55 91 50 31 23 60 84 38 1 22 51 27 76 28 98 11 44 61 63 15 93 52 3 66 16 53 36 18 62 35 85 78 37 73 64 87 74 46 26 82 69 49 33 83 89 56 67 71 25 39 94 96 17 21 6 47 68 34 42 57 81 13 10 54 2 48 80 20 77 4 5 59 30 90 95 45 75 8 88 24 41 40 14 97 32 7 9 65 70 100 99 72 58 92 29 79 12 86 43\r\n', 'output': ['0']}, {'input': '4 1\r\n1 2 3 4\r\n', 'output': ['1']}, {'input': '2 100\r\n13 78\r\n', 'output': ['0']}]

[{'input': '100 30\r\n100 100 39 39 39 100 100 39 39 100 39 39 100 39 100 39 100 100 100 100 100 39 100 100 100 39 39 39 100 39 100 100 39 39 100 39 39 39 100 100 39 100 39 100 39 39 100 100 39 100 39 100 39 39 39 100 39 100 39 39 39 100 39 39 100 100 39 39 39 100 100 39 39 39 100 100 100 100 39 100 100 100 39 39 100 39 100 100 39 100 39 100 39 39 100 39 39 100 100 100\r\n', 'output': ['5']}, {'input': '6 4\r\n1 2 4 5 7 8\r\n', 'output': ['2']}, {'input': '100 1\r\n1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100\r\n', 'output': ['1']}, {'input': '100 50\r\n2 4 82 12 47 63 52 91 87 45 53 1 17 25 64 50 9 13 22 54 21 30 43 24 38 33 68 11 41 78 99 23 28 18 58 67 79 10 71 56 49 61 26 29 59 20 90 74 5 75 89 8 39 95 72 42 66 98 44 32 88 35 92 3 97 55 65 51 77 27 81 76 84 69 73 85 19 46 62 100 60 37 7 36 57 6 14 83 40 48 16 70 96 15 31 93 80 86 94 34\r\n', 'output': ['1']}, {'input': '4 1\r\n1 2 3 4\r\n', 'output': ['1']}]

[{'input': '6 1\r\n1 2 1 2 1 2\r\n', 'output': ['1']}, {'input': '100 10\r\n19 55 91 50 31 23 60 84 38 1 22 51 27 76 28 98 11 44 61 63 15 93 52 3 66 16 53 36 18 62 35 85 78 37 73 64 87 74 46 26 82 69 49 33 83 89 56 67 71 25 39 94 96 17 21 6 47 68 34 42 57 81 13 10 54 2 48 80 20 77 4 5 59 30 90 95 45 75 8 88 24 41 40 14 97 32 7 9 65 70 100 99 72 58 92 29 79 12 86 43\r\n', 'output': ['0']}, {'input': '100 1\r\n1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100\r\n', 'output': ['1']}, {'input': '100 50\r\n2 4 82 12 47 63 52 91 87 45 53 1 17 25 64 50 9 13 22 54 21 30 43 24 38 33 68 11 41 78 99 23 28 18 58 67 79 10 71 56 49 61 26 29 59 20 90 74 5 75 89 8 39 95 72 42 66 98 44 32 88 35 92 3 97 55 65 51 77 27 81 76 84 69 73 85 19 46 62 100 60 37 7 36 57 6 14 83 40 48 16 70 96 15 31 93 80 86 94 34\r\n', 'output': ['1']}, {'input': '100 1\r\n78 52 95 76 96 49 53 59 77 100 64 11 9 48 15 17 44 46 21 54 39 68 43 4 32 28 73 6 16 62 72 84 65 86 98 75 33 45 25 3 91 82 2 92 63 88 7 50 97 93 14 22 20 42 60 55 80 85 29 34 56 71 83 38 26 47 90 70 51 41 40 31 37 12 35 99 67 94 1 87 57 8 61 19 23 79 36 18 66 74 5 27 81 69 24 58 13 10 89 30\r\n', 'output': ['0']}]

[{'input': '4 10\r\n1 3 2 4\r\n', 'output': ['0']}, {'input': '6 4\r\n1 2 4 5 7 8\r\n', 'output': ['2']}, {'input': '100 80\r\n39 100 39 100 100 100 100 39 39 100 100 39 39 100 39 39 39 39 100 39 39 39 39 100 100 100 100 39 100 39 39 100 100 39 39 100 39 100 39 100 100 39 39 100 39 39 39 100 39 100 39 100 100 100 100 100 100 100 39 100 39 100 100 100 39 39 39 39 39 100 100 100 39 100 100 100 100 39 100 100 39 39 100 39 39 39 100 39 100 39 39 100 100 39 100 39 39 39 100 39\r\n', 'output': ['6']}, {'input': '100 100\r\n1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100\r\n', 'output': ['49']}, {'input': '100 10\r\n3 20 3 29 90 69 2 30 70 28 71 99 22 99 34 70 87 48 3 92 71 61 26 90 14 38 51 81 16 33 49 71 14 52 50 95 65 16 80 57 87 47 29 14 40 31 74 15 87 76 71 61 30 91 44 10 87 48 84 12 77 51 25 68 49 38 79 8 7 9 39 19 48 40 15 53 29 4 60 86 76 84 6 37 45 71 46 38 80 68 94 71 64 72 41 51 71 60 79 7\r\n', 'output': ['2']}]

["harry potter", "tom riddle"]

The input consists of a single line containing two space-separated strings: the first and the last names. Each character of each string is a lowercase English letter. The length of each string is between 1 and 10, inclusive.

aed892f2bda10b6aee10dcb834a63709

first_name, last_name = input().split() first_done = first_name.lower() last_done = last_name.lower() login = first_name[0] for i in range(1, len(first_name)): if ord(first_done[i]) < ord(last_done[0]): login += first_name[i] else: break login += last_name[0] print(login)

["hap", "tomr"]

Python

Output a single string — alphabetically earliest possible login formed from these names. The output should be given in lowercase as well.

The preferred way to generate user login in Polygon is to concatenate a prefix of the user's first name and a prefix of their last name, in that order. Each prefix must be non-empty, and any of the prefixes can be the full name. Typically there are multiple possible logins for each person.You are given the first and the last name of a user. Return the alphabetically earliest login they can get (regardless of other potential Polygon users).As a reminder, a prefix of a string s is its substring which occurs at the beginning of s: "a", "ab", "abc" etc. are prefixes of string "{abcdef}" but "b" and 'bc" are not. A string a is alphabetically earlier than a string b, if a is a prefix of b, or a and b coincide up to some position, and then a has a letter that is alphabetically earlier than the corresponding letter in b: "a" and "ab" are alphabetically earlier than "ac" but "b" and "ba" are alphabetically later than "ac".

[{"input": "harry potter\r\n", "output": ["hap"]}, {"input": "tom riddle\r\n", "output": ["tomr"]}, {"input": "a qdpinbmcrf\r\n", "output": ["aq"]}, {"input": "wixjzniiub ssdfodfgap\r\n", "output": ["wis"]}, {"input": "z z\r\n", "output": ["zz"]}, {"input": "ertuyivhfg v\r\n", "output": ["ertuv"]}, {"input": "asdfghjkli ware\r\n", "output": ["asdfghjkliw"]}, {"input": "udggmyop ze\r\n", "output": ["udggmyopz"]}, {"input": "fapkdme rtzxovx\r\n", "output": ["fapkdmer"]}, {"input": "mybiqxmnqq l\r\n", "output": ["ml"]}, {"input": "dtbqya fyyymv\r\n", "output": ["df"]}, {"input": "fyclu zokbxiahao\r\n", "output": ["fycluz"]}, {"input": "qngatnviv rdych\r\n", "output": ["qngar"]}, {"input": "ttvnhrnng lqkfulhrn\r\n", "output": ["tl"]}, {"input": "fya fgx\r\n", "output": ["ff"]}, {"input": "nuis zvjjqlre\r\n", "output": ["nuisz"]}, {"input": "ly qtsmze\r\n", "output": ["lq"]}, {"input": "d kgfpjsurfw\r\n", "output": ["dk"]}, {"input": "lwli ewrpu\r\n", "output": ["le"]}, {"input": "rr wldsfubcs\r\n", "output": ["rrw"]}, {"input": "h qart\r\n", "output": ["hq"]}, {"input": "vugvblnzx kqdwdulm\r\n", "output": ["vk"]}, {"input": "xohesmku ef\r\n", "output": ["xe"]}, {"input": "twvvsl wtcyawv\r\n", "output": ["tw"]}, {"input": "obljndajv q\r\n", "output": ["obljndajq"]}, {"input": "jjxwj kxccwx\r\n", "output": ["jjk"]}, {"input": "sk fftzmv\r\n", "output": ["sf"]}, {"input": "cgpegngs aufzxkyyrw\r\n", "output": ["ca"]}, {"input": "reyjzjdvq skuch\r\n", "output": ["res"]}, {"input": "ardaae mxgdulijf\r\n", "output": ["am"]}, {"input": "bgopsdfji uaps\r\n", "output": ["bgopsdfjiu"]}, {"input": "amolfed pun\r\n", "output": ["amolfedp"]}, {"input": "badkiln yort\r\n", "output": ["badkilny"]}, {"input": "aaaaaaaaaz york\r\n", "output": ["aaaaaaaaay"]}, {"input": "bbbbcbbbbd c\r\n", "output": ["bbbbc"]}, {"input": "aa ab\r\n", "output": ["aa"]}, {"input": "ab b\r\n", "output": ["ab"]}, {"input": "aaaaa ab\r\n", "output": ["aa"]}, {"input": "aa a\r\n", "output": ["aa"]}, {"input": "aba b\r\n", "output": ["ab"]}, {"input": "aaaaaaa aaaaaa\r\n", "output": ["aa"]}, {"input": "a a\r\n", "output": ["aa"]}, {"input": "a aa\r\n", "output": ["aa"]}, {"input": "a b\r\n", "output": ["ab"]}, {"input": "b a\r\n", "output": ["ba"]}, {"input": "z a\r\n", "output": ["za"]}, {"input": "aaa a\r\n", "output": ["aa"]}, {"input": "aa aa\r\n", "output": ["aa"]}, {"input": "a aaa\r\n", "output": ["aa"]}, {"input": "aaaaaaaaaa aaaaaaaaaa\r\n", "output": ["aa"]}, {"input": "aaaaaaaaaa a\r\n", "output": ["aa"]}, {"input": "a aaaaaaaaaa\r\n", "output": ["aa"]}, {"input": "zzaa b\r\n", "output": ["zb"]}, {"input": "ca cf\r\n", "output": ["cac"]}, {"input": "abhi ia\r\n", "output": ["abhi"]}, {"input": "aaaa aaaab\r\n", "output": ["aa"]}, {"input": "aar raa\r\n", "output": ["aar"]}, {"input": "harry hotter\r\n", "output": ["hah"]}, {"input": "aaaaaaa a\r\n", "output": ["aa"]}, {"input": "apple pie\r\n", "output": ["ap"]}, {"input": "aaa aaa\r\n", "output": ["aa"]}, {"input": "kabc buba\r\n", "output": ["kab"]}, {"input": "asd ss\r\n", "output": ["as"]}, {"input": "bbb b\r\n", "output": ["bb"]}]

[{'input': 'h qart\r\n', 'output': ['hq']}, {'input': 'cgpegngs aufzxkyyrw\r\n', 'output': ['ca']}, {'input': 'bbb b\r\n', 'output': ['bb']}, {'input': 'lwli ewrpu\r\n', 'output': ['le']}, {'input': 'badkiln yort\r\n', 'output': ['badkilny']}]

[{'input': 'tom riddle\r\n', 'output': ['tomr']}, {'input': 'udggmyop ze\r\n', 'output': ['udggmyopz']}, {'input': 'amolfed pun\r\n', 'output': ['amolfedp']}, {'input': 'aaaaaaaaaz york\r\n', 'output': ['aaaaaaaaay']}, {'input': 'a b\r\n', 'output': ['ab']}]

[{'input': 'vugvblnzx kqdwdulm\r\n', 'output': ['vk']}, {'input': 'aaaaaaaaaa a\r\n', 'output': ['aa']}, {'input': 'd kgfpjsurfw\r\n', 'output': ['dk']}, {'input': 'obljndajv q\r\n', 'output': ['obljndajq']}, {'input': 'bgopsdfji uaps\r\n', 'output': ['bgopsdfjiu']}]

[{'input': 'z a\r\n', 'output': ['za']}, {'input': 'h qart\r\n', 'output': ['hq']}, {'input': 'aaaaaaaaaa aaaaaaaaaa\r\n', 'output': ['aa']}, {'input': 'aa ab\r\n', 'output': ['aa']}, {'input': 'aaaaaaa aaaaaa\r\n', 'output': ['aa']}]

[{'input': 'aaaaaaa aaaaaa\r\n', 'output': ['aa']}, {'input': 'aar raa\r\n', 'output': ['aar']}, {'input': 'a aaa\r\n', 'output': ['aa']}, {'input': 'wixjzniiub ssdfodfgap\r\n', 'output': ['wis']}, {'input': 'd kgfpjsurfw\r\n', 'output': ['dk']}]

["7\nj......", "7\n...feon", "7\n.l.r.o."]

First line contains an integer n (6 ≤ n ≤ 8) – the length of the string. Next line contains a string consisting of n characters, each of which is either a lower case english letter (indicating a known letter) or a dot character (indicating an empty cell in the crossword).

ec3d15ff198d1e4ab9fd04dd3b12e6c0

import re input() print(next(filter(re.compile(input()[:-3] + '$').match, ['vapor', 'jolt', 'flar', 'esp', 'umbr', 'leaf', 'glac', 'sylv'])) + 'eon')

["jolteon", "leafeon", "flareon"]

Python

NoteHere's a set of names in a form you can paste into your solution:["vaporeon", "jolteon", "flareon", "espeon", "umbreon", "leafeon", "glaceon", "sylveon"]{"vaporeon", "jolteon", "flareon", "espeon", "umbreon", "leafeon", "glaceon", "sylveon"}

Print a name of the pokemon that Eevee can evolve into that matches the pattern in the input. Use lower case letters only to print the name (in particular, do not capitalize the first letter).

You are solving the crossword problem K from IPSC 2014. You solved all the clues except for one: who does Eevee evolve into? You are not very into pokemons, but quick googling helped you find out, that Eevee can evolve into eight different pokemons: Vaporeon, Jolteon, Flareon, Espeon, Umbreon, Leafeon, Glaceon, and Sylveon.You know the length of the word in the crossword, and you already know some letters. Designers of the crossword made sure that the answer is unambiguous, so you can assume that exactly one pokemon out of the 8 that Eevee evolves into fits the length and the letters given. Your task is to find it.

[{"input": "7\r\nj......\r\n", "output": ["jolteon"]}, {"input": "7\r\n...feon\r\n", "output": ["leafeon"]}, {"input": "7\r\n.l.r.o.\r\n", "output": ["flareon"]}, {"input": "6\r\n.s..o.\r\n", "output": ["espeon"]}, {"input": "7\r\n.mb....\r\n", "output": ["umbreon"]}, {"input": "7\r\nglaceon\r\n", "output": ["glaceon"]}, {"input": "7\r\n.y.....\r\n", "output": ["sylveon"]}, {"input": "8\r\n.a.o.e.n\r\n", "output": ["vaporeon"]}, {"input": "6\r\n......\r\n", "output": ["espeon"]}, {"input": "8\r\n........\r\n", "output": ["vaporeon"]}, {"input": "6\r\n..p...\r\n", "output": ["espeon"]}, {"input": "7\r\n.laceon\r\n", "output": ["glaceon"]}, {"input": "8\r\n..p.....\r\n", "output": ["vaporeon"]}, {"input": "7\r\n..lveon\r\n", "output": ["sylveon"]}, {"input": "7\r\n.l.ceon\r\n", "output": ["glaceon"]}, {"input": "7\r\n.l.c...\r\n", "output": ["glaceon"]}, {"input": "7\r\n..b....\r\n", "output": ["umbreon"]}, {"input": "7\r\n..areon\r\n", "output": ["flareon"]}, {"input": "7\r\n..ar...\r\n", "output": ["flareon"]}, {"input": "7\r\n..lv...\r\n", "output": ["sylveon"]}]

[{'input': '7\r\n.l.c...\r\n', 'output': ['glaceon']}, {'input': '7\r\n.y.....\r\n', 'output': ['sylveon']}, {'input': '7\r\n..lveon\r\n', 'output': ['sylveon']}, {'input': '7\r\n.l.ceon\r\n', 'output': ['glaceon']}, {'input': '8\r\n........\r\n', 'output': ['vaporeon']}]

[{'input': '7\r\n..lveon\r\n', 'output': ['sylveon']}, {'input': '7\r\n.mb....\r\n', 'output': ['umbreon']}, {'input': '7\r\n.laceon\r\n', 'output': ['glaceon']}, {'input': '8\r\n..p.....\r\n', 'output': ['vaporeon']}, {'input': '7\r\n.l.c...\r\n', 'output': ['glaceon']}]

[{'input': '7\r\n.l.ceon\r\n', 'output': ['glaceon']}, {'input': '7\r\n.l.c...\r\n', 'output': ['glaceon']}, {'input': '7\r\n..lv...\r\n', 'output': ['sylveon']}, {'input': '8\r\n..p.....\r\n', 'output': ['vaporeon']}, {'input': '8\r\n........\r\n', 'output': ['vaporeon']}]

[{'input': '6\r\n......\r\n', 'output': ['espeon']}, {'input': '7\r\n..lv...\r\n', 'output': ['sylveon']}, {'input': '7\r\n.laceon\r\n', 'output': ['glaceon']}, {'input': '7\r\n..areon\r\n', 'output': ['flareon']}, {'input': '7\r\n.l.c...\r\n', 'output': ['glaceon']}]

[{'input': '8\r\n..p.....\r\n', 'output': ['vaporeon']}, {'input': '7\r\n..ar...\r\n', 'output': ['flareon']}, {'input': '8\r\n........\r\n', 'output': ['vaporeon']}, {'input': '7\r\n..lv...\r\n', 'output': ['sylveon']}, {'input': '6\r\n......\r\n', 'output': ['espeon']}]

["-2 1", "2 1", "4 3"]

The first and single line contains two integers x and y — the coordinates of the hole made in the clock by the ball. Each of the numbers x and y has an absolute value that does not exceed 1000.

8c92aac1bef5822848a136a1328346c6

x, y = map(int, input().split()) p = x * x + y * y d = int(p ** 0.5) if d * d == p: print('black') else: if x * y < 0: print('black' if d % 2 else 'white') else: print('white' if d % 2 else 'black')

["white", "black", "black"]

Python

Find the required color. All the points between which and the origin of coordinates the distance is integral-value are painted black.

Not so long ago as a result of combat operations the main Berland place of interest — the magic clock — was damaged. The cannon's balls made several holes in the clock, that's why the residents are concerned about the repair. The magic clock can be represented as an infinite Cartesian plane, where the origin corresponds to the clock center. The clock was painted two colors as is shown in the picture: The picture shows only the central part of the clock. This coloring naturally extends to infinity.The balls can be taken to be points on the plane. Your task is to find the color of the area, damaged by the given ball.All the points located on the border of one of the areas have to be considered painted black.

[{"input": "-2 1\r\n", "output": ["white"]}, {"input": "2 1\r\n", "output": ["black"]}, {"input": "4 3\r\n", "output": ["black"]}, {"input": "3 3\r\n", "output": ["black"]}, {"input": "4 4\r\n", "output": ["white"]}, {"input": "-4 4\r\n", "output": ["black"]}, {"input": "4 -4\r\n", "output": ["black"]}, {"input": "-4 -4\r\n", "output": ["white"]}, {"input": "0 0\r\n", "output": ["black"]}, {"input": "0 1\r\n", "output": ["black"]}, {"input": "0 2\r\n", "output": ["black"]}, {"input": "0 1000\r\n", "output": ["black"]}, {"input": "1000 0\r\n", "output": ["black"]}, {"input": "-1000 0\r\n", "output": ["black"]}, {"input": "0 -1000\r\n", "output": ["black"]}, {"input": "1000 -1000\r\n", "output": ["white"]}, {"input": "12 5\r\n", "output": ["black"]}, {"input": "12 -5\r\n", "output": ["black"]}, {"input": "-12 -35\r\n", "output": ["black"]}, {"input": "20 -21\r\n", "output": ["black"]}, {"input": "-677 492\r\n", "output": ["white"]}, {"input": "-673 -270\r\n", "output": ["white"]}, {"input": "-668 970\r\n", "output": ["black"]}, {"input": "-220 208\r\n", "output": ["white"]}, {"input": "-215 -996\r\n", "output": ["black"]}, {"input": "-211 243\r\n", "output": ["black"]}, {"input": "-206 -518\r\n", "output": ["white"]}, {"input": "-201 278\r\n", "output": ["black"]}, {"input": "-196 -484\r\n", "output": ["black"]}, {"input": "902 479\r\n", "output": ["white"]}, {"input": "-441 572\r\n", "output": ["white"]}, {"input": "217 221\r\n", "output": ["white"]}, {"input": "875 -129\r\n", "output": ["white"]}, {"input": "-469 -36\r\n", "output": ["black"]}, {"input": "189 -387\r\n", "output": ["white"]}, {"input": "847 -294\r\n", "output": ["white"]}, {"input": "-496 -644\r\n", "output": ["black"]}, {"input": "-281 -552\r\n", "output": ["white"]}, {"input": "377 -902\r\n", "output": ["black"]}, {"input": "165 -738\r\n", "output": ["white"]}, {"input": "61 -175\r\n", "output": ["black"]}, {"input": "-42 389\r\n", "output": ["black"]}, {"input": "-589 952\r\n", "output": ["black"]}, {"input": "-693 -929\r\n", "output": ["white"]}, {"input": "-796 -365\r\n", "output": ["white"]}, {"input": "658 198\r\n", "output": ["white"]}, {"input": "555 319\r\n", "output": ["black"]}, {"input": "8 882\r\n", "output": ["black"]}, {"input": "-96 -556\r\n", "output": ["black"]}, {"input": "-129 489\r\n", "output": ["black"]}, {"input": "207 -224\r\n", "output": ["black"]}, {"input": "64 0\r\n", "output": ["black"]}, {"input": "17 144\r\n", "output": ["black"]}, {"input": "60 -448\r\n", "output": ["black"]}, {"input": "-399 -40\r\n", "output": ["black"]}, {"input": "128 -504\r\n", "output": ["black"]}, {"input": "0 72\r\n", "output": ["black"]}, {"input": "168 -26\r\n", "output": ["black"]}, {"input": "72 -154\r\n", "output": ["black"]}, {"input": "117 -44\r\n", "output": ["black"]}, {"input": "-72 -646\r\n", "output": ["black"]}, {"input": "253 -204\r\n", "output": ["black"]}, {"input": "-40 198\r\n", "output": ["black"]}, {"input": "-216 -90\r\n", "output": ["black"]}, {"input": "15 -8\r\n", "output": ["black"]}, {"input": "-180 -432\r\n", "output": ["black"]}, {"input": "280 342\r\n", "output": ["black"]}, {"input": "132 224\r\n", "output": ["black"]}, {"input": "-192 -256\r\n", "output": ["black"]}, {"input": "351 -280\r\n", "output": ["black"]}]

[{'input': '253 -204\r\n', 'output': ['black']}, {'input': '-469 -36\r\n', 'output': ['black']}, {'input': '351 -280\r\n', 'output': ['black']}, {'input': '132 224\r\n', 'output': ['black']}, {'input': '4 4\r\n', 'output': ['white']}]

[{'input': '-589 952\r\n', 'output': ['black']}, {'input': '72 -154\r\n', 'output': ['black']}, {'input': '-40 198\r\n', 'output': ['black']}, {'input': '0 2\r\n', 'output': ['black']}, {'input': '0 0\r\n', 'output': ['black']}]

[{'input': '-1000 0\r\n', 'output': ['black']}, {'input': '-211 243\r\n', 'output': ['black']}, {'input': '-206 -518\r\n', 'output': ['white']}, {'input': '902 479\r\n', 'output': ['white']}, {'input': '-4 -4\r\n', 'output': ['white']}]

[{'input': '-4 4\r\n', 'output': ['black']}, {'input': '-668 970\r\n', 'output': ['black']}, {'input': '-215 -996\r\n', 'output': ['black']}, {'input': '555 319\r\n', 'output': ['black']}, {'input': '72 -154\r\n', 'output': ['black']}]

[{'input': '17 144\r\n', 'output': ['black']}, {'input': '875 -129\r\n', 'output': ['white']}, {'input': '-40 198\r\n', 'output': ['black']}, {'input': '-180 -432\r\n', 'output': ['black']}, {'input': '8 882\r\n', 'output': ['black']}]

["78 87", "1 1"]

The first letter contains two space-separated numbers a and b (1 ≤ a, b ≤ 1000) which represent the given summands.

8ccfb9b1fef6a992177cc49bd56fab7b

a, b = input().split() x = int(max(a + b)) + 1 s, v = int(a, x) + int(b, x), 0 while s: s, v = s // x, v + 1 print(v)

["3", "2"]

Python

Print a single number — the length of the longest answer.

Vasya studies positional numeral systems. Unfortunately, he often forgets to write the base of notation in which the expression is written. Once he saw a note in his notebook saying a + b = ?, and that the base of the positional notation wasn’t written anywhere. Now Vasya has to choose a base p and regard the expression as written in the base p positional notation. Vasya understood that he can get different results with different bases, and some bases are even invalid. For example, expression 78 + 87 in the base 16 positional notation is equal to FF16, in the base 15 positional notation it is equal to 11015, in the base 10 one — to 16510, in the base 9 one — to 1769, and in the base 8 or lesser-based positional notations the expression is invalid as all the numbers should be strictly less than the positional notation base. Vasya got interested in what is the length of the longest possible expression value. Help him to find this length.The length of a number should be understood as the number of numeric characters in it. For example, the length of the longest answer for 78 + 87 = ? is 3. It is calculated like that in the base 15 (11015), base 10 (16510), base 9 (1769) positional notations, for example, and in some other ones.

[{"input": "78 87\r\n", "output": ["3"]}, {"input": "1 1\r\n", "output": ["2"]}, {"input": "9 7\r\n", "output": ["2"]}, {"input": "11 11\r\n", "output": ["3"]}, {"input": "43 21\r\n", "output": ["3"]}, {"input": "84 89\r\n", "output": ["3"]}, {"input": "12 34\r\n", "output": ["3"]}, {"input": "99 11\r\n", "output": ["3"]}, {"input": "11 99\r\n", "output": ["3"]}, {"input": "99 99\r\n", "output": ["3"]}, {"input": "1 2\r\n", "output": ["2"]}, {"input": "1 3\r\n", "output": ["2"]}, {"input": "2 1\r\n", "output": ["2"]}, {"input": "2 2\r\n", "output": ["2"]}, {"input": "2 3\r\n", "output": ["2"]}, {"input": "3 1\r\n", "output": ["2"]}, {"input": "3 2\r\n", "output": ["2"]}, {"input": "3 3\r\n", "output": ["2"]}, {"input": "1 466\r\n", "output": ["3"]}, {"input": "1 1000\r\n", "output": ["4"]}, {"input": "1 999\r\n", "output": ["4"]}, {"input": "149 1\r\n", "output": ["3"]}, {"input": "999 1\r\n", "output": ["4"]}, {"input": "1000 1\r\n", "output": ["4"]}, {"input": "998 998\r\n", "output": ["4"]}, {"input": "998 999\r\n", "output": ["4"]}, {"input": "998 1000\r\n", "output": ["4"]}, {"input": "999 998\r\n", "output": ["4"]}, {"input": "999 999\r\n", "output": ["4"]}, {"input": "999 1000\r\n", "output": ["4"]}, {"input": "1000 998\r\n", "output": ["4"]}, {"input": "1000 999\r\n", "output": ["4"]}, {"input": "1000 1000\r\n", "output": ["5"]}, {"input": "1000 539\r\n", "output": ["4"]}, {"input": "999 619\r\n", "output": ["4"]}, {"input": "2 511\r\n", "output": ["3"]}, {"input": "877 2\r\n", "output": ["3"]}, {"input": "379 999\r\n", "output": ["4"]}, {"input": "247 1000\r\n", "output": ["4"]}, {"input": "555 555\r\n", "output": ["4"]}, {"input": "208 997\r\n", "output": ["4"]}, {"input": "633 581\r\n", "output": ["4"]}, {"input": "411 517\r\n", "output": ["4"]}, {"input": "836 101\r\n", "output": ["4"]}, {"input": "262 685\r\n", "output": ["4"]}, {"input": "39 269\r\n", "output": ["3"]}, {"input": "464 205\r\n", "output": ["4"]}, {"input": "890 789\r\n", "output": ["4"]}, {"input": "667 373\r\n", "output": ["4"]}, {"input": "840 975\r\n", "output": ["4"]}, {"input": "810 413\r\n", "output": ["4"]}, {"input": "133 851\r\n", "output": ["4"]}, {"input": "104 938\r\n", "output": ["4"]}, {"input": "427 376\r\n", "output": ["4"]}, {"input": "398 815\r\n", "output": ["4"]}, {"input": "721 253\r\n", "output": ["4"]}, {"input": "692 339\r\n", "output": ["4"]}, {"input": "15 778\r\n", "output": ["3"]}, {"input": "986 216\r\n", "output": ["4"]}, {"input": "450 277\r\n", "output": ["3"]}, {"input": "333 1\r\n", "output": ["4"]}, {"input": "499 499\r\n", "output": ["3"]}, {"input": "79 1\r\n", "output": ["2"]}, {"input": "87 1\r\n", "output": ["2"]}, {"input": "47 8\r\n", "output": ["2"]}, {"input": "87 8\r\n", "output": ["3"]}, {"input": "1 11\r\n", "output": ["3"]}]

[{'input': '1000 1000\r\n', 'output': ['5']}, {'input': '986 216\r\n', 'output': ['4']}, {'input': '262 685\r\n', 'output': ['4']}, {'input': '1 999\r\n', 'output': ['4']}, {'input': '99 11\r\n', 'output': ['3']}]

[{'input': '87 8\r\n', 'output': ['3']}, {'input': '78 87\r\n', 'output': ['3']}, {'input': '2 1\r\n', 'output': ['2']}, {'input': '11 99\r\n', 'output': ['3']}, {'input': '1000 1000\r\n', 'output': ['5']}]

[{'input': '2 2\r\n', 'output': ['2']}, {'input': '890 789\r\n', 'output': ['4']}, {'input': '262 685\r\n', 'output': ['4']}, {'input': '999 1000\r\n', 'output': ['4']}, {'input': '3 3\r\n', 'output': ['2']}]

[{'input': '9 7\r\n', 'output': ['2']}, {'input': '998 1000\r\n', 'output': ['4']}, {'input': '208 997\r\n', 'output': ['4']}, {'input': '999 998\r\n', 'output': ['4']}, {'input': '104 938\r\n', 'output': ['4']}]

[{'input': '43 21\r\n', 'output': ['3']}, {'input': '1 466\r\n', 'output': ['3']}, {'input': '3 2\r\n', 'output': ['2']}, {'input': '79 1\r\n', 'output': ['2']}, {'input': '667 373\r\n', 'output': ['4']}]

["4\n1 1 0 1", "6\n0 1 0 0 1 0", "1\n0"]

The first line contains one integer number n (1 ≤ n ≤ 100). The second line contains n space-separated integer numbers s1, s2, ..., sn (0 ≤ si ≤ 1). 0 corresponds to an unsuccessful game, 1 — to a successful one.

c7b1f0b40e310f99936d1c33e4816b95

n = int(input()) t = -1 an = 0 a = list(map(int, input().split())) while a.count(1): an = max(a.index(1) + a.count(1), an) del a[a.index(1)] print(max(an, len(a)))

["3", "4", "1"]

Python

Print one integer — the maximum number of games Hideo can leave in his CV so that no unsuccessful game comes after a successful one.

Hideo Kojima has just quit his job at Konami. Now he is going to find a new place to work. Despite being such a well-known person, he still needs a CV to apply for a job.During all his career Hideo has produced n games. Some of them were successful, some were not. Hideo wants to remove several of them (possibly zero) from his CV to make a better impression on employers. As a result there should be no unsuccessful game which comes right after successful one in his CV.More formally, you are given an array s1, s2, ..., sn of zeros and ones. Zero corresponds to an unsuccessful game, one — to a successful one. Games are given in order they were produced, and Hideo can't swap these values. He should remove some elements from this array in such a way that no zero comes right after one.Besides that, Hideo still wants to mention as much games in his CV as possible. Help this genius of a man determine the maximum number of games he can leave in his CV.

[{"input": "4\r\n1 1 0 1\r\n", "output": ["3"]}, {"input": "6\r\n0 1 0 0 1 0\r\n", "output": ["4"]}, {"input": "1\r\n0\r\n", "output": ["1"]}, {"input": "100\r\n0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0\r\n", "output": ["100"]}, {"input": "100\r\n0 0 1 1 1 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 1 0 0 0 0 0 0 1 1 1 0 0 1 0 1 0 0 0 1 1 0 0 0 0 0 1 1 0 1 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 1 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0\r\n", "output": ["80"]}, {"input": "1\r\n1\r\n", "output": ["1"]}, {"input": "100\r\n1 1 0 1 1 0 0 0 0 1 0 1 1 1 0 1 1 1 1 0 1 1 1 1 1 1 0 1 1 0 0 1 1 1 0 0 0 1 0 0 1 0 1 1 0 1 0 0 1 0 0 1 1 0 0 1 0 0 1 1 0 1 0 1 0 0 0 0 0 1 0 0 0 0 0 0 1 1 0 0 0 1 1 1 0 1 1 0 1 1 1 0 0 1 1 0 0 0 0 1\r\n", "output": ["53"]}, {"input": "100\r\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1\r\n", "output": ["100"]}, {"input": "3\r\n1 0 0\r\n", "output": ["2"]}, {"input": "10\r\n1 1 0 0 0 1 1 0 0 0\r\n", "output": ["6"]}, {"input": "90\r\n1 0 0 1 1 0 0 1 0 0 0 0 1 1 1 0 1 0 1 0 0 0 0 1 0 0 1 1 1 1 1 0 0 0 1 0 1 0 1 0 1 0 0 1 0 1 0 1 0 1 0 1 0 0 1 0 0 1 1 0 0 1 0 0 0 0 1 1 1 0 1 0 1 0 0 0 0 1 0 0 1 1 1 1 1 0 0 0 1 0\r\n", "output": ["52"]}, {"input": "78\r\n0 0 1 0 1 0 1 1 0 0 0 1 1 1 1 0 0 0 1 0 1 1 1 0 1 0 0 0 1 0 0 0 1 1 1 1 1 1 1 1 1 1 1 0 1 0 0 0 0 0 1 0 0 1 0 1 0 1 0 1 0 1 1 1 0 0 1 0 0 0 0 1 0 1 0 0 1 0\r\n", "output": ["42"]}, {"input": "4\r\n1 0 0 1\r\n", "output": ["3"]}, {"input": "2\r\n0 1\r\n", "output": ["2"]}, {"input": "5\r\n0 1 0 0 1\r\n", "output": ["4"]}, {"input": "3\r\n1 0 1\r\n", "output": ["2"]}, {"input": "3\r\n1 1 0\r\n", "output": ["2"]}, {"input": "16\r\n1 1 1 1 1 0 0 0 0 0 1 0 1 0 0 1\r\n", "output": ["9"]}]

[{'input': '6\r\n0 1 0 0 1 0\r\n', 'output': ['4']}, {'input': '78\r\n0 0 1 0 1 0 1 1 0 0 0 1 1 1 1 0 0 0 1 0 1 1 1 0 1 0 0 0 1 0 0 0 1 1 1 1 1 1 1 1 1 1 1 0 1 0 0 0 0 0 1 0 0 1 0 1 0 1 0 1 0 1 1 1 0 0 1 0 0 0 0 1 0 1 0 0 1 0\r\n', 'output': ['42']}, {'input': '16\r\n1 1 1 1 1 0 0 0 0 0 1 0 1 0 0 1\r\n', 'output': ['9']}, {'input': '100\r\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1\r\n', 'output': ['100']}, {'input': '4\r\n1 0 0 1\r\n', 'output': ['3']}]

[{'input': '3\r\n1 0 0\r\n', 'output': ['2']}, {'input': '4\r\n1 1 0 1\r\n', 'output': ['3']}, {'input': '5\r\n0 1 0 0 1\r\n', 'output': ['4']}, {'input': '1\r\n1\r\n', 'output': ['1']}, {'input': '100\r\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1\r\n', 'output': ['100']}]

[{'input': '3\r\n1 0 1\r\n', 'output': ['2']}, {'input': '100\r\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1\r\n', 'output': ['100']}, {'input': '100\r\n0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0\r\n', 'output': ['100']}, {'input': '1\r\n0\r\n', 'output': ['1']}, {'input': '6\r\n0 1 0 0 1 0\r\n', 'output': ['4']}]

[{'input': '90\r\n1 0 0 1 1 0 0 1 0 0 0 0 1 1 1 0 1 0 1 0 0 0 0 1 0 0 1 1 1 1 1 0 0 0 1 0 1 0 1 0 1 0 0 1 0 1 0 1 0 1 0 1 0 0 1 0 0 1 1 0 0 1 0 0 0 0 1 1 1 0 1 0 1 0 0 0 0 1 0 0 1 1 1 1 1 0 0 0 1 0\r\n', 'output': ['52']}, {'input': '5\r\n0 1 0 0 1\r\n', 'output': ['4']}, {'input': '4\r\n1 0 0 1\r\n', 'output': ['3']}, {'input': '1\r\n0\r\n', 'output': ['1']}, {'input': '78\r\n0 0 1 0 1 0 1 1 0 0 0 1 1 1 1 0 0 0 1 0 1 1 1 0 1 0 0 0 1 0 0 0 1 1 1 1 1 1 1 1 1 1 1 0 1 0 0 0 0 0 1 0 0 1 0 1 0 1 0 1 0 1 1 1 0 0 1 0 0 0 0 1 0 1 0 0 1 0\r\n', 'output': ['42']}]

[{'input': '4\r\n1 0 0 1\r\n', 'output': ['3']}, {'input': '90\r\n1 0 0 1 1 0 0 1 0 0 0 0 1 1 1 0 1 0 1 0 0 0 0 1 0 0 1 1 1 1 1 0 0 0 1 0 1 0 1 0 1 0 0 1 0 1 0 1 0 1 0 1 0 0 1 0 0 1 1 0 0 1 0 0 0 0 1 1 1 0 1 0 1 0 0 0 0 1 0 0 1 1 1 1 1 0 0 0 1 0\r\n', 'output': ['52']}, {'input': '100\r\n0 0 1 1 1 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 1 0 0 0 0 0 0 1 1 1 0 0 1 0 1 0 0 0 1 1 0 0 0 0 0 1 1 0 1 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 1 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0\r\n', 'output': ['80']}, {'input': '2\r\n0 1\r\n', 'output': ['2']}, {'input': '10\r\n1 1 0 0 0 1 1 0 0 0\r\n', 'output': ['6']}]

["3 1", "2 3", "7 3"]

The single line of the input contains two positive integers a and b (1 ≤ a, b ≤ 100) — the number of red and blue socks that Vasya's got.

775766790e91e539c1cfaa5030e5b955

a, b = map(int, input().split()) k = 0 k2 = 0 while a > 0 and b > 0: a -= 1 b -= 1 k += 1 if a > 0: k2 = int(a//2) elif b > 0: k2 = int(b//2) print(k, k2)

["1 1", "2 0", "3 2"]

Python

NoteIn the first sample Vasya can first put on one pair of different socks, after that he has two red socks left to wear on the second day.

Print two space-separated integers — the maximum number of days when Vasya can wear different socks and the number of days when he can wear the same socks until he either runs out of socks or cannot make a single pair from the socks he's got. Keep in mind that at the end of the day Vasya throws away the socks that he's been wearing on that day.

One day Vasya the Hipster decided to count how many socks he had. It turned out that he had a red socks and b blue socks.According to the latest fashion, hipsters should wear the socks of different colors: a red one on the left foot, a blue one on the right foot.Every day Vasya puts on new socks in the morning and throws them away before going to bed as he doesn't want to wash them.Vasya wonders, what is the maximum number of days when he can dress fashionable and wear different socks, and after that, for how many days he can then wear the same socks until he either runs out of socks or cannot make a single pair from the socks he's got.Can you help him?

[{"input": "3 1\r\n", "output": ["1 1", "1 1", "1\r\n1"]}, {"input": "2 3\r\n", "output": ["2 0", "2 0", "2\r\n0"]}, {"input": "7 3\r\n", "output": ["3\r\n2", "3 2", "3 2"]}, {"input": "100 100\r\n", "output": ["100 0", "100 0", "100\r\n0"]}, {"input": "4 10\r\n", "output": ["4\r\n3", "4 3", "4 3"]}, {"input": "6 10\r\n", "output": ["6\r\n2", "6 2", "6 2"]}, {"input": "6 11\r\n", "output": ["6\r\n2", "6 2", "6 2"]}, {"input": "10 40\r\n", "output": ["10\r\n15", "10 15", "10 15"]}, {"input": "11 56\r\n", "output": ["11 22", "11\r\n22", "11 22"]}, {"input": "34 30\r\n", "output": ["30\r\n2", "30 2", "30 2"]}, {"input": "33 33\r\n", "output": ["33 0", "33\r\n0", "33 0"]}, {"input": "100 45\r\n", "output": ["45\r\n27", "45 27", "45 27"]}, {"input": "100 23\r\n", "output": ["23 38", "23\r\n38", "23 38"]}, {"input": "45 12\r\n", "output": ["12 16", "12 16", "12\r\n16"]}, {"input": "1 1\r\n", "output": ["1 0", "1\r\n0", "1 0"]}, {"input": "1 100\r\n", "output": ["1 49", "1 49", "1\r\n49"]}, {"input": "100 1\r\n", "output": ["1 49", "1 49", "1\r\n49"]}, {"input": "68 59\r\n", "output": ["59 4", "59\r\n4", "59 4"]}, {"input": "45 99\r\n", "output": ["45\r\n27", "45 27", "45 27"]}, {"input": "99 100\r\n", "output": ["99 0", "99 0", "99\r\n0"]}, {"input": "100 98\r\n", "output": ["98 1", "98\r\n1", "98 1"]}, {"input": "59 12\r\n", "output": ["12 23", "12 23", "12\r\n23"]}, {"input": "86 4\r\n", "output": ["4 41", "4\r\n41", "4 41"]}, {"input": "68 21\r\n", "output": ["21 23", "21 23", "21\r\n23"]}, {"input": "100 11\r\n", "output": ["11 44", "11\r\n44", "11 44"]}, {"input": "100 10\r\n", "output": ["10 45", "10\r\n45", "10 45"]}, {"input": "15 45\r\n", "output": ["15\r\n15", "15 15", "15 15"]}, {"input": "11 32\r\n", "output": ["11\r\n10", "11 10", "11 10"]}, {"input": "34 96\r\n", "output": ["34\r\n31", "34 31", "34 31"]}, {"input": "89 89\r\n", "output": ["89 0", "89 0", "89\r\n0"]}]

[{'input': '45 99\r\n', 'output': ['45\r\n27', '45 27', '45 27']}, {'input': '100 1\r\n', 'output': ['1 49', '1 49', '1\r\n49']}, {'input': '68 21\r\n', 'output': ['21 23', '21 23', '21\r\n23']}, {'input': '100 10\r\n', 'output': ['10 45', '10\r\n45', '10 45']}, {'input': '11 32\r\n', 'output': ['11\r\n10', '11 10', '11 10']}]

[{'input': '2 3\r\n', 'output': ['2 0', '2 0', '2\r\n0']}, {'input': '15 45\r\n', 'output': ['15\r\n15', '15 15', '15 15']}, {'input': '68 59\r\n', 'output': ['59 4', '59\r\n4', '59 4']}, {'input': '11 56\r\n', 'output': ['11 22', '11\r\n22', '11 22']}, {'input': '100 10\r\n', 'output': ['10 45', '10\r\n45', '10 45']}]

[{'input': '10 40\r\n', 'output': ['10\r\n15', '10 15', '10 15']}, {'input': '1 100\r\n', 'output': ['1 49', '1 49', '1\r\n49']}, {'input': '100 98\r\n', 'output': ['98 1', '98\r\n1', '98 1']}, {'input': '33 33\r\n', 'output': ['33 0', '33\r\n0', '33 0']}, {'input': '11 32\r\n', 'output': ['11\r\n10', '11 10', '11 10']}]

[{'input': '10 40\r\n', 'output': ['10\r\n15', '10 15', '10 15']}, {'input': '100 98\r\n', 'output': ['98 1', '98\r\n1', '98 1']}, {'input': '4 10\r\n', 'output': ['4\r\n3', '4 3', '4 3']}, {'input': '100 10\r\n', 'output': ['10 45', '10\r\n45', '10 45']}, {'input': '100 1\r\n', 'output': ['1 49', '1 49', '1\r\n49']}]

[{'input': '100 45\r\n', 'output': ['45\r\n27', '45 27', '45 27']}, {'input': '7 3\r\n', 'output': ['3\r\n2', '3 2', '3 2']}, {'input': '10 40\r\n', 'output': ['10\r\n15', '10 15', '10 15']}, {'input': '34 30\r\n', 'output': ['30\r\n2', '30 2', '30 2']}, {'input': '100 1\r\n', 'output': ['1 49', '1 49', '1\r\n49']}]

["4 3 9", "4 3 24", "2 4 4"]

The only line contains three integers n, m and k (1 ≤ n, m ≤ 10 000, 1 ≤ k ≤ 2nm) — the number of lanes, the number of desks in each lane and the number of Santa Claus' place.

d6929926b44c2d5b1a8e6b7f965ca1bb

n, m, k = map(int, input().split()) l = (k - 1) // (2 * m) + 1 print(l, ((k - 1) % (2 * m)) // 2 + 1, 'L' if k & 1 else 'R')

["2 2 L", "4 3 R", "1 2 R"]

Python

NoteThe first and the second samples are shown on the picture. The green place corresponds to Santa Claus' place in the first example, the blue place corresponds to Santa Claus' place in the second example.In the third sample there are two lanes with four desks in each, and Santa Claus has the fourth place. Thus, his place is in the first lane at the second desk on the right.

Print two integers: the number of lane r, the number of desk d, and a character s, which stands for the side of the desk Santa Claus. The character s should be "L", if Santa Clause should sit on the left, and "R" if his place is on the right.

Santa Claus is the first who came to the Christmas Olympiad, and he is going to be the first to take his place at a desk! In the classroom there are n lanes of m desks each, and there are two working places at each of the desks. The lanes are numbered from 1 to n from the left to the right, the desks in a lane are numbered from 1 to m starting from the blackboard. Note that the lanes go perpendicularly to the blackboard, not along it (see picture).The organizers numbered all the working places from 1 to 2nm. The places are numbered by lanes (i. e. all the places of the first lane go first, then all the places of the second lane, and so on), in a lane the places are numbered starting from the nearest to the blackboard (i. e. from the first desk in the lane), at each desk, the place on the left is numbered before the place on the right. The picture illustrates the first and the second samples. Santa Clause knows that his place has number k. Help him to determine at which lane at which desk he should sit, and whether his place is on the left or on the right!

[{"input": "4 3 9\r\n", "output": ["2 2 L"]}, {"input": "4 3 24\r\n", "output": ["4 3 R"]}, {"input": "2 4 4\r\n", "output": ["1 2 R"]}, {"input": "3 10 24\r\n", "output": ["2 2 R"]}, {"input": "10 3 59\r\n", "output": ["10 3 L"]}, {"input": "10000 10000 160845880\r\n", "output": ["8043 2940 R"]}, {"input": "1 1 1\r\n", "output": ["1 1 L"]}, {"input": "1 1 2\r\n", "output": ["1 1 R"]}, {"input": "1 10000 1\r\n", "output": ["1 1 L"]}, {"input": "1 10000 20000\r\n", "output": ["1 10000 R"]}, {"input": "10000 1 1\r\n", "output": ["1 1 L"]}, {"input": "10000 1 10000\r\n", "output": ["5000 1 R"]}, {"input": "10000 1 20000\r\n", "output": ["10000 1 R"]}, {"input": "3 2 1\r\n", "output": ["1 1 L"]}, {"input": "3 2 2\r\n", "output": ["1 1 R"]}, {"input": "3 2 3\r\n", "output": ["1 2 L"]}, {"input": "3 2 4\r\n", "output": ["1 2 R"]}, {"input": "3 2 5\r\n", "output": ["2 1 L"]}, {"input": "3 2 6\r\n", "output": ["2 1 R"]}, {"input": "3 2 7\r\n", "output": ["2 2 L"]}, {"input": "3 2 8\r\n", "output": ["2 2 R"]}, {"input": "3 2 9\r\n", "output": ["3 1 L"]}, {"input": "3 2 10\r\n", "output": ["3 1 R"]}, {"input": "3 2 11\r\n", "output": ["3 2 L"]}, {"input": "3 2 12\r\n", "output": ["3 2 R"]}, {"input": "300 2000 1068628\r\n", "output": ["268 314 R"]}, {"input": "300 2000 584756\r\n", "output": ["147 378 R"]}, {"input": "300 2000 268181\r\n", "output": ["68 91 L"]}, {"input": "10000 9999 186450844\r\n", "output": ["9324 4745 R"]}, {"input": "10000 9999 197114268\r\n", "output": ["9857 6990 R"]}, {"input": "10000 9999 112390396\r\n", "output": ["5621 818 R"]}, {"input": "10000 10000 1\r\n", "output": ["1 1 L"]}, {"input": "10000 10000 2\r\n", "output": ["1 1 R"]}, {"input": "10000 10000 100000001\r\n", "output": ["5001 1 L"]}, {"input": "10000 10000 199999999\r\n", "output": ["10000 10000 L"]}, {"input": "10000 10000 200000000\r\n", "output": ["10000 10000 R"]}, {"input": "1 2 1\r\n", "output": ["1 1 L"]}, {"input": "1 2 2\r\n", "output": ["1 1 R"]}, {"input": "1 2 3\r\n", "output": ["1 2 L"]}, {"input": "1 2 4\r\n", "output": ["1 2 R"]}, {"input": "2 1 1\r\n", "output": ["1 1 L"]}, {"input": "2 1 2\r\n", "output": ["1 1 R"]}, {"input": "2 1 3\r\n", "output": ["2 1 L"]}, {"input": "2 1 4\r\n", "output": ["2 1 R"]}, {"input": "4 3 7\r\n", "output": ["2 1 L"]}, {"input": "1 1 1\r\n", "output": ["1 1 L"]}]

[{'input': '3 2 8\r\n', 'output': ['2 2 R']}, {'input': '1 2 4\r\n', 'output': ['1 2 R']}, {'input': '3 2 12\r\n', 'output': ['3 2 R']}, {'input': '10000 1 20000\r\n', 'output': ['10000 1 R']}, {'input': '10000 9999 197114268\r\n', 'output': ['9857 6990 R']}]

[{'input': '1 2 2\r\n', 'output': ['1 1 R']}, {'input': '10000 10000 1\r\n', 'output': ['1 1 L']}, {'input': '3 2 9\r\n', 'output': ['3 1 L']}, {'input': '3 2 7\r\n', 'output': ['2 2 L']}, {'input': '2 4 4\r\n', 'output': ['1 2 R']}]

[{'input': '1 10000 1\r\n', 'output': ['1 1 L']}, {'input': '3 2 5\r\n', 'output': ['2 1 L']}, {'input': '300 2000 1068628\r\n', 'output': ['268 314 R']}, {'input': '1 1 1\r\n', 'output': ['1 1 L']}, {'input': '2 1 2\r\n', 'output': ['1 1 R']}]

[{'input': '10000 10000 2\r\n', 'output': ['1 1 R']}, {'input': '1 10000 20000\r\n', 'output': ['1 10000 R']}, {'input': '1 2 1\r\n', 'output': ['1 1 L']}, {'input': '10 3 59\r\n', 'output': ['10 3 L']}, {'input': '10000 10000 1\r\n', 'output': ['1 1 L']}]

[{'input': '4 3 7\r\n', 'output': ['2 1 L']}, {'input': '10000 1 1\r\n', 'output': ['1 1 L']}, {'input': '10000 9999 112390396\r\n', 'output': ['5621 818 R']}, {'input': '3 2 11\r\n', 'output': ['3 2 L']}, {'input': '1 2 1\r\n', 'output': ['1 1 L']}]

["5"]

The only line of the input contains one integer n (5 ≤ n ≤ 100) — the number of east to west paths and north to south paths.

92db14325cd8aee06b502c12d2e3dd81

n = int(input()) print(((n*(n-1)*(n-2)*(n-3)*(n-4))**2)//120)

["120"]

Python

Output one integer — the number of ways to place the benches.

The city park of IT City contains n east to west paths and n north to south paths. Each east to west path crosses each north to south path, so there are n2 intersections.The city funded purchase of five benches. To make it seems that there are many benches it was decided to place them on as many paths as possible. Obviously this requirement is satisfied by the following scheme: each bench is placed on a cross of paths and each path contains not more than one bench.Help the park administration count the number of ways to place the benches.

[{"input": "5\r\n", "output": ["120"]}, {"input": "6\r\n", "output": ["4320"]}, {"input": "7\r\n", "output": ["52920"]}, {"input": "15\r\n", "output": ["1082161080"]}, {"input": "17\r\n", "output": ["4594961280"]}, {"input": "72\r\n", "output": ["23491596420472320"]}, {"input": "83\r\n", "output": ["101159538130177920"]}, {"input": "95\r\n", "output": ["402852449038723320"]}, {"input": "99\r\n", "output": ["613867215317368320"]}, {"input": "100\r\n", "output": ["680185280130048000"]}]

[{'input': '6\r\n', 'output': ['4320']}, {'input': '95\r\n', 'output': ['402852449038723320']}, {'input': '72\r\n', 'output': ['23491596420472320']}, {'input': '17\r\n', 'output': ['4594961280']}, {'input': '83\r\n', 'output': ['101159538130177920']}]

[{'input': '83\r\n', 'output': ['101159538130177920']}, {'input': '5\r\n', 'output': ['120']}, {'input': '72\r\n', 'output': ['23491596420472320']}, {'input': '100\r\n', 'output': ['680185280130048000']}, {'input': '6\r\n', 'output': ['4320']}]

[{'input': '15\r\n', 'output': ['1082161080']}, {'input': '95\r\n', 'output': ['402852449038723320']}, {'input': '5\r\n', 'output': ['120']}, {'input': '100\r\n', 'output': ['680185280130048000']}, {'input': '17\r\n', 'output': ['4594961280']}]

[{'input': '17\r\n', 'output': ['4594961280']}, {'input': '83\r\n', 'output': ['101159538130177920']}, {'input': '6\r\n', 'output': ['4320']}, {'input': '5\r\n', 'output': ['120']}, {'input': '100\r\n', 'output': ['680185280130048000']}]

[{'input': '95\r\n', 'output': ['402852449038723320']}, {'input': '100\r\n', 'output': ['680185280130048000']}, {'input': '72\r\n', 'output': ['23491596420472320']}, {'input': '15\r\n', 'output': ['1082161080']}, {'input': '5\r\n', 'output': ['120']}]

["3 3\n0 0\n2 0\n3 1\n-2 1\n0 3\n2 2", "2 1\n1 0\n2 2\n3 1"]

The first line contains two space-separated integers R, B(1 ≤ R, B ≤ 10). For 1 ≤ i ≤ R, the i + 1-th line contains two space-separated integers xi and yi (|xi|, |yi| ≤ 10000) denoting the coordinates of the i-th Rebel spaceship. The following B lines have the same format, denoting the position of bases. It is guaranteed that no two points coincide and that no three points are on the same line.

65f81f621c228c09915adcb05256c634

n,m=[int(x) for x in input().split()] for i in range(n+m): s=input() if n==m: print('Yes') else: print('No')

["Yes", "No"]

Python

NoteFor the first example, one possible way is to connect the Rebels and bases in order.For the second example, there is no perfect matching between Rebels and bases.

If it is possible to connect Rebel spaceships and bases so as satisfy the constraint, output Yes, otherwise output No (without quote).

The Rebel fleet is afraid that the Empire might want to strike back again. Princess Heidi needs to know if it is possible to assign R Rebel spaceships to guard B bases so that every base has exactly one guardian and each spaceship has exactly one assigned base (in other words, the assignment is a perfect matching). Since she knows how reckless her pilots are, she wants to be sure that any two (straight) paths – from a base to its assigned spaceship – do not intersect in the galaxy plane (that is, in 2D), and so there is no risk of collision.

[{"input": "3 3\r\n0 0\r\n2 0\r\n3 1\r\n-2 1\r\n0 3\r\n2 2\r\n", "output": ["YES", "Yes"]}, {"input": "2 1\r\n1 0\r\n2 2\r\n3 1\r\n", "output": ["No", "NO"]}, {"input": "1 1\r\n3686 4362\r\n-7485 5112\r\n", "output": ["YES", "Yes"]}, {"input": "1 2\r\n1152 -7324\r\n-5137 -35\r\n-6045 -5271\r\n", "output": ["No", "NO"]}, {"input": "1 3\r\n-8824 -9306\r\n-5646 -9767\r\n8123 9355\r\n-6203 -1643\r\n", "output": ["No", "NO"]}, {"input": "1 5\r\n-8775 6730\r\n-3806 -6906\r\n-9256 -8240\r\n-1320 6849\r\n8155 746\r\n8284 -7317\r\n", "output": ["No", "NO"]}, {"input": "1 8\r\n8741 3638\r\n381 -9191\r\n7534 8792\r\n-8848 -414\r\n2926 -7444\r\n9475 559\r\n6938 2359\r\n2570 4721\r\n3329 -9365\r\n", "output": ["No", "NO"]}, {"input": "1 9\r\n6207 1655\r\n2728 8520\r\n9142 3418\r\n-1258 -8727\r\n5370 3161\r\n-5167 -7691\r\n517 2242\r\n3702 -9904\r\n-6862 -2997\r\n2524 -5492\r\n", "output": ["No", "NO"]}, {"input": "1 10\r\n9424 3979\r\n-8582 9252\r\n-2432 -3287\r\n-4247 1932\r\n-9491 5544\r\n-635 5689\r\n8260 -6790\r\n8841 3067\r\n-5624 -1990\r\n1569 1045\r\n-8844 -8462\r\n", "output": ["No", "NO"]}, {"input": "2 1\r\n2893 -5488\r\n-5087 -5042\r\n-8928 -9453\r\n", "output": ["No", "NO"]}, {"input": "2 2\r\n359 -29\r\n6964 -7332\r\n2384 -4529\r\n4434 2253\r\n", "output": ["YES", "Yes"]}, {"input": "2 3\r\n-9617 845\r\n4195 -2181\r\n-6305 -9903\r\n-535 -6060\r\n9417 -8419\r\n", "output": ["No", "NO"]}, {"input": "2 5\r\n-9568 -3121\r\n-1408 2942\r\n-827 -7497\r\n4348 2432\r\n-7958 231\r\n6440 1896\r\n2647 -1305\r\n", "output": ["No", "NO"]}, {"input": "2 8\r\n7948 3490\r\n2779 3512\r\n3403 -3024\r\n-3180 -4831\r\n6815 4601\r\n7631 9772\r\n-6320 -1060\r\n5592 362\r\n-785 4040\r\n8030 3272\r\n", "output": ["No", "NO"]}, {"input": "2 9\r\n5414 -8195\r\n-5171 -1634\r\n5012 4161\r\n-5888 -585\r\n9258 2646\r\n5548 1523\r\n7259 -8619\r\n9580 5738\r\n-8715 706\r\n-2232 -3280\r\n1866 1775\r\n", "output": ["No", "NO"]}, {"input": "2 10\r\n-5118 -3971\r\n-1169 -9140\r\n-7807 -3139\r\n9702 -5328\r\n8555 3460\r\n-1442 -733\r\n701 -2802\r\n-5784 2578\r\n8186 -4810\r\n-2722 -1013\r\n-9437 4021\r\n-5403 -1331\r\n", "output": ["No", "NO"]}, {"input": "3 1\r\n-8199 -7896\r\n7015 -4898\r\n-499 -8710\r\n9953 -6411\r\n", "output": ["No", "NO"]}, {"input": "3 2\r\n9268 -9879\r\n4245 2515\r\n-9188 -3786\r\n-2458 -2165\r\n3420 463\r\n", "output": ["No", "NO"]}, {"input": "3 3\r\n-8149 697\r\n6593 7667\r\n2123 -9160\r\n-5165 9523\r\n747 -8933\r\n-1536 -2691\r\n", "output": ["YES", "Yes"]}, {"input": "3 5\r\n-658 7030\r\n990 3086\r\n-4958 -6755\r\n7159 -1986\r\n5634 -7726\r\n1740 -1450\r\n1947 7835\r\n-2755 -4709\r\n", "output": ["No", "NO"]}, {"input": "3 8\r\n-3143 -6360\r\n-5121 -6641\r\n-727 -9723\r\n-369 454\r\n-9298 4086\r\n5787 -1016\r\n2683 -9660\r\n-1089 1121\r\n-4898 7743\r\n418 5485\r\n7425 -6644\r\n", "output": ["No", "NO"]}, {"input": "3 9\r\n6882 -8342\r\n4669 -8932\r\n882 4904\r\n-220 4700\r\n587 -5311\r\n3704 -1823\r\n6559 -6921\r\n-7399 6497\r\n-5387 -5890\r\n-9844 -1067\r\n5367 -7237\r\n-8314 -939\r\n", "output": ["No", "NO"]}, {"input": "3 10\r\n-7100 -1623\r\n-3459 2172\r\n9676 1595\r\n-6053 4558\r\n-842 8819\r\n-9691 3144\r\n3440 -9112\r\n7034 4946\r\n4851 -2513\r\n430 4372\r\n-7175 -3497\r\n5719 381\r\n-8859 -1347\r\n", "output": ["No", "NO"]}, {"input": "5 1\r\n9621 -154\r\n6694 -2348\r\n944 -7225\r\n-1568 -5543\r\n-3805 -872\r\n1204 -2651\r\n", "output": ["No", "NO"]}, {"input": "5 2\r\n-355 -9579\r\n-1256 -4638\r\n-4890 7402\r\n-1420 -1297\r\n-1362 2290\r\n-879 9101\r\n9514 -6689\r\n", "output": ["No", "NO"]}, {"input": "5 3\r\n9670 8440\r\n1091 -9784\r\n6422 4884\r\n3314 -9610\r\n8523 -7107\r\n-2963 8293\r\n3092 -3950\r\n-4093 -6502\r\n", "output": ["No", "NO"]}, {"input": "5 5\r\n-2840 4475\r\n2931 -6923\r\n-659 -8125\r\n8197 -1118\r\n851 -5899\r\n313 6679\r\n-9751 6115\r\n-6415 4250\r\n-227 -9732\r\n-6282 5041\r\n", "output": ["YES", "Yes"]}, {"input": "5 8\r\n-5325 1383\r\n-5441 3351\r\n-3870 1465\r\n669 -8381\r\n-4377 5913\r\n4360 -329\r\n8725 8620\r\n7810 -2479\r\n4019 4850\r\n8052 9911\r\n4130 -4668\r\n3744 2537\r\n-7171 -3933\r\n", "output": ["No", "NO"]}, {"input": "5 9\r\n-2742 -600\r\n6609 8502\r\n-5118 6389\r\n-4300 5568\r\n-1934 -3484\r\n9719 -1137\r\n2303 -8641\r\n1500 2897\r\n-6172 -8783\r\n-2210 -6939\r\n9514 -5262\r\n-3773 -4081\r\n1983 -4032\r\n4503 -3496\r\n", "output": ["No", "NO"]}, {"input": "5 10\r\n1493 7658\r\n-598 7650\r\n9226 -964\r\n2439 -3114\r\n366 2391\r\n-1008 -2258\r\n6063 8568\r\n7488 6824\r\n-4674 9523\r\n9590 9960\r\n-8361 -8234\r\n520 -1312\r\n-3878 -1142\r\n-8261 -239\r\n-2346 -2362\r\n", "output": ["No", "NO"]}, {"input": "8 1\r\n-796 -1\r\n3591 -2510\r\n-6330 4706\r\n-7422 -9093\r\n7860 -7002\r\n5375 -5310\r\n3538 3108\r\n-9851 -9798\r\n-8884 -170\r\n", "output": ["No", "NO"]}, {"input": "8 2\r\n-3330 -1983\r\n-6621 -4800\r\n-4721 9630\r\n9871 -4847\r\n-2256 -8957\r\n3292 -6118\r\n4558 -6712\r\n-5863 5282\r\n-9373 3938\r\n-5179 -8073\r\n", "output": ["No", "NO"]}, {"input": "8 3\r\n6695 8593\r\n-7129 352\r\n6590 -5447\r\n-2540 -3457\r\n7630 1647\r\n8651 5634\r\n-1864 -6829\r\n7828 -1901\r\n-7005 -9695\r\n4561 -4921\r\n-4782 -6478\r\n", "output": ["No", "NO"]}, {"input": "8 5\r\n6744 2367\r\n-5290 -7085\r\n-491 6662\r\n2343 -2407\r\n-43 2855\r\n-8075 6875\r\n-7265 -4206\r\n-4197 8851\r\n7433 780\r\n4038 -8321\r\n-1455 -7665\r\n3139 -1225\r\n9884 -167\r\n", "output": ["No", "NO"]}, {"input": "8 8\r\n4260 1536\r\n-8545 6045\r\n-3702 3693\r\n-5185 -2228\r\n-5271 -5335\r\n-4027 4453\r\n-8790 8598\r\n7172 -5320\r\n-880 -4638\r\n-1630 -3452\r\n2076 8296\r\n-9116 -5599\r\n2461 9832\r\n4268 5116\r\n-7582 -805\r\n3548 3776\r\n", "output": ["YES", "Yes"]}, {"input": "8 9\r\n-5716 6995\r\n1245 3754\r\n7610 8617\r\n-451 -5424\r\n-2828 5270\r\n-6111 6502\r\n-2653 1039\r\n3718 7498\r\n-8810 -7973\r\n667 -300\r\n-2838 -2001\r\n3367 5523\r\n-8386 -2827\r\n6929 -6260\r\n3247 1167\r\n1873 6265\r\n4376 -8781\r\n", "output": ["No", "NO"]}, {"input": "8 10\r\n5844 -8156\r\n9676 -8121\r\n-6302 -1050\r\n-4823 -8343\r\n4736 -3859\r\n9129 5920\r\n-3990 2792\r\n3615 -8930\r\n-7831 -8703\r\n-5542 931\r\n7599 -7930\r\n8705 -8735\r\n-6438 1724\r\n-7568 -8351\r\n5893 2316\r\n2574 -9723\r\n2416 3827\r\n856 -4877\r\n", "output": ["No", "NO"]}, {"input": "9 1\r\n8114 -9851\r\n872 -9807\r\n9541 5449\r\n7948 -3808\r\n8892 -7517\r\n-6767 3903\r\n-18 -311\r\n-3973 5845\r\n-3295 3533\r\n-4790 -4426\r\n", "output": ["No", "NO"]}, {"input": "9 2\r\n5580 8167\r\n-7078 -4655\r\n3707 -9628\r\n2980 438\r\n1632 -9472\r\n-8850 -4346\r\n-6440 2428\r\n-2841 923\r\n6515 -2658\r\n-2492 -8716\r\n8219 5104\r\n", "output": ["No", "NO"]}, {"input": "9 3\r\n8163 6185\r\n-4731 2757\r\n-4982 -4704\r\n3128 4684\r\n-8483 1132\r\n6807 2288\r\n4878 2311\r\n-6295 6299\r\n8882 -5992\r\n-195 4733\r\n6162 4510\r\n-7264 -1020\r\n", "output": ["No", "NO"]}, {"input": "9 5\r\n-4347 -5222\r\n-2891 5618\r\n-4621 7404\r\n-4548 -6825\r\n3846 2340\r\n2640 3530\r\n-7965 4934\r\n-8617 -2950\r\n-9240 4483\r\n-718 6451\r\n-8251 -6379\r\n558 3484\r\n9861 -6432\r\n483 -7331\r\n", "output": ["No", "NO"]}, {"input": "9 8\r\n-6832 -872\r\n1295 -4109\r\n-7832 -8123\r\n-2373 -6646\r\n-1383 -5849\r\n3832 -6334\r\n-7229 -2263\r\n-6951 -9678\r\n4709 1326\r\n-6386 -1239\r\n2721 -8159\r\n-4255 -890\r\n9880 3567\r\n3349 5921\r\n2487 -828\r\n-783 2422\r\n-5497 -8399\r\n", "output": ["No", "NO"]}, {"input": "9 9\r\n3193 -2855\r\n787 -6399\r\n3479 9360\r\n5217 -9842\r\n1061 4755\r\n1748 -7142\r\n-6209 -2380\r\n6740 -4302\r\n-5482 5433\r\n3353 -5529\r\n664 1546\r\n8228 -9769\r\n-8409 -1650\r\n893 9365\r\n-9542 8585\r\n7245 -9972\r\n-475 -6359\r\n-3775 2139\r\n", "output": ["YES", "Yes"]}, {"input": "9 10\r\n-3581 3894\r\n7385 3191\r\n-8820 6540\r\n-577 -5900\r\n2781 -5943\r\n8322 -7944\r\n-1251 -5779\r\n-3567 3140\r\n8835 -6406\r\n-2390 -1126\r\n7006 4553\r\n-174 -7023\r\n-6538 1530\r\n3318 2477\r\n7864 -9657\r\n-2379 -6961\r\n4456 9852\r\n1462 -5871\r\n-9931 6466\r\n", "output": ["No", "NO"]}, {"input": "10 1\r\n3362 3137\r\n-6006 -2168\r\n-9207 8006\r\n-6284 -114\r\n4617 -4997\r\n-4360 3540\r\n-6423 2328\r\n-8768 8468\r\n2899 1032\r\n-7561 -3623\r\n6979 653\r\n", "output": ["No", "NO"]}, {"input": "10 2\r\n5945 8596\r\n-3658 -4459\r\n-7598 -7071\r\n3567 4132\r\n7060 -1835\r\n-6443 -4709\r\n4895 2211\r\n-4780 3546\r\n5266 7400\r\n2178 -472\r\n4922 -9643\r\n4163 6030\r\n", "output": ["No", "NO"]}, {"input": "10 3\r\n3411 6614\r\n8392 693\r\n-8846 7555\r\n-1402 -4181\r\n-3055 -3789\r\n4033 -5516\r\n-1527 4950\r\n-792 8922\r\n-4925 4065\r\n4475 5536\r\n-9695 9764\r\n6943 -2849\r\n7022 1986\r\n", "output": ["No", "NO"]}, {"input": "10 5\r\n3460 5504\r\n529 -6744\r\n4075 9961\r\n-3961 4311\r\n-7871 9977\r\n7308 -4275\r\n-6928 7573\r\n-3114 -327\r\n-3046 -5461\r\n3953 4398\r\n-4106 -3981\r\n-8092 -8048\r\n7590 9228\r\n9433 -4\r\n-8808 -6742\r\n", "output": ["No", "NO"]}, {"input": "10 8\r\n8417 -444\r\n-5582 6386\r\n863 6992\r\n-4047 6751\r\n-5658 1788\r\n-1204 5862\r\n-6192 -2480\r\n813 -7056\r\n-9098 -1176\r\n-1715 -3292\r\n6866 -2905\r\n-7788 137\r\n7609 -774\r\n-7702 -6753\r\n-6622 -3090\r\n3089 -7006\r\n-9374 1882\r\n-481 -5698\r\n", "output": ["No", "NO"]}, {"input": "10 9\r\n-9001 -9868\r\n4207 1240\r\n-7826 1618\r\n-6755 3555\r\n-3214 -167\r\n4155 -4648\r\n-2316 259\r\n4801 -1679\r\n-6730 8048\r\n-4535 -9843\r\n4809 -5759\r\n4695 -8742\r\n9321 -5991\r\n2401 4133\r\n6468 6324\r\n1414 -9103\r\n-6613 3922\r\n5544 -5092\r\n-6777 -788\r\n", "output": ["No", "NO"]}, {"input": "10 10\r\n8530 -3814\r\n-9330 -6035\r\n3951 -217\r\n-9276 8291\r\n636 -3118\r\n5024 -2403\r\n4601 7977\r\n-3620 -1428\r\n4954 -9632\r\n-9852 6553\r\n-3457 5430\r\n-8866 -7343\r\n1020 -5748\r\n5043 -3820\r\n-2832 1528\r\n-5058 -825\r\n2406 -3530\r\n9152 -7463\r\n-8547 7108\r\n2492 8953\r\n", "output": ["YES", "Yes"]}]

[{'input': '8 1\r\n-796 -1\r\n3591 -2510\r\n-6330 4706\r\n-7422 -9093\r\n7860 -7002\r\n5375 -5310\r\n3538 3108\r\n-9851 -9798\r\n-8884 -170\r\n', 'output': ['No', 'NO']}, {'input': '10 5\r\n3460 5504\r\n529 -6744\r\n4075 9961\r\n-3961 4311\r\n-7871 9977\r\n7308 -4275\r\n-6928 7573\r\n-3114 -327\r\n-3046 -5461\r\n3953 4398\r\n-4106 -3981\r\n-8092 -8048\r\n7590 9228\r\n9433 -4\r\n-8808 -6742\r\n', 'output': ['No', 'NO']}, {'input': '1 9\r\n6207 1655\r\n2728 8520\r\n9142 3418\r\n-1258 -8727\r\n5370 3161\r\n-5167 -7691\r\n517 2242\r\n3702 -9904\r\n-6862 -2997\r\n2524 -5492\r\n', 'output': ['No', 'NO']}, {'input': '10 8\r\n8417 -444\r\n-5582 6386\r\n863 6992\r\n-4047 6751\r\n-5658 1788\r\n-1204 5862\r\n-6192 -2480\r\n813 -7056\r\n-9098 -1176\r\n-1715 -3292\r\n6866 -2905\r\n-7788 137\r\n7609 -774\r\n-7702 -6753\r\n-6622 -3090\r\n3089 -7006\r\n-9374 1882\r\n-481 -5698\r\n', 'output': ['No', 'NO']}, {'input': '9 2\r\n5580 8167\r\n-7078 -4655\r\n3707 -9628\r\n2980 438\r\n1632 -9472\r\n-8850 -4346\r\n-6440 2428\r\n-2841 923\r\n6515 -2658\r\n-2492 -8716\r\n8219 5104\r\n', 'output': ['No', 'NO']}]

[{'input': '8 1\r\n-796 -1\r\n3591 -2510\r\n-6330 4706\r\n-7422 -9093\r\n7860 -7002\r\n5375 -5310\r\n3538 3108\r\n-9851 -9798\r\n-8884 -170\r\n', 'output': ['No', 'NO']}, {'input': '9 3\r\n8163 6185\r\n-4731 2757\r\n-4982 -4704\r\n3128 4684\r\n-8483 1132\r\n6807 2288\r\n4878 2311\r\n-6295 6299\r\n8882 -5992\r\n-195 4733\r\n6162 4510\r\n-7264 -1020\r\n', 'output': ['No', 'NO']}, {'input': '8 9\r\n-5716 6995\r\n1245 3754\r\n7610 8617\r\n-451 -5424\r\n-2828 5270\r\n-6111 6502\r\n-2653 1039\r\n3718 7498\r\n-8810 -7973\r\n667 -300\r\n-2838 -2001\r\n3367 5523\r\n-8386 -2827\r\n6929 -6260\r\n3247 1167\r\n1873 6265\r\n4376 -8781\r\n', 'output': ['No', 'NO']}, {'input': '2 5\r\n-9568 -3121\r\n-1408 2942\r\n-827 -7497\r\n4348 2432\r\n-7958 231\r\n6440 1896\r\n2647 -1305\r\n', 'output': ['No', 'NO']}, {'input': '1 8\r\n8741 3638\r\n381 -9191\r\n7534 8792\r\n-8848 -414\r\n2926 -7444\r\n9475 559\r\n6938 2359\r\n2570 4721\r\n3329 -9365\r\n', 'output': ['No', 'NO']}]

[{'input': '8 10\r\n5844 -8156\r\n9676 -8121\r\n-6302 -1050\r\n-4823 -8343\r\n4736 -3859\r\n9129 5920\r\n-3990 2792\r\n3615 -8930\r\n-7831 -8703\r\n-5542 931\r\n7599 -7930\r\n8705 -8735\r\n-6438 1724\r\n-7568 -8351\r\n5893 2316\r\n2574 -9723\r\n2416 3827\r\n856 -4877\r\n', 'output': ['No', 'NO']}, {'input': '5 5\r\n-2840 4475\r\n2931 -6923\r\n-659 -8125\r\n8197 -1118\r\n851 -5899\r\n313 6679\r\n-9751 6115\r\n-6415 4250\r\n-227 -9732\r\n-6282 5041\r\n', 'output': ['YES', 'Yes']}, {'input': '3 10\r\n-7100 -1623\r\n-3459 2172\r\n9676 1595\r\n-6053 4558\r\n-842 8819\r\n-9691 3144\r\n3440 -9112\r\n7034 4946\r\n4851 -2513\r\n430 4372\r\n-7175 -3497\r\n5719 381\r\n-8859 -1347\r\n', 'output': ['No', 'NO']}, {'input': '5 3\r\n9670 8440\r\n1091 -9784\r\n6422 4884\r\n3314 -9610\r\n8523 -7107\r\n-2963 8293\r\n3092 -3950\r\n-4093 -6502\r\n', 'output': ['No', 'NO']}, {'input': '9 2\r\n5580 8167\r\n-7078 -4655\r\n3707 -9628\r\n2980 438\r\n1632 -9472\r\n-8850 -4346\r\n-6440 2428\r\n-2841 923\r\n6515 -2658\r\n-2492 -8716\r\n8219 5104\r\n', 'output': ['No', 'NO']}]

[{'input': '10 1\r\n3362 3137\r\n-6006 -2168\r\n-9207 8006\r\n-6284 -114\r\n4617 -4997\r\n-4360 3540\r\n-6423 2328\r\n-8768 8468\r\n2899 1032\r\n-7561 -3623\r\n6979 653\r\n', 'output': ['No', 'NO']}, {'input': '3 2\r\n9268 -9879\r\n4245 2515\r\n-9188 -3786\r\n-2458 -2165\r\n3420 463\r\n', 'output': ['No', 'NO']}, {'input': '2 2\r\n359 -29\r\n6964 -7332\r\n2384 -4529\r\n4434 2253\r\n', 'output': ['YES', 'Yes']}, {'input': '2 1\r\n2893 -5488\r\n-5087 -5042\r\n-8928 -9453\r\n', 'output': ['No', 'NO']}, {'input': '2 9\r\n5414 -8195\r\n-5171 -1634\r\n5012 4161\r\n-5888 -585\r\n9258 2646\r\n5548 1523\r\n7259 -8619\r\n9580 5738\r\n-8715 706\r\n-2232 -3280\r\n1866 1775\r\n', 'output': ['No', 'NO']}]

[{'input': '1 2\r\n1152 -7324\r\n-5137 -35\r\n-6045 -5271\r\n', 'output': ['No', 'NO']}, {'input': '10 2\r\n5945 8596\r\n-3658 -4459\r\n-7598 -7071\r\n3567 4132\r\n7060 -1835\r\n-6443 -4709\r\n4895 2211\r\n-4780 3546\r\n5266 7400\r\n2178 -472\r\n4922 -9643\r\n4163 6030\r\n', 'output': ['No', 'NO']}, {'input': '3 9\r\n6882 -8342\r\n4669 -8932\r\n882 4904\r\n-220 4700\r\n587 -5311\r\n3704 -1823\r\n6559 -6921\r\n-7399 6497\r\n-5387 -5890\r\n-9844 -1067\r\n5367 -7237\r\n-8314 -939\r\n', 'output': ['No', 'NO']}, {'input': '9 1\r\n8114 -9851\r\n872 -9807\r\n9541 5449\r\n7948 -3808\r\n8892 -7517\r\n-6767 3903\r\n-18 -311\r\n-3973 5845\r\n-3295 3533\r\n-4790 -4426\r\n', 'output': ['No', 'NO']}, {'input': '2 5\r\n-9568 -3121\r\n-1408 2942\r\n-827 -7497\r\n4348 2432\r\n-7958 231\r\n6440 1896\r\n2647 -1305\r\n', 'output': ['No', 'NO']}]

["4 2 2", "5 1 5"]

The only input line contains three integers $$$n$$$, $$$l$$$ and $$$r$$$ ($$$1 \leq n \leq 1\,000$$$, $$$1 \leq l \leq r \leq \min(n, 20)$$$) — an array's size, the minimal number and the maximal number of distinct elements in an array.

ce220726392fb0cacf0ec44a7490084a

n,l,r=map(int,input().split()) m=n a=1 x=0 A=[] B=[] while n>0: if l==1: A.append(1) n-=1 else: A.append(2**(l-1)) l-=1 n-=1 while x<m: if a==r: B.append(2**(a-1)) x+=1 else: B.append(2**(a-1)) x+=1 a+=1 print(sum(A),sum(B))

["5 7", "5 31"]

Python

NoteIn the first example, an array could be the one of the following: $$$[1,1,1,2]$$$, $$$[1,1,2,2]$$$ or $$$[1,2,2,2]$$$. In the first case the minimal sum is reached and in the last case the maximal sum is reached.In the second example, the minimal sum is reached at the array $$$[1,1,1,1,1]$$$, and the maximal one is reached at the array $$$[1,2,4,8,16]$$$.

Output two numbers — the minimal and the maximal possible sums of all elements in an array.

Mislove had an array $$$a_1$$$, $$$a_2$$$, $$$\cdots$$$, $$$a_n$$$ of $$$n$$$ positive integers, but he has lost it. He only remembers the following facts about it: The number of different numbers in the array is not less than $$$l$$$ and is not greater than $$$r$$$; For each array's element $$$a_i$$$ either $$$a_i = 1$$$ or $$$a_i$$$ is even and there is a number $$$\dfrac{a_i}{2}$$$ in the array.For example, if $$$n=5$$$, $$$l=2$$$, $$$r=3$$$ then an array could be $$$[1,2,2,4,4]$$$ or $$$[1,1,1,1,2]$$$; but it couldn't be $$$[1,2,2,4,8]$$$ because this array contains $$$4$$$ different numbers; it couldn't be $$$[1,2,2,3,3]$$$ because $$$3$$$ is odd and isn't equal to $$$1$$$; and it couldn't be $$$[1,1,2,2,16]$$$ because there is a number $$$16$$$ in the array but there isn't a number $$$\frac{16}{2} = 8$$$.According to these facts, he is asking you to count the minimal and the maximal possible sums of all elements in an array.

[{"input": "4 2 2\r\n", "output": ["5 7"]}, {"input": "5 1 5\r\n", "output": ["5 31"]}, {"input": "106 16 18\r\n", "output": ["65625 11796479"]}, {"input": "114 18 19\r\n", "output": ["262239 25427967"]}, {"input": "655 3 18\r\n", "output": ["659 83755007"]}, {"input": "1000 1 20\r\n", "output": ["1000 514850815"]}, {"input": "1000 20 20\r\n", "output": ["1049555 514850815"]}, {"input": "1 1 1\r\n", "output": ["1 1"]}, {"input": "588 13 15\r\n", "output": ["8766 9420799"]}, {"input": "408 13 13\r\n", "output": ["8586 1626111"]}, {"input": "879 17 17\r\n", "output": ["131933 56623103"]}, {"input": "17 2 14\r\n", "output": ["18 40959"]}, {"input": "624 7 17\r\n", "output": ["744 39911423"]}, {"input": "1000 1 1\r\n", "output": ["1000 1000"]}]

[{'input': '655 3 18\r\n', 'output': ['659 83755007']}, {'input': '5 1 5\r\n', 'output': ['5 31']}, {'input': '879 17 17\r\n', 'output': ['131933 56623103']}, {'input': '17 2 14\r\n', 'output': ['18 40959']}, {'input': '1000 1 1\r\n', 'output': ['1000 1000']}]

[{'input': '1000 1 1\r\n', 'output': ['1000 1000']}, {'input': '106 16 18\r\n', 'output': ['65625 11796479']}, {'input': '5 1 5\r\n', 'output': ['5 31']}, {'input': '408 13 13\r\n', 'output': ['8586 1626111']}, {'input': '879 17 17\r\n', 'output': ['131933 56623103']}]

[{'input': '17 2 14\r\n', 'output': ['18 40959']}, {'input': '588 13 15\r\n', 'output': ['8766 9420799']}, {'input': '655 3 18\r\n', 'output': ['659 83755007']}, {'input': '114 18 19\r\n', 'output': ['262239 25427967']}, {'input': '1000 1 20\r\n', 'output': ['1000 514850815']}]

[{'input': '1000 1 1\r\n', 'output': ['1000 1000']}, {'input': '17 2 14\r\n', 'output': ['18 40959']}, {'input': '588 13 15\r\n', 'output': ['8766 9420799']}, {'input': '408 13 13\r\n', 'output': ['8586 1626111']}, {'input': '4 2 2\r\n', 'output': ['5 7']}]

[{'input': '1000 1 20\r\n', 'output': ['1000 514850815']}, {'input': '4 2 2\r\n', 'output': ['5 7']}, {'input': '114 18 19\r\n', 'output': ['262239 25427967']}, {'input': '655 3 18\r\n', 'output': ['659 83755007']}, {'input': '408 13 13\r\n', 'output': ['8586 1626111']}]

["2 2\n5 8", "1 2\n7 1", "1 2\n4 4", "1 4\n2 2 1 2"]

The first line contains two integers n and k (1 ≤ n ≤ 10000, 1 ≤ k ≤ 100) — the number of rows and the number of groups of soldiers, respectively. The second line contains k integers a1, a2, a3, ..., ak (1 ≤ ai ≤ 10000), where ai denotes the number of soldiers in the i-th group. It is guaranteed that a1 + a2 + ... + ak ≤ 8·n.

d1f88a97714d6c13309c88fcf7d86821

n,k = map(int, input().split()) a = list(map(int,input().split())) all_sum = sum(a) r4,r2 = n,n*2 for v in range(len(a)): mid = a[v] // 4 a[v] = a[v] % 4 if mid <= r4: r4 -= mid else: a[v] += 4 * (mid - r4) r4 = 0 if r4 == 0: break mid = 0 r22 = 0 for v in a: if v % 2 == 1: mid += 1 r22 += v // 2 #print(r4,r22,mid,r2) if r4 > 0: mid -=r4 r22 -= r4 if mid < 0: r22 -= (mid // -2) mid = 0 if r22 + mid > r2: print('NO') else: print('YES')

["YES", "NO", "YES", "YES"]

Python

NoteIn the first sample, Daenerys can place the soldiers like in the figure below: In the second sample, there is no way to place the soldiers in the plane since the second group soldier will always have a seat neighboring to someone from the first group.In the third example Daenerys can place the first group on seats (1, 2, 7, 8), and the second group an all the remaining seats.In the fourth example she can place the first two groups on seats (1, 2) and (7, 8), the third group on seats (3), and the fourth group on seats (5, 6).

If we can place the soldiers in the airplane print "YES" (without quotes). Otherwise print "NO" (without quotes). You can choose the case (lower or upper) for each letter arbitrary.

Daenerys Targaryen has an army consisting of k groups of soldiers, the i-th group contains ai soldiers. She wants to bring her army to the other side of the sea to get the Iron Throne. She has recently bought an airplane to carry her army through the sea. The airplane has n rows, each of them has 8 seats. We call two seats neighbor, if they are in the same row and in seats {1, 2}, {3, 4}, {4, 5}, {5, 6} or {7, 8}. A row in the airplane Daenerys Targaryen wants to place her army in the plane so that there are no two soldiers from different groups sitting on neighboring seats.Your task is to determine if there is a possible arranging of her army in the airplane such that the condition above is satisfied.

[{"input": "2 2\r\n5 8\r\n", "output": ["YES"]}, {"input": "1 2\r\n7 1\r\n", "output": ["NO"]}, {"input": "1 2\r\n4 4\r\n", "output": ["YES"]}, {"input": "1 4\r\n2 2 1 2\r\n", "output": ["YES"]}, {"input": "10000 100\r\n749 2244 949 2439 2703 44 2394 124 285 3694 3609 717 1413 155 974 1778 1448 1327 1487 3458 319 1395 3783 2184 2062 43 826 38 3276 807 1837 4635 171 1386 1768 1128 2020 2536 800 782 3058 174 455 83 647 595 658 109 33 23 70 39 38 1 6 35 94 9 22 12 6 1 2 2 4 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 2 1 1 1 2 1 1 1 1 1 1 1 1 1 1 1 1 1 9938\r\n", "output": ["YES"]}, {"input": "100 15\r\n165 26 83 64 235 48 36 51 3 18 5 10 9 6 5\r\n", "output": ["YES"]}, {"input": "1 4\r\n2 2 2 2\r\n", "output": ["NO"]}, {"input": "5691 91\r\n6573 1666 2158 2591 4636 886 263 4217 389 29 1513 1172 617 2012 1855 798 1588 979 152 37 890 375 1091 839 385 382 1 255 117 289 119 224 182 69 19 71 115 13 4 22 35 2 60 12 6 12 19 9 3 2 2 6 5 1 7 7 3 1 5 1 7 1 4 1 1 3 2 1 2 1 1 2 1 2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 5631\r\n", "output": ["NO"]}, {"input": "2000 50\r\n203 89 1359 3105 898 1381 248 365 108 766 961 630 265 819 838 125 1751 289 177 81 131 564 102 95 49 74 92 101 19 17 156 5 5 4 20 9 25 16 16 2 8 5 4 2 1 3 4 1 3 2\r\n", "output": ["NO"]}, {"input": "10000 100\r\n800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800\r\n", "output": ["YES"]}, {"input": "10000 100\r\n749 2244 949 2439 2703 44 2394 124 285 3694 3609 717 1413 155 974 1778 1448 1327 1487 3458 319 1395 3783 2184 2062 43 826 38 3276 807 1837 4635 171 1386 1768 1128 2020 2536 2050 1074 605 979 1724 1608 672 88 1243 129 718 544 3590 37 187 600 738 34 64 316 58 6 84 252 75 68 40 68 4 29 29 8 13 11 5 1 5 1 3 2 1 1 1 2 3 4 1 1 2 2 2 1 1 1 1 1 1 1 1 1 1 3\r\n", "output": ["NO"]}, {"input": "8459 91\r\n778 338 725 1297 115 540 1452 2708 193 1806 1496 1326 2648 176 199 93 342 3901 2393 2718 800 3434 657 4037 291 690 1957 3280 73 6011 2791 1987 440 455 444 155 261 234 829 1309 1164 616 34 627 107 213 52 110 323 81 98 8 7 73 20 12 56 3 40 12 8 7 69 1 14 3 6 2 6 8 3 5 4 4 3 1 1 4 2 1 1 1 8 2 2 2 1 1 1 2 8421\r\n", "output": ["NO"]}, {"input": "1 3\r\n2 3 2\r\n", "output": ["YES"]}, {"input": "10000 91\r\n2351 1402 1137 2629 4718 1138 1839 1339 2184 2387 165 370 918 1476 2717 879 1152 5367 3940 608 941 766 1256 656 2768 916 4176 489 1989 1633 2725 2329 2795 1970 667 340 1275 120 870 488 225 59 64 255 207 3 37 127 19 224 34 283 144 50 132 60 57 29 18 6 7 4 4 15 3 5 1 10 5 2 3 1 1 1 1 1 1 1 1 1 1 1 2 1 1 1 2 1 1 1 9948\r\n", "output": ["YES"]}, {"input": "10000 83\r\n64 612 2940 2274 1481 1713 860 1264 104 5616 2574 5292 4039 292 1416 854 3854 1140 4344 3904 1720 1968 442 884 2032 875 291 677 2780 3074 3043 2997 407 727 344 511 156 321 134 51 382 336 591 52 134 39 104 10 20 15 24 2 70 39 14 16 16 25 1 6 2 2 1 1 1 2 4 2 1 2 1 2 1 1 1 1 1 1 1 1 1 1 9968\r\n", "output": ["YES"]}, {"input": "4000 71\r\n940 1807 57 715 532 212 3842 2180 2283 744 1453 800 1945 380 2903 293 633 391 2866 256 102 46 228 1099 434 210 244 14 27 4 63 53 3 9 36 25 1 12 2 14 12 28 2 28 8 5 11 8 2 3 6 4 1 1 1 3 2 1 1 1 2 2 1 1 1 1 1 2 1 1 3966\r\n", "output": ["YES"]}, {"input": "3403 59\r\n1269 1612 453 795 1216 941 19 44 1796 324 2019 1397 651 382 841 2003 3013 638 1007 1001 351 95 394 149 125 13 116 183 20 78 208 19 152 10 151 177 16 23 17 22 8 1 3 2 6 1 5 3 13 1 8 4 3 4 4 4 2 2 3378\r\n", "output": ["YES"]}, {"input": "2393 33\r\n1381 2210 492 3394 912 2927 1189 269 66 102 104 969 395 385 369 354 251 28 203 334 20 10 156 29 61 13 30 4 1 32 2 2 2436\r\n", "output": ["YES"]}, {"input": "10000 100\r\n749 2244 949 2439 2703 44 2394 124 285 3694 3609 717 1413 155 974 1778 1448 1327 1487 3458 319 1395 3783 2184 2062 43 826 38 3276 807 1837 4635 171 1386 1768 1128 2020 2536 800 782 3058 174 455 83 647 595 658 109 33 23 70 39 38 1 6 35 94 9 22 12 6 1 2 2 4 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 2 1 1 1 2 1 1 1 1 1 1 1 1 1 1 1 1 1 9939\r\n", "output": ["NO"]}, {"input": "10000 89\r\n1001 1531 2489 457 1415 617 2057 2658 3030 789 2500 3420 1550 376 720 78 506 293 1978 383 3195 2036 891 1741 1817 486 2650 360 2250 2531 3250 1612 2759 603 5321 1319 791 1507 265 174 877 1861 572 172 580 536 777 165 169 11 125 31 186 113 78 27 25 37 8 21 48 24 4 33 35 13 15 1 3 2 2 8 3 5 1 1 6 1 1 2 1 1 2 2 1 1 2 1 9953\r\n", "output": ["NO"]}, {"input": "4 16\r\n2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2\r\n", "output": ["NO"]}, {"input": "10000 71\r\n110 14 2362 260 423 881 1296 3904 1664 849 57 631 1922 917 4832 1339 3398 4578 59 2663 2223 698 4002 3013 747 699 1230 2750 239 1409 6291 2133 1172 5824 181 797 26 281 574 557 19 82 624 387 278 53 64 163 22 617 15 35 42 48 14 140 171 36 28 22 5 49 17 5 10 14 13 1 3 3 9979\r\n", "output": ["NO"]}, {"input": "3495 83\r\n2775 2523 1178 512 3171 1159 1382 2146 2192 1823 799 231 502 16 99 309 656 665 222 285 11 106 244 137 241 45 41 29 485 6 62 38 94 5 7 93 48 5 10 13 2 1 2 1 4 8 5 9 4 6 1 1 1 3 4 3 7 1 2 3 1 1 7 1 1 2 1 1 1 1 1 1 2 1 1 1 1 1 1 1 1 1 3443\r\n", "output": ["NO"]}, {"input": "1000 40\r\n1701 1203 67 464 1884 761 11 559 29 115 405 133 174 63 147 93 41 19 1 15 41 8 33 4 4 1 4 1 1 2 1 2 1 1 2 1 1 2 1 4\r\n", "output": ["NO"]}, {"input": "347 20\r\n55 390 555 426 140 360 29 115 23 113 58 30 33 1 23 3 35 5 7 363\r\n", "output": ["NO"]}, {"input": "10000 100\r\n749 2244 949 2439 2703 44 2394 124 285 3694 3609 717 1413 155 974 1778 1448 1327 1487 3458 319 1395 3783 2184 2062 43 826 38 3276 807 1837 4635 171 1386 1768 1128 2020 2536 800 782 3058 174 455 83 647 595 658 109 33 23 70 39 38 1 6 35 94 9 22 12 6 1 2 2 4 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 2 1 1 1 2 1 1 1 1 1 1 1 1 1 1 1 1 1 9940\r\n", "output": ["NO"]}, {"input": "10000 93\r\n1388 119 711 23 4960 4002 2707 188 813 1831 334 543 338 3402 1808 3368 1428 971 985 220 1521 457 457 140 332 1503 1539 2095 1891 269 5223 226 1528 190 428 5061 410 1587 1149 1934 2275 1337 1828 275 181 85 499 29 585 808 751 401 635 461 181 164 274 36 401 255 38 60 76 16 6 35 79 46 1 39 11 2 8 2 4 14 3 1 1 1 1 1 2 1 3 1 1 1 1 2 1 1 9948\r\n", "output": ["NO"]}, {"input": "4981 51\r\n5364 2166 223 742 350 1309 15 229 4100 3988 227 1719 9 125 787 427 141 842 171 2519 32 2554 2253 721 775 88 720 9 397 513 100 291 111 32 238 42 152 108 5 58 96 53 7 19 11 2 5 5 6 2 4966\r\n", "output": ["NO"]}, {"input": "541 31\r\n607 204 308 298 398 213 1182 58 162 46 64 12 38 91 29 2 4 12 19 3 7 9 3 6 1 1 2 1 3 1 529\r\n", "output": ["YES"]}, {"input": "100 100\r\n6 129 61 6 87 104 45 28 3 35 2 14 1 37 2 4 24 4 3 1 6 4 2 1 1 3 1 2 2 9 1 1 2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 2 1 1 1 1 1 1 1 1 1 1 1 1 2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 22\r\n", "output": ["NO"]}, {"input": "1 4\r\n2 2 2 1\r\n", "output": ["YES"]}, {"input": "1 3\r\n2 2 2\r\n", "output": ["YES"]}, {"input": "2 5\r\n8 2 2 2 2\r\n", "output": ["YES"]}, {"input": "1 4\r\n1 1 2 2\r\n", "output": ["YES"]}, {"input": "1 3\r\n2 2 3\r\n", "output": ["YES"]}, {"input": "1 3\r\n4 2 2\r\n", "output": ["YES"]}, {"input": "1 4\r\n2 1 2 2\r\n", "output": ["YES"]}, {"input": "1 3\r\n3 2 2\r\n", "output": ["YES"]}, {"input": "2 8\r\n2 2 2 2 2 2 1 1\r\n", "output": ["YES"]}, {"input": "2 6\r\n2 2 2 2 2 2\r\n", "output": ["YES"]}, {"input": "1 4\r\n1 2 2 2\r\n", "output": ["YES"]}, {"input": "1 4\r\n1 1 1 1\r\n", "output": ["YES"]}, {"input": "2 7\r\n2 2 2 2 2 2 2\r\n", "output": ["YES"]}, {"input": "2 8\r\n1 1 1 1 1 1 1 1\r\n", "output": ["YES"]}, {"input": "3 7\r\n12 2 2 2 2 2 2\r\n", "output": ["YES"]}, {"input": "2 6\r\n4 1 3 1 1 3\r\n", "output": ["NO"]}, {"input": "1 3\r\n2 2 4\r\n", "output": ["YES"]}, {"input": "5 15\r\n2 2 2 2 2 2 2 2 2 2 2 2 2 2 2\r\n", "output": ["YES"]}, {"input": "2 8\r\n2 2 2 2 1 1 1 1\r\n", "output": ["YES"]}, {"input": "1 2\r\n6 2\r\n", "output": ["YES"]}, {"input": "4 13\r\n2 2 2 2 2 2 2 2 2 2 2 2 4\r\n", "output": ["YES"]}, {"input": "2 7\r\n1 1 1 4 2 2 2\r\n", "output": ["YES"]}, {"input": "3 8\r\n8 2 2 2 2 2 2 2\r\n", "output": ["YES"]}, {"input": "2 8\r\n1 1 1 1 2 2 2 2\r\n", "output": ["YES"]}, {"input": "2 8\r\n2 2 2 2 1 1 2 2\r\n", "output": ["YES"]}, {"input": "1 4\r\n2 2 1 1\r\n", "output": ["YES"]}, {"input": "3 9\r\n2 2 2 2 2 2 2 2 2\r\n", "output": ["YES"]}, {"input": "2 6\r\n2 2 2 2 2 5\r\n", "output": ["YES"]}, {"input": "1 1\r\n6\r\n", "output": ["YES"]}, {"input": "2 1\r\n16\r\n", "output": ["YES"]}, {"input": "1 1\r\n2\r\n", "output": ["YES"]}, {"input": "2 8\r\n2 2 2 2 2 2 2 1\r\n", "output": ["NO"]}, {"input": "4 16\r\n1 1 1 1 2 2 2 2 2 2 2 2 2 2 2 2\r\n", "output": ["YES"]}, {"input": "2 7\r\n4 1 1 1 1 2 2\r\n", "output": ["YES"]}, {"input": "2 6\r\n2 2 2 5 2 2\r\n", "output": ["YES"]}, {"input": "3 1\r\n22\r\n", "output": ["YES"]}, {"input": "2 8\r\n2 2 2 2 1 1 1 3\r\n", "output": ["NO"]}, {"input": "3 12\r\n2 1 2 2 2 1 2 2 2 1 2 2\r\n", "output": ["YES"]}, {"input": "1 4\r\n2 2 3 1\r\n", "output": ["NO"]}, {"input": "2 6\r\n5 2 2 2 2 2\r\n", "output": ["YES"]}, {"input": "20 100\r\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1\r\n", "output": ["NO"]}, {"input": "1 3\r\n2 2 1\r\n", "output": ["YES"]}, {"input": "1 2\r\n3 3\r\n", "output": ["YES"]}, {"input": "2 6\r\n2 3 2 2 3 2\r\n", "output": ["YES"]}, {"input": "2 8\r\n2 2 1 1 2 2 2 2\r\n", "output": ["YES"]}, {"input": "2 6\r\n3 3 2 2 2 2\r\n", "output": ["YES"]}, {"input": "3 12\r\n2 2 2 2 2 2 2 2 2 1 1 1\r\n", "output": ["YES"]}, {"input": "3 10\r\n2 2 2 2 2 2 2 2 2 3\r\n", "output": ["YES"]}]

[{'input': '1 4\r\n2 1 2 2\r\n', 'output': ['YES']}, {'input': '1 3\r\n2 2 1\r\n', 'output': ['YES']}, {'input': '10000 100\r\n800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800 800\r\n', 'output': ['YES']}, {'input': '1 2\r\n4 4\r\n', 'output': ['YES']}, {'input': '10000 93\r\n1388 119 711 23 4960 4002 2707 188 813 1831 334 543 338 3402 1808 3368 1428 971 985 220 1521 457 457 140 332 1503 1539 2095 1891 269 5223 226 1528 190 428 5061 410 1587 1149 1934 2275 1337 1828 275 181 85 499 29 585 808 751 401 635 461 181 164 274 36 401 255 38 60 76 16 6 35 79 46 1 39 11 2 8 2 4 14 3 1 1 1 1 1 2 1 3 1 1 1 1 2 1 1 9948\r\n', 'output': ['NO']}]

[{'input': '10000 100\r\n749 2244 949 2439 2703 44 2394 124 285 3694 3609 717 1413 155 974 1778 1448 1327 1487 3458 319 1395 3783 2184 2062 43 826 38 3276 807 1837 4635 171 1386 1768 1128 2020 2536 800 782 3058 174 455 83 647 595 658 109 33 23 70 39 38 1 6 35 94 9 22 12 6 1 2 2 4 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 2 1 1 1 2 1 1 1 1 1 1 1 1 1 1 1 1 1 9939\r\n', 'output': ['NO']}, {'input': '4981 51\r\n5364 2166 223 742 350 1309 15 229 4100 3988 227 1719 9 125 787 427 141 842 171 2519 32 2554 2253 721 775 88 720 9 397 513 100 291 111 32 238 42 152 108 5 58 96 53 7 19 11 2 5 5 6 2 4966\r\n', 'output': ['NO']}, {'input': '1 4\r\n2 2 2 1\r\n', 'output': ['YES']}, {'input': '10000 100\r\n749 2244 949 2439 2703 44 2394 124 285 3694 3609 717 1413 155 974 1778 1448 1327 1487 3458 319 1395 3783 2184 2062 43 826 38 3276 807 1837 4635 171 1386 1768 1128 2020 2536 2050 1074 605 979 1724 1608 672 88 1243 129 718 544 3590 37 187 600 738 34 64 316 58 6 84 252 75 68 40 68 4 29 29 8 13 11 5 1 5 1 3 2 1 1 1 2 3 4 1 1 2 2 2 1 1 1 1 1 1 1 1 1 1 3\r\n', 'output': ['NO']}, {'input': '1 4\r\n2 2 1 2\r\n', 'output': ['YES']}]

[{'input': '541 31\r\n607 204 308 298 398 213 1182 58 162 46 64 12 38 91 29 2 4 12 19 3 7 9 3 6 1 1 2 1 3 1 529\r\n', 'output': ['YES']}, {'input': '5691 91\r\n6573 1666 2158 2591 4636 886 263 4217 389 29 1513 1172 617 2012 1855 798 1588 979 152 37 890 375 1091 839 385 382 1 255 117 289 119 224 182 69 19 71 115 13 4 22 35 2 60 12 6 12 19 9 3 2 2 6 5 1 7 7 3 1 5 1 7 1 4 1 1 3 2 1 2 1 1 2 1 2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 5631\r\n', 'output': ['NO']}, {'input': '1 4\r\n1 1 2 2\r\n', 'output': ['YES']}, {'input': '100 15\r\n165 26 83 64 235 48 36 51 3 18 5 10 9 6 5\r\n', 'output': ['YES']}, {'input': '1 2\r\n3 3\r\n', 'output': ['YES']}]

[{'input': '4 16\r\n1 1 1 1 2 2 2 2 2 2 2 2 2 2 2 2\r\n', 'output': ['YES']}, {'input': '2 6\r\n3 3 2 2 2 2\r\n', 'output': ['YES']}, {'input': '10000 100\r\n749 2244 949 2439 2703 44 2394 124 285 3694 3609 717 1413 155 974 1778 1448 1327 1487 3458 319 1395 3783 2184 2062 43 826 38 3276 807 1837 4635 171 1386 1768 1128 2020 2536 800 782 3058 174 455 83 647 595 658 109 33 23 70 39 38 1 6 35 94 9 22 12 6 1 2 2 4 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 2 1 1 1 2 1 1 1 1 1 1 1 1 1 1 1 1 1 9939\r\n', 'output': ['NO']}, {'input': '1000 40\r\n1701 1203 67 464 1884 761 11 559 29 115 405 133 174 63 147 93 41 19 1 15 41 8 33 4 4 1 4 1 1 2 1 2 1 1 2 1 1 2 1 4\r\n', 'output': ['NO']}, {'input': '1 4\r\n2 2 2 2\r\n', 'output': ['NO']}]

[{'input': '2 7\r\n2 2 2 2 2 2 2\r\n', 'output': ['YES']}, {'input': '1 4\r\n2 2 2 1\r\n', 'output': ['YES']}, {'input': '2 6\r\n2 2 2 2 2 5\r\n', 'output': ['YES']}, {'input': '1 3\r\n2 2 4\r\n', 'output': ['YES']}, {'input': '5691 91\r\n6573 1666 2158 2591 4636 886 263 4217 389 29 1513 1172 617 2012 1855 798 1588 979 152 37 890 375 1091 839 385 382 1 255 117 289 119 224 182 69 19 71 115 13 4 22 35 2 60 12 6 12 19 9 3 2 2 6 5 1 7 7 3 1 5 1 7 1 4 1 1 3 2 1 2 1 1 2 1 2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 5631\r\n', 'output': ['NO']}]

["5 1 2 1 2", "3 3 1 1 1", "4 5 3 1 5"]

The first line contains five integers s, v1, v2, t1, t2 (1 ≤ s, v1, v2, t1, t2 ≤ 1000) — the number of characters in the text, the time of typing one character for the first participant, the time of typing one character for the the second participant, the ping of the first participant and the ping of the second participant.

10226b8efe9e3c473239d747b911a1ef

def t(a,b,c,d,e): #for i in range(5): # v.append (int(input("podaj liczbe"))) gr1=0 gr2=0 gr1=(b*a)+(d*2) gr2=(c*a)+(e*2) #print(gr1) #print(gr2) if gr1>gr2: print("Second") if gr1<gr2: print("First") if gr1==gr2: print("Friendship") a,b,c,d,e = input().split(" ") t(int(a),int(b),int(c),int(d),int(e))

["First", "Second", "Friendship"]

Python

NoteIn the first example, information on the success of the first participant comes in 7 milliseconds, of the second participant — in 14 milliseconds. So, the first wins.In the second example, information on the success of the first participant comes in 11 milliseconds, of the second participant — in 5 milliseconds. So, the second wins.In the third example, information on the success of the first participant comes in 22 milliseconds, of the second participant — in 22 milliseconds. So, it is be a draw.

If the first participant wins, print "First". If the second participant wins, print "Second". In case of a draw print "Friendship".

Two boys decided to compete in text typing on the site "Key races". During the competition, they have to type a text consisting of s characters. The first participant types one character in v1 milliseconds and has ping t1 milliseconds. The second participant types one character in v2 milliseconds and has ping t2 milliseconds.If connection ping (delay) is t milliseconds, the competition passes for a participant as follows: Exactly after t milliseconds after the start of the competition the participant receives the text to be entered. Right after that he starts to type it. Exactly t milliseconds after he ends typing all the text, the site receives information about it. The winner is the participant whose information on the success comes earlier. If the information comes from both participants at the same time, it is considered that there is a draw.Given the length of the text and the information about participants, determine the result of the game.

[{"input": "5 1 2 1 2\r\n", "output": ["First"]}, {"input": "3 3 1 1 1\r\n", "output": ["Second"]}, {"input": "4 5 3 1 5\r\n", "output": ["Friendship"]}, {"input": "1000 1000 1000 1000 1000\r\n", "output": ["Friendship"]}, {"input": "1 1 1 1 1\r\n", "output": ["Friendship"]}, {"input": "8 8 1 1 1\r\n", "output": ["Second"]}, {"input": "15 14 32 65 28\r\n", "output": ["First"]}, {"input": "894 197 325 232 902\r\n", "output": ["First"]}, {"input": "1 2 8 8 5\r\n", "output": ["Friendship"]}, {"input": "37 261 207 1 1000\r\n", "output": ["Friendship"]}, {"input": "29 344 406 900 1\r\n", "output": ["Friendship"]}, {"input": "1 2 8 9 8\r\n", "output": ["First"]}, {"input": "2 9 8 8 9\r\n", "output": ["Friendship"]}, {"input": "213 480 811 134 745\r\n", "output": ["First"]}, {"input": "2 313 856 964 421\r\n", "output": ["Friendship"]}, {"input": "1 10 2 6 10\r\n", "output": ["Friendship"]}, {"input": "2 7 6 2 3\r\n", "output": ["Friendship"]}, {"input": "637 324 69 612 998\r\n", "output": ["Second"]}, {"input": "13 849 819 723 918\r\n", "output": ["Friendship"]}, {"input": "9 5 7 8 7\r\n", "output": ["First"]}, {"input": "6 5 7 10 4\r\n", "output": ["Friendship"]}, {"input": "61 464 623 89 548\r\n", "output": ["First"]}, {"input": "641 31 29 161 802\r\n", "output": ["Friendship"]}, {"input": "3 3 1 6 9\r\n", "output": ["Friendship"]}, {"input": "2 3 9 8 2\r\n", "output": ["Friendship"]}, {"input": "485 117 368 567 609\r\n", "output": ["First"]}, {"input": "4 202 512 995 375\r\n", "output": ["Friendship"]}, {"input": "424 41 41 909 909\r\n", "output": ["Friendship"]}, {"input": "884 913 263 641 265\r\n", "output": ["Second"]}, {"input": "12 462 8 311 327\r\n", "output": ["Second"]}, {"input": "436 306 266 493 580\r\n", "output": ["Second"]}, {"input": "69 1 2 1 2\r\n", "output": ["First"]}]

[{'input': '6 5 7 10 4\r\n', 'output': ['Friendship']}, {'input': '894 197 325 232 902\r\n', 'output': ['First']}, {'input': '213 480 811 134 745\r\n', 'output': ['First']}, {'input': '5 1 2 1 2\r\n', 'output': ['First']}, {'input': '1 2 8 9 8\r\n', 'output': ['First']}]

[{'input': '424 41 41 909 909\r\n', 'output': ['Friendship']}, {'input': '641 31 29 161 802\r\n', 'output': ['Friendship']}, {'input': '1 10 2 6 10\r\n', 'output': ['Friendship']}, {'input': '2 313 856 964 421\r\n', 'output': ['Friendship']}, {'input': '894 197 325 232 902\r\n', 'output': ['First']}]

[{'input': '12 462 8 311 327\r\n', 'output': ['Second']}, {'input': '2 313 856 964 421\r\n', 'output': ['Friendship']}, {'input': '485 117 368 567 609\r\n', 'output': ['First']}, {'input': '6 5 7 10 4\r\n', 'output': ['Friendship']}, {'input': '1 10 2 6 10\r\n', 'output': ['Friendship']}]

[{'input': '1 1 1 1 1\r\n', 'output': ['Friendship']}, {'input': '1 2 8 9 8\r\n', 'output': ['First']}, {'input': '12 462 8 311 327\r\n', 'output': ['Second']}, {'input': '61 464 623 89 548\r\n', 'output': ['First']}, {'input': '641 31 29 161 802\r\n', 'output': ['Friendship']}]

[{'input': '485 117 368 567 609\r\n', 'output': ['First']}, {'input': '884 913 263 641 265\r\n', 'output': ['Second']}, {'input': '1 1 1 1 1\r\n', 'output': ['Friendship']}, {'input': '2 313 856 964 421\r\n', 'output': ['Friendship']}, {'input': '6 5 7 10 4\r\n', 'output': ['Friendship']}]

["0 1 1 1 1 0", "1 1 0 0 1000 1000"]

The only line contains six integers ax, ay, bx, by, cx, cy (|ax|, |ay|, |bx|, |by|, |cx|, |cy| ≤ 109). It's guaranteed that the points are distinct.

05ec6ec3e9ffcc0e856dc0d461e6eeab

ax,ay,bx,by,cx,cy=list(map(int,input().split())) ax-=bx ay-=by cx-=bx cy-=by print('No'if ax*cy-ay*cx==0 or ax**2+ay**2!=cx**2+cy**2 else'Yes')

["Yes", "No"]

Python

NoteIn the first sample test, rotate the page around (0.5, 0.5) by .In the second sample test, you can't find any solution.

Print "Yes" if the problem has a solution, "No" otherwise. You can print each letter in any case (upper or lower).

Arpa is taking a geometry exam. Here is the last problem of the exam.You are given three points a, b, c.Find a point and an angle such that if we rotate the page around the point by the angle, the new position of a is the same as the old position of b, and the new position of b is the same as the old position of c.Arpa is doubting if the problem has a solution or not (i.e. if there exists a point and an angle satisfying the condition). Help Arpa determine if the question has a solution or not.

[{"input": "0 1 1 1 1 0\r\n", "output": ["YES", "Yes"]}, {"input": "1 1 0 0 1000 1000\r\n", "output": ["No", "NO"]}, {"input": "1 0 2 0 3 0\r\n", "output": ["No", "NO"]}, {"input": "3 4 0 0 4 3\r\n", "output": ["YES", "Yes"]}, {"input": "-1000000000 1 0 0 1000000000 1\r\n", "output": ["YES", "Yes"]}, {"input": "49152 0 0 0 0 81920\r\n", "output": ["No", "NO"]}, {"input": "1 -1 4 4 2 -3\r\n", "output": ["No", "NO"]}, {"input": "-2 -2 1 4 -2 0\r\n", "output": ["No", "NO"]}, {"input": "5 0 4 -2 0 1\r\n", "output": ["No", "NO"]}, {"input": "-4 -3 2 -1 -3 4\r\n", "output": ["No", "NO"]}, {"input": "-3 -3 5 2 3 -1\r\n", "output": ["No", "NO"]}, {"input": "-1000000000 -1000000000 0 0 1000000000 999999999\r\n", "output": ["No", "NO"]}, {"input": "-1000000000 -1000000000 0 0 1000000000 1000000000\r\n", "output": ["No", "NO"]}, {"input": "-357531221 381512519 -761132895 -224448284 328888775 -237692564\r\n", "output": ["No", "NO"]}, {"input": "264193194 -448876521 736684426 -633906160 -328597212 -47935734\r\n", "output": ["No", "NO"]}, {"input": "419578772 -125025887 169314071 89851312 961404059 21419450\r\n", "output": ["No", "NO"]}, {"input": "-607353321 -620687860 248029390 477864359 728255275 -264646027\r\n", "output": ["No", "NO"]}, {"input": "299948862 -648908808 338174789 841279400 -850322448 350263551\r\n", "output": ["No", "NO"]}, {"input": "48517753 416240699 7672672 272460100 -917845051 199790781\r\n", "output": ["No", "NO"]}, {"input": "-947393823 -495674431 211535284 -877153626 -522763219 -778236665\r\n", "output": ["No", "NO"]}, {"input": "-685673792 -488079395 909733355 385950193 -705890324 256550506\r\n", "output": ["No", "NO"]}, {"input": "-326038504 547872194 49630307 713863100 303770000 -556852524\r\n", "output": ["No", "NO"]}, {"input": "-706921242 -758563024 -588592101 -443440080 858751713 238854303\r\n", "output": ["No", "NO"]}, {"input": "-1000000000 -1000000000 0 1000000000 1000000000 -1000000000\r\n", "output": ["YES", "Yes"]}, {"input": "1000000000 1000000000 0 -1000000000 -1000000000 1000000000\r\n", "output": ["YES", "Yes"]}, {"input": "-999999999 -1000000000 0 0 1000000000 999999999\r\n", "output": ["YES", "Yes"]}, {"input": "-1000000000 -999999999 0 0 1000000000 999999999\r\n", "output": ["No", "NO"]}, {"input": "-1 -1000000000 0 1000000000 1 -1000000000\r\n", "output": ["YES", "Yes"]}, {"input": "0 1000000000 1 0 0 -1000000000\r\n", "output": ["YES", "Yes"]}, {"input": "0 1000000000 0 0 0 -1000000000\r\n", "output": ["No", "NO"]}, {"input": "0 1 1 2 2 3\r\n", "output": ["No", "NO"]}, {"input": "999999999 1000000000 0 0 -1000000000 -999999999\r\n", "output": ["YES", "Yes"]}, {"input": "0 0 1 1 2 0\r\n", "output": ["YES", "Yes"]}, {"input": "0 0 1 1 2 2\r\n", "output": ["No", "NO"]}, {"input": "1 1 2 2 3 3\r\n", "output": ["No", "NO"]}, {"input": "0 2 0 3 0 4\r\n", "output": ["No", "NO"]}, {"input": "1 1 1 2 1 3\r\n", "output": ["No", "NO"]}, {"input": "0 0 3 4 3 9\r\n", "output": ["YES", "Yes"]}, {"input": "589824 196608 262144 196608 0 0\r\n", "output": ["YES", "Yes"]}, {"input": "0 0 1000000000 1 1000000000 -999999999\r\n", "output": ["No", "NO"]}, {"input": "0 0 2 45 0 90\r\n", "output": ["YES", "Yes"]}, {"input": "0 0 0 2 0 1\r\n", "output": ["No", "NO"]}, {"input": "0 2 4 5 4 0\r\n", "output": ["YES", "Yes"]}, {"input": "0 0 2 0 4 0\r\n", "output": ["No", "NO"]}, {"input": "1 1 3 3 5 5\r\n", "output": ["No", "NO"]}, {"input": "1 1 2 2 3 1\r\n", "output": ["YES", "Yes"]}]

[{'input': '-1000000000 -1000000000 0 1000000000 1000000000 -1000000000\r\n', 'output': ['YES', 'Yes']}, {'input': '0 1000000000 0 0 0 -1000000000\r\n', 'output': ['No', 'NO']}, {'input': '419578772 -125025887 169314071 89851312 961404059 21419450\r\n', 'output': ['No', 'NO']}, {'input': '-607353321 -620687860 248029390 477864359 728255275 -264646027\r\n', 'output': ['No', 'NO']}, {'input': '-999999999 -1000000000 0 0 1000000000 999999999\r\n', 'output': ['YES', 'Yes']}]

[{'input': '-3 -3 5 2 3 -1\r\n', 'output': ['No', 'NO']}, {'input': '1 1 0 0 1000 1000\r\n', 'output': ['No', 'NO']}, {'input': '48517753 416240699 7672672 272460100 -917845051 199790781\r\n', 'output': ['No', 'NO']}, {'input': '0 0 1000000000 1 1000000000 -999999999\r\n', 'output': ['No', 'NO']}, {'input': '-1000000000 1 0 0 1000000000 1\r\n', 'output': ['YES', 'Yes']}]

[{'input': '5 0 4 -2 0 1\r\n', 'output': ['No', 'NO']}, {'input': '589824 196608 262144 196608 0 0\r\n', 'output': ['YES', 'Yes']}, {'input': '0 0 1 1 2 0\r\n', 'output': ['YES', 'Yes']}, {'input': '-947393823 -495674431 211535284 -877153626 -522763219 -778236665\r\n', 'output': ['No', 'NO']}, {'input': '-1000000000 -1000000000 0 0 1000000000 1000000000\r\n', 'output': ['No', 'NO']}]

[{'input': '0 2 0 3 0 4\r\n', 'output': ['No', 'NO']}, {'input': '49152 0 0 0 0 81920\r\n', 'output': ['No', 'NO']}, {'input': '264193194 -448876521 736684426 -633906160 -328597212 -47935734\r\n', 'output': ['No', 'NO']}, {'input': '0 1000000000 1 0 0 -1000000000\r\n', 'output': ['YES', 'Yes']}, {'input': '-1000000000 1 0 0 1000000000 1\r\n', 'output': ['YES', 'Yes']}]

[{'input': '-326038504 547872194 49630307 713863100 303770000 -556852524\r\n', 'output': ['No', 'NO']}, {'input': '-4 -3 2 -1 -3 4\r\n', 'output': ['No', 'NO']}, {'input': '0 2 0 3 0 4\r\n', 'output': ['No', 'NO']}, {'input': '999999999 1000000000 0 0 -1000000000 -999999999\r\n', 'output': ['YES', 'Yes']}, {'input': '1 1 2 2 3 3\r\n', 'output': ['No', 'NO']}]

["3 1\n2 1 4", "3 0\n7 7 7", "6 3\n1 3 4 6 9 10"]

The first line contains two integers n and d (1 ≤ n ≤ 100, 0 ≤ d ≤ 100) — the amount of points and the maximum allowed diameter respectively. The second line contains n space separated integers (1 ≤ xi ≤ 100) — the coordinates of the points.

6bcb324c072f796f4d50bafea5f624b2

x=input() x=x.split(' ') n=int(x[0]) d=int(x[1]) x=input() x=x.split(' ') for i in range(n): x[i]=int(x[i]) x.sort() l = [] for i in range(0, n): for j in range(i+1, n): if (x[j]-x[i])<=d: l.append(i + (n - j) - 1) if l == []: print(n-1) else: print(min(l))

["1", "0", "3"]

Python

NoteIn the first test case the optimal strategy is to remove the point with coordinate 4. The remaining points will have coordinates 1 and 2, so the diameter will be equal to 2 - 1 = 1.In the second test case the diameter is equal to 0, so its is unnecessary to remove any points. In the third test case the optimal strategy is to remove points with coordinates 1, 9 and 10. The remaining points will have coordinates 3, 4 and 6, so the diameter will be equal to 6 - 3 = 3.

Output a single integer — the minimum number of points you have to remove.

We've got no test cases. A big olympiad is coming up. But the problemsetters' number one priority should be adding another problem to the round. The diameter of a multiset of points on the line is the largest distance between two points from this set. For example, the diameter of the multiset {1, 3, 2, 1} is 2.Diameter of multiset consisting of one point is 0.You are given n points on the line. What is the minimum number of points you have to remove, so that the diameter of the multiset of the remaining points will not exceed d?

[{"input": "3 1\r\n2 1 4\r\n", "output": ["1"]}, {"input": "3 0\r\n7 7 7\r\n", "output": ["0"]}, {"input": "6 3\r\n1 3 4 6 9 10\r\n", "output": ["3"]}, {"input": "11 5\r\n10 11 12 13 14 15 16 17 18 19 20\r\n", "output": ["5"]}, {"input": "1 100\r\n1\r\n", "output": ["0"]}, {"input": "100 10\r\n22 75 26 45 72 81 47 29 97 2 75 25 82 84 17 56 32 2 28 37 57 39 18 11 79 6 40 68 68 16 40 63 93 49 91 10 55 68 31 80 57 18 34 28 76 55 21 80 22 45 11 67 67 74 91 4 35 34 65 80 21 95 1 52 25 31 2 53 96 22 89 99 7 66 32 2 68 33 75 92 84 10 94 28 54 12 9 80 43 21 51 92 20 97 7 25 67 17 38 100\r\n", "output": ["84"]}, {"input": "100 70\r\n22 75 26 45 72 81 47 29 97 2 75 25 82 84 17 56 32 2 28 37 57 39 18 11 79 6 40 68 68 16 40 63 93 49 91 10 55 68 31 80 57 18 34 28 76 55 21 80 22 45 11 67 67 74 91 4 35 34 65 80 21 95 1 52 25 31 2 53 96 22 89 99 7 66 32 2 68 33 75 92 84 10 94 28 54 12 9 80 43 21 51 92 20 97 7 25 67 17 38 100\r\n", "output": ["27"]}, {"input": "1 10\r\n25\r\n", "output": ["0"]}, {"input": "70 80\r\n1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70\r\n", "output": ["0"]}, {"input": "3 1\r\n25 26 27\r\n", "output": ["1"]}, {"input": "100 5\r\n51 56 52 60 52 53 52 60 56 54 55 50 53 51 57 53 52 54 54 52 51 55 50 56 60 51 58 50 60 59 50 54 60 55 55 57 54 59 59 55 55 52 56 57 59 54 53 57 52 50 50 55 59 54 54 56 51 58 52 51 56 56 58 56 54 54 57 52 51 58 56 57 54 59 58 53 50 52 50 60 57 51 54 59 54 54 52 55 53 55 51 53 52 54 51 56 55 53 58 56\r\n", "output": ["34"]}, {"input": "100 11\r\n44 89 57 64 94 96 73 96 55 52 91 73 73 93 51 62 63 85 43 75 60 78 98 55 80 84 65 75 61 88 62 71 53 57 94 85 60 96 66 96 61 72 97 64 51 44 63 82 67 86 60 57 74 85 57 79 61 94 86 78 84 56 60 75 91 91 92 62 89 85 79 57 76 97 65 56 46 78 51 69 50 52 85 80 76 71 81 51 90 71 77 60 63 62 84 59 79 84 69 81\r\n", "output": ["70"]}, {"input": "100 0\r\n22 75 26 45 72 81 47 29 97 2 75 25 82 84 17 56 32 2 28 37 57 39 18 11 79 6 40 68 68 16 40 63 93 49 91 10 55 68 31 80 57 18 34 28 76 55 21 80 22 45 11 67 67 74 91 4 35 34 65 80 21 95 1 52 25 31 2 53 96 22 89 99 7 66 32 2 68 33 75 92 84 10 94 28 54 12 9 80 43 21 51 92 20 97 7 25 67 17 38 100\r\n", "output": ["96"]}, {"input": "100 100\r\n22 75 26 45 72 81 47 29 97 2 75 25 82 84 17 56 32 2 28 37 57 39 18 11 79 6 40 68 68 16 40 63 93 49 91 10 55 68 31 80 57 18 34 28 76 55 21 80 22 45 11 67 67 74 91 4 35 34 65 80 21 95 1 52 25 31 2 53 96 22 89 99 7 66 32 2 68 33 75 92 84 10 94 28 54 12 9 80 43 21 51 92 20 97 7 25 67 17 38 100\r\n", "output": ["0"]}, {"input": "76 32\r\n50 53 69 58 55 39 40 42 40 55 58 73 55 72 75 44 45 55 46 60 60 42 41 64 77 39 68 51 61 49 38 41 56 57 64 43 78 36 39 63 40 66 52 76 39 68 39 73 40 68 54 60 35 67 69 52 58 52 38 63 69 38 69 60 73 64 65 41 59 55 37 57 40 34 35 35\r\n", "output": ["13"]}, {"input": "100 1\r\n22 75 26 45 72 81 47 29 97 2 75 25 82 84 17 56 32 2 28 37 57 39 18 11 79 6 40 68 68 16 40 63 93 49 91 10 55 68 31 80 57 18 34 28 76 55 21 80 22 45 11 67 67 74 91 4 35 34 65 80 21 95 1 52 25 31 2 53 96 22 89 99 7 66 32 2 68 33 75 92 84 10 94 28 54 12 9 80 43 21 51 92 20 97 7 25 67 17 38 100\r\n", "output": ["93"]}, {"input": "100 5\r\n22 75 26 45 72 81 47 29 97 2 75 25 82 84 17 56 32 2 28 37 57 39 18 11 79 6 40 68 68 16 40 63 93 49 91 10 55 68 31 80 57 18 34 28 76 55 21 80 22 45 11 67 67 74 91 4 35 34 65 80 21 95 1 52 25 31 2 53 96 22 89 99 7 66 32 2 68 33 75 92 84 10 94 28 54 12 9 80 43 21 51 92 20 97 7 25 67 17 38 100\r\n", "output": ["89"]}, {"input": "98 64\r\n2 29 36 55 58 15 25 33 7 16 61 1 4 24 63 26 36 16 16 3 57 39 56 7 11 24 20 12 22 10 56 5 11 39 61 52 27 54 21 6 61 36 40 52 54 5 15 52 58 23 45 39 65 16 27 40 13 64 47 24 51 29 9 18 49 49 8 47 2 64 7 63 49 10 20 26 34 3 45 66 8 46 16 32 16 38 3 6 15 17 35 48 36 5 57 29 61 15\r\n", "output": ["1"]}, {"input": "100 56\r\n1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100\r\n", "output": ["43"]}, {"input": "100 0\r\n14 13 14 13 14 13 13 13 13 14 13 13 14 14 13 14 14 14 14 13 13 13 14 13 13 14 14 14 14 14 14 13 13 13 13 14 13 14 13 14 13 14 14 14 14 13 13 14 14 13 13 13 13 14 13 14 13 14 13 14 13 13 13 14 13 13 14 13 14 14 13 13 13 14 14 14 14 13 13 14 14 14 14 14 14 14 13 14 13 13 13 14 14 13 13 13 13 13 14 14\r\n", "output": ["50"]}, {"input": "100 0\r\n14 17 18 22 19 18 19 21 19 19 22 22 19 21 24 23 24 19 25 24 24 21 20 13 26 18 17 15 25 13 17 20 20 21 13 22 27 15 18 27 19 15 16 25 18 17 18 22 19 17 18 24 14 16 18 16 22 16 17 27 18 17 18 24 22 13 14 20 23 19 16 21 19 13 14 14 25 15 27 24 26 22 16 20 16 14 21 27 15 23 23 24 27 14 24 17 19 24 15 27\r\n", "output": ["89"]}, {"input": "100 100\r\n100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100\r\n", "output": ["0"]}, {"input": "1 100\r\n22\r\n", "output": ["0"]}, {"input": "1 0\r\n22\r\n", "output": ["0"]}, {"input": "1 99\r\n99\r\n", "output": ["0"]}, {"input": "1 5\r\n6\r\n", "output": ["0"]}, {"input": "3 1\r\n10 20 30\r\n", "output": ["2"]}, {"input": "3 0\r\n1 2 3\r\n", "output": ["2"]}, {"input": "3 2\r\n1 50 99\r\n", "output": ["2"]}, {"input": "7 4\r\n1 3 4 9 10 11 12\r\n", "output": ["3"]}, {"input": "2 5\r\n67 23\r\n", "output": ["1"]}, {"input": "4 2\r\n1 4 7 9\r\n", "output": ["2"]}, {"input": "2 0\r\n1 2\r\n", "output": ["1"]}, {"input": "8 1\r\n3 3 3 5 5 5 5 5\r\n", "output": ["3"]}, {"input": "5 1\r\n3 5 5 5 6\r\n", "output": ["1"]}]

[{'input': '100 5\r\n51 56 52 60 52 53 52 60 56 54 55 50 53 51 57 53 52 54 54 52 51 55 50 56 60 51 58 50 60 59 50 54 60 55 55 57 54 59 59 55 55 52 56 57 59 54 53 57 52 50 50 55 59 54 54 56 51 58 52 51 56 56 58 56 54 54 57 52 51 58 56 57 54 59 58 53 50 52 50 60 57 51 54 59 54 54 52 55 53 55 51 53 52 54 51 56 55 53 58 56\r\n', 'output': ['34']}, {'input': '3 0\r\n7 7 7\r\n', 'output': ['0']}, {'input': '100 0\r\n22 75 26 45 72 81 47 29 97 2 75 25 82 84 17 56 32 2 28 37 57 39 18 11 79 6 40 68 68 16 40 63 93 49 91 10 55 68 31 80 57 18 34 28 76 55 21 80 22 45 11 67 67 74 91 4 35 34 65 80 21 95 1 52 25 31 2 53 96 22 89 99 7 66 32 2 68 33 75 92 84 10 94 28 54 12 9 80 43 21 51 92 20 97 7 25 67 17 38 100\r\n', 'output': ['96']}, {'input': '1 0\r\n22\r\n', 'output': ['0']}, {'input': '98 64\r\n2 29 36 55 58 15 25 33 7 16 61 1 4 24 63 26 36 16 16 3 57 39 56 7 11 24 20 12 22 10 56 5 11 39 61 52 27 54 21 6 61 36 40 52 54 5 15 52 58 23 45 39 65 16 27 40 13 64 47 24 51 29 9 18 49 49 8 47 2 64 7 63 49 10 20 26 34 3 45 66 8 46 16 32 16 38 3 6 15 17 35 48 36 5 57 29 61 15\r\n', 'output': ['1']}]

[{'input': '100 0\r\n14 17 18 22 19 18 19 21 19 19 22 22 19 21 24 23 24 19 25 24 24 21 20 13 26 18 17 15 25 13 17 20 20 21 13 22 27 15 18 27 19 15 16 25 18 17 18 22 19 17 18 24 14 16 18 16 22 16 17 27 18 17 18 24 22 13 14 20 23 19 16 21 19 13 14 14 25 15 27 24 26 22 16 20 16 14 21 27 15 23 23 24 27 14 24 17 19 24 15 27\r\n', 'output': ['89']}, {'input': '7 4\r\n1 3 4 9 10 11 12\r\n', 'output': ['3']}, {'input': '3 1\r\n25 26 27\r\n', 'output': ['1']}, {'input': '3 0\r\n7 7 7\r\n', 'output': ['0']}, {'input': '100 10\r\n22 75 26 45 72 81 47 29 97 2 75 25 82 84 17 56 32 2 28 37 57 39 18 11 79 6 40 68 68 16 40 63 93 49 91 10 55 68 31 80 57 18 34 28 76 55 21 80 22 45 11 67 67 74 91 4 35 34 65 80 21 95 1 52 25 31 2 53 96 22 89 99 7 66 32 2 68 33 75 92 84 10 94 28 54 12 9 80 43 21 51 92 20 97 7 25 67 17 38 100\r\n', 'output': ['84']}]

[{'input': '1 100\r\n1\r\n', 'output': ['0']}, {'input': '4 2\r\n1 4 7 9\r\n', 'output': ['2']}, {'input': '2 5\r\n67 23\r\n', 'output': ['1']}, {'input': '1 0\r\n22\r\n', 'output': ['0']}, {'input': '11 5\r\n10 11 12 13 14 15 16 17 18 19 20\r\n', 'output': ['5']}]

[{'input': '3 1\r\n10 20 30\r\n', 'output': ['2']}, {'input': '100 11\r\n44 89 57 64 94 96 73 96 55 52 91 73 73 93 51 62 63 85 43 75 60 78 98 55 80 84 65 75 61 88 62 71 53 57 94 85 60 96 66 96 61 72 97 64 51 44 63 82 67 86 60 57 74 85 57 79 61 94 86 78 84 56 60 75 91 91 92 62 89 85 79 57 76 97 65 56 46 78 51 69 50 52 85 80 76 71 81 51 90 71 77 60 63 62 84 59 79 84 69 81\r\n', 'output': ['70']}, {'input': '100 0\r\n14 17 18 22 19 18 19 21 19 19 22 22 19 21 24 23 24 19 25 24 24 21 20 13 26 18 17 15 25 13 17 20 20 21 13 22 27 15 18 27 19 15 16 25 18 17 18 22 19 17 18 24 14 16 18 16 22 16 17 27 18 17 18 24 22 13 14 20 23 19 16 21 19 13 14 14 25 15 27 24 26 22 16 20 16 14 21 27 15 23 23 24 27 14 24 17 19 24 15 27\r\n', 'output': ['89']}, {'input': '100 70\r\n22 75 26 45 72 81 47 29 97 2 75 25 82 84 17 56 32 2 28 37 57 39 18 11 79 6 40 68 68 16 40 63 93 49 91 10 55 68 31 80 57 18 34 28 76 55 21 80 22 45 11 67 67 74 91 4 35 34 65 80 21 95 1 52 25 31 2 53 96 22 89 99 7 66 32 2 68 33 75 92 84 10 94 28 54 12 9 80 43 21 51 92 20 97 7 25 67 17 38 100\r\n', 'output': ['27']}, {'input': '98 64\r\n2 29 36 55 58 15 25 33 7 16 61 1 4 24 63 26 36 16 16 3 57 39 56 7 11 24 20 12 22 10 56 5 11 39 61 52 27 54 21 6 61 36 40 52 54 5 15 52 58 23 45 39 65 16 27 40 13 64 47 24 51 29 9 18 49 49 8 47 2 64 7 63 49 10 20 26 34 3 45 66 8 46 16 32 16 38 3 6 15 17 35 48 36 5 57 29 61 15\r\n', 'output': ['1']}]

[{'input': '3 0\r\n7 7 7\r\n', 'output': ['0']}, {'input': '2 5\r\n67 23\r\n', 'output': ['1']}, {'input': '100 1\r\n22 75 26 45 72 81 47 29 97 2 75 25 82 84 17 56 32 2 28 37 57 39 18 11 79 6 40 68 68 16 40 63 93 49 91 10 55 68 31 80 57 18 34 28 76 55 21 80 22 45 11 67 67 74 91 4 35 34 65 80 21 95 1 52 25 31 2 53 96 22 89 99 7 66 32 2 68 33 75 92 84 10 94 28 54 12 9 80 43 21 51 92 20 97 7 25 67 17 38 100\r\n', 'output': ['93']}, {'input': '7 4\r\n1 3 4 9 10 11 12\r\n', 'output': ['3']}, {'input': '1 99\r\n99\r\n', 'output': ['0']}]

["3 10 3 3", "3 10 1 3", "100 100 1 1000"]

The first line contains four space-separated integers k, a, b, v (2 ≤ k ≤ 1000; 1 ≤ a, b, v ≤ 1000) — the maximum number of sections in the box, the number of nuts, the number of divisors and the capacity of each section of the box.

7cff20b1c63a694baca69bdf4bdb2652

k,a,b,v = map(int, input().split()) answ = 0 while a != 0 and b != 0: a -= min(v*min(k,b+1),a) b -= min(k-1,b) answ+=1 answ += a//v + int(a%v != 0) print(answ)

["2", "3", "1"]

Python

NoteIn the first sample you can act like this: Put two divisors to the first box. Now the first box has three sections and we can put three nuts into each section. Overall, the first box will have nine nuts. Do not put any divisors into the second box. Thus, the second box has one section for the last nut. In the end we've put all the ten nuts into boxes.The second sample is different as we have exactly one divisor and we put it to the first box. The next two boxes will have one section each.

Print a single integer — the answer to the problem.

You have a nuts and lots of boxes. The boxes have a wonderful feature: if you put x (x ≥ 0) divisors (the spacial bars that can divide a box) to it, you get a box, divided into x + 1 sections.You are minimalist. Therefore, on the one hand, you are against dividing some box into more than k sections. On the other hand, you are against putting more than v nuts into some section of the box. What is the minimum number of boxes you have to use if you want to put all the nuts in boxes, and you have b divisors?Please note that you need to minimize the number of used boxes, not sections. You do not have to minimize the number of used divisors.

[{"input": "3 10 3 3\r\n", "output": ["2"]}, {"input": "3 10 1 3\r\n", "output": ["3"]}, {"input": "100 100 1 1000\r\n", "output": ["1"]}, {"input": "5 347 20 1\r\n", "output": ["327"]}, {"input": "6 978 10 5\r\n", "output": ["186"]}, {"input": "6 856 50 35\r\n", "output": ["5"]}, {"input": "8 399 13 36\r\n", "output": ["2"]}, {"input": "4 787 48 4\r\n", "output": ["149"]}, {"input": "4 714 7 6\r\n", "output": ["112"]}, {"input": "7 915 12 24\r\n", "output": ["27"]}, {"input": "8 995 3 28\r\n", "output": ["33"]}, {"input": "10 267 4 48\r\n", "output": ["2"]}, {"input": "10 697 1 34\r\n", "output": ["20"]}, {"input": "7 897 49 42\r\n", "output": ["4"]}, {"input": "10 849 3 28\r\n", "output": ["28"]}, {"input": "477 492 438 690\r\n", "output": ["1"]}, {"input": "461 790 518 105\r\n", "output": ["1"]}, {"input": "510 996 830 417\r\n", "output": ["1"]}, {"input": "763 193 388 346\r\n", "output": ["1"]}, {"input": "958 380 405 434\r\n", "output": ["1"]}, {"input": "346 991 4 4\r\n", "output": ["244"]}, {"input": "648 990 5 2\r\n", "output": ["490"]}, {"input": "810 1000 6 5\r\n", "output": ["194"]}, {"input": "683 995 10 1\r\n", "output": ["985"]}, {"input": "307 999 10 7\r\n", "output": ["133"]}, {"input": "974 999 3 4\r\n", "output": ["247"]}, {"input": "60 1000 2 2\r\n", "output": ["498"]}, {"input": "634 993 9 3\r\n", "output": ["322"]}, {"input": "579 990 8 9\r\n", "output": ["102"]}, {"input": "306 993 9 9\r\n", "output": ["102"]}, {"input": "845 996 1 1\r\n", "output": ["995"]}, {"input": "872 997 1 1\r\n", "output": ["996"]}, {"input": "2 990 1 1\r\n", "output": ["989"]}, {"input": "489 992 1 1\r\n", "output": ["991"]}, {"input": "638 1000 1 1\r\n", "output": ["999"]}, {"input": "2 4 1000 1\r\n", "output": ["2"]}]

[{'input': '634 993 9 3\r\n', 'output': ['322']}, {'input': '307 999 10 7\r\n', 'output': ['133']}, {'input': '8 399 13 36\r\n', 'output': ['2']}, {'input': '872 997 1 1\r\n', 'output': ['996']}, {'input': '763 193 388 346\r\n', 'output': ['1']}]

[{'input': '100 100 1 1000\r\n', 'output': ['1']}, {'input': '683 995 10 1\r\n', 'output': ['985']}, {'input': '2 990 1 1\r\n', 'output': ['989']}, {'input': '872 997 1 1\r\n', 'output': ['996']}, {'input': '7 915 12 24\r\n', 'output': ['27']}]

[{'input': '845 996 1 1\r\n', 'output': ['995']}, {'input': '8 399 13 36\r\n', 'output': ['2']}, {'input': '872 997 1 1\r\n', 'output': ['996']}, {'input': '638 1000 1 1\r\n', 'output': ['999']}, {'input': '7 915 12 24\r\n', 'output': ['27']}]

[{'input': '2 4 1000 1\r\n', 'output': ['2']}, {'input': '2 990 1 1\r\n', 'output': ['989']}, {'input': '306 993 9 9\r\n', 'output': ['102']}, {'input': '4 787 48 4\r\n', 'output': ['149']}, {'input': '7 915 12 24\r\n', 'output': ['27']}]

[{'input': '346 991 4 4\r\n', 'output': ['244']}, {'input': '10 849 3 28\r\n', 'output': ['28']}, {'input': '648 990 5 2\r\n', 'output': ['490']}, {'input': '2 4 1000 1\r\n', 'output': ['2']}, {'input': '763 193 388 346\r\n', 'output': ['1']}]

["01.01.98\n01.01.80", "20.10.20\n10.02.30", "28.02.74\n28.02.64"]

The first line contains the date DD.MM.YY, the second line contains the date BD.BM.BY. It is guaranteed that both dates are correct, and YY and BY are always in [01;99]. It could be that by passport Bob was born after the finals. In this case, he can still change the order of numbers in date.

5418c98fe362909f7b28f95225837d33

import itertools as it month_to_days_non_leap = { 1: 31, 2: 28, 3: 31, 4: 30, 5: 31, 6: 30, 7: 31, 8: 31, 9: 30, 10: 31, 11: 30, 12: 31, } def month_year_to_day(month, year): if year % 4 == 0 and month == 2: return 29 else: return month_to_days_non_leap[month] def good_date(day, month, year): if month > 12: return False if day > month_year_to_day(month, year): return False return True dd, mm, yy = map(int, input().split('.')) bd, bm, by = map(int, input().split('.')) found_sol = False for p_bd, p_bm, p_by in it.permutations([bd, bm, by]): if good_date(p_bd, p_bm, p_by): year_diff = yy - p_by if year_diff > 18: found_sol = True break elif year_diff < 18: continue if p_bm < mm: found_sol = True break elif p_bm > mm: continue if p_bd < dd: found_sol = True break elif p_bd > dd: continue found_sol = True break if found_sol: print("YES") else: print("NO")

["YES", "NO", "NO"]

Python

If it is possible to rearrange the numbers in the date of birth so that Bob will be at least 18 years old on the DD.MM.YY, output YES. In the other case, output NO. Each number contains exactly two digits and stands for day, month or year in a date. Note that it is permitted to rearrange only numbers, not digits.

The king Copa often has been reported about the Codeforces site, which is rapidly getting more and more popular among the brightest minds of the humanity, who are using it for training and competing. Recently Copa understood that to conquer the world he needs to organize the world Codeforces tournament. He hopes that after it the brightest minds will become his subordinates, and the toughest part of conquering the world will be completed.The final round of the Codeforces World Finals 20YY is scheduled for DD.MM.YY, where DD is the day of the round, MM is the month and YY are the last two digits of the year. Bob is lucky to be the first finalist form Berland. But there is one problem: according to the rules of the competition, all participants must be at least 18 years old at the moment of the finals. Bob was born on BD.BM.BY. This date is recorded in his passport, the copy of which he has already mailed to the organizers. But Bob learned that in different countries the way, in which the dates are written, differs. For example, in the US the month is written first, then the day and finally the year. Bob wonders if it is possible to rearrange the numbers in his date of birth so that he will be at least 18 years old on the day DD.MM.YY. He can always tell that in his motherland dates are written differently. Help him.According to another strange rule, eligible participant must be born in the same century as the date of the finals. If the day of the finals is participant's 18-th birthday, he is allowed to participate. As we are considering only the years from 2001 to 2099 for the year of the finals, use the following rule: the year is leap if it's number is divisible by four.

[{"input": "01.01.98\r\n01.01.80\r\n", "output": ["YES"]}, {"input": "20.10.20\r\n10.02.30\r\n", "output": ["NO"]}, {"input": "28.02.74\r\n28.02.64\r\n", "output": ["NO"]}, {"input": "05.05.25\r\n06.02.71\r\n", "output": ["NO"]}, {"input": "19.11.54\r\n29.11.53\r\n", "output": ["NO"]}, {"input": "01.06.84\r\n24.04.87\r\n", "output": ["NO"]}, {"input": "30.06.43\r\n14.09.27\r\n", "output": ["YES"]}, {"input": "09.05.55\r\n25.09.42\r\n", "output": ["NO"]}, {"input": "14.05.21\r\n02.01.88\r\n", "output": ["NO"]}, {"input": "27.12.51\r\n26.06.22\r\n", "output": ["YES"]}, {"input": "12.10.81\r\n18.11.04\r\n", "output": ["YES"]}, {"input": "26.04.11\r\n11.07.38\r\n", "output": ["NO"]}, {"input": "17.01.94\r\n17.03.58\r\n", "output": ["YES"]}, {"input": "15.01.93\r\n23.04.97\r\n", "output": ["NO"]}, {"input": "14.04.92\r\n27.05.35\r\n", "output": ["YES"]}, {"input": "13.08.91\r\n01.05.26\r\n", "output": ["YES"]}, {"input": "14.08.89\r\n05.06.65\r\n", "output": ["YES"]}, {"input": "13.11.88\r\n09.07.03\r\n", "output": ["YES"]}, {"input": "12.11.87\r\n14.08.42\r\n", "output": ["YES"]}, {"input": "11.03.86\r\n20.08.81\r\n", "output": ["NO"]}, {"input": "10.02.37\r\n25.09.71\r\n", "output": ["NO"]}, {"input": "11.06.36\r\n24.01.25\r\n", "output": ["NO"]}, {"input": "02.05.90\r\n08.03.50\r\n", "output": ["YES"]}, {"input": "15.01.15\r\n01.08.58\r\n", "output": ["NO"]}, {"input": "31.10.41\r\n27.12.13\r\n", "output": ["YES"]}, {"input": "14.06.18\r\n21.04.20\r\n", "output": ["NO"]}, {"input": "15.12.62\r\n17.12.21\r\n", "output": ["YES"]}, {"input": "13.03.69\r\n09.01.83\r\n", "output": ["NO"]}, {"input": "26.11.46\r\n03.05.90\r\n", "output": ["NO"]}, {"input": "11.12.72\r\n29.06.97\r\n", "output": ["NO"]}, {"input": "25.08.49\r\n22.10.05\r\n", "output": ["YES"]}, {"input": "08.04.74\r\n18.03.60\r\n", "output": ["NO"]}, {"input": "03.11.79\r\n10.09.61\r\n", "output": ["YES"]}, {"input": "29.03.20\r\n12.01.09\r\n", "output": ["YES"]}, {"input": "13.09.67\r\n07.09.48\r\n", "output": ["YES"]}, {"input": "23.05.53\r\n31.10.34\r\n", "output": ["YES"]}, {"input": "08.07.20\r\n27.01.01\r\n", "output": ["YES"]}, {"input": "10.05.64\r\n10.05.45\r\n", "output": ["YES"]}, {"input": "19.09.93\r\n17.05.74\r\n", "output": ["YES"]}, {"input": "14.06.61\r\n01.11.42\r\n", "output": ["YES"]}, {"input": "29.02.80\r\n29.02.60\r\n", "output": ["YES"]}, {"input": "21.02.59\r\n24.04.40\r\n", "output": ["YES"]}, {"input": "05.04.99\r\n19.08.80\r\n", "output": ["YES"]}, {"input": "02.06.59\r\n30.01.40\r\n", "output": ["YES"]}, {"input": "23.09.93\r\n12.11.74\r\n", "output": ["YES"]}, {"input": "09.08.65\r\n21.06.46\r\n", "output": ["YES"]}, {"input": "29.09.35\r\n21.07.17\r\n", "output": ["YES"]}, {"input": "30.06.58\r\n21.05.39\r\n", "output": ["YES"]}, {"input": "06.08.91\r\n05.12.73\r\n", "output": ["YES"]}, {"input": "08.07.88\r\n15.01.69\r\n", "output": ["YES"]}, {"input": "07.10.55\r\n13.05.36\r\n", "output": ["YES"]}, {"input": "22.03.79\r\n04.03.61\r\n", "output": ["YES"]}, {"input": "30.06.76\r\n03.10.57\r\n", "output": ["YES"]}, {"input": "03.03.70\r\n18.01.51\r\n", "output": ["YES"]}, {"input": "08.07.79\r\n25.08.60\r\n", "output": ["YES"]}, {"input": "01.09.92\r\n10.05.74\r\n", "output": ["YES"]}, {"input": "05.04.73\r\n28.09.54\r\n", "output": ["YES"]}, {"input": "30.08.83\r\n13.04.65\r\n", "output": ["YES"]}, {"input": "08.04.64\r\n27.01.45\r\n", "output": ["YES"]}, {"input": "10.11.95\r\n09.04.77\r\n", "output": ["YES"]}, {"input": "19.11.36\r\n17.02.21\r\n", "output": ["YES"]}, {"input": "28.02.20\r\n11.01.29\r\n", "output": ["YES"]}, {"input": "01.01.35\r\n16.02.29\r\n", "output": ["YES"]}, {"input": "01.01.47\r\n28.02.29\r\n", "output": ["YES"]}, {"input": "06.08.34\r\n16.02.29\r\n", "output": ["YES"]}, {"input": "30.09.46\r\n24.02.29\r\n", "output": ["YES"]}, {"input": "01.03.19\r\n01.02.29\r\n", "output": ["NO"]}, {"input": "30.08.32\r\n02.02.29\r\n", "output": ["NO"]}, {"input": "30.10.46\r\n25.02.29\r\n", "output": ["NO"]}, {"input": "06.03.20\r\n06.02.03\r\n", "output": ["YES"]}, {"input": "01.05.19\r\n08.01.04\r\n", "output": ["YES"]}, {"input": "31.05.19\r\n12.01.04\r\n", "output": ["YES"]}, {"input": "31.03.50\r\n02.11.32\r\n", "output": ["YES"]}, {"input": "03.12.98\r\n11.12.80\r\n", "output": ["YES"]}, {"input": "04.02.19\r\n01.03.02\r\n", "output": ["YES"]}, {"input": "01.05.21\r\n03.11.04\r\n", "output": ["YES"]}, {"input": "31.05.20\r\n02.12.04\r\n", "output": ["YES"]}, {"input": "31.03.36\r\n10.11.31\r\n", "output": ["YES"]}, {"input": "01.05.19\r\n03.01.28\r\n", "output": ["YES"]}, {"input": "30.12.68\r\n31.12.50\r\n", "output": ["NO"]}, {"input": "30.08.55\r\n31.08.37\r\n", "output": ["NO"]}, {"input": "30.08.41\r\n23.08.31\r\n", "output": ["NO"]}]

[{'input': '31.10.41\r\n27.12.13\r\n', 'output': ['YES']}, {'input': '20.10.20\r\n10.02.30\r\n', 'output': ['NO']}, {'input': '03.12.98\r\n11.12.80\r\n', 'output': ['YES']}, {'input': '05.04.99\r\n19.08.80\r\n', 'output': ['YES']}, {'input': '13.08.91\r\n01.05.26\r\n', 'output': ['YES']}]

[{'input': '08.04.64\r\n27.01.45\r\n', 'output': ['YES']}, {'input': '19.09.93\r\n17.05.74\r\n', 'output': ['YES']}, {'input': '30.08.83\r\n13.04.65\r\n', 'output': ['YES']}, {'input': '29.09.35\r\n21.07.17\r\n', 'output': ['YES']}, {'input': '29.02.80\r\n29.02.60\r\n', 'output': ['YES']}]

[{'input': '11.03.86\r\n20.08.81\r\n', 'output': ['NO']}, {'input': '30.08.83\r\n13.04.65\r\n', 'output': ['YES']}, {'input': '08.04.64\r\n27.01.45\r\n', 'output': ['YES']}, {'input': '05.04.99\r\n19.08.80\r\n', 'output': ['YES']}, {'input': '20.10.20\r\n10.02.30\r\n', 'output': ['NO']}]

[{'input': '19.11.36\r\n17.02.21\r\n', 'output': ['YES']}, {'input': '06.08.34\r\n16.02.29\r\n', 'output': ['YES']}, {'input': '13.11.88\r\n09.07.03\r\n', 'output': ['YES']}, {'input': '13.08.91\r\n01.05.26\r\n', 'output': ['YES']}, {'input': '10.02.37\r\n25.09.71\r\n', 'output': ['NO']}]

[{'input': '14.05.21\r\n02.01.88\r\n', 'output': ['NO']}, {'input': '05.04.73\r\n28.09.54\r\n', 'output': ['YES']}, {'input': '08.04.74\r\n18.03.60\r\n', 'output': ['NO']}, {'input': '02.06.59\r\n30.01.40\r\n', 'output': ['YES']}, {'input': '10.02.37\r\n25.09.71\r\n', 'output': ['NO']}]

["2\nRB", "3\nGRG", "5\nBBBBB"]

The first line of the input contains a single integer n (1 ≤ n ≤ 200) — the total number of cards. The next line contains a string s of length n — the colors of the cards. s contains only the characters 'B', 'G', and 'R', representing blue, green, and red, respectively.

4cedd3b70d793bc8ed4a93fc5a827f8f

from collections import Counter def go(s): ct = Counter(s) pos = ''.join(c for c in 'BGR' if ct[c] > 0) if len(pos) == 3 or len(pos) == 1: return pos one = ''.join(c for c in 'BGR' if ct[c] <= 1) if len(one) == 1: return 'BGR' if len(one) == 2: return one return ''.join(c for c in 'BGR' if ct[c] == 0) input() print(go(input()))

["G", "BR", "B"]

Python

NoteIn the first sample, Catherine has one red card and one blue card, which she must exchange for a green card.In the second sample, Catherine has two green cards and one red card. She has two options: she can exchange the two green cards for a green card, then exchange the new green card and the red card for a blue card. Alternatively, she can exchange a green and a red card for a blue card, then exchange the blue card and remaining green card for a red card.In the third sample, Catherine only has blue cards, so she can only exchange them for more blue cards.

Print a single string of up to three characters — the possible colors of the final card (using the same symbols as the input) in alphabetical order.

Catherine has a deck of n cards, each of which is either red, green, or blue. As long as there are at least two cards left, she can do one of two actions: take any two (not necessarily adjacent) cards with different colors and exchange them for a new card of the third color; take any two (not necessarily adjacent) cards with the same color and exchange them for a new card with that color. She repeats this process until there is only one card left. What are the possible colors for the final card?

[{"input": "2\r\nRB\r\n", "output": ["G"]}, {"input": "3\r\nGRG\r\n", "output": ["BR"]}, {"input": "5\r\nBBBBB\r\n", "output": ["B"]}, {"input": "1\r\nR\r\n", "output": ["R"]}, {"input": "200\r\nBBRGRRBBRGGGBGBGBGRRGRGRGRBGRGRRBBGRGBGRRGRRRGGBBRGBGBGBRBBBBBBBGGBRGGRRRGGRGBGBGGBRRRRBRRRBRBBGGBGBRGRGBBBBGGBGBBBGBGRRBRRRGBGGBBBRBGRBRRGGGRRGBBBGBGRRRRRRGGRGRGBBBRGGGBGGGBRBBRRGBGRGRBRRRBRBGRGGBRBB\r\n", "output": ["BGR"]}, {"input": "101\r\nRRRRRRRRRRRRRRRRRRRBRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRR\r\n", "output": ["BG"]}, {"input": "7\r\nBBBGBRG\r\n", "output": ["BGR"]}, {"input": "5\r\nGRRGR\r\n", "output": ["BGR"]}, {"input": "3\r\nGBR\r\n", "output": ["BGR"]}, {"input": "1\r\nB\r\n", "output": ["B"]}, {"input": "2\r\nBB\r\n", "output": ["B"]}, {"input": "1\r\nG\r\n", "output": ["G"]}, {"input": "2\r\nBG\r\n", "output": ["R"]}, {"input": "3\r\nBGB\r\n", "output": ["GR"]}, {"input": "2\r\nGG\r\n", "output": ["G"]}, {"input": "3\r\nGBG\r\n", "output": ["BR"]}, {"input": "4\r\nBGBG\r\n", "output": ["BGR"]}, {"input": "2\r\nBR\r\n", "output": ["G"]}, {"input": "3\r\nBRB\r\n", "output": ["GR"]}, {"input": "2\r\nRG\r\n", "output": ["B"]}, {"input": "3\r\nBGR\r\n", "output": ["BGR"]}, {"input": "4\r\nRBGB\r\n", "output": ["BGR"]}, {"input": "3\r\nGGR\r\n", "output": ["BR"]}, {"input": "4\r\nGGRB\r\n", "output": ["BGR"]}, {"input": "5\r\nBGBGR\r\n", "output": ["BGR"]}, {"input": "2\r\nRR\r\n", "output": ["R"]}, {"input": "3\r\nRBR\r\n", "output": ["BG"]}, {"input": "4\r\nRRBB\r\n", "output": ["BGR"]}, {"input": "3\r\nRRG\r\n", "output": ["BG"]}, {"input": "4\r\nBRRG\r\n", "output": ["BGR"]}, {"input": "5\r\nRBRBG\r\n", "output": ["BGR"]}, {"input": "4\r\nRGGR\r\n", "output": ["BGR"]}, {"input": "5\r\nBRGRG\r\n", "output": ["BGR"]}, {"input": "6\r\nGRRGBB\r\n", "output": ["BGR"]}, {"input": "150\r\nGRGBBBBRBGGBGBBGBBBBGRBBRRBBGRRGGGBRBBRGRRRRGBGRRBGBGBGRBBBGBBBGBGBRGBRRRRRGGGRGRBBGBRGGGRBBRGBBGRGGGBBRBRRGRGRRGRRGRRRGBGBRRGGRGGBRBGGGBBBRGRGBRGRRRR\r\n", "output": ["BGR"]}, {"input": "16\r\nRRGRRRRRRGGRGRRR\r\n", "output": ["BGR"]}, {"input": "190\r\nBBBBBBBBBBBBBBBBBGBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBB\r\n", "output": ["GR"]}, {"input": "200\r\nRGRGRRRRRGRRGRRRGRGRRRGGRGRRGGGRRGGRRRRRRRRRRRGRRGRRRGRRRGRRRRRRRGRRRRRRRRRRRGGRRGGRRRRGGRRRRRRRRRGGGRGRGRGRRGRGGRGRGRRRGRRRRRRGGRGRRRRGRRGRGGRRRRRRRGRGGRRGRRRRRRRGGRRRRGRRRRRRRGRRRGGRRRRRRGRRGGGRRRGR\r\n", "output": ["BGR"]}, {"input": "200\r\nGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGG\r\n", "output": ["G"]}, {"input": "52\r\nBBBBBBBBBBBBBBBBBBBBGBGBBBBBBBBBBBBBBBBBBBBBBBBBBBBB\r\n", "output": ["BGR"]}, {"input": "200\r\nGRGRRGRBRRRGGGRGGRRRRRBBGRRGRBBGRRGBGRRBBRBBRRBBBGRBRGGGGBGGBRRBBRGRBGGRRGGBBRBGGRGBBRRBBRGBRRBGBRBGBBRGGRRRGGGBRGGGGRRRBBRRGRGRBRRGRBBGGRBBRGRGRBGRBBRGGBBBGRGBBGGBGBGBBRRBGRGRGGBRRGRGGGGGBRGGGGBBBBRB\r\n", "output": ["BGR"]}, {"input": "102\r\nGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGRGGGGGGGGBGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGG\r\n", "output": ["BGR"]}, {"input": "193\r\nRRRGGGRBGGBGGGBGGBBGRBGGRBGGBBRBGGRBBBRBRRGGBBRBRGRRRBGBBRGGRGGGBGGRRGGRGRRBRBRBRRGRGBGBRGBBRGRRRBGRGGBGBRBBBGBRBBGBGBGGGBGGGGBRBBRRBGRGGBBBRBBBBBGRRRGBRGBRRRBBBGBGGGGRGGRRBRBGRRGBGBRBGGGRBRRGG\r\n", "output": ["BGR"]}, {"input": "90\r\nBGBGGRRBGGRRRRRGGRGBBBBBRRBGBGBGBGGBBGRGGGGRBRBBRRRGBRRGBBGBBGGGRGRGRBGBBBRRGRRBRBRRGGRBRB\r\n", "output": ["BGR"]}, {"input": "3\r\nGGB\r\n", "output": ["BR"]}]

[{'input': '200\r\nRGRGRRRRRGRRGRRRGRGRRRGGRGRRGGGRRGGRRRRRRRRRRRGRRGRRRGRRRGRRRRRRRGRRRRRRRRRRRGGRRGGRRRRGGRRRRRRRRRGGGRGRGRGRRGRGGRGRGRRRGRRRRRRGGRGRRRRGRRGRGGRRRRRRRGRGGRRGRRRRRRRGGRRRRGRRRRRRRGRRRGGRRRRRRGRRGGGRRRGR\r\n', 'output': ['BGR']}, {'input': '4\r\nRGGR\r\n', 'output': ['BGR']}, {'input': '2\r\nRB\r\n', 'output': ['G']}, {'input': '3\r\nGGR\r\n', 'output': ['BR']}, {'input': '5\r\nGRRGR\r\n', 'output': ['BGR']}]

[{'input': '5\r\nBBBBB\r\n', 'output': ['B']}, {'input': '4\r\nRBGB\r\n', 'output': ['BGR']}, {'input': '16\r\nRRGRRRRRRGGRGRRR\r\n', 'output': ['BGR']}, {'input': '3\r\nGGR\r\n', 'output': ['BR']}, {'input': '1\r\nG\r\n', 'output': ['G']}]

[{'input': '5\r\nGRRGR\r\n', 'output': ['BGR']}, {'input': '1\r\nG\r\n', 'output': ['G']}, {'input': '3\r\nGBG\r\n', 'output': ['BR']}, {'input': '5\r\nBGBGR\r\n', 'output': ['BGR']}, {'input': '2\r\nRB\r\n', 'output': ['G']}]

[{'input': '3\r\nGBG\r\n', 'output': ['BR']}, {'input': '16\r\nRRGRRRRRRGGRGRRR\r\n', 'output': ['BGR']}, {'input': '190\r\nBBBBBBBBBBBBBBBBBGBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBB\r\n', 'output': ['GR']}, {'input': '2\r\nRB\r\n', 'output': ['G']}, {'input': '7\r\nBBBGBRG\r\n', 'output': ['BGR']}]

[{'input': '4\r\nRGGR\r\n', 'output': ['BGR']}, {'input': '200\r\nGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGG\r\n', 'output': ['G']}, {'input': '6\r\nGRRGBB\r\n', 'output': ['BGR']}, {'input': '4\r\nGGRB\r\n', 'output': ['BGR']}, {'input': '200\r\nBBRGRRBBRGGGBGBGBGRRGRGRGRBGRGRRBBGRGBGRRGRRRGGBBRGBGBGBRBBBBBBBGGBRGGRRRGGRGBGBGGBRRRRBRRRBRBBGGBGBRGRGBBBBGGBGBBBGBGRRBRRRGBGGBBBRBGRBRRGGGRRGBBBGBGRRRRRRGGRGRGBBBRGGGBGGGBRBBRRGBGRGRBRRRBRBGRGGBRBB\r\n', 'output': ['BGR']}]

["3 3 3\n1 1 1\n2 2 3\n3 3 2", "4 10 2\n2 3 8\n3 4 7"]

The first line contains three integers $$$n$$$, $$$h$$$, and $$$m$$$ ($$$1 \leq n,h,m \leq 50$$$) — the number of spots, the maximum height, and the number of restrictions. Each of the next $$$m$$$ lines contains three integers $$$l_i$$$, $$$r_i$$$, and $$$x_i$$$ ($$$1 \leq l_i \leq r_i \leq n$$$, $$$0 \leq x_i \leq h$$$) — left and right limits (inclusive) of the $$$i$$$-th restriction and the maximum possible height in that range.

f22b6dab443f63fb8d2d288b702f20ad

(n,h,m) = [int(x) for x in input().split()] houses= [h]*n for i in range(m): (l,r,x) = [int(x) for x in input().split()] for j in range(l-1,r): houses[j] = min(houses[j],x) mx = 0 for j in range(n): mx += houses[j]*houses[j] print(mx)

["14", "262"]

Python

NoteIn the first example, there are $$$3$$$ houses, the maximum height of a house is $$$3$$$, and there are $$$3$$$ restrictions. The first restriction says the tallest house between $$$1$$$ and $$$1$$$ must be at most $$$1$$$. The second restriction says the tallest house between $$$2$$$ and $$$2$$$ must be at most $$$3$$$. The third restriction says the tallest house between $$$3$$$ and $$$3$$$ must be at most $$$2$$$.In this case, it is optimal to build houses with heights $$$[1, 3, 2]$$$. This fits within all the restrictions. The total profit in this case is $$$1^2 + 3^2 + 2^2 = 14$$$.In the second example, there are $$$4$$$ houses, the maximum height of a house is $$$10$$$, and there are $$$2$$$ restrictions. The first restriction says the tallest house from $$$2$$$ to $$$3$$$ must be at most $$$8$$$. The second restriction says the tallest house from $$$3$$$ to $$$4$$$ must be at most $$$7$$$.In this case, it's optimal to build houses with heights $$$[10, 8, 7, 7]$$$. We get a profit of $$$10^2+8^2+7^2+7^2 = 262$$$. Note that there are two restrictions on house $$$3$$$ and both of them must be satisfied. Also, note that even though there isn't any explicit restrictions on house $$$1$$$, we must still limit its height to be at most $$$10$$$ ($$$h=10$$$).

Print a single integer, the maximum profit you can make.

You are planning to build housing on a street. There are $$$n$$$ spots available on the street on which you can build a house. The spots are labeled from $$$1$$$ to $$$n$$$ from left to right. In each spot, you can build a house with an integer height between $$$0$$$ and $$$h$$$.In each spot, if a house has height $$$a$$$, you will gain $$$a^2$$$ dollars from it.The city has $$$m$$$ zoning restrictions. The $$$i$$$-th restriction says that the tallest house from spots $$$l_i$$$ to $$$r_i$$$ (inclusive) must be at most $$$x_i$$$.You would like to build houses to maximize your profit. Determine the maximum profit possible.

[{"input": "3 3 3\r\n1 1 1\r\n2 2 3\r\n3 3 2\r\n", "output": ["14"]}, {"input": "4 10 2\r\n2 3 8\r\n3 4 7\r\n", "output": ["262"]}, {"input": "50 50 1\r\n1 50 0\r\n", "output": ["0"]}, {"input": "50 50 50\r\n17 40 12\r\n33 36 47\r\n8 43 35\r\n25 29 42\r\n18 36 6\r\n25 35 18\r\n36 48 47\r\n17 40 13\r\n20 27 37\r\n32 32 28\r\n17 20 13\r\n4 14 6\r\n13 18 47\r\n18 45 28\r\n3 50 45\r\n6 6 6\r\n3 25 36\r\n28 48 42\r\n14 34 32\r\n28 41 35\r\n29 35 25\r\n25 48 24\r\n32 40 40\r\n18 38 44\r\n6 16 2\r\n1 36 7\r\n14 48 2\r\n18 29 40\r\n11 16 37\r\n8 40 19\r\n12 16 44\r\n44 46 21\r\n19 24 26\r\n24 45 44\r\n22 22 15\r\n6 15 32\r\n19 42 7\r\n21 33 20\r\n1 13 26\r\n16 27 40\r\n46 48 30\r\n21 39 1\r\n1 9 32\r\n14 34 20\r\n35 38 11\r\n19 47 23\r\n13 38 15\r\n28 29 28\r\n7 20 40\r\n2 21 46\r\n", "output": ["4384"]}, {"input": "50 50 50\r\n20 34 50\r\n10 36 27\r\n46 49 19\r\n15 22 21\r\n5 10 21\r\n40 47 0\r\n26 43 48\r\n15 34 5\r\n29 48 49\r\n2 45 25\r\n5 40 42\r\n1 27 0\r\n43 50 47\r\n5 19 23\r\n1 42 20\r\n18 50 16\r\n13 38 14\r\n14 30 22\r\n5 26 2\r\n32 46 15\r\n10 49 37\r\n33 37 24\r\n10 31 45\r\n16 45 37\r\n22 41 7\r\n23 49 29\r\n22 44 49\r\n3 44 22\r\n26 32 4\r\n30 40 19\r\n19 28 5\r\n6 34 14\r\n16 21 40\r\n12 43 46\r\n9 36 42\r\n2 19 39\r\n13 45 12\r\n2 30 6\r\n5 28 35\r\n18 45 7\r\n39 46 29\r\n29 43 33\r\n3 16 24\r\n20 40 24\r\n35 36 8\r\n2 14 8\r\n3 29 47\r\n31 32 0\r\n27 49 16\r\n1 37 45\r\n", "output": ["1111"]}, {"input": "50 50 50\r\n28 29 9\r\n33 43 30\r\n12 34 3\r\n9 12 26\r\n24 39 10\r\n12 47 35\r\n29 41 47\r\n43 44 49\r\n19 37 36\r\n11 18 46\r\n19 42 20\r\n9 40 47\r\n18 34 22\r\n11 20 44\r\n5 31 44\r\n29 40 0\r\n1 26 19\r\n7 50 4\r\n14 34 48\r\n43 48 21\r\n12 49 23\r\n6 40 47\r\n22 37 50\r\n39 48 29\r\n12 34 13\r\n5 10 25\r\n30 45 46\r\n26 32 29\r\n2 4 23\r\n7 39 19\r\n22 49 42\r\n11 29 31\r\n23 50 29\r\n12 32 47\r\n4 13 18\r\n24 46 20\r\n33 34 44\r\n24 35 41\r\n39 50 47\r\n14 24 49\r\n25 44 28\r\n23 23 42\r\n32 44 40\r\n25 42 3\r\n25 31 6\r\n35 47 18\r\n22 49 2\r\n38 43 23\r\n1 27 16\r\n19 23 43\r\n", "output": ["1786"]}, {"input": "50 50 50\r\n24 31 47\r\n2 5 10\r\n18 22 39\r\n6 48 29\r\n30 43 25\r\n9 26 19\r\n20 40 23\r\n27 49 42\r\n41 49 50\r\n28 39 42\r\n35 37 49\r\n17 40 40\r\n26 38 21\r\n8 38 40\r\n10 28 19\r\n30 41 9\r\n2 13 24\r\n29 42 36\r\n20 49 17\r\n3 48 1\r\n33 38 10\r\n5 37 20\r\n7 21 30\r\n35 38 22\r\n37 38 19\r\n16 43 47\r\n46 50 16\r\n4 13 36\r\n18 20 41\r\n26 31 19\r\n11 34 30\r\n20 23 23\r\n20 46 19\r\n10 43 49\r\n27 33 45\r\n37 45 27\r\n6 12 0\r\n38 47 27\r\n3 50 6\r\n25 41 41\r\n2 37 27\r\n25 49 24\r\n38 44 31\r\n31 36 7\r\n18 31 3\r\n6 33 2\r\n19 36 33\r\n45 50 48\r\n10 21 17\r\n8 41 42\r\n", "output": ["2711"]}, {"input": "50 50 50\r\n26 27 33\r\n8 29 15\r\n10 31 23\r\n7 38 33\r\n9 12 39\r\n3 18 2\r\n11 35 25\r\n8 10 33\r\n12 19 11\r\n9 44 39\r\n17 32 27\r\n17 49 9\r\n13 13 20\r\n3 9 36\r\n18 20 43\r\n24 48 19\r\n12 26 1\r\n39 49 18\r\n11 33 38\r\n7 49 7\r\n23 38 48\r\n20 22 46\r\n12 31 34\r\n21 41 15\r\n3 13 26\r\n26 30 18\r\n50 50 12\r\n20 39 18\r\n34 40 10\r\n35 45 21\r\n28 41 17\r\n17 29 40\r\n21 30 34\r\n16 34 0\r\n28 45 21\r\n4 36 8\r\n31 50 6\r\n10 48 12\r\n18 42 43\r\n43 47 32\r\n35 38 27\r\n19 26 5\r\n5 36 22\r\n33 38 38\r\n7 24 50\r\n20 23 12\r\n5 35 40\r\n2 7 19\r\n38 49 45\r\n17 39 40\r\n", "output": ["3477"]}, {"input": "50 50 50\r\n7 47 45\r\n22 24 8\r\n31 48 31\r\n36 47 13\r\n7 25 19\r\n2 2 17\r\n34 40 14\r\n27 33 50\r\n31 45 35\r\n4 7 4\r\n27 30 27\r\n4 41 27\r\n34 41 15\r\n2 12 17\r\n2 3 19\r\n25 47 47\r\n6 43 50\r\n4 47 23\r\n5 38 30\r\n12 43 18\r\n8 38 28\r\n6 11 13\r\n23 35 41\r\n2 39 41\r\n27 30 1\r\n28 49 46\r\n15 39 29\r\n18 29 22\r\n37 39 33\r\n7 45 40\r\n23 49 19\r\n8 12 46\r\n21 48 26\r\n22 45 27\r\n9 35 50\r\n10 43 5\r\n13 29 22\r\n7 36 12\r\n18 37 34\r\n17 18 3\r\n17 27 4\r\n44 47 39\r\n6 10 34\r\n31 48 1\r\n32 45 33\r\n39 41 43\r\n5 40 4\r\n8 50 11\r\n1 45 42\r\n30 35 31\r\n", "output": ["2960"]}, {"input": "50 50 50\r\n14 41 31\r\n28 49 13\r\n4 19 15\r\n34 41 16\r\n37 40 34\r\n10 25 1\r\n28 35 15\r\n2 42 43\r\n2 12 47\r\n16 25 26\r\n21 48 4\r\n13 37 22\r\n16 26 15\r\n30 49 12\r\n8 40 45\r\n32 33 6\r\n6 27 2\r\n25 35 5\r\n22 42 24\r\n6 13 49\r\n23 26 14\r\n27 42 38\r\n9 34 45\r\n1 33 35\r\n42 44 7\r\n5 7 42\r\n12 43 25\r\n5 42 4\r\n7 47 2\r\n7 10 40\r\n20 34 6\r\n2 21 12\r\n9 45 15\r\n19 45 29\r\n4 50 0\r\n1 2 12\r\n1 47 26\r\n8 16 23\r\n9 48 45\r\n23 28 20\r\n12 19 4\r\n27 37 46\r\n21 47 25\r\n33 49 5\r\n21 49 6\r\n14 32 1\r\n5 13 36\r\n7 23 34\r\n15 34 43\r\n2 24 29\r\n", "output": ["432"]}, {"input": "50 50 50\r\n14 39 43\r\n22 27 43\r\n9 11 0\r\n23 38 21\r\n13 32 23\r\n19 43 35\r\n27 29 15\r\n6 31 8\r\n19 20 35\r\n36 45 22\r\n20 26 34\r\n13 49 42\r\n13 37 40\r\n37 45 7\r\n16 41 19\r\n27 48 15\r\n15 41 8\r\n33 45 37\r\n6 33 45\r\n10 18 4\r\n12 35 27\r\n15 42 37\r\n25 28 50\r\n19 46 28\r\n7 19 12\r\n12 44 13\r\n1 12 21\r\n7 36 11\r\n19 29 21\r\n6 33 14\r\n32 41 44\r\n30 46 30\r\n1 47 30\r\n14 43 31\r\n18 37 27\r\n11 50 44\r\n26 26 7\r\n24 31 9\r\n9 13 5\r\n29 47 12\r\n6 17 3\r\n3 35 29\r\n29 41 42\r\n5 27 35\r\n14 45 3\r\n27 31 37\r\n20 33 43\r\n18 22 7\r\n12 35 44\r\n10 24 28\r\n", "output": ["6751"]}, {"input": "50 50 50\r\n18 30 29\r\n39 40 46\r\n19 45 35\r\n13 32 26\r\n11 28 38\r\n15 19 18\r\n25 32 15\r\n15 15 1\r\n36 40 48\r\n15 48 18\r\n7 47 12\r\n26 49 37\r\n1 8 40\r\n5 38 4\r\n13 30 18\r\n5 21 0\r\n9 32 37\r\n14 16 44\r\n24 45 15\r\n18 19 36\r\n1 48 14\r\n46 49 11\r\n2 28 4\r\n2 6 21\r\n11 49 20\r\n22 27 34\r\n17 17 43\r\n12 35 19\r\n33 46 38\r\n1 6 15\r\n44 45 31\r\n37 47 22\r\n35 44 20\r\n22 45 33\r\n28 41 3\r\n28 45 0\r\n2 47 13\r\n25 41 45\r\n1 28 14\r\n3 47 3\r\n15 41 2\r\n33 37 37\r\n39 45 33\r\n11 33 38\r\n3 42 50\r\n10 48 47\r\n3 38 49\r\n21 33 31\r\n9 41 19\r\n33 50 27\r\n", "output": ["1243"]}, {"input": "50 50 50\r\n13 24 16\r\n13 46 26\r\n28 37 19\r\n2 22 29\r\n1 2 2\r\n30 31 3\r\n16 23 42\r\n32 44 45\r\n11 44 9\r\n19 35 39\r\n25 44 41\r\n4 35 31\r\n33 38 39\r\n28 35 25\r\n17 26 43\r\n17 49 9\r\n22 40 42\r\n11 44 26\r\n29 48 36\r\n20 30 41\r\n11 32 0\r\n15 31 35\r\n27 30 34\r\n38 47 39\r\n23 24 25\r\n14 20 30\r\n10 25 40\r\n5 39 0\r\n5 10 7\r\n5 20 15\r\n3 10 18\r\n10 35 39\r\n27 45 9\r\n18 34 35\r\n5 15 30\r\n35 41 32\r\n23 35 20\r\n9 37 30\r\n4 39 1\r\n2 26 46\r\n9 27 1\r\n13 31 18\r\n10 26 24\r\n17 28 17\r\n4 42 48\r\n24 50 32\r\n3 19 29\r\n28 35 2\r\n20 29 20\r\n22 23 24\r\n", "output": ["2167"]}, {"input": "50 50 50\r\n15 21 1\r\n8 40 30\r\n25 34 4\r\n19 46 8\r\n24 32 16\r\n2 31 37\r\n18 18 43\r\n27 42 37\r\n7 28 48\r\n2 31 36\r\n43 45 19\r\n8 48 25\r\n4 26 13\r\n36 42 20\r\n15 26 18\r\n28 43 18\r\n7 32 47\r\n18 46 7\r\n9 39 5\r\n17 35 21\r\n21 24 38\r\n12 30 34\r\n18 49 38\r\n28 46 32\r\n39 41 31\r\n1 26 1\r\n14 29 35\r\n23 33 7\r\n23 32 25\r\n1 13 15\r\n17 20 5\r\n20 21 31\r\n11 43 24\r\n8 33 37\r\n6 19 6\r\n34 46 39\r\n15 44 25\r\n31 50 15\r\n11 46 11\r\n16 40 12\r\n6 8 1\r\n25 44 0\r\n22 28 15\r\n22 30 21\r\n30 44 45\r\n41 45 41\r\n22 35 36\r\n39 46 25\r\n2 12 21\r\n7 41 23\r\n", "output": ["1022"]}, {"input": "50 50 50\r\n17 17 39\r\n11 13 9\r\n9 43 39\r\n9 35 13\r\n23 39 31\r\n21 43 21\r\n16 17 43\r\n2 47 30\r\n23 49 9\r\n22 47 7\r\n20 34 48\r\n12 49 20\r\n13 29 12\r\n3 29 17\r\n4 30 42\r\n37 40 28\r\n16 50 24\r\n31 43 40\r\n6 26 26\r\n22 43 28\r\n7 41 24\r\n33 35 8\r\n17 23 43\r\n11 49 25\r\n21 42 37\r\n34 36 23\r\n15 44 31\r\n7 7 14\r\n4 41 44\r\n13 16 16\r\n28 36 17\r\n19 29 48\r\n7 40 14\r\n7 32 39\r\n1 42 33\r\n9 25 21\r\n15 48 30\r\n1 45 1\r\n22 45 21\r\n1 22 4\r\n47 50 0\r\n16 19 8\r\n22 38 32\r\n24 32 1\r\n31 37 43\r\n16 36 25\r\n5 41 17\r\n42 45 49\r\n23 32 48\r\n21 43 21\r\n", "output": ["94"]}, {"input": "50 50 50\r\n15 20 50\r\n11 36 39\r\n1 7 23\r\n11 25 16\r\n2 8 46\r\n44 47 5\r\n7 15 20\r\n6 35 23\r\n21 31 47\r\n14 42 3\r\n22 44 25\r\n7 12 15\r\n5 50 13\r\n29 29 38\r\n4 35 17\r\n1 23 37\r\n22 32 30\r\n17 25 21\r\n17 40 47\r\n5 31 8\r\n46 50 10\r\n21 45 32\r\n7 47 48\r\n9 48 17\r\n4 46 43\r\n20 42 19\r\n2 15 28\r\n31 34 48\r\n9 22 11\r\n4 38 16\r\n31 49 4\r\n14 34 14\r\n41 49 28\r\n6 38 41\r\n10 38 8\r\n16 26 26\r\n24 36 37\r\n9 17 37\r\n37 41 32\r\n19 39 47\r\n10 33 0\r\n20 46 41\r\n12 45 22\r\n26 34 5\r\n27 34 40\r\n23 33 10\r\n6 17 23\r\n3 9 20\r\n1 2 49\r\n20 39 19\r\n", "output": ["2327"]}, {"input": "50 50 50\r\n6 28 36\r\n12 22 44\r\n12 39 7\r\n19 50 20\r\n27 43 35\r\n6 12 38\r\n2 6 20\r\n15 24 15\r\n38 43 8\r\n21 22 49\r\n15 21 4\r\n20 20 8\r\n25 42 37\r\n22 40 34\r\n43 43 17\r\n17 21 22\r\n35 41 34\r\n10 41 2\r\n8 29 17\r\n9 24 38\r\n14 31 24\r\n2 10 32\r\n6 20 2\r\n41 42 11\r\n20 22 49\r\n2 7 40\r\n16 18 48\r\n8 10 4\r\n31 40 30\r\n4 7 16\r\n19 39 42\r\n1 8 6\r\n37 42 17\r\n11 34 43\r\n25 29 36\r\n6 35 8\r\n12 15 42\r\n14 35 48\r\n33 48 43\r\n34 41 38\r\n4 18 50\r\n10 22 23\r\n7 15 13\r\n24 40 35\r\n23 27 36\r\n9 50 19\r\n24 30 29\r\n8 10 44\r\n26 30 50\r\n5 23 19\r\n", "output": ["2979"]}, {"input": "50 50 50\r\n24 50 22\r\n26 27 22\r\n22 27 43\r\n16 48 24\r\n27 46 50\r\n2 34 22\r\n1 4 21\r\n33 48 7\r\n5 14 21\r\n37 43 19\r\n8 39 32\r\n20 21 4\r\n4 34 36\r\n12 23 29\r\n32 47 42\r\n11 32 31\r\n4 49 13\r\n3 16 35\r\n13 44 37\r\n17 29 45\r\n16 23 10\r\n25 33 5\r\n1 44 6\r\n28 49 30\r\n31 47 4\r\n13 44 11\r\n17 22 45\r\n24 40 37\r\n11 45 48\r\n4 26 17\r\n32 50 30\r\n2 10 23\r\n29 48 31\r\n30 50 19\r\n16 47 11\r\n5 48 14\r\n33 41 48\r\n8 27 34\r\n9 32 27\r\n45 47 5\r\n2 50 49\r\n8 48 31\r\n27 47 29\r\n27 46 39\r\n12 28 34\r\n4 25 5\r\n43 50 10\r\n13 19 16\r\n9 46 0\r\n41 45 16\r\n", "output": ["498"]}, {"input": "50 50 50\r\n28 33 44\r\n15 17 1\r\n25 40 10\r\n7 43 38\r\n13 23 9\r\n4 4 43\r\n25 26 43\r\n5 41 14\r\n1 49 40\r\n4 31 18\r\n41 45 22\r\n38 43 48\r\n23 30 45\r\n5 13 3\r\n1 47 13\r\n14 25 33\r\n27 32 40\r\n23 50 26\r\n2 25 20\r\n7 41 41\r\n31 41 47\r\n34 37 7\r\n6 37 14\r\n23 43 20\r\n14 49 31\r\n22 25 22\r\n12 30 36\r\n44 46 32\r\n5 48 34\r\n17 22 31\r\n39 48 14\r\n27 34 25\r\n20 41 24\r\n31 48 9\r\n19 30 11\r\n45 49 48\r\n1 28 35\r\n10 16 10\r\n36 37 46\r\n5 42 48\r\n15 50 24\r\n12 44 27\r\n14 27 9\r\n5 37 46\r\n33 48 3\r\n12 45 8\r\n5 15 37\r\n1 5 43\r\n46 47 4\r\n8 49 33\r\n", "output": ["3080"]}, {"input": "20 50 20\r\n4 5 18\r\n14 15 32\r\n6 13 46\r\n13 19 39\r\n2 8 18\r\n15 16 29\r\n2 8 9\r\n1 2 23\r\n1 8 8\r\n18 18 11\r\n10 16 3\r\n9 18 44\r\n9 19 31\r\n2 3 19\r\n4 19 12\r\n10 17 24\r\n9 13 20\r\n4 7 10\r\n12 20 24\r\n3 19 19\r\n", "output": ["1704"]}, {"input": "50 20 20\r\n4 15 1\r\n26 31 15\r\n28 40 5\r\n16 42 1\r\n10 26 10\r\n42 42 1\r\n21 49 4\r\n24 50 10\r\n7 32 12\r\n5 38 18\r\n36 41 14\r\n16 44 2\r\n23 33 4\r\n18 19 15\r\n14 21 14\r\n18 28 16\r\n29 38 13\r\n6 17 10\r\n6 44 2\r\n17 45 1\r\n", "output": ["1406"]}, {"input": "20 20 50\r\n10 17 9\r\n5 10 5\r\n9 18 5\r\n4 19 8\r\n10 18 4\r\n5 19 2\r\n9 11 0\r\n3 9 9\r\n11 12 6\r\n7 9 7\r\n6 19 15\r\n7 12 10\r\n5 17 18\r\n4 9 14\r\n11 11 9\r\n2 20 8\r\n2 16 9\r\n5 16 1\r\n1 2 5\r\n6 9 1\r\n8 13 15\r\n6 15 18\r\n7 13 7\r\n13 18 11\r\n1 16 17\r\n16 20 17\r\n2 19 10\r\n15 18 0\r\n2 14 11\r\n1 3 11\r\n2 3 3\r\n2 16 10\r\n6 20 7\r\n3 17 2\r\n8 13 11\r\n7 11 13\r\n1 13 14\r\n5 16 4\r\n2 3 14\r\n2 5 4\r\n4 10 6\r\n10 17 20\r\n9 13 4\r\n1 5 20\r\n7 13 6\r\n16 20 9\r\n9 16 16\r\n5 12 7\r\n2 18 14\r\n9 13 19\r\n", "output": ["102"]}, {"input": "20 50 20\r\n3 9 4\r\n4 7 11\r\n9 14 31\r\n1 6 17\r\n5 13 33\r\n17 19 11\r\n13 14 10\r\n4 12 16\r\n8 19 46\r\n8 19 7\r\n11 20 32\r\n3 18 39\r\n1 12 31\r\n4 16 15\r\n2 15 38\r\n1 2 33\r\n2 11 25\r\n7 14 17\r\n3 14 45\r\n15 18 50\r\n", "output": ["2204"]}, {"input": "50 20 20\r\n19 49 15\r\n8 29 12\r\n28 33 20\r\n5 40 14\r\n1 45 14\r\n15 50 17\r\n20 44 17\r\n11 18 15\r\n20 40 6\r\n16 21 6\r\n12 31 10\r\n29 49 5\r\n20 44 17\r\n16 41 10\r\n3 30 9\r\n8 36 10\r\n45 48 5\r\n6 27 12\r\n35 44 8\r\n21 42 16\r\n", "output": ["2727"]}, {"input": "20 20 50\r\n1 3 9\r\n2 20 19\r\n2 5 3\r\n2 8 17\r\n1 19 16\r\n1 19 1\r\n17 19 13\r\n2 6 6\r\n9 12 14\r\n15 15 3\r\n6 13 7\r\n11 17 6\r\n12 15 15\r\n4 16 5\r\n8 13 4\r\n6 12 6\r\n10 13 1\r\n2 20 15\r\n9 16 11\r\n1 13 16\r\n2 12 17\r\n13 17 13\r\n17 18 9\r\n5 6 11\r\n5 16 6\r\n3 16 0\r\n2 10 3\r\n2 17 6\r\n6 9 4\r\n4 11 2\r\n5 20 17\r\n5 20 9\r\n7 20 15\r\n5 11 20\r\n11 15 12\r\n6 18 8\r\n9 16 4\r\n2 17 14\r\n4 8 11\r\n8 15 8\r\n15 18 20\r\n7 14 15\r\n5 8 14\r\n11 13 20\r\n16 17 15\r\n1 14 13\r\n6 10 11\r\n8 19 19\r\n8 20 17\r\n3 19 2\r\n", "output": ["86"]}, {"input": "20 50 20\r\n5 9 16\r\n17 17 15\r\n2 4 15\r\n6 20 22\r\n3 16 48\r\n11 13 46\r\n2 3 37\r\n7 9 8\r\n16 20 7\r\n11 19 3\r\n6 19 11\r\n3 18 34\r\n7 19 5\r\n7 17 37\r\n4 16 12\r\n13 16 42\r\n18 20 4\r\n3 8 50\r\n9 14 15\r\n17 19 5\r\n", "output": ["3556"]}, {"input": "50 20 20\r\n22 39 19\r\n23 37 18\r\n16 38 9\r\n30 49 15\r\n14 31 5\r\n1 29 16\r\n10 46 9\r\n27 40 16\r\n3 42 1\r\n33 38 6\r\n18 40 6\r\n3 34 5\r\n8 23 14\r\n5 9 14\r\n4 34 8\r\n1 48 16\r\n4 15 18\r\n9 46 18\r\n18 29 14\r\n25 47 20\r\n", "output": ["1951"]}, {"input": "20 20 50\r\n1 13 18\r\n1 18 9\r\n4 6 13\r\n2 7 17\r\n8 8 7\r\n5 11 17\r\n8 18 5\r\n8 18 11\r\n1 9 9\r\n6 15 12\r\n15 17 3\r\n2 15 10\r\n11 16 19\r\n2 17 13\r\n8 16 15\r\n6 7 0\r\n4 8 14\r\n5 8 0\r\n10 20 13\r\n6 12 3\r\n11 16 19\r\n4 14 20\r\n1 17 11\r\n7 15 7\r\n11 17 8\r\n6 17 7\r\n6 16 17\r\n5 16 3\r\n17 18 2\r\n6 14 14\r\n12 16 2\r\n2 11 16\r\n2 7 11\r\n1 14 4\r\n6 13 1\r\n1 17 10\r\n8 16 19\r\n9 13 16\r\n13 14 3\r\n8 19 12\r\n9 16 16\r\n5 10 17\r\n5 18 12\r\n1 17 15\r\n3 7 0\r\n17 18 4\r\n4 19 16\r\n6 18 9\r\n2 19 11\r\n1 4 11\r\n", "output": ["347"]}, {"input": "3 3 4\r\n1 3 1\r\n1 1 3\r\n2 2 3\r\n3 3 3\r\n", "output": ["3"]}]

[{'input': '50 50 50\r\n14 39 43\r\n22 27 43\r\n9 11 0\r\n23 38 21\r\n13 32 23\r\n19 43 35\r\n27 29 15\r\n6 31 8\r\n19 20 35\r\n36 45 22\r\n20 26 34\r\n13 49 42\r\n13 37 40\r\n37 45 7\r\n16 41 19\r\n27 48 15\r\n15 41 8\r\n33 45 37\r\n6 33 45\r\n10 18 4\r\n12 35 27\r\n15 42 37\r\n25 28 50\r\n19 46 28\r\n7 19 12\r\n12 44 13\r\n1 12 21\r\n7 36 11\r\n19 29 21\r\n6 33 14\r\n32 41 44\r\n30 46 30\r\n1 47 30\r\n14 43 31\r\n18 37 27\r\n11 50 44\r\n26 26 7\r\n24 31 9\r\n9 13 5\r\n29 47 12\r\n6 17 3\r\n3 35 29\r\n29 41 42\r\n5 27 35\r\n14 45 3\r\n27 31 37\r\n20 33 43\r\n18 22 7\r\n12 35 44\r\n10 24 28\r\n', 'output': ['6751']}, {'input': '50 50 50\r\n17 17 39\r\n11 13 9\r\n9 43 39\r\n9 35 13\r\n23 39 31\r\n21 43 21\r\n16 17 43\r\n2 47 30\r\n23 49 9\r\n22 47 7\r\n20 34 48\r\n12 49 20\r\n13 29 12\r\n3 29 17\r\n4 30 42\r\n37 40 28\r\n16 50 24\r\n31 43 40\r\n6 26 26\r\n22 43 28\r\n7 41 24\r\n33 35 8\r\n17 23 43\r\n11 49 25\r\n21 42 37\r\n34 36 23\r\n15 44 31\r\n7 7 14\r\n4 41 44\r\n13 16 16\r\n28 36 17\r\n19 29 48\r\n7 40 14\r\n7 32 39\r\n1 42 33\r\n9 25 21\r\n15 48 30\r\n1 45 1\r\n22 45 21\r\n1 22 4\r\n47 50 0\r\n16 19 8\r\n22 38 32\r\n24 32 1\r\n31 37 43\r\n16 36 25\r\n5 41 17\r\n42 45 49\r\n23 32 48\r\n21 43 21\r\n', 'output': ['94']}, {'input': '3 3 3\r\n1 1 1\r\n2 2 3\r\n3 3 2\r\n', 'output': ['14']}, {'input': '50 50 50\r\n26 27 33\r\n8 29 15\r\n10 31 23\r\n7 38 33\r\n9 12 39\r\n3 18 2\r\n11 35 25\r\n8 10 33\r\n12 19 11\r\n9 44 39\r\n17 32 27\r\n17 49 9\r\n13 13 20\r\n3 9 36\r\n18 20 43\r\n24 48 19\r\n12 26 1\r\n39 49 18\r\n11 33 38\r\n7 49 7\r\n23 38 48\r\n20 22 46\r\n12 31 34\r\n21 41 15\r\n3 13 26\r\n26 30 18\r\n50 50 12\r\n20 39 18\r\n34 40 10\r\n35 45 21\r\n28 41 17\r\n17 29 40\r\n21 30 34\r\n16 34 0\r\n28 45 21\r\n4 36 8\r\n31 50 6\r\n10 48 12\r\n18 42 43\r\n43 47 32\r\n35 38 27\r\n19 26 5\r\n5 36 22\r\n33 38 38\r\n7 24 50\r\n20 23 12\r\n5 35 40\r\n2 7 19\r\n38 49 45\r\n17 39 40\r\n', 'output': ['3477']}, {'input': '50 50 50\r\n17 40 12\r\n33 36 47\r\n8 43 35\r\n25 29 42\r\n18 36 6\r\n25 35 18\r\n36 48 47\r\n17 40 13\r\n20 27 37\r\n32 32 28\r\n17 20 13\r\n4 14 6\r\n13 18 47\r\n18 45 28\r\n3 50 45\r\n6 6 6\r\n3 25 36\r\n28 48 42\r\n14 34 32\r\n28 41 35\r\n29 35 25\r\n25 48 24\r\n32 40 40\r\n18 38 44\r\n6 16 2\r\n1 36 7\r\n14 48 2\r\n18 29 40\r\n11 16 37\r\n8 40 19\r\n12 16 44\r\n44 46 21\r\n19 24 26\r\n24 45 44\r\n22 22 15\r\n6 15 32\r\n19 42 7\r\n21 33 20\r\n1 13 26\r\n16 27 40\r\n46 48 30\r\n21 39 1\r\n1 9 32\r\n14 34 20\r\n35 38 11\r\n19 47 23\r\n13 38 15\r\n28 29 28\r\n7 20 40\r\n2 21 46\r\n', 'output': ['4384']}]

[{'input': '50 50 50\r\n18 30 29\r\n39 40 46\r\n19 45 35\r\n13 32 26\r\n11 28 38\r\n15 19 18\r\n25 32 15\r\n15 15 1\r\n36 40 48\r\n15 48 18\r\n7 47 12\r\n26 49 37\r\n1 8 40\r\n5 38 4\r\n13 30 18\r\n5 21 0\r\n9 32 37\r\n14 16 44\r\n24 45 15\r\n18 19 36\r\n1 48 14\r\n46 49 11\r\n2 28 4\r\n2 6 21\r\n11 49 20\r\n22 27 34\r\n17 17 43\r\n12 35 19\r\n33 46 38\r\n1 6 15\r\n44 45 31\r\n37 47 22\r\n35 44 20\r\n22 45 33\r\n28 41 3\r\n28 45 0\r\n2 47 13\r\n25 41 45\r\n1 28 14\r\n3 47 3\r\n15 41 2\r\n33 37 37\r\n39 45 33\r\n11 33 38\r\n3 42 50\r\n10 48 47\r\n3 38 49\r\n21 33 31\r\n9 41 19\r\n33 50 27\r\n', 'output': ['1243']}, {'input': '20 20 50\r\n10 17 9\r\n5 10 5\r\n9 18 5\r\n4 19 8\r\n10 18 4\r\n5 19 2\r\n9 11 0\r\n3 9 9\r\n11 12 6\r\n7 9 7\r\n6 19 15\r\n7 12 10\r\n5 17 18\r\n4 9 14\r\n11 11 9\r\n2 20 8\r\n2 16 9\r\n5 16 1\r\n1 2 5\r\n6 9 1\r\n8 13 15\r\n6 15 18\r\n7 13 7\r\n13 18 11\r\n1 16 17\r\n16 20 17\r\n2 19 10\r\n15 18 0\r\n2 14 11\r\n1 3 11\r\n2 3 3\r\n2 16 10\r\n6 20 7\r\n3 17 2\r\n8 13 11\r\n7 11 13\r\n1 13 14\r\n5 16 4\r\n2 3 14\r\n2 5 4\r\n4 10 6\r\n10 17 20\r\n9 13 4\r\n1 5 20\r\n7 13 6\r\n16 20 9\r\n9 16 16\r\n5 12 7\r\n2 18 14\r\n9 13 19\r\n', 'output': ['102']}, {'input': '50 50 50\r\n28 29 9\r\n33 43 30\r\n12 34 3\r\n9 12 26\r\n24 39 10\r\n12 47 35\r\n29 41 47\r\n43 44 49\r\n19 37 36\r\n11 18 46\r\n19 42 20\r\n9 40 47\r\n18 34 22\r\n11 20 44\r\n5 31 44\r\n29 40 0\r\n1 26 19\r\n7 50 4\r\n14 34 48\r\n43 48 21\r\n12 49 23\r\n6 40 47\r\n22 37 50\r\n39 48 29\r\n12 34 13\r\n5 10 25\r\n30 45 46\r\n26 32 29\r\n2 4 23\r\n7 39 19\r\n22 49 42\r\n11 29 31\r\n23 50 29\r\n12 32 47\r\n4 13 18\r\n24 46 20\r\n33 34 44\r\n24 35 41\r\n39 50 47\r\n14 24 49\r\n25 44 28\r\n23 23 42\r\n32 44 40\r\n25 42 3\r\n25 31 6\r\n35 47 18\r\n22 49 2\r\n38 43 23\r\n1 27 16\r\n19 23 43\r\n', 'output': ['1786']}, {'input': '20 50 20\r\n5 9 16\r\n17 17 15\r\n2 4 15\r\n6 20 22\r\n3 16 48\r\n11 13 46\r\n2 3 37\r\n7 9 8\r\n16 20 7\r\n11 19 3\r\n6 19 11\r\n3 18 34\r\n7 19 5\r\n7 17 37\r\n4 16 12\r\n13 16 42\r\n18 20 4\r\n3 8 50\r\n9 14 15\r\n17 19 5\r\n', 'output': ['3556']}, {'input': '50 20 20\r\n22 39 19\r\n23 37 18\r\n16 38 9\r\n30 49 15\r\n14 31 5\r\n1 29 16\r\n10 46 9\r\n27 40 16\r\n3 42 1\r\n33 38 6\r\n18 40 6\r\n3 34 5\r\n8 23 14\r\n5 9 14\r\n4 34 8\r\n1 48 16\r\n4 15 18\r\n9 46 18\r\n18 29 14\r\n25 47 20\r\n', 'output': ['1951']}]

[{'input': '50 50 50\r\n17 17 39\r\n11 13 9\r\n9 43 39\r\n9 35 13\r\n23 39 31\r\n21 43 21\r\n16 17 43\r\n2 47 30\r\n23 49 9\r\n22 47 7\r\n20 34 48\r\n12 49 20\r\n13 29 12\r\n3 29 17\r\n4 30 42\r\n37 40 28\r\n16 50 24\r\n31 43 40\r\n6 26 26\r\n22 43 28\r\n7 41 24\r\n33 35 8\r\n17 23 43\r\n11 49 25\r\n21 42 37\r\n34 36 23\r\n15 44 31\r\n7 7 14\r\n4 41 44\r\n13 16 16\r\n28 36 17\r\n19 29 48\r\n7 40 14\r\n7 32 39\r\n1 42 33\r\n9 25 21\r\n15 48 30\r\n1 45 1\r\n22 45 21\r\n1 22 4\r\n47 50 0\r\n16 19 8\r\n22 38 32\r\n24 32 1\r\n31 37 43\r\n16 36 25\r\n5 41 17\r\n42 45 49\r\n23 32 48\r\n21 43 21\r\n', 'output': ['94']}, {'input': '3 3 4\r\n1 3 1\r\n1 1 3\r\n2 2 3\r\n3 3 3\r\n', 'output': ['3']}, {'input': '20 20 50\r\n10 17 9\r\n5 10 5\r\n9 18 5\r\n4 19 8\r\n10 18 4\r\n5 19 2\r\n9 11 0\r\n3 9 9\r\n11 12 6\r\n7 9 7\r\n6 19 15\r\n7 12 10\r\n5 17 18\r\n4 9 14\r\n11 11 9\r\n2 20 8\r\n2 16 9\r\n5 16 1\r\n1 2 5\r\n6 9 1\r\n8 13 15\r\n6 15 18\r\n7 13 7\r\n13 18 11\r\n1 16 17\r\n16 20 17\r\n2 19 10\r\n15 18 0\r\n2 14 11\r\n1 3 11\r\n2 3 3\r\n2 16 10\r\n6 20 7\r\n3 17 2\r\n8 13 11\r\n7 11 13\r\n1 13 14\r\n5 16 4\r\n2 3 14\r\n2 5 4\r\n4 10 6\r\n10 17 20\r\n9 13 4\r\n1 5 20\r\n7 13 6\r\n16 20 9\r\n9 16 16\r\n5 12 7\r\n2 18 14\r\n9 13 19\r\n', 'output': ['102']}, {'input': '50 50 50\r\n7 47 45\r\n22 24 8\r\n31 48 31\r\n36 47 13\r\n7 25 19\r\n2 2 17\r\n34 40 14\r\n27 33 50\r\n31 45 35\r\n4 7 4\r\n27 30 27\r\n4 41 27\r\n34 41 15\r\n2 12 17\r\n2 3 19\r\n25 47 47\r\n6 43 50\r\n4 47 23\r\n5 38 30\r\n12 43 18\r\n8 38 28\r\n6 11 13\r\n23 35 41\r\n2 39 41\r\n27 30 1\r\n28 49 46\r\n15 39 29\r\n18 29 22\r\n37 39 33\r\n7 45 40\r\n23 49 19\r\n8 12 46\r\n21 48 26\r\n22 45 27\r\n9 35 50\r\n10 43 5\r\n13 29 22\r\n7 36 12\r\n18 37 34\r\n17 18 3\r\n17 27 4\r\n44 47 39\r\n6 10 34\r\n31 48 1\r\n32 45 33\r\n39 41 43\r\n5 40 4\r\n8 50 11\r\n1 45 42\r\n30 35 31\r\n', 'output': ['2960']}, {'input': '50 50 50\r\n15 21 1\r\n8 40 30\r\n25 34 4\r\n19 46 8\r\n24 32 16\r\n2 31 37\r\n18 18 43\r\n27 42 37\r\n7 28 48\r\n2 31 36\r\n43 45 19\r\n8 48 25\r\n4 26 13\r\n36 42 20\r\n15 26 18\r\n28 43 18\r\n7 32 47\r\n18 46 7\r\n9 39 5\r\n17 35 21\r\n21 24 38\r\n12 30 34\r\n18 49 38\r\n28 46 32\r\n39 41 31\r\n1 26 1\r\n14 29 35\r\n23 33 7\r\n23 32 25\r\n1 13 15\r\n17 20 5\r\n20 21 31\r\n11 43 24\r\n8 33 37\r\n6 19 6\r\n34 46 39\r\n15 44 25\r\n31 50 15\r\n11 46 11\r\n16 40 12\r\n6 8 1\r\n25 44 0\r\n22 28 15\r\n22 30 21\r\n30 44 45\r\n41 45 41\r\n22 35 36\r\n39 46 25\r\n2 12 21\r\n7 41 23\r\n', 'output': ['1022']}]

[{'input': '20 50 20\r\n4 5 18\r\n14 15 32\r\n6 13 46\r\n13 19 39\r\n2 8 18\r\n15 16 29\r\n2 8 9\r\n1 2 23\r\n1 8 8\r\n18 18 11\r\n10 16 3\r\n9 18 44\r\n9 19 31\r\n2 3 19\r\n4 19 12\r\n10 17 24\r\n9 13 20\r\n4 7 10\r\n12 20 24\r\n3 19 19\r\n', 'output': ['1704']}, {'input': '50 50 50\r\n15 20 50\r\n11 36 39\r\n1 7 23\r\n11 25 16\r\n2 8 46\r\n44 47 5\r\n7 15 20\r\n6 35 23\r\n21 31 47\r\n14 42 3\r\n22 44 25\r\n7 12 15\r\n5 50 13\r\n29 29 38\r\n4 35 17\r\n1 23 37\r\n22 32 30\r\n17 25 21\r\n17 40 47\r\n5 31 8\r\n46 50 10\r\n21 45 32\r\n7 47 48\r\n9 48 17\r\n4 46 43\r\n20 42 19\r\n2 15 28\r\n31 34 48\r\n9 22 11\r\n4 38 16\r\n31 49 4\r\n14 34 14\r\n41 49 28\r\n6 38 41\r\n10 38 8\r\n16 26 26\r\n24 36 37\r\n9 17 37\r\n37 41 32\r\n19 39 47\r\n10 33 0\r\n20 46 41\r\n12 45 22\r\n26 34 5\r\n27 34 40\r\n23 33 10\r\n6 17 23\r\n3 9 20\r\n1 2 49\r\n20 39 19\r\n', 'output': ['2327']}, {'input': '50 20 20\r\n4 15 1\r\n26 31 15\r\n28 40 5\r\n16 42 1\r\n10 26 10\r\n42 42 1\r\n21 49 4\r\n24 50 10\r\n7 32 12\r\n5 38 18\r\n36 41 14\r\n16 44 2\r\n23 33 4\r\n18 19 15\r\n14 21 14\r\n18 28 16\r\n29 38 13\r\n6 17 10\r\n6 44 2\r\n17 45 1\r\n', 'output': ['1406']}, {'input': '3 3 3\r\n1 1 1\r\n2 2 3\r\n3 3 2\r\n', 'output': ['14']}, {'input': '50 50 50\r\n15 21 1\r\n8 40 30\r\n25 34 4\r\n19 46 8\r\n24 32 16\r\n2 31 37\r\n18 18 43\r\n27 42 37\r\n7 28 48\r\n2 31 36\r\n43 45 19\r\n8 48 25\r\n4 26 13\r\n36 42 20\r\n15 26 18\r\n28 43 18\r\n7 32 47\r\n18 46 7\r\n9 39 5\r\n17 35 21\r\n21 24 38\r\n12 30 34\r\n18 49 38\r\n28 46 32\r\n39 41 31\r\n1 26 1\r\n14 29 35\r\n23 33 7\r\n23 32 25\r\n1 13 15\r\n17 20 5\r\n20 21 31\r\n11 43 24\r\n8 33 37\r\n6 19 6\r\n34 46 39\r\n15 44 25\r\n31 50 15\r\n11 46 11\r\n16 40 12\r\n6 8 1\r\n25 44 0\r\n22 28 15\r\n22 30 21\r\n30 44 45\r\n41 45 41\r\n22 35 36\r\n39 46 25\r\n2 12 21\r\n7 41 23\r\n', 'output': ['1022']}]

[{'input': '50 50 50\r\n7 47 45\r\n22 24 8\r\n31 48 31\r\n36 47 13\r\n7 25 19\r\n2 2 17\r\n34 40 14\r\n27 33 50\r\n31 45 35\r\n4 7 4\r\n27 30 27\r\n4 41 27\r\n34 41 15\r\n2 12 17\r\n2 3 19\r\n25 47 47\r\n6 43 50\r\n4 47 23\r\n5 38 30\r\n12 43 18\r\n8 38 28\r\n6 11 13\r\n23 35 41\r\n2 39 41\r\n27 30 1\r\n28 49 46\r\n15 39 29\r\n18 29 22\r\n37 39 33\r\n7 45 40\r\n23 49 19\r\n8 12 46\r\n21 48 26\r\n22 45 27\r\n9 35 50\r\n10 43 5\r\n13 29 22\r\n7 36 12\r\n18 37 34\r\n17 18 3\r\n17 27 4\r\n44 47 39\r\n6 10 34\r\n31 48 1\r\n32 45 33\r\n39 41 43\r\n5 40 4\r\n8 50 11\r\n1 45 42\r\n30 35 31\r\n', 'output': ['2960']}, {'input': '4 10 2\r\n2 3 8\r\n3 4 7\r\n', 'output': ['262']}, {'input': '20 50 20\r\n3 9 4\r\n4 7 11\r\n9 14 31\r\n1 6 17\r\n5 13 33\r\n17 19 11\r\n13 14 10\r\n4 12 16\r\n8 19 46\r\n8 19 7\r\n11 20 32\r\n3 18 39\r\n1 12 31\r\n4 16 15\r\n2 15 38\r\n1 2 33\r\n2 11 25\r\n7 14 17\r\n3 14 45\r\n15 18 50\r\n', 'output': ['2204']}, {'input': '50 50 50\r\n14 41 31\r\n28 49 13\r\n4 19 15\r\n34 41 16\r\n37 40 34\r\n10 25 1\r\n28 35 15\r\n2 42 43\r\n2 12 47\r\n16 25 26\r\n21 48 4\r\n13 37 22\r\n16 26 15\r\n30 49 12\r\n8 40 45\r\n32 33 6\r\n6 27 2\r\n25 35 5\r\n22 42 24\r\n6 13 49\r\n23 26 14\r\n27 42 38\r\n9 34 45\r\n1 33 35\r\n42 44 7\r\n5 7 42\r\n12 43 25\r\n5 42 4\r\n7 47 2\r\n7 10 40\r\n20 34 6\r\n2 21 12\r\n9 45 15\r\n19 45 29\r\n4 50 0\r\n1 2 12\r\n1 47 26\r\n8 16 23\r\n9 48 45\r\n23 28 20\r\n12 19 4\r\n27 37 46\r\n21 47 25\r\n33 49 5\r\n21 49 6\r\n14 32 1\r\n5 13 36\r\n7 23 34\r\n15 34 43\r\n2 24 29\r\n', 'output': ['432']}, {'input': '50 50 50\r\n18 30 29\r\n39 40 46\r\n19 45 35\r\n13 32 26\r\n11 28 38\r\n15 19 18\r\n25 32 15\r\n15 15 1\r\n36 40 48\r\n15 48 18\r\n7 47 12\r\n26 49 37\r\n1 8 40\r\n5 38 4\r\n13 30 18\r\n5 21 0\r\n9 32 37\r\n14 16 44\r\n24 45 15\r\n18 19 36\r\n1 48 14\r\n46 49 11\r\n2 28 4\r\n2 6 21\r\n11 49 20\r\n22 27 34\r\n17 17 43\r\n12 35 19\r\n33 46 38\r\n1 6 15\r\n44 45 31\r\n37 47 22\r\n35 44 20\r\n22 45 33\r\n28 41 3\r\n28 45 0\r\n2 47 13\r\n25 41 45\r\n1 28 14\r\n3 47 3\r\n15 41 2\r\n33 37 37\r\n39 45 33\r\n11 33 38\r\n3 42 50\r\n10 48 47\r\n3 38 49\r\n21 33 31\r\n9 41 19\r\n33 50 27\r\n', 'output': ['1243']}]

["6 2\n2 1 2 2 2 1", "8 4\n1 1 2 1 1 1 2 1", "9 3\n2 1 1 1 2 1 1 1 2"]

The first line of the input contains a pair of integers n, k (1 ≤ k ≤ n ≤ 100), where n is the length of the array and the value n is divisible by k. The second line contains the sequence of elements of the given array a1, a2, ..., an (1 ≤ ai ≤ 2), ai is the i-th element of the array.

5f94c2ecf1cf8fdbb6117cab801ed281

a=int(input().split()[1]) *b,=map(int,input().split()) c=0 for i in range(a): d=b[i::a] c+=min(d.count(1),d.count(2)) print(c)

["1", "0", "3"]

Python

NoteIn the first sample it is enough to change the fourth element from 2 to 1, then the array changes to [2, 1, 2, 1, 2, 1].In the second sample, the given array already is 4-periodic.In the third sample it is enough to replace each occurrence of number two by number one. In this case the array will look as [1, 1, 1, 1, 1, 1, 1, 1, 1] — this array is simultaneously 1-, 3- and 9-periodic.

Print the minimum number of array elements we need to change to make the array k-periodic. If the array already is k-periodic, then print 0.

This task will exclusively concentrate only on the arrays where all elements equal 1 and/or 2.Array a is k-period if its length is divisible by k and there is such array b of length k, that a is represented by array b written exactly times consecutively. In other words, array a is k-periodic, if it has period of length k.For example, any array is n-periodic, where n is the array length. Array [2, 1, 2, 1, 2, 1] is at the same time 2-periodic and 6-periodic and array [1, 2, 1, 1, 2, 1, 1, 2, 1] is at the same time 3-periodic and 9-periodic.For the given array a, consisting only of numbers one and two, find the minimum number of elements to change to make the array k-periodic. If the array already is k-periodic, then the required value equals 0.

[{"input": "6 2\r\n2 1 2 2 2 1\r\n", "output": ["1"]}, {"input": "8 4\r\n1 1 2 1 1 1 2 1\r\n", "output": ["0"]}, {"input": "9 3\r\n2 1 1 1 2 1 1 1 2\r\n", "output": ["3"]}, {"input": "1 1\r\n2\r\n", "output": ["0"]}, {"input": "2 1\r\n1 1\r\n", "output": ["0"]}, {"input": "2 2\r\n2 2\r\n", "output": ["0"]}, {"input": "100 1\r\n1 2 1 2 2 2 2 2 2 2 1 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 1 2 2 2 2 2 2 2 2 1 2 1 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 1 2 2 2 2 2 2 2 2 2 1 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2\r\n", "output": ["8"]}, {"input": "2 1\r\n1 2\r\n", "output": ["1"]}, {"input": "2 2\r\n2 1\r\n", "output": ["0"]}, {"input": "3 1\r\n2 1 2\r\n", "output": ["1"]}, {"input": "3 3\r\n1 2 1\r\n", "output": ["0"]}, {"input": "4 2\r\n2 1 2 2\r\n", "output": ["1"]}, {"input": "10 2\r\n2 2 2 1 1 2 2 2 2 1\r\n", "output": ["3"]}, {"input": "10 5\r\n2 2 1 2 1 1 2 1 1 1\r\n", "output": ["2"]}, {"input": "20 4\r\n2 2 1 2 2 2 1 2 2 2 1 2 2 2 1 2 2 2 1 2\r\n", "output": ["0"]}, {"input": "20 5\r\n2 2 1 1 1 2 1 1 1 1 2 2 1 1 2 2 2 1 1 2\r\n", "output": ["3"]}, {"input": "20 10\r\n1 2 2 2 2 1 1 1 2 1 1 2 2 2 2 1 2 2 2 1\r\n", "output": ["2"]}, {"input": "100 2\r\n2 2 1 2 1 2 1 2 1 2 1 2 1 2 2 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 2 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 1 1 2 1 2 1 1 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2\r\n", "output": ["5"]}, {"input": "100 4\r\n1 2 1 1 1 2 1 1 1 2 1 1 1 2 1 1 1 2 2 2 1 2 1 1 1 1 1 1 1 2 1 1 1 2 1 1 1 2 1 1 1 2 2 1 1 1 1 1 1 2 1 1 1 1 1 1 1 2 1 1 1 2 1 1 1 2 1 1 1 2 1 1 1 2 1 1 1 2 2 1 1 2 1 1 1 2 1 2 1 2 1 1 1 2 1 1 1 2 1 1\r\n", "output": ["8"]}, {"input": "100 5\r\n2 2 2 2 2 2 2 2 2 2 2 1 2 2 2 2 2 1 2 1 2 1 2 2 2 2 2 2 1 2 1 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 1 2 2 2 2 2 2 2 2 2 2 1 2 2 2 2 1 2 2 2 2 2 1 2 1 2 2 2 2 1 2 2 2 1 1 2 1 2 2 2 2 2 2 2 1 2 2 2\r\n", "output": ["16"]}, {"input": "100 10\r\n2 1 1 1 1 2 2 2 1 1 2 1 1 2 1 2 1 2 1 1 2 1 1 1 1 2 1 2 1 1 2 1 1 1 1 2 2 2 1 1 2 1 1 1 1 2 1 2 1 1 2 1 1 1 1 2 1 2 2 1 2 1 1 1 1 2 1 2 1 1 2 1 2 1 1 2 1 2 1 1 2 1 1 1 1 2 1 2 1 1 2 1 1 1 2 2 1 2 1 1\r\n", "output": ["6"]}, {"input": "100 20\r\n2 2 2 1 1 2 1 2 1 2 1 1 2 2 2 2 2 1 2 1 2 2 2 2 1 2 1 2 1 1 1 1 2 2 2 2 1 2 1 1 2 2 2 2 1 2 1 2 1 2 1 1 2 1 2 2 2 1 2 2 2 2 2 2 2 2 1 2 1 1 1 1 2 2 2 2 2 1 1 2 2 1 2 2 1 2 1 2 1 2 1 1 2 2 1 2 2 1 1 1\r\n", "output": ["13"]}, {"input": "100 25\r\n2 2 1 2 2 2 2 2 1 2 2 1 2 1 1 2 1 2 1 2 2 2 1 2 2 2 1 1 2 1 2 1 2 1 2 2 1 2 1 1 2 2 2 1 2 2 1 2 2 2 2 1 1 2 1 2 2 1 1 2 2 2 2 2 1 2 1 2 2 2 2 2 2 2 1 2 1 1 2 2 2 2 2 1 2 2 1 1 2 1 2 2 2 1 2 2 2 2 2 2\r\n", "output": ["15"]}, {"input": "100 10\r\n2 2 2 2 2 1 2 1 2 1 2 2 2 2 2 1 2 1 2 1 2 2 2 2 2 1 2 1 2 1 2 2 2 2 2 1 2 1 2 1 2 2 2 2 2 1 2 1 2 1 2 2 2 2 2 1 2 1 2 1 2 2 2 2 2 1 2 1 2 1 2 2 2 2 2 1 2 1 2 1 2 2 2 2 2 1 2 1 2 1 2 2 2 2 2 1 2 1 2 1\r\n", "output": ["0"]}]

[{'input': '20 5\r\n2 2 1 1 1 2 1 1 1 1 2 2 1 1 2 2 2 1 1 2\r\n', 'output': ['3']}, {'input': '100 2\r\n2 2 1 2 1 2 1 2 1 2 1 2 1 2 2 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 2 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 1 1 2 1 2 1 1 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2\r\n', 'output': ['5']}, {'input': '1 1\r\n2\r\n', 'output': ['0']}, {'input': '2 1\r\n1 2\r\n', 'output': ['1']}, {'input': '100 25\r\n2 2 1 2 2 2 2 2 1 2 2 1 2 1 1 2 1 2 1 2 2 2 1 2 2 2 1 1 2 1 2 1 2 1 2 2 1 2 1 1 2 2 2 1 2 2 1 2 2 2 2 1 1 2 1 2 2 1 1 2 2 2 2 2 1 2 1 2 2 2 2 2 2 2 1 2 1 1 2 2 2 2 2 1 2 2 1 1 2 1 2 2 2 1 2 2 2 2 2 2\r\n', 'output': ['15']}]

[{'input': '20 10\r\n1 2 2 2 2 1 1 1 2 1 1 2 2 2 2 1 2 2 2 1\r\n', 'output': ['2']}, {'input': '100 5\r\n2 2 2 2 2 2 2 2 2 2 2 1 2 2 2 2 2 1 2 1 2 1 2 2 2 2 2 2 1 2 1 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 1 2 2 2 2 2 2 2 2 2 2 1 2 2 2 2 1 2 2 2 2 2 1 2 1 2 2 2 2 1 2 2 2 1 1 2 1 2 2 2 2 2 2 2 1 2 2 2\r\n', 'output': ['16']}, {'input': '2 2\r\n2 2\r\n', 'output': ['0']}, {'input': '8 4\r\n1 1 2 1 1 1 2 1\r\n', 'output': ['0']}, {'input': '100 4\r\n1 2 1 1 1 2 1 1 1 2 1 1 1 2 1 1 1 2 2 2 1 2 1 1 1 1 1 1 1 2 1 1 1 2 1 1 1 2 1 1 1 2 2 1 1 1 1 1 1 2 1 1 1 1 1 1 1 2 1 1 1 2 1 1 1 2 1 1 1 2 1 1 1 2 1 1 1 2 2 1 1 2 1 1 1 2 1 2 1 2 1 1 1 2 1 1 1 2 1 1\r\n', 'output': ['8']}]

[{'input': '100 4\r\n1 2 1 1 1 2 1 1 1 2 1 1 1 2 1 1 1 2 2 2 1 2 1 1 1 1 1 1 1 2 1 1 1 2 1 1 1 2 1 1 1 2 2 1 1 1 1 1 1 2 1 1 1 1 1 1 1 2 1 1 1 2 1 1 1 2 1 1 1 2 1 1 1 2 1 1 1 2 2 1 1 2 1 1 1 2 1 2 1 2 1 1 1 2 1 1 1 2 1 1\r\n', 'output': ['8']}, {'input': '2 1\r\n1 1\r\n', 'output': ['0']}, {'input': '1 1\r\n2\r\n', 'output': ['0']}, {'input': '10 2\r\n2 2 2 1 1 2 2 2 2 1\r\n', 'output': ['3']}, {'input': '4 2\r\n2 1 2 2\r\n', 'output': ['1']}]

[{'input': '100 10\r\n2 2 2 2 2 1 2 1 2 1 2 2 2 2 2 1 2 1 2 1 2 2 2 2 2 1 2 1 2 1 2 2 2 2 2 1 2 1 2 1 2 2 2 2 2 1 2 1 2 1 2 2 2 2 2 1 2 1 2 1 2 2 2 2 2 1 2 1 2 1 2 2 2 2 2 1 2 1 2 1 2 2 2 2 2 1 2 1 2 1 2 2 2 2 2 1 2 1 2 1\r\n', 'output': ['0']}, {'input': '9 3\r\n2 1 1 1 2 1 1 1 2\r\n', 'output': ['3']}, {'input': '1 1\r\n2\r\n', 'output': ['0']}, {'input': '100 25\r\n2 2 1 2 2 2 2 2 1 2 2 1 2 1 1 2 1 2 1 2 2 2 1 2 2 2 1 1 2 1 2 1 2 1 2 2 1 2 1 1 2 2 2 1 2 2 1 2 2 2 2 1 1 2 1 2 2 1 1 2 2 2 2 2 1 2 1 2 2 2 2 2 2 2 1 2 1 1 2 2 2 2 2 1 2 2 1 1 2 1 2 2 2 1 2 2 2 2 2 2\r\n', 'output': ['15']}, {'input': '20 4\r\n2 2 1 2 2 2 1 2 2 2 1 2 2 2 1 2 2 2 1 2\r\n', 'output': ['0']}]

[{'input': '6 2\r\n2 1 2 2 2 1\r\n', 'output': ['1']}, {'input': '10 2\r\n2 2 2 1 1 2 2 2 2 1\r\n', 'output': ['3']}, {'input': '4 2\r\n2 1 2 2\r\n', 'output': ['1']}, {'input': '20 5\r\n2 2 1 1 1 2 1 1 1 1 2 2 1 1 2 2 2 1 1 2\r\n', 'output': ['3']}, {'input': '2 2\r\n2 1\r\n', 'output': ['0']}]