info stringlengths 120 50k | question stringlengths 504 10.4k | avg@8_qwen3_4b_instruct_2507 float64 0 0.88 |
|---|---|---|
{"tests": "{\"inputs\": [\"5\\n23\\n45\\n123\\n123\\n1234\\n123\\n1223\\n1222\\n1223\\n1234\", \"5\\n23\\n45\\n123\\n123\\n804\\n123\\n1223\\n1222\\n1223\\n1234\", \"5\\n20\\n29\\n123\\n92\\n804\\n35\\n1223\\n1222\\n1223\\n1234\", \"5\\n0\\n0\\n184\\n001\\n51\\n23\\n4842\\n1\\n11\\n0010\", \"5\\n0\\n-2\\n0\\n010\\n1\\n... | It can be seen that the number, 125874, and its double, 251748, contain exactly the same digits, but in a different order.
WAP to check that if 2 such numbers have this property
Input:
The first line will consist of the total number of test cases T(1 β€ T β€ 10).
The next T lines will consist of one number on each lin... | 0 |
{"tests": "{\"inputs\": [\"3\\n2 1 3\\n\", \"3\\n1 2 3\\n\", \"2\\n3 2\\n\", \"100\\n3 1 3 1 2 1 2 3 1 2 3 2 3 2 3 2 3 1 2 1 2 3 1 2 3 2 1 2 1 3 2 3 1 2 3 1 2 3 1 3 2 1 2 1 3 2 1 2 1 3 1 3 2 1 2 1 2 1 2 3 2 1 2 1 2 3 2 3 2 1 3 2 1 2 1 2 1 3 1 3 1 2 1 2 3 2 1 2 3 2 3 1 3 2 3 1 2 3 2 3\\n\", \"100\\n1 2 1 2 1 2 1 2 1 3 1... | The math faculty of Berland State University has suffered the sudden drop in the math skills of enrolling students. This year the highest grade on the entrance math test was 8. Out of 100! Thus, the decision was made to make the test easier.
Future students will be asked just a single question. They are given a sequen... | 0 |
{"tests": "{\"inputs\": [\"6\\n1 2\\n1 3\\n3 4\\n3 5\\n2 6\\n\", \"1\\n\", \"20\\n1 16\\n12 1\\n16 6\\n6 9\\n16 3\\n18 3\\n3 7\\n18 5\\n3 17\\n4 1\\n15 7\\n10 3\\n20 1\\n13 7\\n19 15\\n8 3\\n5 11\\n11 14\\n4 2\\n\", \"20\\n9 18\\n9 20\\n20 13\\n17 18\\n9 1\\n4 18\\n1 10\\n20 19\\n20 5\\n3 13\\n20 12\\n15 20\\n9 7\\n4 6... | We had a really tough time generating tests for problem D. In order to prepare strong tests, we had to solve the following problem.
Given an undirected labeled tree consisting of n vertices, find a set of segments such that:
1. both endpoints of each segment are integers from 1 to 2n, and each integer from 1 to 2n ... | 0 |
{"tests": "{\"inputs\": [\"4\\n5 2\\n2 3 4 4 3\\n3 1\\n2 10 1000\\n4 5\\n0 1 1 100\\n1 8\\n89\\n\", \"1\\n17 2\\n30 26 22 21 18 16 13 12 10 8 7 6 5 4 3 0 0\\n\", \"1\\n71 2\\n100 99 98 97 96 95 94 93 92 91 90 87 86 82 79 78 76 71 70 69 68 66 64 63 62 56 55 53 52 51 50 46 43 42 39 38 37 35 33 31 30 29 22 20 19 18 11 7 0... | Johnny has just found the new, great tutorial: "How to become a grandmaster?". The tutorial tells many strange and unexpected for Johnny things, such as you have to be patient or that very important is solving many harder and harder problems.
The boy has found an online judge with tasks divided by topics they cover. ... | 0 |
{"tests": "{\"inputs\": [\"4\\n1 2 0 3\\nNo\\nNo\\nNo\\nNo\\nNo\\nNo\", \"3\\n1 1 1\\nYes\", \"4\\n1 2\\n3 1\\n4 1\\n2 3\\n4 2\\n3 4\\n\", \"4\\n1 2\\n1 3\\n4 1\\n2 3\\n4 2\\n3 4\\n\", \"6\\n1 2\\n1 3\\n1 6\\n1 4\\n5 1\\n2 3\\n6 2\\n4 2\\n5 2\\n3 6\\n4 3\\n5 3\\n4 6\\n5 6\\n4 5\\n\", \"4\\n2 1\\n3 1\\n1 4\\n3 2\\n2 4\\... | This is an interactive problem. Remember to flush your output while communicating with the testing program. You may use fflush(stdout) in C++, system.out.flush() in Java, stdout.flush() in Python or flush(output) in Pascal to flush the output. If you use some other programming language, consult its documentation. You m... | 0 |
{"tests": "{\"inputs\": [\"5 5\\n\", \"5 10\\n\", \"1 1\\n\", \"195 468\\n\", \"629 865\\n\", \"5 205\\n\", \"455 470\\n\", \"600 175\\n\", \"395 55\\n\", \"111 111\\n\", \"5 1000\\n\", \"15 20\\n\", \"130 312\\n\", \"999 1000\\n\", \"5 11\\n\", \"30 40\\n\", \"60 80\\n\", \"440 330\\n\", \"385 505\\n\", \"105 140\\n\"... | There is a right triangle with legs of length a and b. Your task is to determine whether it is possible to locate the triangle on the plane in such a way that none of its sides is parallel to the coordinate axes. All the vertices must have integer coordinates. If there exists such a location, you have to output the app... | 0 |
{"tests": "{\"inputs\": [\"5\\nMisha ILoveCodeforces\\nVasya Petrov\\nPetrov VasyaPetrov123\\nILoveCodeforces MikeMirzayanov\\nPetya Ivanov\\n\", \"1\\nMisha Vasya\\n\", \"8\\nM F\\nS D\\n1 2\\nF G\\n2 R\\nD Q\\nQ W\\nW e\\n\", \"17\\nn5WhQ VCczxtxKwFio5U\\nVCczxtxKwFio5U 1WMVGA17cd1LRcp4r\\n1WMVGA17cd1LRcp4r SJl\\nSJl... | Misha hacked the Codeforces site. Then he decided to let all the users change their handles. A user can now change his handle any number of times. But each new handle must not be equal to any handle that is already used or that was used at some point.
Misha has a list of handle change requests. After completing the re... | 0 |
{"tests": "{\"inputs\": [\"3 1 1 2 0 0\\n3\\n1 1\\n2 1\\n2 3\\n\", \"5 0 4 2 2 0\\n5\\n5 2\\n3 0\\n5 5\\n3 5\\n3 3\\n\", \"100 100 0 0 1 1\\n1\\n2 2\\n\", \"2 2 1000000000 1000000000 0 0\\n3\\n1 1\\n5 5\\n100 100\\n\", \"0 0 1000000000 1000000000 1 1\\n4\\n2 2\\n3 3\\n4 4\\n5 5\\n\", \"10000 0 1000000 0 0 0\\n2\\n1 1\\... | It was recycling day in Kekoland. To celebrate it Adil and Bera went to Central Perk where they can take bottles from the ground and put them into a recycling bin.
We can think Central Perk as coordinate plane. There are n bottles on the ground, the i-th bottle is located at position (xi, yi). Both Adil and Bera can c... | 0 |
{"tests": "{\"inputs\": [\"3\\n0 1 2\\n\", \"17\\n7 10 12 11 13 0 9 6 4 2 15 3 5 8 14 16 1\\n\", \"100\\n54 93 37 83 59 66 74 19 6 75 76 81 41 97 22 86 80 13 55 3 32 40 18 96 95 44 33 53 79 88 28 70 63 35 25 38 85 36 58 98 87 12 52 0 16 61 17 72 46 62 31 20 43 34 4 7 60 15 73 1 78 48 69 30 8 14 94 84 91 27 2 64 57 42 7... | Bill is a famous mathematician in BubbleLand. Thanks to his revolutionary math discoveries he was able to make enough money to build a beautiful house. Unfortunately, for not paying property tax on time, court decided to punish Bill by making him lose a part of his property.
Billβs property can be observed as a convex... | 0 |
{"tests": "{\"inputs\": [\"0 0\\n0 0\\n2 0\\n1 0\\n\", \"0 2\\n0 0\\n4 0\\n-3 0\\n\", \"0 3\\n0 0\\n4 0\\n4 3\\n\", \"10 1\\n-71 23\\n51 92\\n-72 10\\n\", \"83 0\\n94 -62\\n0 -34\\n-87 49\\n\", \"0 0\\n0 0\\n5 0\\n10 0\\n\", \"0 5\\n-20 -2\\n16 -6\\n16 -2\\n\", \"26 6\\n98 -44\\n60 67\\n-41 -15\\n\", \"13 5\\n-95 7\\n-... | Two neighbours, Alan and Bob, live in the city, where there are three buildings only: a cinema, a shop and the house, where they live. The rest is a big asphalt square.
Once they went to the cinema, and the film impressed them so deeply, that when they left the cinema, they did not want to stop discussing it.
Bob wa... | 0 |
{"tests": "{\"inputs\": [\"4 4\\n\", \"5 3\\n\", \"232435556779345919 19\\n\", \"518264351335130399 37\\n\", \"442762254977842799 30\\n\", \"1 2\\n\", \"755804560577415016 17\\n\", \"2 1\\n\", \"310113769227703889 3\\n\", \"731457367464667229 118809129279134971\\n\", \"649549020631327471 41923378183538525\\n\", \"33436... | Imp is watching a documentary about cave painting.
<image>
Some numbers, carved in chaotic order, immediately attracted his attention. Imp rapidly proposed a guess that they are the remainders of division of a number n by all integers i from 1 to k. Unfortunately, there are too many integers to analyze for Imp.
Imp ... | 0 |
{"tests": "{\"inputs\": [\"1\\n5\\n5 7 7 15 12\\n7\\n\\nSAMPLE\", \"1\\n5\\n5 7 7 15 12\\n13\\n\\nSAMPLE\", \"1\\n5\\n5 7 7 15 5\\n25\\n\\nSAMPLE\", \"1\\n5\\n5 14 7 15 5\\n25\\n\\nSAMPLE\", \"1\\n5\\n5 14 7 26 5\\n16\\n\\nSAMPLE\", \"1\\n5\\n5 7 7 15 0\\n7\\n\\nSAMPLE\", \"1\\n5\\n5 7 7 16 12\\n13\\n\\nSAMPLE\", \"1\\... | Raja tranports boxes from one place to another.But the boxes are too heavy it is very diffcult for him to transport them.But he is Raja:-p he has a magical power he can choose any random number D and if sum of weight of two continuous boxes one after another is divisble by that number then he can change both boxes in t... | 0.125 |
{"tests": "{\"inputs\": [\"0001111110\\n\\nSAMPLE\", \"1000111000111000111000111\", \"1111010100010100101011101100101101110011000010100010000001111100010011100101010001101111000001011000\", \"0101100011001110001110100111100011010101011000000000110110010010111100101111010111100011101100100101\", \"1111111\", \"111111111... | Little Jhool always wanted to have some psychic powers so that he could showoff his skills, and magic to people and impress them. (Specially, his girlfriend Big Jhool!) But, in spite all his efforts, hardwork, dedication, Googling, watching youtube videos he couldn't garner any psychic abilities!
He knew everyone was ... | 0.875 |
{"tests": "{\"inputs\": [\"3\\n3 2 1\", \"5\\n2 3 2 1 2\", \"3\\n3 4 1\", \"5\\n2 1 2 1 2\", \"5\\n2 1 1 1 2\", \"5\\n3 1 1 1 1\", \"3\\n1 3 4\", \"3\\n3 5 1\", \"5\\n2 1 2 2 2\", \"3\\n3 5 2\", \"5\\n3 1 2 2 2\", \"3\\n3 5 3\", \"5\\n6 1 2 2 2\", \"3\\n3 7 3\", \"5\\n1 1 2 2 2\", \"3\\n3 1 3\", \"5\\n1 1 2 1 2\", \"5\... | There are N strings arranged in a row. It is known that, for any two adjacent strings, the string to the left is lexicographically smaller than the string to the right. That is, S_1<S_2<...<S_N holds lexicographically, where S_i is the i-th string from the left.
At least how many different characters are contained in ... | 0 |
{"tests": "{\"inputs\": [\"1 3 3 1 3\\n1 3 2000\\n1 2 1000\\n2 3 1000\\n2 3 3 1 3\\n1 3 2300\\n1 2 1000\\n2 3 1200\\n2 6 6 5 1\\n1 2 1500\\n1 3 4500\\n2 6 2000\\n5 4 1000\\n6 4 2200\\n3 5 3000\\n0 0 0 0 0\", \"1 3 3 1 3\\n1 3 2000\\n1 2 1000\\n2 3 1001\\n2 3 3 1 3\\n1 3 2300\\n1 2 1000\\n2 3 1200\\n2 6 6 5 1\\n1 2 1500... | Mr. A is planning to travel alone on a highway bus (hereinafter referred to as "bus") during his high school holidays. First, Mr. A chose the town he wanted to visit the most and made it his destination. Next, you have to decide the route to transfer the bus from the departure point to the destination. When connecting,... | 0.75 |
{"tests": "{\"inputs\": [\"666660666\\n44444416003334446633111\\n20202202000333003330333\", \"666660666\\n62238520449600706121638\\n20202202000333003330333\", \"666660666\\n62238520449600706121638\\n20470251257982382367886\", \"666660666\\n79768964391256325078385\\n20470251257982382367886\", \"666660666\\n7976896439125... | She loves e-mail so much! She sends e-mails by her cellular phone to her friends when she has breakfast, she talks with other friends, and even when she works in the library! Her cellular phone has somewhat simple layout (Figure 1). Pushing button 1 once displays a character (β), pushing
<image>
it twice in series di... | 0.125 |
{"tests": "{\"inputs\": [\"ABC 3\\nABC 0\\n2(4(AB)3(XY))10C 30\\n1000(1000(1000(1000(1000(1000(NM)))))) 999999\\n0 0\", \"ABC 3\\nABC 1\\n2(4(AB)3(XY))10C 30\\n1000(1000(1000(1000(1000(1000(NM)))))) 999999\\n0 0\", \"ABC 3\\nABC 0\\n2(4(AB)3(XY))10C 3\\n1000(1000(1000(1000(1000(1000(NM)))))) 999999\\n0 0\", \"ABC 3\\nA... | In 2300, the Life Science Division of Federal Republic of Space starts a very ambitious project to complete the genome sequencing of all living creatures in the entire universe and develop the genomic database of all space life. Thanks to scientific research over many years, it has been known that the genome of any spe... | 0 |
{"tests": "{\"inputs\": [\"3\\n8 8 18\\n32 32 32\\n57 2 57\\n5\\n49 3 49\\n7 30 44\\n27 21 21\\n33 56 56\\n21 46 4\\n3\\n45 52 28\\n36 26 36\\n20 55 50\\n10\\n33 8 39\\n50 57 43\\n35 21 12\\n21 17 11\\n16 21 58\\n45 40 53\\n45 30 53\\n39 1 8\\n55 48 30\\n7 48 15\\n0\", \"3\\n8 8 18\\n32 32 32\\n57 2 57\\n5\\n49 3 49\\n... | In the middle of Tyrrhenian Sea, there is a small volcanic island called Chronus. The island is now uninhabited but it used to be a civilized island. Some historical records imply that the island was annihilated by an eruption of a volcano about 800 years ago and that most of the people in the island were killed by pyr... | 0 |
{"tests": "{\"inputs\": [\"4 4 1\\n3 3\", \"10 6 10\\n10 4\\n4 4\\n5 1\\n4 2\\n7 3\\n1 3\\n2 4\\n8 2\\n7 5\\n7 1\", \"8 4 1\\n3 3\", \"10 6 10\\n10 4\\n4 4\\n5 1\\n4 2\\n7 3\\n1 3\\n2 4\\n8 2\\n3 5\\n7 1\", \"10 6 10\\n10 4\\n4 4\\n5 1\\n6 2\\n7 3\\n1 3\\n2 4\\n8 2\\n7 5\\n7 1\", \"8 4 0\\n3 3\", \"3 4 0\\n5 3\", \"4 4... | There is an Amidakuji that consists of w vertical bars and has a height (the number of steps to which horizontal bars can be added) of h. w is an even number. Of the candidates for the place to add the horizontal bar of this Amidakuji, the ath from the top and the bth from the left are called (a, b). (When a horizontal... | 0 |
{"tests": "{\"inputs\": [\"5\\n4 2 5 3 1\", \"5\\n4 2 5 3 0\", \"5\\n14 3 0 1 -1\", \"5\\n19 3 0 2 -1\", \"5\\n8 1 1 -1 0\", \"5\\n48 -2 1 -2 -1\", \"5\\n48 0 1 -2 -2\", \"5\\n78 0 -2 -1 -3\", \"5\\n6 0 -2 0 -3\", \"5\\n-1 6 0 3 0\", \"5\\n-2 11 1 1 0\", \"5\\n-4 2 -2 -2 2\", \"5\\n2 -12 1 -1 16\", \"5\\n0 -12 2 -1 32\... | G: Working
Kou decided to do the same number of jobs every day for the next $ N $.
$ A_i $ jobs are added on the $ i $ day of the $ N $ day.
Mr. Kou has no work to do now, and he doesn't have to finish all the work by the $ N $ day.
How many jobs can you do in a day?
However, Mr. Kou is excellent, so he can do as ... | 0 |
{"tests": "{\"inputs\": [\"3\\n0 4 1 0 0 9 8 3\\n\", \"10\\n1 2 3 4 5 6 7 8\\n\", \"0\\n0 0 0 0 0 0 0 0\\n\", \"51\\n13 0 8 0 0 11 5 2\\n\", \"48\\n4 0 2 4 0 3 0 8\\n\", \"25\\n0 0 0 0 2 0 6 0\\n\", \"34\\n4 0 0 0 1 0 0 4\\n\", \"39402932710920212\\n0 0 0 7036655838029546 0 2597660979346835 0 0\\n\", \"18\\n0 0 0 0 0 0... | You have a set of items, each having some integer weight not greater than 8. You denote that a subset of items is good if total weight of items in the subset does not exceed W.
You want to calculate the maximum possible weight of a good subset of items. Note that you have to consider the empty set and the original set... | 0 |
{"tests": "{\"inputs\": [\"4\\n1\\n1\\n3\\n00000\\n4\\n1110000\\n2\\n101\\n\", \"4\\n1\\n1\\n3\\n00000\\n4\\n1110000\\n2\\n101\\n\", \"1\\n7\\n0000000000001\\n\", \"4\\n1\\n1\\n3\\n00100\\n4\\n1110000\\n2\\n101\\n\", \"4\\n1\\n1\\n3\\n01100\\n4\\n1110100\\n2\\n101\\n\", \"4\\n1\\n1\\n3\\n01110\\n4\\n1100100\\n2\\n101\\... | A binary string is a string where each character is either 0 or 1. Two binary strings a and b of equal length are similar, if they have the same character in some position (there exists an integer i such that a_i = b_i). For example:
* 10010 and 01111 are similar (they have the same character in position 4);
* 10... | 0 |
{"tests": "{\"inputs\": [\"3\\n6 3\\n0 0 2 5 1 1\\n2 3\\n0 2\\n3 2\\n3 0 2\\n\", \"1\\n2 10\\n7 4\\n\", \"1\\n2 2\\n0 100\\n\", \"1\\n2 7\\n7 0\\n\", \"1\\n2 2\\n3 9\\n\", \"1\\n2 5\\n2 9\\n\", \"1\\n2 2\\n1 9\\n\", \"1\\n2 5\\n10 5\\n\", \"5\\n2 2\\n0 0\\n2 2\\n0 1\\n2 2\\n1 0\\n2 2\\n0 2\\n2 2\\n2 0\\n\", \"1\\n2 3\\... | You want to build a fence that will consist of n equal sections. All sections have a width equal to 1 and height equal to k. You will place all sections in one line side by side.
Unfortunately, the ground beneath the fence is not flat. For simplicity, you can think that the ground level under the i-th section is equal... | 0 |
{"tests": "{\"inputs\": [\"3 11\\n+ 1 2 a\\n+ 2 3 b\\n+ 3 2 a\\n+ 2 1 b\\n? 3\\n? 2\\n- 2 1\\n- 3 2\\n+ 2 1 c\\n+ 3 2 d\\n? 5\\n\", \"3 11\\n+ 1 2 a\\n+ 2 3 c\\n+ 3 2 a\\n+ 2 1 b\\n? 3\\n? 2\\n- 2 1\\n- 3 2\\n+ 2 1 c\\n+ 3 2 d\\n? 5\\n\", \"3 11\\n+ 1 2 a\\n+ 1 3 c\\n+ 3 2 a\\n+ 2 1 b\\n? 6\\n? 4\\n- 2 1\\n- 3 2\\n+ 2 ... | You are given a directed graph consisting of n vertices. Each directed edge (or arc) labeled with a single character. Initially, the graph is empty.
You should process m queries with it. Each query is one of three types:
* "+ u v c" β add arc from u to v with label c. It's guaranteed that there is no arc (u, v) in... | 0 |
{"tests": "{\"inputs\": [\"2 6 12 11\\n\", \"3 6 81 9\\n\", \"2 3 5 1\\n\", \"397 24 21491 18004\\n\", \"65 101 43738 16242\\n\", \"550 5 88379 9433\\n\", \"0 0 16709 12233\\n\", \"0 0 23896 0\\n\", \"239 695 50503 18287\\n\", \"452 53 51476 50033\\n\", \"3 0 42953 1\\n\", \"1 1 2 0\\n\", \"937 859 7333 2141\\n\", \"1 ... | Polycarpus has recently got interested in sequences of pseudorandom numbers. He learned that many programming languages generate such sequences in a similar way: <image> (for i β₯ 1). Here a, b, m are constants, fixed for the given realization of the pseudorandom numbers generator, r0 is the so-called randseed (this val... | 0.75 |
{"tests": "{\"inputs\": [\"2\\n2\\n10 15\\n5 7\\n20 18\\n1\\n0 0\\n\", \"2\\n2\\n10 15\\n5 7\\n20 18\\n1\\n0 0\\n\", \"2\\n2\\n10 15\\n5 7\\n20 14\\n1\\n0 0\\n\", \"2\\n2\\n10 15\\n4 7\\n20 18\\n1\\n0 0\\n\", \"2\\n2\\n10 15\\n5 7\\n20 6\\n1\\n0 0\\n\", \"2\\n2\\n10 15\\n5 7\\n20 3\\n1\\n0 0\\n\", \"2\\n2\\n10 15\\n5 7... | In 2N - 1 boxes there are apples and oranges. Your task is to choose N boxes so, that they will contain not less than half of all the apples and not less than half of all the oranges.
Input
The first input line contains one number T β amount of tests. The description of each test starts with a natural number N β amou... | 0 |
{"tests": "{\"inputs\": [\"5\\n1 2 3 4 5\\n\", \"3\\n1 2 4\\n\", \"10\\n109070199 215498062 361633800 406156967 452258663 530571268 670482660 704334662 841023955 967424642\\n\", \"39\\n37749932 37750076 37750391 37750488 37750607 37750812 37750978 37751835 37752173 37752254 75497669 75497829 75497852 75498044 75498061 ... | Vasily the bear has got a sequence of positive integers a1, a2, ..., an. Vasily the Bear wants to write out several numbers on a piece of paper so that the beauty of the numbers he wrote out was maximum.
The beauty of the written out numbers b1, b2, ..., bk is such maximum non-negative integer v, that number b1 and b... | 0 |
{"tests": "{\"inputs\": [\"4\\n4 3 4 5\\n\", \"4\\n1 3 5 9\\n\", \"3\\n4 1 7\\n\", \"1\\n10\\n\", \"2\\n2 4\\n\", \"7\\n5 40 45 50 55 60 65\\n\", \"20\\n27 6 3 18 54 33 9 15 39 12 57 48 21 51 60 30 24 36 42 45\\n\", \"2\\n1 1\\n\", \"1\\n1\\n\", \"40\\n100000000 100000000 100000000 100000000 100000000 100000000 1000000... | Everybody knows what an arithmetic progression is. Let us remind you just in case that an arithmetic progression is such sequence of numbers a1, a2, ..., an of length n, that the following condition fulfills:
a2 - a1 = a3 - a2 = a4 - a3 = ... = ai + 1 - ai = ... = an - an - 1.
For example, sequences [1, 5], [10], [5... | 0.375 |
{"tests": "{\"inputs\": [\"5\\n1 5 2 4 3\\n\", \"4\\n1 3 4 2\\n\", \"5\\n3 5 4 1 2\\n\", \"4\\n3 4 1 2\\n\", \"100\\n22 78 19 70 81 33 15 72 40 51 18 62 36 24 37 20 97 65 89 75 14 55 23 53 1 67 50 99 54 76 41 16 44 60 2 90 7 28 79 43 47 64 71 27 25 8 46 92 95 80 31 100 42 96 86 66 52 63 98 4 56 91 34 83 85 3 84 17 94 1... | You are given a permutation of numbers from 1 to n. Determine whether there's a pair of integers a, b (1 β€ a, b β€ n; a β b) such that the element <image> (note, that it is usual division, not integer one) is between a and b in this permutation.
Input
First line consists of a single integer n (1 β€ n β€ 300000) β the si... | 0 |
{"tests": "{\"inputs\": [\"3\\n12 3 3\\n\", \"2\\n11 8\\n\", \"5\\n10 9 7 10 6\\n\", \"1\\n1\\n\", \"20\\n44 50 41 18 28 31 21 38 12 20 28 15 12 29 16 31 34 24 19 15\\n\", \"10\\n520230360 520230361 520230362 520230363 520230364 520230365 520230366 520230367 520230368 520230369\\n\", \"10\\n198447418 198447416 19844741... | Do you like summer? Residents of Berland do. They especially love eating ice cream in the hot summer. So this summer day a large queue of n Berland residents lined up in front of the ice cream stall. We know that each of them has a certain amount of berland dollars with them. The residents of Berland are nice people, s... | 0 |
{"tests": "{\"inputs\": [\"7\\n2\\n3\\n\", \"9960594\\n2551\\n2557\\n\", \"100\\n25\\n10\\n\", \"15\\n4\\n8\\n\", \"4\\n3\\n1\\n\", \"10000000\\n3\\n7\\n\", \"10000000\\n5000000\\n5000000\\n\", \"4608528\\n9059\\n977\\n\", \"1\\n1\\n1\\n\", \"4\\n1\\n2\\n\", \"121\\n11\\n11\\n\", \"4\\n2\\n2\\n\", \"1000000\\n3\\n7\\n\... | Vasya has n burles. One bottle of Ber-Cola costs a burles and one Bars bar costs b burles. He can buy any non-negative integer number of bottles of Ber-Cola and any non-negative integer number of Bars bars.
Find out if it's possible to buy some amount of bottles of Ber-Cola and Bars bars and spend exactly n burles.
I... | 0.25 |
{"tests": "{\"inputs\": [\"1 2 2\\n..\\n\", \"2 3 2\\n**.\\n...\\n\", \"3 3 4\\n.*.\\n*.*\\n.*.\\n\", \"1 1 1000\\n.\\n\", \"2 2 2\\n.*\\n*.\\n\", \"1 1 1\\n.\\n\", \"4 4 2\\n....\\n....\\n....\\n....\\n\", \"2 3 1\\n...\\n...\\n\", \"3 3 1\\n.*.\\n.*.\\n.*.\\n\", \"2 3 1\\n**.\\n...\\n\", \"3 3 1\\n...\\n...\\n...\\n\... | Suppose that you are in a campus and have to go for classes day by day. As you may see, when you hurry to a classroom, you surprisingly find that many seats there are already occupied. Today you and your friends went for class, and found out that some of the seats were occupied.
The classroom contains n rows of seats ... | 0 |
{"tests": "{\"inputs\": [\"12 5\\n\", \"31 12\\n\", \"100000000000000001 10000000000000000\\n\", \"5 100000000000001\\n\", \"1000000000000000000 2\\n\", \"4 8\\n\", \"5 6\\n\", \"7 11\\n\", \"179 100000000000497000\\n\", \"3 6\\n\", \"1000000000000000000 10000001\\n\", \"1 123456789123456\\n\", \"19 46\\n\", \"9 189178... | You have two variables a and b. Consider the following sequence of actions performed with these variables:
1. If a = 0 or b = 0, end the process. Otherwise, go to step 2;
2. If a β₯ 2Β·b, then set the value of a to a - 2Β·b, and repeat step 1. Otherwise, go to step 3;
3. If b β₯ 2Β·a, then set the value of b to b - 2... | 0 |
{"tests": "{\"inputs\": [\"3 3 1 1\", \"1 5 2 0\", \"3 3 0 1\", \"1 5 2 -1\", \"3 6 0 1\", \"1 5 4 -1\", \"3 10 0 1\", \"2 5 4 -1\", \"2 6 4 -1\", \"1 5 0 0\", \"3 3 0 2\", \"1 5 2 1\", \"6 6 0 1\", \"3 4 0 1\", \"1 10 2 -1\", \"3 9 -2 1\", \"2 6 5 -1\", \"6 10 -2 1\", \"1 10 -4 1\", \"3 5 -1 1\", \"1 5 1 0\", \"3 4 0 ... | We have a square grid with H rows and W columns. Snuke wants to write 0 or 1 in each of the squares. Here, all of the following conditions have to be satisfied:
* For every row, the smaller of the following is A: the number of 0s contained in the row, and the number of 1s contained in the row. (If these two numbers ar... | 0 |
{"tests": "{\"inputs\": [\"0\", \"1\", \"1234567894848\", \"2\", \"3\", \"-1\", \"4\", \"2307894359683\", \"8\", \"-2\", \"-4\", \"-3\", \"3500144313336\", \"15\", \"7\", \"-7\", \"-8\", \"4048027520392\", \"16\", \"-6\", \"-12\", \"-11\", \"2609800078127\", \"6\", \"-22\", \"13\", \"-9\", \"4080169873978\", \"11\", \"... | We have a sequence of length N consisting of non-negative integers. Consider performing the following operation on this sequence until the largest element in this sequence becomes N-1 or smaller.
* Determine the largest element in the sequence (if there is more than one, choose one). Decrease the value of this element... | 0 |
{"tests": "{\"inputs\": [\"3 5\\n90\\n52\\n82\\n84\\n70\\n2 4\\n10\\n30\\n40\\n60\\n0 0\", \"3 5\\n123\\n52\\n82\\n84\\n70\\n2 4\\n10\\n30\\n40\\n60\\n0 0\", \"3 5\\n123\\n52\\n82\\n84\\n124\\n2 4\\n18\\n30\\n40\\n60\\n0 0\", \"1 5\\n90\\n52\\n82\\n84\\n70\\n2 4\\n10\\n30\\n40\\n60\\n0 0\", \"1 5\\n90\\n52\\n82\\n84\\n... | There are various parking lots such as three-dimensional type and tower type in the city to improve the utilization efficiency of the parking lot. In some parking lots, a "two-stage parking device" as shown in the figure is installed in one parking space to secure a parking space for two cars. This two-stage parking de... | 0 |
{"tests": "{\"inputs\": [\"5 4\\n5 3 2 -5 2\\n2 -4 2 8 -4\\n2 3 -7 6 7\\n3 -4 10 -3 -3\", \"2 1\\n-2 1\", \"2 2\\n2 -3\\n3 -1\", \"5 4\\n5 6 2 -5 2\\n2 -4 2 8 -4\\n2 3 -7 6 7\\n3 -4 10 -3 -3\", \"0 1\\n-2 1\", \"5 4\\n5 6 2 -5 2\\n2 -4 2 8 -4\\n2 3 -7 6 7\\n1 -4 10 -3 -3\", \"1 1\\n-2 1\", \"5 4\\n5 6 2 -5 2\\n2 -4 2 1... | Nobuo-kun and Shizuo-kun are playing a game of competing for territories on a rectangular island. As shown in Fig. 1 below, the entire island is made up of square compartments divided in a grid pattern, and the profits and losses resulting from these are indicated by integers.
<image>
In this game, move one piece t... | 0 |
{"tests": "{\"inputs\": [\"6 4\\n3\\n2\\n8\\n3\\n1\\n5\", \"6 4\\n3\\n2\\n11\\n3\\n1\\n5\", \"6 4\\n3\\n0\\n11\\n3\\n1\\n5\", \"1 4\\n3\\n0\\n11\\n3\\n1\\n5\", \"1 8\\n5\\n0\\n4\\n2\\n2\\n9\", \"6 4\\n3\\n2\\n8\\n0\\n1\\n5\", \"6 4\\n3\\n2\\n11\\n0\\n1\\n5\", \"6 4\\n3\\n0\\n11\\n3\\n0\\n5\", \"2 4\\n3\\n0\\n11\\n3\\n1... | problem
N students from JOI High School are lined up in a row from east to west. The i-th student from the western end of the column is student i. Each student has a bib with one integer. Initially, the integer Ai is written on the number of student i.
There are M batons, and the batons are numbered from 1 to M. For ... | 0 |
{"tests": "{\"inputs\": [\"2 1 1 1\\n1 1\\n0 0\\n1 3 2 1\\n2 1\\n2 1\\n0 0\\n10 8 3 2\\n2 2\\n1 3\\n1 1\\n0 1\\n3 4\\n3 3 3 2\\n1 2\\n2 1\\n1 1\\n0 1\\n0 0\\n0 0 0 0\", \"2 1 1 1\\n1 1\\n0 0\\n1 3 2 1\\n2 1\\n2 1\\n0 0\\n10 8 3 2\\n2 2\\n1 2\\n1 1\\n0 1\\n3 4\\n3 3 3 2\\n1 2\\n2 1\\n1 1\\n0 1\\n0 0\\n0 0 0 0\", \"2 1 1... | Origami, or the art of folding paper
Master Grus is a famous origami (paper folding) artist, who is enthusiastic about exploring the possibility of origami art. For future creation, he is now planning fundamental experiments to establish the general theory of origami.
One rectangular piece of paper is used in each of... | 0 |
{"tests": "{\"inputs\": [\"4 16\\nINTERNATIONAL\\nCOLLEGIATE\\nPROGRAMMING\\nCONTEST\", \"2 4\\nACM\\nICPC\", \"2 9\\nPROBLEMF\\nCONNECT\", \"4 16\\nINTERNATIONAL\\nCOLLEGIATE\\nPROGRAMMJNG\\nCONTEST\", \"4 16\\nLANOITANRETNI\\nCOLLEGIATE\\nPROGRAMMJNG\\nCONTEST\", \"7 16\\nLANOIUANRETNI\\nCOLLAGIFTE\\nPRNGRAMMJNG\\nTS... | You are playing a solitaire puzzle called "Connect", which uses several letter tiles.
There are R Γ C empty cells. For each i (1 β€ i β€ R), you must put a string si (1 β€ |si| β€ C) in the i-th row of the table, without changing the letter order. In other words, you choose an integer sequence {aj} such that 1 β€ a1 < a2 <... | 0 |
{"tests": "{\"inputs\": [\"1-2+3-4+5-6*0\", \"(1989967-3*1-211+4487)\", \"3-2*3\", \"(5-3*4)*(0-2+1)\", \"(1989967-3*2-211+4487)\", \"3-2)3\", \"(5-3*4)+(0-2+1)\", \"3)2-3\", \"0-2+3-4+5-6*0\", \"(1998967-3*1-211+4487)\", \"(5-3*4)*(0-1+1)\", \"(199896743*1-211+4-87)\", \"(5-3*4)*(0-1+2)\", \"0*6-5+5-3+2-0\", \"(199876... | One day, Ikta, an elementary school student, received a piece of paper with mathematical formulas from his grandfather. Apparently, the grandfather will give you as much money as the answer to the formula. Ikta has only learned addition, subtraction, and multiplication, so only addition, subtraction, and multiplication... | 0 |
{"tests": "{\"inputs\": [\"NicoNicoNi\", \"iNociNociN\", \"iNobiNociN\", \"iNoaiNociN\", \"iNoaiNochN\", \"NhcoNiaoNi\", \"NhcoNiNoai\", \"NhcoNjNoai\", \"NhboNjNoai\", \"NhbNNjooai\", \"NhbNOjooai\", \"jhbNONooai\", \"jhbOONooai\", \"jhbOOoNoai\", \"jibOOoNoai\", \"jibONoNoai\", \"iibONoNoai\", \"iNbOioNoai\", \"iNbOi... | F: Miko Mi String-
story
Mikko Mikkomi ~! Everyone's idol, Miko Miko Tazawa! Today ~, with Mikoto ~, practice the string algorithm, let's do it β
Miko's special ~~ character making ~~ The slogan "MikoMikomi" becomes "MikoMikoMi" in Roman letters! In other words, if A = βMiβ and B = βKoβ, you can write in the form of... | 0.625 |
{"tests": "{\"inputs\": [\"1 2 3\", \"1 2 6\", \"0 2 3\", \"1 2 9\", \"1 1 9\", \"1 2 7\", \"0 2 6\", \"2 2 9\", \"2 1 9\", \"1 2 5\", \"0 4 6\", \"2 2 5\", \"1 2 11\", \"0 2 4\", \"1 2 14\", \"0 2 7\", \"1 4 6\", \"2 2 14\", \"2 1 11\", \"1 2 4\", \"-1 4 6\", \"2 2 11\", \"0 1 4\", \"0 2 14\", \"1 3 6\", \"2 2 16\", \... | Today, Chef woke up to find that he had no clean socks. Doing laundry is such a turn-off for Chef, that in such a situation, he always buys new socks instead of cleaning the old dirty ones. He arrived at the fashion store with money rupees in his pocket and started looking for socks. Everything looked good, but then Ch... | 0.75 |
{"tests": "{\"inputs\": [\"2\\n2\\n4\", \"2\\n2\\n0\", \"2\\n4\\n0\", \"2\\n8\\n0\", \"2\\n10\\n0\", \"2\\n15\\n0\", \"2\\n0\\n0\", \"2\\n24\\n0\", \"2\\n6\\n1\", \"2\\n0\\n2\", \"2\\n10\\n2\", \"2\\n6\\n2\", \"2\\n2\\n2\", \"2\\n9\\n2\", \"2\\n6\\n4\", \"2\\n1\\n4\", \"2\\n6\\n7\", \"2\\n12\\n1\", \"2\\n12\\n2\", \"2\... | The palindrome is a string that can be read the same way from left to right and from right to left. For example, strings "aaaaa", "1221", "bbaabb" are palindromes, however the string "chef" is not a palindrome because if we read it from right to left, we will obtain "fehc" that is not the same as "chef".
We call a str... | 0.375 |
{"tests": "{\"inputs\": [\"10\\na ab a a b ab a a b c\\n\", \"6\\naa bb aa aa bb bb\\n\", \"6\\nto be or not to be\\n\", \"1\\nxdhlmtnvecsbwbycahddxnvwpsxwxgfmidfetpkpeevpjzfbgfafbjpyuevupuptoxutnketcxwrllooyxtxjzwxpzcbpiqzeiplcqvdxyyznjxgkwstpxogdihsamoqhyspbjlelxpbarzqawsgidjtmnpmmupohnslirorliapvntasudhpuuxynyoipuqx... | You are given a text consisting of n space-separated words. There is exactly one space character between any pair of adjacent words. There are no spaces before the first word and no spaces after the last word. The length of text is the number of letters and spaces in it. w_i is the i-th word of text. All words consist ... | 0.375 |
{"tests": "{\"inputs\": [\"4 3\\n\", \"5 2\\n\", \"2 1\\n\", \"97821761637600 97821761637497\\n\", \"97821761637600 97\\n\", \"99999999999030 139\\n\", \"99999640000243 99999640000143\\n\", \"1117 1\\n\", \"1260 1157\\n\", \"7420738134810 103\\n\", \"99999999999030 127\\n\", \"97821761637600 71\\n\", \"1117 9\\n\", \"7... | The campus has m rooms numbered from 0 to m - 1. Also the x-mouse lives in the campus. The x-mouse is not just a mouse: each second x-mouse moves from room i to the room i β
x mod{m} (in fact, it teleports from one room to another since it doesn't visit any intermediate room). Starting position of the x-mouse is unknow... | 0 |
{"tests": "{\"inputs\": [\"3\\n13 7 6\\n6 2\\n\", \"1\\n999999999\\n499999999 1\\n\", \"10\\n1 10 100 1000 10000 100000 1000000 10000000 100000000 1000000000\\n1000000000 999999999\\n\", \"1\\n1000000000\\n333333331 3\\n\", \"1\\n999999999\\n37600609 1\\n\", \"10\\n1 10 100 1000 10000 100000 1000000 10000000 100000000 ... | After finding and moving to the new planet that supports human life, discussions started on which currency should be used. After long negotiations, Bitcoin was ultimately chosen as the universal currency.
These were the great news for Alice, whose grandfather got into Bitcoin mining in 2013, and accumulated a lot of t... | 0.375 |
{"tests": "{\"inputs\": [\"3\\n11 1 29\\n6 4 3 7 5 3 4 7 3 5 3\\n7 1 5\\n1 1 1 1 1 1 1\\n5 2 18\\n2 3 3 7 5\\n\", \"4\\n5 2 16\\n5 6 1 4 7\\n5 3 30\\n5 6 1 4 7\\n6 4 15\\n12 5 15 7 20 17\\n1 1 50\\n100\\n\", \"1\\n24 5 299954\\n99985 99985 99985 1 2 3 99999 99998 99997 99996 99995 99994 99993 99992 99991 99990 99989 99... | Polycarp has a lot of work to do. Recently he has learned a new time management rule: "if a task takes five minutes or less, do it immediately". Polycarp likes the new rule, however he is not sure that five minutes is the optimal value. He supposes that this value d should be chosen based on existing task list.
Polyca... | 0 |
{"tests": "{\"inputs\": [\"3\\n7 3\\n4 4\\n6 2\\n\", \"66\\n1 1\\n1 1\\n1 1\\n1 1\\n1 1\\n1 1\\n1 1\\n1 1\\n1 1\\n1 1\\n1 1\\n1 1\\n1 1\\n1 1\\n1 1\\n1 1\\n1 1\\n1 1\\n1 1\\n1 1\\n1 1\\n1 1\\n1 1\\n1 1\\n1 1\\n1 1\\n1 1\\n1 1\\n1 1\\n1 1\\n1 1\\n1 1\\n1 1\\n1 1\\n1 1\\n1 1\\n1 1\\n1 1\\n1 1\\n1 1\\n1 1\\n1 1\\n1 1\\n1 ... | You are given two integers n and k.
Your task is to construct such a string s of length n that for each i from 1 to k there is at least one i-th letter of the Latin alphabet in this string (the first letter is 'a', the second is 'b' and so on) and there are no other letters except these. You have to maximize the minim... | 0.875 |
{"tests": "{\"inputs\": [\"3\\n101\\n\", \"7\\n1234567\\n\", \"5\\n32333\\n\", \"9\\n110000000\\n\", \"10\\n1100000000\\n\", \"30\\n515585846397632281748827879366\\n\", \"2\\n55\\n\", \"6\\n120000\\n\", \"55\\n7368698743424489936256167465159692831962427973181294216\\n\", \"97\\n90914070008372360100799003910055582334870... | Dima worked all day and wrote down on a long paper strip his favorite number n consisting of l digits. Unfortunately, the strip turned out to be so long that it didn't fit in the Dima's bookshelf.
To solve the issue, Dima decided to split the strip into two non-empty parts so that each of them contains a positive inte... | 0.375 |
{"tests": "{\"inputs\": [\"<a><b><c></c></b></a>\\n\", \"<a><b></b><d><c></c></d></a>\\n\", \"<p><q><l></l><q><k><r><n></n></r></k></q></q><x><z></z><r><k></k></r><h></h></x><c><p></p><o></o></c><n></n><c></c></p><b><c><z></z></c><u><u>... | Let's define a string <x> as an opening tag, where x is any small letter of the Latin alphabet. Each opening tag matches a closing tag of the type </x>, where x is the same letter.
Tegs can be nested into each other: in this case one opening and closing tag pair is located inside another pair.
Let's define the notion... | 0 |
{"tests": "{\"inputs\": [\"3\\n3\\n110\\n001\\n110\\n\\n000\\n000\\n000\\n3\\n101\\n010\\n101\\n\\n010\\n101\\n010\\n2\\n01\\n11\\n\\n10\\n10\\n\", \"3\\n3\\n110\\n001\\n110\\n\\n000\\n000\\n000\\n3\\n101\\n010\\n101\\n\\n110\\n101\\n010\\n2\\n01\\n11\\n\\n10\\n10\\n\", \"3\\n3\\n111\\n001\\n110\\n\\n000\\n000\\n000\\n... | You are given two binary square matrices a and b of size n Γ n. A matrix is called binary if each of its elements is equal to 0 or 1. You can do the following operations on the matrix a arbitrary number of times (0 or more):
* vertical xor. You choose the number j (1 β€ j β€ n) and for all i (1 β€ i β€ n) do the follow... | 0 |
{"tests": "{\"inputs\": [\"zyxxxxxxyyz\\n5\\n5 5\\n1 3\\n1 11\\n1 4\\n3 6\\n\", \"zxyzxyzyyzxzzxyzxyzx\\n15\\n7 10\\n17 17\\n6 7\\n8 14\\n4 7\\n11 18\\n12 13\\n1 1\\n3 8\\n1 1\\n9 17\\n4 4\\n5 11\\n3 15\\n1 1\\n\", \"x\\n1\\n1 1\\n\", \"xxxxyyxyyzzyxyxzxyzyxzyyyzyzzxxxxzyyzzzzyxxxxzzyzzyzx\\n5\\n4 4\\n3 3\\n1 24\\n3 28... | Sereja loves all sorts of algorithms. He has recently come up with a new algorithm, which receives a string as an input. Let's represent the input string of the algorithm as q = q1q2... qk. The algorithm consists of two steps:
1. Find any continuous subsequence (substring) of three characters of string q, which does... | 0 |
{"tests": "{\"inputs\": [\"1 2 1000\\n\", \"5 3 1103\\n\", \"2 2 1000\\n\", \"886 10 902171654\\n\", \"6 64 941761822\\n\", \"712 53 592302770\\n\", \"393 71 933802677\\n\", \"56 48 961996131\\n\", \"123 72 56222855\\n\", \"312 41 915197716\\n\", \"604 97 26180786\\n\", \"497 33 479662107\\n\", \"434 6 56571287\\n\", \... | 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 > 0 exist such that:
* D... | 0 |
{"tests": "{\"inputs\": [\"2 3\\n1 2\\n\", \"6 1\\n5 1 2 3 4 1\\n\", \"10 0\\n1 1 1 1 1 1 1 1 1 1\\n\", \"5 0\\n1 1 1 1 1\\n\", \"69 25\\n68 26 8 121 96 101 106 87 103 14 86 26 76 85 70 50 4 4 97 89 44 98 33 65 76 64 98 95 30 5 93 121 97 85 47 50 66 2 46 79 46 22 68 59 75 94 104 105 91 97 121 6 32 94 101 125 32 91 76 5... | There are some beautiful girls in Arpaβs land as mentioned before.
Once Arpa came up with an obvious problem:
Given an array and a number x, count the number of pairs of indices i, j (1 β€ i < j β€ n) such that <image>, where <image> is bitwise xor operation (see notes for explanation).
<image>
Immediately, Mehrdad d... | 0.875 |
{"tests": "{\"inputs\": [\"5\\n1 3 1 3 2\\n2 5\\n3 4\\n4 5\\n1 5\\n4\\n\", \"3\\n2 1 1\\n3 2\\n1 2\\n3\\n\", \"5\\n1 3 1 1 2\\n2 5\\n4 5\\n3 4\\n1 5\\n4\\n\", \"1\\n6\\n1\\n\", \"15\\n7 5 4 1 2 4 2 8 1 7 1 3 8 2 7\\n2 3\\n8 5\\n14 5\\n4 14\\n1 5\\n10 12\\n11 8\\n15 13\\n7 5\\n13 5\\n9 8\\n3 12\\n6 12\\n5 12\\n6\\n\", \... | "Eat a beaver, save a tree!" β That will be the motto of ecologists' urgent meeting in Beaverley Hills.
And the whole point is that the population of beavers on the Earth has reached incredible sizes! Each day their number increases in several times and they don't even realize how much their unhealthy obsession with t... | 0 |
{"tests": "{\"inputs\": [\"1 2000000000\\n\", \"100 200\\n\", \"1 10\\n\", \"28 863\\n\", \"2 2\\n\", \"472069 972050\\n\", \"3779135 4194302\\n\", \"7077888 45349631\\n\", \"129140163 129140163\\n\", \"27 102036671\\n\", \"12 1999999931\\n\", \"509607936 1836660096\\n\", \"1934917632 1934917632\\n\", \"5183 25165825\\... | A positive integer is called a 2-3-integer, if it is equal to 2xΒ·3y for some non-negative integers x and y. In other words, these integers are such integers that only have 2 and 3 among their prime divisors. For example, integers 1, 6, 9, 16 and 108 β are 2-3 integers, while 5, 10, 21 and 120 are not.
Print the number... | 0.75 |
{"tests": "{\"inputs\": [\"qqqqqqqq\\n\", \"wuffuw\\n\", \"mew\\n\", \"aaadcba\\n\", \"aaabcdaaa\\n\", \"ababa\\n\", \"aaabaa\\n\", \"ybejrrlbcintahovgjddrqatv\\n\", \"aaabccbaaa\\n\", \"l\\n\", \"aabaa\\n\", \"axyza\\n\", \"aaaabcaaaa\\n\", \"aabaaaa\\n\", \"aacbca\\n\", \"ijvxljt\\n\", \"aaholaa\\n\", \"aaabbbaaa\\n\... | A string is a palindrome if it reads the same from the left to the right and from the right to the left. For example, the strings "kek", "abacaba", "r" and "papicipap" are palindromes, while the strings "abb" and "iq" are not.
A substring s[l β¦ r] (1 β€ l β€ r β€ |s|) of a string s = s_{1}s_{2} β¦ s_{|s|} is the string s_... | 0.625 |
{"tests": "{\"inputs\": [\"2\\n2 4 6\\n1 2 3\\n\\nSAMPLE\", \"2\\n2 3 6\\n1 2 3\\n\\nSAMPLE\", \"2\\n2 3 6\\n1 2 6\\n\\nSAMPLE\", \"2\\n2 4 6\\n1 4 3\\n\\nSAMPLE\", \"2\\n3 3 6\\n1 2 3\\n\\nSAMPLD\", \"2\\n2 4 6\\n1 7 3\\n\\nSAMPME\", \"2\\n3 3 6\\n1 3 3\\n\\nSAMPLD\", \"2\\n3 3 6\\n1 2 1\\n\\nSAMPLD\", \"2\\n3 3 11\\n... | Bholu the Pandit on this New Year wanted to divide his Cuboidal Packaging block into cubes.
But he loves uniformity so he asks you to divide it such a way that all the cubes are of same size and volume of individual cube is as large as possible.
Note: He will utilize whole volume i.e volume of cuboid before dividing i... | 0.875 |
{"tests": "{\"inputs\": [\"2 \\n1 6 10 11 5 \\n2 2 4 2 1\\n\\nSAMPLE\", \"2 \\n1 6 14 11 5 \\n2 2 4 2 1\\n\\nSAMPLE\", \"2 \\n1 6 14 11 5 \\n3 2 4 2 1\\n\\nSAMPLE\", \"2 \\n1 6 11 11 1 \\n3 2 4 2 1\\n\\nSAMPLE\", \"2 \\n1 6 14 11 10 \\n3 2 4 0 1\\n\\nSAMPLE\", \"2 \\n1 4 8 19 5 \\n3 2 4 2 1\\n\\nSAMPLE\", \"2 \\n1 6 14... | Bitoholic is an inhabitant of the planet Neo in a galaxy far far away. Their civilization is studies an advanced form of mathematics. However, rules of calculus are a bit different there. On his planet, integration and differentiation techniques are called alpha and beta operations respectively and are defined as:
alp... | 0.75 |
{"tests": "{\"inputs\": [\"3\\n140\\n310\\n30\\n\\nSAMPLE\", \"3\\n245\\n310\\n30\\n\\nSAMPLE\", \"3\\n245\\n260\\n30\\n\\nSAMPLE\", \"3\\n241\\n364\\n30\\n\\nSAMPLE\", \"3\\n140\\n310\\n30\\n\\nS@MPLE\", \"3\\n111\\n260\\n30\\n\\nSAMPLE\", \"3\\n241\\n205\\n30\\n\\nSAMPLE\", \"3\\n382\\n364\\n30\\n\\nSAMPLE\", \"3\\n2... | The time is 1st January 20000014 Gazu is depressed with his life as he thinks there is nothing unique about him. One day he meets a travelling coder, Gazu tells him why he is depressed, to which coder replies βEveryone is one in a zillion my brotherβ. The coder explained it like this.
Considering every man and woman m... | 0.375 |
{"tests": "{\"inputs\": [\"bixzja\\n2\\n2 3\\n3 6\", \"abc\\n1\\n2 2\", \"cassert\\n4\\n1 2\\n3 4\\n1 1\\n2 2\", \"bixzja\\n2\\n2 0\\n3 6\", \"abc\\n1\\n2 3\", \"cassert\\n4\\n1 2\\n3 4\\n1 1\\n2 0\", \"bixzja\\n1\\n2 0\\n3 6\", \"cassert\\n3\\n1 2\\n3 4\\n1 1\\n2 0\", \"bixzja\\n1\\n2 0\\n3 5\", \"cassert\\n0\\n1 2\\n... | Ringo has a string S.
He can perform the following N kinds of operations any number of times in any order.
* Operation i: For each of the characters from the L_i-th through the R_i-th characters in S, replace it with its succeeding letter in the English alphabet. (That is, replace `a` with `b`, replace `b` with `c` a... | 0 |
{"tests": "{\"inputs\": [\"ddd\", \"aab\", \"bcbc\", \"ddc\", \"aaa\", \"adad\", \"bbcc\", \"dec\", \"aa`\", \"ccbb\", \"eec\", \"aa_\", \"ccbc\", \"cee\", \"ba_\", \"cbbc\", \"ece\", \"_ab\", \"ccba\", \"eed\", \"`ab\", \"ccab\", \"dee\", \"`ba\", \"bcac\", \"eee\", \"`b`\", \"bcca\", \"dfe\", \"ab`\", \"bcc`\", \"efd... | Let x be a string of length at least 1. We will call x a good string, if for any string y and any integer k (k \geq 2), the string obtained by concatenating k copies of y is different from x. For example, `a`, `bbc` and `cdcdc` are good strings, while `aa`, `bbbb` and `cdcdcd` are not.
Let w be a string of length at l... | 0.75 |
{"tests": "{\"inputs\": [\"4\\n52 96 15 20\\n86 22 35 45\\n45 78 54 36\\n16 86 74 55\\n4\\n52 96 15 20\\n86 22 35 45\\n45 78 54 36\\n16 86 74 55\\n0\", \"4\\n52 96 15 20\\n86 22 35 45\\n45 78 54 36\\n10 86 74 55\\n4\\n52 96 15 20\\n86 22 35 45\\n45 78 54 36\\n16 86 74 55\\n0\", \"4\\n52 26 15 20\\n86 22 35 45\\n45 78 5... | Your task is to develop a tiny little part of spreadsheet software.
Write a program which adds up columns and rows of given table as shown in the following figure:
<image>
Input
The input consists of several datasets. Each dataset consists of:
n (the size of row and column of the given table)
1st row of the tab... | 0.625 |
{"tests": "{\"inputs\": [\"7\\n1 2 5\\n2 3 2\\n3 4 3\\n2 5 3\\n5 6 3\\n5 7 8\\n0\", \"7\\n1 2 5\\n2 3 2\\n3 4 3\\n2 5 3\\n5 6 5\\n5 7 8\\n0\", \"7\\n1 2 5\\n2 3 2\\n3 4 3\\n2 5 0\\n5 6 10\\n5 7 7\\n0\", \"7\\n1 2 5\\n1 3 2\\n6 4 3\\n2 5 3\\n5 6 5\\n5 7 8\\n0\", \"7\\n1 2 5\\n2 3 3\\n3 4 3\\n2 5 3\\n5 6 5\\n5 7 8\\n0\",... | Under the command "Save Sergeant Ryan," Aiz's rescue team fought fierce battles with enemy forces in the floating city of Lee, Germany. They successfully joined the sergeant, but there were many enemy tanks and they could not call a rescue herio. So, in order to confuse the enemy tanks, they decided to carry out an ope... | 0 |
{"tests": "{\"inputs\": [\"2\\n4\\n0\", \"2\\n8\\n0\", \"2\\n6\\n0\", \"2\\n2\\n0\", \"2\\n0\\n0\", \"2\\n14\\n0\", \"2\\n12\\n0\", \"2\\n10\\n0\", \"2\\n18\\n0\", \"2\\n24\\n0\", \"2\\n0\\n1\", \"2\\n0\\n-1\", \"2\\n0\\n-2\", \"2\\n0\\n2\", \"2\\n0\\n4\", \"2\\n0\\n-4\", \"2\\n0\\n0\", \"2\\n0\\n-1\", \"2\\n0\\n-2\", ... | Dr. Hedro is astonished. According to his theory, we can make sludge that can dissolve almost everything on the earth. Now he's trying to produce the sludge to verify his theory.
The sludge is produced in a rectangular solid shaped tank whose size is N Γ N Γ 2. Let coordinate of two corner points of tank be (-N/2, -N/... | 0 |
{"tests": "{\"inputs\": [\"4 7 0 2\\n0 1 abra\\n0 1 oil\\n2 0 ket\\n1 3 cada\\n3 3 da\\n3 2 bra\\n2 3 ket\\n2 2 0 1\\n0 0 a\\n0 1 b\\n5 6 3 0\\n3 1 op\\n3 2 op\\n3 4 opq\\n1 0 st\\n2 0 qr\\n4 0 r\\n2 1 0 1\\n1 1 loooop\\n0 0 0 0\", \"4 7 0 2\\n0 1 abra\\n0 1 oil\\n2 0 ket\\n1 3 cada\\n3 3 da\\n3 2 bra\\n2 3 ket\\n2 2 0... | Long long ago, there lived a wizard who invented a lot of "magical patterns." In a room where one of his magical patterns is drawn on the floor, anyone can use magic by casting magic spells! The set of spells usable in the room depends on the drawn magical pattern. Your task is to compute, for each given magical patter... | 0 |
{"tests": "{\"inputs\": [\"6\\n0 0\\n3 4\\n9 12\\n17 6\\n21 9\\n33 0\\n5\\n0 0\\n10 0\\n20 0\\n30 0\\n40 0\\n10\\n0 0\\n1 2\\n3 0\\n6 3\\n9 0\\n11 2\\n13 0\\n15 2\\n16 2\\n18 0\\n7\\n0 0\\n150 997\\n300 1\\n450 999\\n600 2\\n750 998\\n900 0\\n0\", \"6\\n0 0\\n3 4\\n9 12\\n17 6\\n21 0\\n33 0\\n5\\n0 0\\n10 0\\n20 0\\n30... | Two experienced climbers are planning a first-ever attempt: they start at two points of the equal altitudes on a mountain range, move back and forth on a single route keeping their altitudes equal, and finally meet with each other at a point on the route. A wise man told them that if a route has no point lower than the... | 0 |
{"tests": "{\"inputs\": [\"4\\n1 1 1 5\\n3 3 5 3\\n4 2 4 4\\n7 1 7 5\", \"23\\n1 1 3 1\\n3 1 3 3\\n3 3 1 3\\n1 3 1 5\\n1 5 3 5\\n5 2 7 2\\n7 2 7 4\\n7 4 5 4\\n5 4 5 6\\n5 6 7 6\\n11 4 13 4\\n13 0 15 0\\n15 0 15 4\\n18 2 18 2\\n21 5 23 5\\n21 5 21 7\\n21 7 23 7\\n23 7 23 9\\n23 9 21 9\\n24 0 26 0\\n24 0 24 4\\n24 4 26 4... | Hint
* One grid may be filled more than once
* Even if it can be represented by one line segment such as '1', it may be represented by two or more line segments.
Sample Input 1
Formula for Sample Input 1.
Sample Input 2
Sample Input 2 formula. Another character may get inside the smallest rectangle that covers one... | 0 |
{"tests": "{\"inputs\": [\"5 2\\n4\\n1 1\\n1 2\\n2 2\\n2 1\\n4\\n3 3\\n3 4\\n4 4\\n4 3\\n0 0\", \"5 2\\n4\\n1 1\\n1 2\\n2 4\\n2 1\\n4\\n3 3\\n3 4\\n4 4\\n4 3\\n0 0\", \"5 2\\n4\\n1 1\\n2 2\\n2 4\\n2 1\\n4\\n3 3\\n3 4\\n0 4\\n4 3\\n0 0\", \"5 2\\n4\\n1 1\\n1 2\\n2 2\\n2 1\\n4\\n3 3\\n3 4\\n3 4\\n4 3\\n0 0\", \"5 2\\n4\\... | Wind Corridor is a covered passageway where strong wind is always blowing. It is a long corridor of width W, and there are several pillars in it. Each pillar is a right prism and its face is a polygon (not necessarily convex).
In this problem, we consider two-dimensional space where the positive x-axis points the east... | 0 |
{"tests": "{\"inputs\": [\"2 1 3 6 12 1 2 1 2\\nRL\", \"2 1 3 6 12 1 2 1 2\\nRH\", \"39989 6 999983 999979 999961 1 1000 1 1000\\nSR 1 39989\\nSC 1 39989\\nRL\\nRH\\nRR\\nRV\", \"2 1 3 6 12 1 2 1 2\\nWR 1 1 1\", \"2 1 3 2 12 1 2 1 2\\nRL\", \"2 1 3 3 12 1 2 1 2\\nWR 1 1 1\", \"2 1 3 3 12 1 2 1 2\\nWR 2 1 1\", \"2 1 3 3... | You are a student looking for a job. Today you had an employment examination for an IT company. They asked you to write an efficient program to perform several operations. First, they showed you an N \times N square matrix and a list of operations. All operations but one modify the matrix, and the last operation output... | 0 |
{"tests": "{\"inputs\": [\"3 300\\n120 100 80\\n3 30\\n10 20 5\\n4 1000\\n100 200 300 400\\n5 5\\n2523 8430 3 4199 632\\n0 0\", \"3 300\\n120 100 80\\n3 5\\n10 20 5\\n4 1000\\n100 200 300 400\\n5 5\\n2523 8430 3 4199 632\\n0 0\", \"3 300\\n120 100 80\\n3 5\\n10 20 5\\n4 1000\\n100 260 300 400\\n5 5\\n2523 8430 3 4199 6... | Dutch treat
You have organized a party to pray for the good performance of the ICPC 2019 Yokohama Regional Domestic Qualifiers. There are N participants in this party.
Since it costs M yen in total to hold this party, we decided to collect M / N yen from each of the N participants. Since M is divisible by N, there is... | 0 |
{"tests": "{\"inputs\": [\"5 16\\n5 5 5 5 5\\n\", \"5 15\\n5 5 5 5 5\\n\", \"5 26\\n5 5 5 5 5\\n\", \"7 10\\n1 3 4 2 1 4 2\\n\", \"5 8\\n2 3 1 1 2\\n\", \"100 686\\n18 25 67 51 38 62 52 81 51 74 16 90 13 67 47 91 23 70 10 34 48 38 82 48 31 79 76 12 41 84 7 22 95 62 69 26 18 2 18 18 22 11 96 39 83 22 65 36 26 37 88 10 5... | The only difference between easy and hard versions is the constraints.
Polycarp has to write a coursework. The coursework consists of m pages.
Polycarp also has n cups of coffee. The coffee in the i-th cup has a_i caffeine in it. Polycarp can drink some cups of coffee (each one no more than once). He can drink cups i... | 0.125 |
{"tests": "{\"inputs\": [\"5\\n1 2 4 0 2\\n\", \"9\\n5 1 3 6 8 2 9 0 10\\n\", \"8\\n3 2 0 1 0 1 2 3\\n\", \"6\\n5 1 4 2 6 3\\n\", \"7\\n3 2 0 1 0 1 2\\n\", \"8\\n0 9 7 5 8 6 9 3\\n\", \"6\\n1 2 100 3 101 4\\n\", \"5\\n1 4 2 5 3\\n\", \"12\\n12 8 1 3 7 5 9 6 4 10 11 2\\n\", \"1\\n1337\\n\", \"12\\n11 2 1 3 5 8 9 10 7 6 ... | Two integer sequences existed initially, one of them was strictly increasing, and another one β strictly decreasing.
Strictly increasing sequence is a sequence of integers [x_1 < x_2 < ... < x_k]. And strictly decreasing sequence is a sequence of integers [y_1 > y_2 > ... > y_l]. Note that the empty sequence and the s... | 0 |
{"tests": "{\"inputs\": [\"5 3\\n4 2 1 3 2\\n3 5\\n4 2\\n2 5\\n\", \"5 6\\n1 2 0 2 0\\n2 4\\n3 3\\n1 5\\n1 2\\n1 5\\n2 3\\n\", \"10 47\\n1 0 0 1 2 1 1 3 1 3\\n4 9\\n15 5\\n6 2\\n4 1\\n23 3\\n9 10\\n12 2\\n5 10\\n2 4\\n2 4\\n18 4\\n23 5\\n17 1\\n22 3\\n24 4\\n20 5\\n7 3\\n17 10\\n3 10\\n12 10\\n4 6\\n3 10\\n24 2\\n12 1\... | The only difference between easy and hard versions is constraints.
Ivan plays a computer game that contains some microtransactions to make characters look cooler. Since Ivan wants his character to be really cool, he wants to use some of these microtransactions β and he won't start playing until he gets all of them.
E... | 0 |
{"tests": "{\"inputs\": [\"3 2\\n\", \"5 3\\n\\n4\\n\\n0\\n\\n1\\n\", \"3 1\\n949490681 476940754 49124973\\n\", \"3 2\\n1 2 3\\n\", \"16 16\\n308016736 956290215 528410265 714807573 549801784 640036314 72785399 243731193 64286020 242735735 652383284 747302261 133040055 523901569 310398221 592433960\\n\", \"2 1\\n76977... | This is an interactive problem.
Note: the XOR-sum of an array a_1, a_2, β¦, a_n (1 β€ a_i β€ 10^9) is defined as a_1 β a_2 β β¦ β a_n, where β denotes the [bitwise XOR operation](https://en.wikipedia.org/wiki/Bitwise_operation#XOR).
Little Dormi received an array of n integers a_1, a_2, β¦, a_n for Christmas. However, whi... | 0 |
{"tests": "{\"inputs\": [\"7\\n\", \"321\\n\", \"8\\n\", \"700\\n\", \"624\\n\", \"10\\n\", \"9\\n\", \"776\\n\", \"666\\n\", \"777\\n\", \"606\\n\", \"369\\n\", \"36\\n\", \"14\\n\", \"17\\n\", \"298\\n\", \"475\\n\", \"22\\n\", \"25\\n\", \"315\\n\", \"64\\n\", \"35\\n\", \"28\\n\", \"19\\n\", \"33\\n\", \"38\\n\", \... | One company of IT City decided to create a group of innovative developments consisting from 5 to 7 people and hire new employees for it. After placing an advertisment the company received n resumes. Now the HR department has to evaluate each possible group composition and select one of them. Your task is to count the n... | 0.75 |
{"tests": "{\"inputs\": [\"7\\n4 4\\n4 4\\n4 4\\n4 4\\n4 4\\n4 4\\n5 5\\n\", \"7\\n14000000003 1000000000000000000\\n81000000000 88000000000\\n5000000000 7000000000\\n15000000000 39000000000\\n46000000000 51000000000\\n0 1000000000\\n0 0\\n\", \"8\\n20 1000\\n32 37\\n40 1000\\n45 50\\n16 16\\n16 16\\n14 1000\\n2 1000\\... | One tradition of ACM-ICPC contests is that a team gets a balloon for every solved problem. We assume that the submission time doesn't matter and teams are sorted only by the number of balloons they have. It means that one's place is equal to the number of teams with more balloons, increased by 1. For example, if there ... | 0 |
{"tests": "{\"inputs\": [\"10 6\\n2 -5 1 3 0 0 -4 -3 1 0\\n\", \"4 2\\n-5 20 -3 0\\n\", \"4 3\\n-5 20 -3 0\\n\", \"2 0\\n-12 -13\\n\", \"7 3\\n-2 -14 3 -17 -20 -13 -17\\n\", \"50 3\\n6 20 17 19 15 17 3 17 5 16 20 18 9 19 18 18 2 -3 11 11 5 15 4 18 16 16 19 11 20 17 2 1 11 14 18 -8 13 17 19 9 9 20 19 20 19 5 12 19 6 9\\... | The winter in Berland lasts n days. For each day we know the forecast for the average air temperature that day.
Vasya has a new set of winter tires which allows him to drive safely no more than k days at any average air temperature. After k days of using it (regardless of the temperature of these days) the set of win... | 0 |
{"tests": "{\"inputs\": [\"2 5 4 6 1 3 6 2 5 5 1 2 3 5 3 1 1 2 4 6 6 4 3 4\\n\", \"5 3 5 3 2 5 2 5 6 2 6 2 4 4 4 4 1 1 1 1 6 3 6 3\\n\", \"3 3 3 3 4 4 5 5 1 1 1 1 2 2 4 4 5 5 6 6 6 6 2 2\\n\", \"3 6 5 4 4 6 1 4 3 2 5 2 1 2 6 2 5 4 1 3 1 6 5 3\\n\", \"4 5 4 4 3 3 1 2 3 1 1 5 2 2 5 6 6 4 3 2 6 5 1 6\\n\", \"6 6 1 2 6 1 1... | During the breaks between competitions, top-model Izabella tries to develop herself and not to be bored. For example, now she tries to solve Rubik's cube 2x2x2.
It's too hard to learn to solve Rubik's cube instantly, so she learns to understand if it's possible to solve the cube in some state using 90-degrees rotation... | 0 |
{"tests": "{\"inputs\": [\"3\\n\\nSAMPLE\", \"3\\n\\nSAMPKE\", \"3\\n\\nSAMPKD\", \"3\\n\\nSAMOKD\", \"3\\n\\nSAMDKO\", \"3\\n\\nSADMKO\", \"3\\n\\nTADMKO\", \"3\\n\\nTADMJO\", \"3\\n\\nTADNJO\", \"3\\n\\nT@DNJO\", \"3\\n\\nT@DNJN\", \"3\\n\\nJ@DNTN\", \"3\\n\\nJ@DMTN\", \"3\\n\\nI@DMTN\", \"3\\n\\nI@DTMN\", \"3\\n\\nI... | Rani has challenged Nandu to generate Splendid Matrices. Splendid matrices are square matrices with dimensions 2^n X 2^n filled in a particular manner. To explain this manner, Rani gives Nandu the matrices for n=1, n=2 and n=3 :
n=1
1 2
3 4
n=2 (spacing for clarity)
1 2 5 6
3 4 7 8
9 10 13 14
11 12 15 16
n=3... | 0.25 |
{"tests": "{\"inputs\": [\"5 5\\n1 2\\n2 3\\n3 4\\n2 5\\n4 5\", \"4 4\\n1 2\\n2 3\\n3 4\\n4 1\", \"5 5\\n1 2\\n2 3\\n3 4\\n3 5\\n4 5\", \"10 2\\n1 2\\n1 3\\n0 4\\n3 5\\n4 5\", \"7 2\\n1 2\\n2 3\\n0 2\\n3 5\\n4 5\", \"5 5\\n1 1\\n2 3\\n3 4\\n3 5\\n4 5\", \"5 5\\n1 1\\n2 3\\n4 4\\n3 5\\n4 5\", \"5 5\\n1 2\\n2 3\\n4 4\\n3... | You are given a simple connected undirected graph with N vertices and M edges. The vertices are numbered 1 to N, and the i-th edge connects Vertex A_i and Vertex B_i. Takahashi will assign one of the two possible directions to each of the edges in the graph to make a directed graph. Determine if it is possible to make ... | 0.375 |
{"tests": "{\"inputs\": [\"1 2\\n8 8\\n0 0\\n0 1\\n3 3\\n1 2 5\\n2 8 3\\n0 1 2\\n0 0\\n2 2\\n3 3\\n1 2 5\\n2 8 3\\n0 1 2\\n0 0\\n1 2\\n2 2\\n1 2\\n3 4\\n0 0\\n0 1\\n2 3\\n1 2 3\\n4 5 6\\n0 0\\n1 2\\n0 0\", \"1 2\\n8 8\\n0 0\\n0 1\\n3 3\\n1 2 5\\n2 8 3\\n0 1 2\\n0 0\\n2 2\\n3 3\\n1 2 5\\n2 8 6\\n0 1 2\\n0 0\\n1 2\\n2 2\... | The north country is conquered by the great shogun-sama (which means king). Recently many beautiful dice which were made by order of the great shogun-sama were given to all citizens of the country. All citizens received the beautiful dice with a tear of delight. Now they are enthusiastically playing a game with the dic... | 0 |
{"tests": "{\"inputs\": [\"3\\n49 50 87 78 41\\n27 61 100 45 84\\n28 88 40 95 66\\n2\\n100 100 100 100 100\\n0 0 0 0 0\\n1\\n89 90 85 93 82\\n0\", \"2\\n100 100 100 100 100\\n0 0 0 0 0\", \"1\\n89 90 85 93 82\", \"3\\n49 50 87 78 41\\n27 61 100 45 84\\n28 88 40 95 66\", \"3\\n49 50 87 78 41\\n27 61 100 45 84\\n28 36 40... | Yui Hirasawa, who attends private Sakuragaoka Girls' High School, has to make a career hope by the day after tomorrow, but the trouble is that she hasn't decided anything yet. When I consulted with my friend Wa, I knew that my first choice was K University, so I consulted with my career guidance teacher to see if I cou... | 0 |
{"tests": "{\"inputs\": [\"2 1\\n7 5\\n7 6\\n7 7\\n76 5\\n8 41\\n0 0\", \"2 1\\n7 6\\n7 6\\n7 7\\n76 5\\n8 41\\n0 0\", \"1 1\\n7 5\\n7 6\\n7 7\\n76 5\\n8 41\\n0 0\", \"2 1\\n7 6\\n7 6\\n7 7\\n76 3\\n8 41\\n0 0\", \"2 1\\n7 6\\n7 6\\n7 3\\n76 3\\n8 41\\n0 0\", \"2 1\\n7 6\\n7 6\\n7 3\\n76 3\\n11 41\\n0 0\", \"2 1\\n7 5\... | Koto Municipal Subway
Koto Municipal Subway
Koto City is a famous city whose roads are in a grid pattern, as shown in the figure below. The roads extending from north to south and the roads extending from east to west are lined up at intervals of 1 km each. Let Koto station at the southwestern intersection of Koto ci... | 0.75 |
{"tests": "{\"inputs\": [\"4\\n1 2\\n1 3\\n3 4\\n0 3 2 0\\n-3 4 5 -1\", \"4\\n1 2\\n1 3\\n1 4\\n0 3 2 0\\n-3 4 5 -1\", \"4\\n1 2\\n2 3\\n1 4\\n0 3 2 0\\n-3 4 5 -1\", \"4\\n1 2\\n1 4\\n3 4\\n0 3 2 0\\n-3 4 5 -1\", \"4\\n1 2\\n1 3\\n1 4\\n0 4 2 0\\n-3 4 5 -1\", \"4\\n1 2\\n2 3\\n1 4\\n0 3 2 0\\n-3 2 5 -1\", \"4\\n1 2\\n1... | Problem statement
There is a tree consisting of $ N $ vertices $ N-1 $ edges, and the $ i $ th edge connects the $ u_i $ and $ v_i $ vertices.
Each vertex has a button, and the button at the $ i $ th vertex is called the button $ i $.
First, the beauty of the button $ i $ is $ a_i $.
Each time you press the button ... | 0 |
{"tests": "{\"inputs\": [\"2\\n\\n0\\n\\n-1\", \"-1\\n1000000000\\n\", \"-1\\n3032485242972588\\n\", \"-1\\n3390435124564596\\n\", \"-1\\n520825450746127\\n\", \"-1\\n8802767625702528\\n\", \"-1\\n544868732745086\\n\", \"-1\\n3\\n\", \"-1\\n100\\n\", \"-1\\n8878530174845145\\n\", \"-1\\n10004205361450469\\n\", \"-1\\n3... | This problem is interactive.
You should guess hidden number x which is between 1 and M = 10004205361450474, inclusive.
You could use up to 5 queries.
In each query, you can output an increasing sequence of k β€ x integers, each between 1 and M, inclusive, and you will obtain one of the following as an answer:
* ei... | 0 |
{"tests": "{\"inputs\": [\"5 6 4 14\\n1 2 3 4 5\\n1 5 2\\n1 2 5\\n2 3 5\\n3 5 3\\n\", \"22 4 33 11\\n35 58 48 7 5 19 18 50 56 6 38 3 4 30 29 35 37 22 57 15 53 5\\n1 1 58\\n3 4 34\\n4 4 42\\n3 3 54\\n2 4 12\\n4 4 50\\n2 2 18\\n3 4 35\\n1 2 15\\n4 4 35\\n1 3 2\\n4 4 18\\n3 3 5\\n1 4 5\\n2 2 57\\n4 4 60\\n1 3 2\\n1 4 38\\... | You are playing a computer game, where you lead a party of m soldiers. Each soldier is characterised by his agility a_i.
The level you are trying to get through can be represented as a straight line segment from point 0 (where you and your squad is initially located) to point n + 1 (where the boss is located).
The le... | 0 |
{"tests": "{\"inputs\": [\"5\\na\\nabcdfdcecba\\nabbaxyzyx\\ncodeforces\\nacbba\\n\", \"1\\nadaaaecabaaacgaeaacigabaabacaa\\n\", \"1\\nwxclhkkhlcxwuzpxjlljxpzu\\n\", \"1\\naixprmmrpxiawxwlaccalwxw\\n\", \"1\\noaaaigaakaaaakaagiaaaozavgbaaloaibbiaolaabgvaz\\n\", \"1\\njtnvmzzmvntjmbrocppcorbm\\n\", \"1\\navcbkhaaaabbaaa... | This is the hard version of the problem. The difference is the constraint on the sum of lengths of strings and the number of test cases. You can make hacks only if you solve all versions of this task.
You are given a string s, consisting of lowercase English letters. Find the longest string, t, which satisfies the fol... | 0 |
{"tests": "{\"inputs\": [\"2\\n4 4\\n1 1 1 1\\n4 1 -3 -1\\n1 2\\n1 3\\n1 4\\n3 13\\n3 3 7\\n13 1 4\\n1 2\\n1 3\\n\", \"2\\n7 4\\n1 0 1 1 0 1 0\\n4 0 0 -1 0 -1 0\\n1 2\\n1 3\\n1 4\\n3 5\\n3 6\\n3 7\\n5 11\\n1 2 5 2 1\\n-11 -2 -6 -2 -1\\n1 2\\n1 3\\n1 4\\n3 5\\n\", \"2\\n7 4\\n1 0 1 1 0 1 0\\n4 0 0 -1 0 -1 0\\n1 2\\n1 3\... | Uncle Bogdan is in captain Flint's crew for a long time and sometimes gets nostalgic for his homeland. Today he told you how his country introduced a happiness index.
There are n cities and nβ1 undirected roads connecting pairs of cities. Citizens of any city can reach any other city traveling by these roads. Cities a... | 0.25 |
{"tests": "{\"inputs\": [\"2 5 2\\n-G-R-\\n-R-G-\\n\", \"2 3 1\\n-R-\\n-G-\\n\", \"3 3 2\\nG-R\\nR-G\\nG-R\\n\", \"2 3 1\\nR-G\\nRG-\\n\", \"8 53 4\\n------------------------------------G-------------R--\\n-----------G--R--------------------------------------\\n----------------------------------GR-----------------\\n--... | Having learned (not without some help from the Codeforces participants) to play the card game from the previous round optimally, Shrek and Donkey (as you may remember, they too live now in the Kingdom of Far Far Away) have decided to quit the boring card games and play with toy soldiers.
The rules of the game are as f... | 0 |
{"tests": "{\"inputs\": [\"3\\n1 2\\n1\\n3 4\\n3 2\\n1 3 4\\n2 4\\n9 14\\n2 7 16 28 33 57 59 86 99\\n3 9 14 19 25 26 28 35 41 59 85 87 99 100\\n\", \"3\\n1 2\\n1\\n3 4\\n3 2\\n1 3 4\\n2 4\\n9 14\\n2 7 16 28 33 57 59 92 99\\n3 9 14 19 25 26 28 35 41 59 85 87 99 100\\n\", \"3\\n1 2\\n1\\n1 4\\n3 2\\n1 3 4\\n2 4\\n9 14\\n... | Gildong's town has a train system that has 100 trains that travel from the bottom end to the top end and 100 trains that travel from the left end to the right end. The trains starting from each side are numbered from 1 to 100, respectively, and all trains have the same speed. Let's take a look at the picture below.
<i... | 0.875 |
{"tests": "{\"inputs\": [\"3\\n1 9\\n2 1\\n4 1\\n\", \"6\\n4 2\\n8 4\\n3 0\\n2 3\\n7 1\\n0 1\\n\", \"3\\n7 2\\n8 1\\n0 1\\n\", \"3\\n143757750 43097231\\n509800305 187308871\\n29994173 572950383\\n\", \"30\\n59 1\\n59 2\\n50 5\\n61 0\\n76 98\\n60 1\\n17 1\\n3 10\\n72 38\\n75 90\\n16 5\\n80 6\\n57 0\\n47 12\\n34 13\\n61... | There are n cities numbered from 1 to n, and city i has beauty a_i.
A salesman wants to start at city 1, visit every city exactly once, and return to city 1.
For all iβ j, a flight from city i to city j costs max(c_i,a_j-a_i) dollars, where c_i is the price floor enforced by city i. Note that there is no absolute val... | 0 |
{"tests": "{\"inputs\": [\"AERLAND DERLAND 2:1\\nDERLAND CERLAND 0:3\\nCERLAND AERLAND 0:1\\nAERLAND BERLAND 2:0\\nDERLAND BERLAND 4:0\\n\", \"AERLAND DERLAND 2:2\\nDERLAND CERLAND 2:3\\nCERLAND AERLAND 1:3\\nAERLAND BERLAND 2:1\\nDERLAND BERLAND 4:1\\n\", \"CRWEYDMET BERLAND 6:2\\nJ CRWEYDMET 5:4\\nLYUTZZCGW BERLAND 8... | Any resemblance to any real championship and sport is accidental.
The Berland National team takes part in the local Football championship which now has a group stage. Let's describe the formal rules of the local championship:
* the team that kicked most balls in the enemy's goal area wins the game;
* the victor... | 0 |
{"tests": "{\"inputs\": [\"21 5\\n\", \"5 2\\n\", \"87783 3\\n\", \"1000000000 3\\n\", \"1 1000\\n\", \"137 2\\n\", \"780787655 29\\n\", \"1 2\\n\", \"172285923 26\\n\", \"567886500 9\\n\", \"989464701 4\\n\", \"764747 6\\n\", \"900077555 2\\n\", \"980345678 19\\n\", \"980765665 7\\n\", \"1 3\\n\", \"76754 2\\n\", \"30... | Numbers k-bonacci (k is integer, k > 1) are a generalization of Fibonacci numbers and are determined as follows:
* F(k, n) = 0, for integer n, 1 β€ n < k;
* F(k, k) = 1;
* F(k, n) = F(k, n - 1) + F(k, n - 2) + ... + F(k, n - k), for integer n, n > k.
Note that we determine the k-bonacci numbers, F(k, n), on... | 0 |
{"tests": "{\"inputs\": [\"1 5\\n\", \"3 6\\n\", \"32768 65536\\n\", \"2 3\\n\", \"1 100000\\n\", \"65535 65536\\n\", \"1 99989\\n\", \"1 1\\n\", \"100 24\\n\", \"1 8\\n\", \"99961 99971\\n\", \"3 65536\\n\", \"6 8\\n\", \"512 2\\n\", \"1 65535\\n\", \"100000 1\\n\", \"3 99929\\n\", \"4 65536\\n\", \"10 5\\n\", \"98812... | One industrial factory is reforming working plan. The director suggested to set a mythical detail production norm. If at the beginning of the day there were x details in the factory storage, then by the end of the day the factory has to produce <image> (remainder after dividing x by m) more details. Unfortunately, no c... | 0.375 |
{"tests": "{\"inputs\": [\"4 7 7 4\\n\", \"2 1 2 2\\n\", \"2 0 0 2\\n\", \"0 2 0 1\\n\", \"13118 79593 32785 22736\\n\", \"0 2 2 0\\n\", \"10 0 0 10\\n\", \"9 0 8 0\\n\", \"34750 34886 34751 44842\\n\", \"50042 34493 84536 17892\\n\", \"0 1 1 0\\n\", \"4 5 5 5\\n\", \"2 2 1 2\\n\", \"67949 70623 71979 70623\\n\", \"433... | Polycarp and Vasiliy love simple logical games. Today they play a game with infinite chessboard and one pawn for each player. Polycarp and Vasiliy move in turns, Polycarp starts. In each turn Polycarp can move his pawn from cell (x, y) to (x - 1, y) or (x, y - 1). Vasiliy can move his pawn from (x, y) to one of cells: ... | 0 |
{"tests": "{\"inputs\": [\"4\\n1 -5 1 1\\n1 2\\n1 4\\n2 3\\n\", \"8\\n0 5 -1 4 3 2 6 5\\n1 2\\n2 4\\n2 5\\n1 3\\n3 6\\n6 7\\n6 8\\n\", \"1\\n-1\\n\", \"10\\n4 -4 2 5 -1 3 -1 1 4 5\\n1 8\\n7 1\\n4 1\\n9 6\\n1 2\\n5 10\\n10 1\\n9 3\\n1 9\\n\", \"10\\n-1000000000 -1000000000 -1000000000 -1000000000 -1000000000 -1000000000... | Generous sponsors of the olympiad in which Chloe and Vladik took part allowed all the participants to choose a prize for them on their own. Christmas is coming, so sponsors decided to decorate the Christmas tree with their prizes.
They took n prizes for the contestants and wrote on each of them a unique id (integer f... | 0.125 |
{"tests": "{\"inputs\": [\"5\\n4 5 1 2 3\\n\", \"3\\n3 1 2\\n\", \"100\\n98 52 63 2 18 96 31 58 84 40 41 45 66 100 46 71 26 48 81 20 73 91 68 76 13 93 17 29 64 95 79 21 55 75 19 85 54 51 89 78 15 87 43 59 36 1 90 35 65 56 62 28 86 5 82 49 3 99 33 9 92 32 74 69 27 22 77 16 44 94 34 6 57 70 23 12 61 25 8 11 67 47 83 88 1... | According to an old legeng, a long time ago Ankh-Morpork residents did something wrong to miss Fortune, and she cursed them. She said that at some time n snacks of distinct sizes will fall on the city, and the residents should build a Snacktower of them by placing snacks one on another. Of course, big snacks should be ... | 0 |
{"tests": "{\"inputs\": [\"10\\nmihail\\noolyana\\nkooooper\\nhoon\\nulyana\\nkoouper\\nmikhail\\nkhun\\nkuooper\\nkkkhoon\\n\", \"9\\nhariton\\nhkariton\\nbuoi\\nkkkhariton\\nboooi\\nbui\\nkhariton\\nboui\\nboi\\n\", \"2\\nalex\\nalex\\n\", \"40\\noooo\\nhu\\no\\nhoh\\nkhk\\nuuh\\nhu\\nou\\nuuoh\\no\\nkouk\\nuouo\\nu\... | There are some ambiguities when one writes Berland names with the letters of the Latin alphabet.
For example, the Berland sound u can be written in the Latin alphabet as "u", and can be written as "oo". For this reason, two words "ulyana" and "oolyana" denote the same name.
The second ambiguity is about the Berland s... | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.