Search is not available for this dataset
problem_id
stringlengths 32
32
| name
stringlengths 2
112
| problem
stringlengths 200
14k
| test_cases
stringlengths 33
79.2M
| difficulty
stringclasses 33
values | language
sequencelengths 1
1
| source
stringclasses 14
values | num_solutions
int64 2
1.9M
| starter_code
stringlengths 0
1.47k
| subset
stringclasses 3
values |
|---|---|---|---|---|---|---|---|---|---|
48dea5d3b269153c9936806a0c9b97dc | Perfect Encoding | You are working as an analyst in a company working on a new system for big data storage. This system will store $n$ different objects. Each object should have a unique ID.
To create the system, you choose the parameters of the system — integers $m \ge 1$ and $b_{1}, b_{2}, \ldots, b_{m}$. With these parameters an ID of some object in the system is an array of integers $[a_{1}, a_{2}, \ldots, a_{m}]$ where $1 \le a_{i} \le b_{i}$ holds for every $1 \le i \le m$.
Developers say that production costs are proportional to $\sum_{i=1}^{m} b_{i}$. You are asked to choose parameters $m$ and $b_{i}$ so that the system will be able to assign unique IDs to $n$ different objects and production costs are minimized. Note that you don't have to use all available IDs.
In the only line of input there is one positive integer $n$. The length of the decimal representation of $n$ is no greater than $1.5 \cdot 10^{6}$. The integer does not contain leading zeros.
Print one number — minimal value of $\sum_{i=1}^{m} b_{i}$.
Sample Input
36
37
12345678901234567890123456789
Sample Output
10
11
177
| {"inputs": ["36", "37", "12345678901234567890123456789", "1", "2", "3", "4", "7421902501252475186372406731932548506197390793597574544727433297197476846519276598727359617092494798", "71057885893313745806894531138592341136175030511382512555364579061229040750815096670263802546201989828165866147027119861863385397179695224216202346062872417111920113483747119385957051753101263769591892062039112567316036455789217245754461225443096439906225767290690128677713047690686004149082311677134836383178262318973298581951974863511315252485252083010690948164456205330279738760034861583874764199950445592461479109814313530332776429627014232776723160331462731018692207739471347664936326394313671025", "515377520732011331036461129765621272702107522001", "515377520732011331036461129765621272702107522002", "515377520732011331036461129765621272702107522000", "2644141638961613273780910519504288731930844065504296335329840736453657194693409799081556627701216123927819555393745164711901909164201237823730685450515907348055240450396641607756029548457929682548780800235177236082257895631246188876123132346108173348981012356250960688811094108794077791634930736509832272441660537127557164580456832796615775793837112808169797875218746484343692719877391033530037881176218120852179342877728205628700771297494331664021228732264346205537805710440002"], "outputs": ["10", "11", "177", "1", "2", "3", "4", "629", "3144", "300", "301", "300", "3002"]} | UNKNOWN | [
"PYTHON3"
] | CODEFORCES | 2 | codeforces |
|
48e78a1eb2688cd13b05a10a8592caf5 | The Last Fight Between Human and AI | 100 years have passed since the last victory of the man versus computer in Go. Technologies made a huge step forward and robots conquered the Earth! It's time for the final fight between human and robot that will decide the faith of the planet.
The following game was chosen for the fights: initially there is a polynomial
Polynomial *P*(*x*) is said to be divisible by polynomial *Q*(*x*) if there exists a representation *P*(*x*)<==<=*B*(*x*)*Q*(*x*), where *B*(*x*) is also some polynomial.
Some moves have been made already and now you wonder, is it true that human can guarantee the victory if he plays optimally?
The first line of the input contains two integers *n* and *k* (1<=≤<=*n*<=≤<=100<=000,<=|*k*|<=≤<=10<=000) — the size of the polynomial and the integer *k*.
The *i*-th of the following *n*<=+<=1 lines contain character '?' if the coefficient near *x**i*<=-<=1 is yet undefined or the integer value *a**i*, if the coefficient is already known (<=-<=10<=000<=≤<=*a**i*<=≤<=10<=000). Each of integers *a**i* (and even *a**n*) may be equal to 0.
Please note, that it's not guaranteed that you are given the position of the game where it's computer's turn to move.
Print "Yes" (without quotes) if the human has winning strategy, or "No" (without quotes) otherwise.
Sample Input
1 2
-1
?
2 100
-10000
0
1
4 5
?
1
?
1
?
Sample Output
Yes
YesNo | {"inputs": ["1 2\n-1\n?", "2 100\n-10000\n0\n1", "4 5\n?\n1\n?\n1\n?", "68 -9959\n-3666\n-3501\n9169\n5724\n1478\n-643\n-3039\n-5537\n-4295\n-1856\n-6720\n6827\n-39\n-9509\n-7005\n1942\n-5173\n-4564\n2390\n4604\n-6098\n-9847\n-9708\n2382\n7421\n8716\n9718\n9895\n-4553\n-8275\n4771\n1538\n-8131\n9912\n-4334\n-3702\n7035\n-106\n-1298\n-6190\n1321\n332\n7673\n-5336\n5141\n-2289\n-1748\n-3132\n-4454\n-2357\n2661\n2756\n-9964\n2859\n-1277\n-259\n-2472\n-9222\n2316\n-6965\n-7811\n-8158\n-9712\n105\n-960\n-1058\n9264\n-7353\n-2555", "5 10\n5400\n-900\n-1014\n325\n-32\n1", "5 -6\n-5400\n-2700\n414\n151\n-26\n1", "10 100\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n?", "9 100\n0\n0\n0\n0\n0\n0\n0\n0\n0\n?", "4 0\n0\n-10000\n10000\n-10000\n10000", "5 3\n?\n?\n?\n?\n?\n?", "4 4\n?\n?\n?\n?\n?", "5 6\n-5400\n-2700\n414\n151\n-26\n1", "5 10\n30\n27\n-53\n5\n-10\n1", "64 4\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n1", "3 0\n5\n3\n?\n13", "4 0\n?\n10000\n-10000\n15\n?", "4 0\n0\n3\n?\n13\n?", "5 0\n?\n-123\n534\n?\n?\n?", "1 10000\n?\n?", "1 10000\n0\n0", "1 10000\n?\n0", "7 10000\n0\n0\n0\n0\n0\n0\n0\n10000", "32 2\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n1", "64 2\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n1", "100 100\n1\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0", "1 0\n1\n?", "2 0\n0\n?\n?", "18 10\n3\n2\n4\n0\n0\n0\n0\n0\n0\n6\n5\n0\n0\n0\n0\n0\n0\n0\n1", "17 10\n3\n6\n0\n0\n0\n0\n0\n0\n7\n9\n0\n0\n0\n0\n0\n0\n0\n1", "3 0\n1\n?\n?\n?", "2 0\n?\n?\n1", "1 0\n-1\n?", "17 10\n1\n1\n2\n4\n2\n0\n3\n6\n8\n3\n7\n1\n9\n8\n2\n3\n2\n1", "18 16\n13\n0\n7\n3\n5\n12\n11\n3\n15\n2\n13\n12\n12\n1\n3\n2\n13\n2\n1", "1 0\n?\n?", "102 31\n-1\n4\n-6\n3\n2\n-1\n-4\n7\n-4\n-1\n-1\n3\n4\n2\n1\n-7\n7\n2\n-4\n4\n5\n-4\n-4\n3\n1\n7\n-2\n9\n-6\n-12\n-9\n-1\n6\n3\n-6\n-1\n-7\n0\n-3\n0\n0\n-1\n4\n-4\n2\n-5\n4\n-6\n3\n-2\n-7\n-1\n7\n5\n1\n2\n-8\n1\n-1\n0\n-5\n-7\n1\n6\n7\n4\n5\n-4\n-3\n-3\n1\n-2\n-2\n1\n-5\n-1\n0\n4\n-1\n0\n0\n-1\n-1\n-5\n-6\n0\n-3\n0\n5\n4\n10\n-4\n-2\n6\n-6\n7\n3\n0\n8\n-4\n1\n4\n5", "26 10\n8\n2\n7\n7\n7\n7\n7\n0\n2\n6\n8\n5\n7\n9\n1\n1\n0\n3\n5\n5\n3\n2\n1\n0\n0\n0\n1", "53 10\n1\n1\n5\n8\n3\n2\n9\n9\n6\n2\n8\n7\n0\n3\n1\n2\n3\n1\n4\n3\n9\n5\n8\n4\n2\n0\n9\n0\n8\n5\n4\n5\n3\n2\n4\n2\n9\n8\n4\n9\n3\n1\n2\n9\n2\n3\n0\n2\n0\n9\n2\n4\n7\n1", "84 10\n9\n9\n1\n5\n7\n1\n9\n0\n9\n0\n2\n1\n4\n2\n8\n7\n5\n2\n4\n6\n1\n4\n2\n2\n1\n7\n6\n9\n0\n6\n4\n0\n3\n8\n9\n8\n3\n4\n0\n0\n4\n5\n2\n5\n7\n1\n9\n2\n1\n0\n0\n0\n2\n3\n6\n7\n1\n3\n1\n4\n6\n9\n5\n4\n8\n9\n2\n6\n8\n6\n4\n2\n0\n7\n3\n7\n9\n8\n3\n9\n1\n4\n7\n0\n1", "44 10\n9\n5\n1\n4\n5\n0\n9\n7\n8\n7\n1\n5\n2\n9\n1\n6\n9\n6\n0\n6\n3\n6\n7\n8\n7\n4\n2\n2\n9\n5\n4\n4\n5\n2\n3\n7\n7\n2\n4\n0\n3\n1\n8\n9\n5", "18 10\n3\n6\n0\n0\n0\n0\n0\n0\n0\n6\n1\n0\n0\n0\n0\n0\n0\n0\n1", "100 10000\n427\n5059\n4746\n3792\n2421\n1434\n4381\n9757\n9891\n45\n7135\n933\n8193\n805\n5369\n8487\n5065\n4881\n4459\n4228\n8920\n5272\n7420\n5685\n4612\n2641\n6890\n2826\n2318\n6590\n4634\n5534\n9709\n3951\n3604\n8736\n1303\n9939\n5769\n3690\n6163\n2136\n5933\n4906\n9187\n808\n7153\n5830\n2599\n6141\n5544\n7001\n7919\n205\n4770\n1869\n2840\n6\n100\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0", "19 10\n-6\n-1\n-6\n-1\n-5\n-5\n-9\n0\n-7\n-3\n-7\n0\n-4\n-4\n-7\n-6\n-4\n-4\n-8\n-1", "100 10000\n9137\n5648\n7125\n5337\n4138\n5127\n3419\n7396\n9781\n6103\n3941\n9511\n9183\n4193\n7945\n52\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0", "2 0\n?\n1\n?", "30 1000\n564\n146\n187\n621\n589\n852\n981\n874\n602\n667\n263\n721\n246\n93\n992\n868\n168\n521\n618\n471\n511\n876\n742\n810\n899\n258\n172\n177\n523\n417\n68", "30 1000\n832\n350\n169\n416\n972\n507\n385\n86\n581\n80\n59\n281\n635\n507\n86\n639\n257\n738\n325\n285\n688\n20\n263\n763\n443\n467\n952\n928\n590\n876\n13", "1 0\n?\n1", "100 2\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n-1", "6 1000\n63\n0\n0\n16\n0\n0\n1"], "outputs": ["Yes", "Yes", "No", "No", "Yes", "No", "No", "Yes", "Yes", "Yes", "No", "Yes", "Yes", "No", "No", "Yes", "Yes", "No", "Yes", "Yes", "Yes", "No", "No", "No", "No", "No", "Yes", "No", "No", "No", "Yes", "No", "No", "No", "No", "No", "No", "No", "No", "No", "No", "No", "No", "No", "Yes", "No", "No", "Yes", "No", "No"]} | UNKNOWN | [
"PYTHON3"
] | CODEFORCES | 1 | codeforces |
|
490145635522fa9a26bed3be4055b932 | Counter Attack | Berland has managed to repel the flatlanders' attack and is now starting the counter attack.
Flatland has *n* cities, numbered from 1 to *n*, and some pairs of them are connected by bidirectional roads. The Flatlandian maps show roads between cities if and only if there is in fact no road between this pair of cities (we do not know whether is it a clever spy-proof strategy or just saving ink). In other words, if two cities are connected by a road on a flatland map, then there is in fact no road between them. The opposite situation is also true: if two cities are not connected by a road on a flatland map, then in fact, there is a road between them.
The berlanders got hold of a flatland map. Now Vasya the Corporal is commissioned by General Touristov to find all such groups of flatland cities, that in each group of cities you can get from any city to any other one, moving along the actual roads. Also the cities from different groups are unreachable from each other, moving along the actual roads. Indeed, destroying such groups one by one is much easier than surrounding all Flatland at once!
Help the corporal complete this task and finally become a sergeant! Don't forget that a flatland map shows a road between cities if and only if there is in fact no road between them.
The first line contains two space-separated integers *n* and *m* (1<=≤<=*n*<=≤<=5·105,<=0<=≤<=*m*<=≤<=106) — the number of cities and the number of roads marked on the flatland map, correspondingly.
Next *m* lines contain descriptions of the cities on the map. The *i*-th line contains two integers *a**i* and *b**i* (1<=≤<=*a**i*,<=*b**i*<=≤<=*n*,<=*a**i*<=≠<=*b**i*) — the numbers of cities that are connected by the *i*-th road on the flatland map.
It is guaranteed that each pair of cities occurs in the input no more than once.
On the first line print number *k* — the number of groups of cities in Flatland, such that in each group you can get from any city to any other one by flatland roads. At the same time, the cities from different groups should be unreachable by flatland roads.
On each of the following *k* lines first print *t**i* (1<=≤<=*t**i*<=≤<=*n*) — the number of vertexes in the *i*-th group. Then print space-separated numbers of cities in the *i*-th group.
The order of printing groups and the order of printing numbers in the groups does not matter. The total sum *t**i* for all *k* groups must equal *n*.
Sample Input
4 4
1 2
1 3
4 2
4 3
3 1
1 2
Sample Output
2
2 1 4
2 2 3
1
3 1 2 3
| {"inputs": ["4 4\n1 2\n1 3\n4 2\n4 3", "3 1\n1 2", "8 14\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n2 3\n2 4\n2 5\n2 6\n2 7\n2 8\n5 6\n6 7", "6 9\n1 4\n1 5\n1 6\n2 4\n2 5\n2 6\n3 4\n3 5\n3 6", "4 6\n3 4\n2 3\n2 4\n1 3\n2 1\n4 1", "4 4\n2 3\n1 2\n3 4\n1 3", "5 8\n5 1\n5 2\n5 3\n3 1\n1 4\n4 2\n3 2\n5 4", "5 10\n3 5\n5 1\n1 3\n1 4\n2 3\n4 5\n4 3\n2 4\n2 1\n5 2", "100000 0", "100000 15\n27289 90938\n5080 32762\n12203 86803\n27118 17073\n27958 9409\n94031 28265\n80805 28920\n42943 9112\n60485 7552\n13666 57510\n68452 61810\n96704 97517\n73523 28376\n7364 47737\n28037 87216", "100 0", "1 0", "2 0", "2 1\n1 2", "3 2\n1 2\n1 3", "3 0", "3 3\n2 3\n1 2\n1 3", "4 3\n1 3\n1 4\n1 2", "4 3\n1 2\n3 4\n2 3"], "outputs": ["2\n2 1 4 \n2 2 3 ", "1\n3 1 2 3 ", "2\n2 1 2 \n6 3 4 5 6 7 8 ", "2\n3 1 2 3 \n3 4 5 6 ", "4\n1 1 \n1 2 \n1 3 \n1 4 ", "2\n1 3 \n3 1 2 4 ", "3\n2 1 2 \n2 3 4 \n1 5 ", "5\n1 1 \n1 2 \n1 3 \n1 4 \n1 5 ", "1\n100000 1 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 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 1...", "1\n100000 1 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 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 1...", "1\n100 1 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 ", "1\n1 1 ", "1\n2 1 2 ", "2\n1 1 \n1 2 ", "2\n1 1 \n2 2 3 ", "1\n3 1 2 3 ", "3\n1 1 \n1 2 \n1 3 ", "2\n1 1 \n3 2 3 4 ", "1\n4 1 2 3 4 "]} | UNKNOWN | [
"PYTHON3"
] | CODEFORCES | 1 | codeforces |
|
490201d0bd08c1c3ad12301c1024bdd5 | Antipalindrome | 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 \ldots r]$ ($1<=\leq<=l<=\leq<=r<=\leq<=|s|$) of a string $s<==<=s_{1}s_{2} \ldots s_{|s|}$ is the string $s_{l}s_{l<=+<=1} \ldots s_{r}$.
Anna does not like palindromes, so she makes her friends call her Ann. She also changes all the words she reads in a similar way. Namely, each word $s$ is changed into its longest substring that is not a palindrome. If all the substrings of $s$ are palindromes, she skips the word at all.
Some time ago Ann read the word $s$. What is the word she changed it into?
The first line contains a non-empty string $s$ with length at most $50$ characters, containing lowercase English letters only.
If there is such a substring in $s$ that is not a palindrome, print the maximum length of such a substring. Otherwise print $0$.
Note that there can be multiple longest substrings that are not palindromes, but their length is unique.
Sample Input
mew
wuffuw
qqqqqqqq
Sample Output
3
5
0
| {"inputs": ["mew", "wuffuw", "qqqqqqqq", "ijvji", "iiiiiii", "wobervhvvkihcuyjtmqhaaigvvgiaahqmtjyuchikvvhvrebow", "wwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwww", "wobervhvvkihcuyjtmqhaaigvahheoqleromusrartldojsjvy", "ijvxljt", "fyhcncnchyf", "ffffffffffff", "fyhcncfsepqj", "ybejrrlbcinttnicblrrjeby", "yyyyyyyyyyyyyyyyyyyyyyyyy", "ybejrrlbcintahovgjddrqatv", "oftmhcmclgyqaojljoaqyglcmchmtfo", "oooooooooooooooooooooooooooooooo", "oftmhcmclgyqaojllbotztajglsmcilv", "gxandbtgpbknxvnkjaajknvxnkbpgtbdnaxg", "gggggggggggggggggggggggggggggggggggg", "gxandbtgpbknxvnkjaygommzqitqzjfalfkk", "fcliblymyqckxvieotjooojtoeivxkcqymylbilcf", "fffffffffffffffffffffffffffffffffffffffffff", "fcliblymyqckxvieotjootiqwtyznhhvuhbaixwqnsy", "rrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrr", "rajccqwqnqmshmerpvjyfepxwpxyldzpzhctqjnstxyfmlhiy", "a", "abca", "aaaaabaaaaa", "aba", "asaa", "aabaa", "aabbaa", "abcdaaa", "aaholaa", "abcdefghijka", "aaadcba", "aaaabaaaa", "abaa", "abcbaa", "ab", "l", "aaaabcaaaa", "abbaaaaaabba", "abaaa", "baa", "aaaaaaabbba", "ccbcc", "bbbaaab", "abaaaaaaaa", "abaaba", "aabsdfaaaa", "aaaba", "aaabaaa", "baaabbb", "ccbbabbcc", "cabc", "aabcd", "abcdea", "bbabb", "aaaaabababaaaaa", "bbabbb", "aababd", "abaaaa", "aaaaaaaabbba", "aabca", "aaabccbaaa", "aaaaaaaaaaaaaaaaaaaab", "babb", "abcaa", "qwqq", "aaaaaaaaaaabbbbbbbbbbbbbbbaaaaaaaaaaaaaaaaaaaaaa", "aaab", "aaaaaabaaaaa", "wwuww", "aaaaabcbaaaaa", "aaabbbaaa", "aabcbaa", "abccdefccba", "aabbcbbaa", "aaaabbaaaa", "aabcda", "abbca", "aaaaaabbaaa", "sssssspssssss", "sdnmsdcs", "aaabbbccbbbaaa", "cbdbdc", "abb", "abcdefaaaa", "abbbaaa", "v", "abccbba", "axyza", "abcdefgaaaa", "aaabcdaaa", "aaaacaaaa", "aaaaaaaaaaaaaaaaaaaabaaaaaaaaaaaaaaaaaaaaa", "abbbaa", "abcdee", "oom", "aabcaa", "abba", "aaca", "aacbca", "ababa", "abcda", "cccaaccc", "aaabcda", "aa", "aabaaaa", "abbaaaa", "aaabcbaaa", "aabba", "xyxx", "aaaaaaaaaaaabc", "bbaaaabb", "aaabaa", "sssssabsssss", "bbbaaaabbb", "abbbbaaaa", "wwufuww", "oowoo", "cccaccc", "aaa", "bbbcc", "abcdef", "abbba", "aab", "aaba", "azbyaaa", "oooooiooooo", "aabbbbbaaaaaa"], "outputs": ["3", "5", "0", "4", "0", "49", "0", "50", "7", "10", "0", "12", "23", "0", "25", "30", "0", "32", "35", "0", "36", "40", "0", "43", "0", "49", "0", "4", "10", "2", "4", "4", "5", "7", "7", "12", "7", "8", "4", "6", "2", "0", "10", "11", "5", "3", "11", "4", "7", "10", "5", "10", "5", "6", "7", "8", "4", "5", "6", "4", "14", "6", "6", "6", "12", "5", "9", "21", "4", "5", "4", "48", "4", "12", "4", "12", "8", "6", "11", "8", "9", "6", "5", "11", "12", "8", "13", "6", "3", "10", "7", "0", "7", "5", "11", "9", "8", "42", "6", "6", "3", "6", "3", "4", "6", "4", "5", "7", "7", "0", "7", "7", "8", "5", "4", "14", "7", "6", "12", "9", "9", "6", "4", "6", "0", "5", "6", "4", "3", "4", "7", "10", "13"]} | UNKNOWN | [
"PYTHON3"
] | CODEFORCES | 453 | codeforces |
|
493b20f8548f7eeddc61d9e27d46a567 | Beauty Pageant | General Payne has a battalion of *n* soldiers. The soldiers' beauty contest is coming up, it will last for *k* days. Payne decided that his battalion will participate in the pageant. Now he has choose the participants.
All soldiers in the battalion have different beauty that is represented by a positive integer. The value *a**i* represents the beauty of the *i*-th soldier.
On each of *k* days Generals has to send a detachment of soldiers to the pageant. The beauty of the detachment is the sum of the beauties of the soldiers, who are part of this detachment. Payne wants to surprise the jury of the beauty pageant, so each of *k* days the beauty of the sent detachment should be unique. In other words, all *k* beauties of the sent detachments must be distinct numbers.
Help Payne choose *k* detachments of different beauties for the pageant. Please note that Payne cannot just forget to send soldiers on one day, that is, the detachment of soldiers he sends to the pageant should never be empty.
The first line contains two integers *n*, *k* (1<=≤<=*n*<=≤<=50; 1<=≤<=*k*<=≤<= ) — the number of soldiers and the number of days in the pageant, correspondingly. The second line contains space-separated integers *a*1,<=*a*2,<=...,<=*a**n* (1<=≤<=*a**i*<=≤<=107) — the beauties of the battalion soldiers.
It is guaranteed that Payne's battalion doesn't have two soldiers with the same beauty.
Print *k* lines: in the *i*-th line print the description of the detachment that will participate in the pageant on the *i*-th day. The description consists of integer *c**i* (1<=≤<=*c**i*<=≤<=*n*) — the number of soldiers in the detachment on the *i*-th day of the pageant and *c**i* distinct integers *p*1,<=*i*,<=*p*2,<=*i*,<=...,<=*p**c**i*,<=*i* — the beauties of the soldiers in the detachment on the *i*-th day of the pageant. The beauties of the soldiers are allowed to print in any order.
Separate numbers on the lines by spaces. It is guaranteed that there is the solution that meets the problem conditions. If there are multiple solutions, print any of them.
Sample Input
3 3
1 2 3
2 1
7 12
Sample Output
1 1
1 2
2 3 2
1 12
| {"inputs": ["3 3\n1 2 3", "2 1\n7 12", "1 1\n1000", "5 8\n10 3 8 31 20", "5 15\n1 2 3 4 5", "8 25\n6 8 3 7 2 1 4 9", "10 9\n5 10 2 14 15 6 3 11 4 1", "10 27\n17 53 94 95 57 36 47 68 48 16", "6 5\n17 35 15 11 33 39", "10 27\n17 53 94 95 57 36 47 68 48 16", "30 122\n5858 8519 5558 2397 3059 3710 6238 8547 2167 9401 471 9160 8505 5876 4373 1596 2535 2592 7630 6304 3761 8752 60 3735 6760 999 4616 8695 5471 4107", "40 57\n126032 9927136 5014907 292040 7692407 6366126 7729668 2948494 7684624 1116536 1647501 1431473 9383644 973174 1470440 700000 7802576 6112611 3601596 892656 6128849 2872763 8432319 3811223 7102327 9934716 5184890 6025259 9459149 3290088 738057 6728294 2688654 8600385 5985112 7644837 6567914 2828556 7564262 6794404", "50 813\n7449220 5273373 3201959 2504940 1861950 5457724 7770654 5521932 3601175 8613797 5015473 3267679 5852552 317709 8222785 3095558 7401768 8363473 1465064 9308012 4880614 7406265 9829434 9196038 3063370 237239 8633093 2256018 5444025 8093607 7099410 9798618 7512880 5806095 3225443 3861872 1158790 4245341 4542965 378481 7628588 4918701 1031421 1230404 8413677 7381891 9338029 3206618 1658288 4721546", "50 836\n43 33 24 13 29 34 11 17 39 14 40 23 35 26 38 28 8 32 4 25 46 9 5 21 45 7 6 30 37 12 2 10 3 41 42 22 50 1 18 49 48 44 47 19 15 36 20 31 16 27", "50 423\n49 38 12 5 15 14 18 23 39 3 43 28 20 16 25 42 22 17 21 37 31 27 30 41 10 36 13 40 35 44 48 46 7 24 9 8 33 29 26 19 32 2 4 11 6 47 50 34 1 45", "50 870\n39 13 35 11 30 26 53 22 28 56 16 25 3 48 5 14 51 32 46 59 40 18 60 21 50 23 17 57 34 10 2 9 55 42 24 36 12 4 52 58 20 1 54 33 44 8 31 37 41 15", "50 379\n67 54 43 61 55 58 11 21 24 5 41 30 65 19 32 31 39 28 40 27 14 2 8 64 60 23 66 20 53 63 51 57 34 48 4 49 25 47 7 44 62 15 52 13 36 9 38 1 17 10", "50 270\n72 67 3 27 47 45 69 79 55 46 48 10 13 26 1 37 32 54 78 40 80 29 49 57 73 53 70 5 71 33 52 17 8 6 65 23 63 64 16 56 44 36 39 59 41 58 43 22 35 4", "50 144\n9 97 15 22 69 27 7 23 84 73 74 60 94 43 98 13 4 63 49 31 93 6 75 32 99 68 48 16 54 20 38 40 65 34 28 21 55 79 50 2 18 95 25 56 77 71 52 10 47 36", "50 263\n110 98 17 54 76 31 195 77 207 168 104 229 37 88 29 164 130 156 261 181 8 113 232 234 132 53 179 59 3 141 178 61 276 152 163 85 148 129 235 79 135 94 108 69 117 2 18 158 275 174", "50 1260\n4 20 37 50 46 19 25 47 10 6 34 12 41 9 22 28 40 42 15 27 8 38 17 13 7 30 48 23 11 16 2 32 18 24 14 33 49 35 44 39 3 36 31 45 1 29 5 43 26 21", "49 1221\n30 1 8 22 39 19 49 48 7 43 24 31 29 3 44 14 38 27 4 23 32 25 15 36 40 35 10 13 28 20 21 45 9 2 33 6 5 42 47 18 37 26 17 41 46 11 34 12 16", "40 816\n816843 900330 562275 683341 469585 146423 911678 402115 930078 168816 916945 431061 334812 205026 264126 227854 913266 866210 54081 956450 449344 904851 624237 701550 596898 291551 23284 479098 80555 289147 187677 980472 283817 162917 795597 631748 710693 76839 632833 204451", "50 1267\n7449220 5273373 3201959 2504940 1861950 5457724 7770654 5521932 3601175 8613797 5015473 3267679 5852552 317709 8222785 3095558 7401768 8363473 1465064 9308012 4880614 7406265 9829434 9196038 3063370 237239 8633093 2256018 5444025 8093607 7099410 9798618 7512880 5806095 3225443 3861872 1158790 4245341 4542965 378481 7628588 4918701 1031421 1230404 8413677 7381891 9338029 3206618 1658288 4721546", "35 623\n5575 9829 2987 3856 893 1590 706 1270 3993 7532 4168 9800 7425 138 7824 5229 5204 3485 3591 3046 2844 7435 6180 1647 7885 4947 248 2797 4453 7217 9085 3406 8332 5288 6537", "50 1275\n10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 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 62", "50 1275\n11 84 1000000 1000001 1000002 1000003 1000004 1000005 1000006 1000007 1000008 1000009 1000010 1000011 1000012 1000013 1000014 1000015 1000016 1000017 1000018 1000019 1000020 1000021 1000022 1000023 1000024 1000025 1000026 1000028 1000030 1000031 1000032 1000033 1000034 1000035 1000036 1000037 1000038 1000039 1000040 1000041 1000042 1000043 1000044 1000045 1000046 1000047 1000048 1000049", "50 1275\n1 2 3 4 5 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 45 46 47 48 49 50 52 56", "50 1275\n1 2 3 4 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 56", "50 1275\n2 3 4 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 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 58", "50 1275\n4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 30 31 32 33 34 35 36 37 38 40 41 42 43 44 45 46 47 48 49 50 51 52 53 56 59", "50 1275\n6 9 10 11 12 13 14 16 17 18 19 20 22 24 25 26 27 28 29 30 31 33 34 35 36 37 38 39 40 41 43 44 45 46 47 48 49 50 51 52 54 55 64 66 67 68 84 88 90 92", "50 1275\n6 7 9 10 11 12 13 14 15 16 17 19 20 22 23 24 25 26 28 29 31 32 33 34 35 36 37 38 39 40 41 43 44 46 48 50 51 52 53 54 55 11656 22042 30478 68064 70277 74455 88403 93743 99342", "3 6\n1 2 3"], "outputs": ["1 1\n1 2\n2 3 2", "1 12 ", "1 1000 ", "1 31 \n1 20 \n1 10 \n1 8 \n1 3 \n2 31 20 \n2 31 10 \n2 31 8 ", "1 5 \n1 4 \n1 3 \n1 2 \n1 1 \n2 5 4 \n2 5 3 \n2 5 2 \n2 5 1 \n3 5 4 3 \n3 5 4 2 \n3 5 4 1 \n4 5 4 3 2 \n4 5 4 3 1 \n5 5 4 3 2 1 ", "1 9 \n1 8 \n1 7 \n1 6 \n1 4 \n1 3 \n1 2 \n1 1 \n2 9 8 \n2 9 7 \n2 9 6 \n2 9 4 \n2 9 3 \n2 9 2 \n2 9 1 \n3 9 8 7 \n3 9 8 6 \n3 9 8 4 \n3 9 8 3 \n3 9 8 2 \n3 9 8 1 \n4 9 8 7 6 \n4 9 8 7 4 \n4 9 8 7 3 \n4 9 8 7 2 ", "1 15 \n1 14 \n1 11 \n1 10 \n1 6 \n1 5 \n1 4 \n1 3 \n1 2 ", "1 95 \n1 94 \n1 68 \n1 57 \n1 53 \n1 48 \n1 47 \n1 36 \n1 17 \n1 16 \n2 95 94 \n2 95 68 \n2 95 57 \n2 95 53 \n2 95 48 \n2 95 47 \n2 95 36 \n2 95 17 \n2 95 16 \n3 95 94 68 \n3 95 94 57 \n3 95 94 53 \n3 95 94 48 \n3 95 94 47 \n3 95 94 36 \n3 95 94 17 \n3 95 94 16 ", "1 39 \n1 35 \n1 33 \n1 17 \n1 15 ", "1 95 \n1 94 \n1 68 \n1 57 \n1 53 \n1 48 \n1 47 \n1 36 \n1 17 \n1 16 \n2 95 94 \n2 95 68 \n2 95 57 \n2 95 53 \n2 95 48 \n2 95 47 \n2 95 36 \n2 95 17 \n2 95 16 \n3 95 94 68 \n3 95 94 57 \n3 95 94 53 \n3 95 94 48 \n3 95 94 47 \n3 95 94 36 \n3 95 94 17 \n3 95 94 16 ", "1 9401 \n1 9160 \n1 8752 \n1 8695 \n1 8547 \n1 8519 \n1 8505 \n1 7630 \n1 6760 \n1 6304 \n1 6238 \n1 5876 \n1 5858 \n1 5558 \n1 5471 \n1 4616 \n1 4373 \n1 4107 \n1 3761 \n1 3735 \n1 3710 \n1 3059 \n1 2592 \n1 2535 \n1 2397 \n1 2167 \n1 1596 \n1 999 \n1 471 \n1 60 \n2 9401 9160 \n2 9401 8752 \n2 9401 8695 \n2 9401 8547 \n2 9401 8519 \n2 9401 8505 \n2 9401 7630 \n2 9401 6760 \n2 9401 6304 \n2 9401 6238 \n2 9401 5876 \n2 9401 5858 \n2 9401 5558 \n2 9401 5471 \n2 9401 4616 \n2 9401 4373 \n2 9401 4107 \n2 9401 ...", "1 9934716 \n1 9927136 \n1 9459149 \n1 9383644 \n1 8600385 \n1 8432319 \n1 7802576 \n1 7729668 \n1 7692407 \n1 7684624 \n1 7644837 \n1 7564262 \n1 7102327 \n1 6794404 \n1 6728294 \n1 6567914 \n1 6366126 \n1 6128849 \n1 6112611 \n1 6025259 \n1 5985112 \n1 5184890 \n1 5014907 \n1 3811223 \n1 3601596 \n1 3290088 \n1 2948494 \n1 2872763 \n1 2828556 \n1 2688654 \n1 1647501 \n1 1470440 \n1 1431473 \n1 1116536 \n1 973174 \n1 892656 \n1 738057 \n1 700000 \n1 292040 \n1 126032 \n2 9934716 9927136 \n2 9934716 9459149...", "1 9829434 \n1 9798618 \n1 9338029 \n1 9308012 \n1 9196038 \n1 8633093 \n1 8613797 \n1 8413677 \n1 8363473 \n1 8222785 \n1 8093607 \n1 7770654 \n1 7628588 \n1 7512880 \n1 7449220 \n1 7406265 \n1 7401768 \n1 7381891 \n1 7099410 \n1 5852552 \n1 5806095 \n1 5521932 \n1 5457724 \n1 5444025 \n1 5273373 \n1 5015473 \n1 4918701 \n1 4880614 \n1 4721546 \n1 4542965 \n1 4245341 \n1 3861872 \n1 3601175 \n1 3267679 \n1 3225443 \n1 3206618 \n1 3201959 \n1 3095558 \n1 3063370 \n1 2504940 \n1 2256018 \n1 1861950 \n1 16582...", "1 50 \n1 49 \n1 48 \n1 47 \n1 46 \n1 45 \n1 44 \n1 43 \n1 42 \n1 41 \n1 40 \n1 39 \n1 38 \n1 37 \n1 36 \n1 35 \n1 34 \n1 33 \n1 32 \n1 31 \n1 30 \n1 29 \n1 28 \n1 27 \n1 26 \n1 25 \n1 24 \n1 23 \n1 22 \n1 21 \n1 20 \n1 19 \n1 18 \n1 17 \n1 16 \n1 15 \n1 14 \n1 13 \n1 12 \n1 11 \n1 10 \n1 9 \n1 8 \n1 7 \n1 6 \n1 5 \n1 4 \n1 3 \n1 2 \n1 1 \n2 50 49 \n2 50 48 \n2 50 47 \n2 50 46 \n2 50 45 \n2 50 44 \n2 50 43 \n2 50 42 \n2 50 41 \n2 50 40 \n2 50 39 \n2 50 38 \n2 50 37 \n2 50 36 \n2 50 35 \n2 50 34 \n2 50 33 \n...", "1 50 \n1 49 \n1 48 \n1 47 \n1 46 \n1 45 \n1 44 \n1 43 \n1 42 \n1 41 \n1 40 \n1 39 \n1 38 \n1 37 \n1 36 \n1 35 \n1 34 \n1 33 \n1 32 \n1 31 \n1 30 \n1 29 \n1 28 \n1 27 \n1 26 \n1 25 \n1 24 \n1 23 \n1 22 \n1 21 \n1 20 \n1 19 \n1 18 \n1 17 \n1 16 \n1 15 \n1 14 \n1 13 \n1 12 \n1 11 \n1 10 \n1 9 \n1 8 \n1 7 \n1 6 \n1 5 \n1 4 \n1 3 \n1 2 \n1 1 \n2 50 49 \n2 50 48 \n2 50 47 \n2 50 46 \n2 50 45 \n2 50 44 \n2 50 43 \n2 50 42 \n2 50 41 \n2 50 40 \n2 50 39 \n2 50 38 \n2 50 37 \n2 50 36 \n2 50 35 \n2 50 34 \n2 50 33 \n...", "1 60 \n1 59 \n1 58 \n1 57 \n1 56 \n1 55 \n1 54 \n1 53 \n1 52 \n1 51 \n1 50 \n1 48 \n1 46 \n1 44 \n1 42 \n1 41 \n1 40 \n1 39 \n1 37 \n1 36 \n1 35 \n1 34 \n1 33 \n1 32 \n1 31 \n1 30 \n1 28 \n1 26 \n1 25 \n1 24 \n1 23 \n1 22 \n1 21 \n1 20 \n1 18 \n1 17 \n1 16 \n1 15 \n1 14 \n1 13 \n1 12 \n1 11 \n1 10 \n1 9 \n1 8 \n1 5 \n1 4 \n1 3 \n1 2 \n1 1 \n2 60 59 \n2 60 58 \n2 60 57 \n2 60 56 \n2 60 55 \n2 60 54 \n2 60 53 \n2 60 52 \n2 60 51 \n2 60 50 \n2 60 48 \n2 60 46 \n2 60 44 \n2 60 42 \n2 60 41 \n2 60 40 \n2 60 39 ...", "1 67 \n1 66 \n1 65 \n1 64 \n1 63 \n1 62 \n1 61 \n1 60 \n1 58 \n1 57 \n1 55 \n1 54 \n1 53 \n1 52 \n1 51 \n1 49 \n1 48 \n1 47 \n1 44 \n1 43 \n1 41 \n1 40 \n1 39 \n1 38 \n1 36 \n1 34 \n1 32 \n1 31 \n1 30 \n1 28 \n1 27 \n1 25 \n1 24 \n1 23 \n1 21 \n1 20 \n1 19 \n1 17 \n1 15 \n1 14 \n1 13 \n1 11 \n1 10 \n1 9 \n1 8 \n1 7 \n1 5 \n1 4 \n1 2 \n1 1 \n2 67 66 \n2 67 65 \n2 67 64 \n2 67 63 \n2 67 62 \n2 67 61 \n2 67 60 \n2 67 58 \n2 67 57 \n2 67 55 \n2 67 54 \n2 67 53 \n2 67 52 \n2 67 51 \n2 67 49 \n2 67 48 \n2 67 47 ...", "1 80 \n1 79 \n1 78 \n1 73 \n1 72 \n1 71 \n1 70 \n1 69 \n1 67 \n1 65 \n1 64 \n1 63 \n1 59 \n1 58 \n1 57 \n1 56 \n1 55 \n1 54 \n1 53 \n1 52 \n1 49 \n1 48 \n1 47 \n1 46 \n1 45 \n1 44 \n1 43 \n1 41 \n1 40 \n1 39 \n1 37 \n1 36 \n1 35 \n1 33 \n1 32 \n1 29 \n1 27 \n1 26 \n1 23 \n1 22 \n1 17 \n1 16 \n1 13 \n1 10 \n1 8 \n1 6 \n1 5 \n1 4 \n1 3 \n1 1 \n2 80 79 \n2 80 78 \n2 80 73 \n2 80 72 \n2 80 71 \n2 80 70 \n2 80 69 \n2 80 67 \n2 80 65 \n2 80 64 \n2 80 63 \n2 80 59 \n2 80 58 \n2 80 57 \n2 80 56 \n2 80 55 \n2 80 54...", "1 99 \n1 98 \n1 97 \n1 95 \n1 94 \n1 93 \n1 84 \n1 79 \n1 77 \n1 75 \n1 74 \n1 73 \n1 71 \n1 69 \n1 68 \n1 65 \n1 63 \n1 60 \n1 56 \n1 55 \n1 54 \n1 52 \n1 50 \n1 49 \n1 48 \n1 47 \n1 43 \n1 40 \n1 38 \n1 36 \n1 34 \n1 32 \n1 31 \n1 28 \n1 27 \n1 25 \n1 23 \n1 22 \n1 21 \n1 20 \n1 18 \n1 16 \n1 15 \n1 13 \n1 10 \n1 9 \n1 7 \n1 6 \n1 4 \n1 2 \n2 99 98 \n2 99 97 \n2 99 95 \n2 99 94 \n2 99 93 \n2 99 84 \n2 99 79 \n2 99 77 \n2 99 75 \n2 99 74 \n2 99 73 \n2 99 71 \n2 99 69 \n2 99 68 \n2 99 65 \n2 99 63 \n2 99 6...", "1 276 \n1 275 \n1 261 \n1 235 \n1 234 \n1 232 \n1 229 \n1 207 \n1 195 \n1 181 \n1 179 \n1 178 \n1 174 \n1 168 \n1 164 \n1 163 \n1 158 \n1 156 \n1 152 \n1 148 \n1 141 \n1 135 \n1 132 \n1 130 \n1 129 \n1 117 \n1 113 \n1 110 \n1 108 \n1 104 \n1 98 \n1 94 \n1 88 \n1 85 \n1 79 \n1 77 \n1 76 \n1 69 \n1 61 \n1 59 \n1 54 \n1 53 \n1 37 \n1 31 \n1 29 \n1 18 \n1 17 \n1 8 \n1 3 \n1 2 \n2 276 275 \n2 276 261 \n2 276 235 \n2 276 234 \n2 276 232 \n2 276 229 \n2 276 207 \n2 276 195 \n2 276 181 \n2 276 179 \n2 276 178 \n2 ...", "1 50 \n1 49 \n1 48 \n1 47 \n1 46 \n1 45 \n1 44 \n1 43 \n1 42 \n1 41 \n1 40 \n1 39 \n1 38 \n1 37 \n1 36 \n1 35 \n1 34 \n1 33 \n1 32 \n1 31 \n1 30 \n1 29 \n1 28 \n1 27 \n1 26 \n1 25 \n1 24 \n1 23 \n1 22 \n1 21 \n1 20 \n1 19 \n1 18 \n1 17 \n1 16 \n1 15 \n1 14 \n1 13 \n1 12 \n1 11 \n1 10 \n1 9 \n1 8 \n1 7 \n1 6 \n1 5 \n1 4 \n1 3 \n1 2 \n1 1 \n2 50 49 \n2 50 48 \n2 50 47 \n2 50 46 \n2 50 45 \n2 50 44 \n2 50 43 \n2 50 42 \n2 50 41 \n2 50 40 \n2 50 39 \n2 50 38 \n2 50 37 \n2 50 36 \n2 50 35 \n2 50 34 \n2 50 33 \n...", "1 49 \n1 48 \n1 47 \n1 46 \n1 45 \n1 44 \n1 43 \n1 42 \n1 41 \n1 40 \n1 39 \n1 38 \n1 37 \n1 36 \n1 35 \n1 34 \n1 33 \n1 32 \n1 31 \n1 30 \n1 29 \n1 28 \n1 27 \n1 26 \n1 25 \n1 24 \n1 23 \n1 22 \n1 21 \n1 20 \n1 19 \n1 18 \n1 17 \n1 16 \n1 15 \n1 14 \n1 13 \n1 12 \n1 11 \n1 10 \n1 9 \n1 8 \n1 7 \n1 6 \n1 5 \n1 4 \n1 3 \n1 2 \n1 1 \n2 49 48 \n2 49 47 \n2 49 46 \n2 49 45 \n2 49 44 \n2 49 43 \n2 49 42 \n2 49 41 \n2 49 40 \n2 49 39 \n2 49 38 \n2 49 37 \n2 49 36 \n2 49 35 \n2 49 34 \n2 49 33 \n2 49 32 \n2 49 31...", "1 980472 \n1 956450 \n1 930078 \n1 916945 \n1 913266 \n1 911678 \n1 904851 \n1 900330 \n1 866210 \n1 816843 \n1 795597 \n1 710693 \n1 701550 \n1 683341 \n1 632833 \n1 631748 \n1 624237 \n1 596898 \n1 562275 \n1 479098 \n1 469585 \n1 449344 \n1 431061 \n1 402115 \n1 334812 \n1 291551 \n1 289147 \n1 283817 \n1 264126 \n1 227854 \n1 205026 \n1 204451 \n1 187677 \n1 168816 \n1 162917 \n1 146423 \n1 80555 \n1 76839 \n1 54081 \n1 23284 \n2 980472 956450 \n2 980472 930078 \n2 980472 916945 \n2 980472 913266 \n2 9...", "1 9829434 \n1 9798618 \n1 9338029 \n1 9308012 \n1 9196038 \n1 8633093 \n1 8613797 \n1 8413677 \n1 8363473 \n1 8222785 \n1 8093607 \n1 7770654 \n1 7628588 \n1 7512880 \n1 7449220 \n1 7406265 \n1 7401768 \n1 7381891 \n1 7099410 \n1 5852552 \n1 5806095 \n1 5521932 \n1 5457724 \n1 5444025 \n1 5273373 \n1 5015473 \n1 4918701 \n1 4880614 \n1 4721546 \n1 4542965 \n1 4245341 \n1 3861872 \n1 3601175 \n1 3267679 \n1 3225443 \n1 3206618 \n1 3201959 \n1 3095558 \n1 3063370 \n1 2504940 \n1 2256018 \n1 1861950 \n1 16582...", "1 9829 \n1 9800 \n1 9085 \n1 8332 \n1 7885 \n1 7824 \n1 7532 \n1 7435 \n1 7425 \n1 7217 \n1 6537 \n1 6180 \n1 5575 \n1 5288 \n1 5229 \n1 5204 \n1 4947 \n1 4453 \n1 4168 \n1 3993 \n1 3856 \n1 3591 \n1 3485 \n1 3406 \n1 3046 \n1 2987 \n1 2844 \n1 2797 \n1 1647 \n1 1590 \n1 1270 \n1 893 \n1 706 \n1 248 \n1 138 \n2 9829 9800 \n2 9829 9085 \n2 9829 8332 \n2 9829 7885 \n2 9829 7824 \n2 9829 7532 \n2 9829 7435 \n2 9829 7425 \n2 9829 7217 \n2 9829 6537 \n2 9829 6180 \n2 9829 5575 \n2 9829 5288 \n2 9829 5229 \n2 98...", "1 62 \n1 59 \n1 58 \n1 57 \n1 56 \n1 55 \n1 54 \n1 53 \n1 52 \n1 51 \n1 50 \n1 49 \n1 48 \n1 47 \n1 46 \n1 45 \n1 44 \n1 43 \n1 42 \n1 41 \n1 40 \n1 39 \n1 38 \n1 37 \n1 36 \n1 35 \n1 34 \n1 32 \n1 31 \n1 30 \n1 29 \n1 28 \n1 27 \n1 26 \n1 25 \n1 24 \n1 23 \n1 22 \n1 21 \n1 20 \n1 19 \n1 18 \n1 17 \n1 16 \n1 15 \n1 14 \n1 13 \n1 12 \n1 11 \n1 10 \n2 62 59 \n2 62 58 \n2 62 57 \n2 62 56 \n2 62 55 \n2 62 54 \n2 62 53 \n2 62 52 \n2 62 51 \n2 62 50 \n2 62 49 \n2 62 48 \n2 62 47 \n2 62 46 \n2 62 45 \n2 62 44 \n2...", "1 1000049 \n1 1000048 \n1 1000047 \n1 1000046 \n1 1000045 \n1 1000044 \n1 1000043 \n1 1000042 \n1 1000041 \n1 1000040 \n1 1000039 \n1 1000038 \n1 1000037 \n1 1000036 \n1 1000035 \n1 1000034 \n1 1000033 \n1 1000032 \n1 1000031 \n1 1000030 \n1 1000028 \n1 1000026 \n1 1000025 \n1 1000024 \n1 1000023 \n1 1000022 \n1 1000021 \n1 1000020 \n1 1000019 \n1 1000018 \n1 1000017 \n1 1000016 \n1 1000015 \n1 1000014 \n1 1000013 \n1 1000012 \n1 1000011 \n1 1000010 \n1 1000009 \n1 1000008 \n1 1000007 \n1 1000006 \n1 10000...", "1 56 \n1 52 \n1 50 \n1 49 \n1 48 \n1 47 \n1 46 \n1 45 \n1 43 \n1 42 \n1 41 \n1 40 \n1 39 \n1 38 \n1 37 \n1 36 \n1 35 \n1 34 \n1 33 \n1 32 \n1 31 \n1 30 \n1 29 \n1 28 \n1 27 \n1 26 \n1 25 \n1 24 \n1 23 \n1 22 \n1 21 \n1 20 \n1 19 \n1 18 \n1 17 \n1 16 \n1 15 \n1 14 \n1 13 \n1 12 \n1 11 \n1 10 \n1 9 \n1 8 \n1 7 \n1 5 \n1 4 \n1 3 \n1 2 \n1 1 \n2 56 52 \n2 56 50 \n2 56 49 \n2 56 48 \n2 56 47 \n2 56 46 \n2 56 45 \n2 56 43 \n2 56 42 \n2 56 41 \n2 56 40 \n2 56 39 \n2 56 38 \n2 56 37 \n2 56 36 \n2 56 35 \n2 56 34 \n...", "1 56 \n1 51 \n1 50 \n1 49 \n1 48 \n1 47 \n1 46 \n1 45 \n1 44 \n1 43 \n1 42 \n1 41 \n1 40 \n1 39 \n1 38 \n1 37 \n1 36 \n1 35 \n1 34 \n1 33 \n1 32 \n1 31 \n1 30 \n1 28 \n1 27 \n1 26 \n1 25 \n1 24 \n1 23 \n1 22 \n1 21 \n1 20 \n1 19 \n1 18 \n1 17 \n1 16 \n1 15 \n1 14 \n1 13 \n1 12 \n1 11 \n1 10 \n1 9 \n1 8 \n1 7 \n1 6 \n1 4 \n1 3 \n1 2 \n1 1 \n2 56 51 \n2 56 50 \n2 56 49 \n2 56 48 \n2 56 47 \n2 56 46 \n2 56 45 \n2 56 44 \n2 56 43 \n2 56 42 \n2 56 41 \n2 56 40 \n2 56 39 \n2 56 38 \n2 56 37 \n2 56 36 \n2 56 35 \n...", "1 58 \n1 52 \n1 51 \n1 50 \n1 49 \n1 48 \n1 47 \n1 46 \n1 45 \n1 44 \n1 43 \n1 42 \n1 41 \n1 40 \n1 39 \n1 38 \n1 37 \n1 36 \n1 35 \n1 34 \n1 33 \n1 32 \n1 31 \n1 30 \n1 29 \n1 28 \n1 27 \n1 26 \n1 25 \n1 24 \n1 22 \n1 21 \n1 20 \n1 19 \n1 18 \n1 17 \n1 16 \n1 15 \n1 14 \n1 13 \n1 12 \n1 11 \n1 10 \n1 9 \n1 8 \n1 7 \n1 6 \n1 4 \n1 3 \n1 2 \n2 58 52 \n2 58 51 \n2 58 50 \n2 58 49 \n2 58 48 \n2 58 47 \n2 58 46 \n2 58 45 \n2 58 44 \n2 58 43 \n2 58 42 \n2 58 41 \n2 58 40 \n2 58 39 \n2 58 38 \n2 58 37 \n2 58 36 ...", "1 59 \n1 56 \n1 53 \n1 52 \n1 51 \n1 50 \n1 49 \n1 48 \n1 47 \n1 46 \n1 45 \n1 44 \n1 43 \n1 42 \n1 41 \n1 40 \n1 38 \n1 37 \n1 36 \n1 35 \n1 34 \n1 33 \n1 32 \n1 31 \n1 30 \n1 28 \n1 27 \n1 26 \n1 25 \n1 24 \n1 23 \n1 22 \n1 21 \n1 20 \n1 19 \n1 18 \n1 17 \n1 16 \n1 15 \n1 14 \n1 13 \n1 12 \n1 11 \n1 10 \n1 9 \n1 8 \n1 7 \n1 6 \n1 5 \n1 4 \n2 59 56 \n2 59 53 \n2 59 52 \n2 59 51 \n2 59 50 \n2 59 49 \n2 59 48 \n2 59 47 \n2 59 46 \n2 59 45 \n2 59 44 \n2 59 43 \n2 59 42 \n2 59 41 \n2 59 40 \n2 59 38 \n2 59 37...", "1 92 \n1 90 \n1 88 \n1 84 \n1 68 \n1 67 \n1 66 \n1 64 \n1 55 \n1 54 \n1 52 \n1 51 \n1 50 \n1 49 \n1 48 \n1 47 \n1 46 \n1 45 \n1 44 \n1 43 \n1 41 \n1 40 \n1 39 \n1 38 \n1 37 \n1 36 \n1 35 \n1 34 \n1 33 \n1 31 \n1 30 \n1 29 \n1 28 \n1 27 \n1 26 \n1 25 \n1 24 \n1 22 \n1 20 \n1 19 \n1 18 \n1 17 \n1 16 \n1 14 \n1 13 \n1 12 \n1 11 \n1 10 \n1 9 \n1 6 \n2 92 90 \n2 92 88 \n2 92 84 \n2 92 68 \n2 92 67 \n2 92 66 \n2 92 64 \n2 92 55 \n2 92 54 \n2 92 52 \n2 92 51 \n2 92 50 \n2 92 49 \n2 92 48 \n2 92 47 \n2 92 46 \n2 9...", "1 99342 \n1 93743 \n1 88403 \n1 74455 \n1 70277 \n1 68064 \n1 30478 \n1 22042 \n1 11656 \n1 55 \n1 54 \n1 53 \n1 52 \n1 51 \n1 50 \n1 48 \n1 46 \n1 44 \n1 43 \n1 41 \n1 40 \n1 39 \n1 38 \n1 37 \n1 36 \n1 35 \n1 34 \n1 33 \n1 32 \n1 31 \n1 29 \n1 28 \n1 26 \n1 25 \n1 24 \n1 23 \n1 22 \n1 20 \n1 19 \n1 17 \n1 16 \n1 15 \n1 14 \n1 13 \n1 12 \n1 11 \n1 10 \n1 9 \n1 7 \n1 6 \n2 99342 93743 \n2 99342 88403 \n2 99342 74455 \n2 99342 70277 \n2 99342 68064 \n2 99342 30478 \n2 99342 22042 \n2 99342 11656 \n2 99342 5...", "1 3 \n1 2 \n1 1 \n2 3 2 \n2 3 1 \n3 3 2 1 "]} | UNKNOWN | [
"PYTHON3"
] | CODEFORCES | 12 | codeforces |
|
496ca3229acb846a688f9099b6dd5e8a | Valera and Elections | The city Valera lives in is going to hold elections to the city Parliament.
The city has *n* districts and *n*<=-<=1 bidirectional roads. We know that from any district there is a path along the roads to any other district. Let's enumerate all districts in some way by integers from 1 to *n*, inclusive. Furthermore, for each road the residents decided if it is the problem road or not. A problem road is a road that needs to be repaired.
There are *n* candidates running the elections. Let's enumerate all candidates in some way by integers from 1 to *n*, inclusive. If the candidate number *i* will be elected in the city Parliament, he will perform exactly one promise — to repair all problem roads on the way from the *i*-th district to the district 1, where the city Parliament is located.
Help Valera and determine the subset of candidates such that if all candidates from the subset will be elected to the city Parliament, all problem roads in the city will be repaired. If there are several such subsets, you should choose the subset consisting of the minimum number of candidates.
The first line contains a single integer *n* (2<=≤<=*n*<=≤<=105) — the number of districts in the city.
Then *n*<=-<=1 lines follow. Each line contains the description of a city road as three positive integers *x**i*, *y**i*, *t**i* (1<=≤<=*x**i*,<=*y**i*<=≤<=*n*, 1<=≤<=*t**i*<=≤<=2) — the districts connected by the *i*-th bidirectional road and the road type. If *t**i* equals to one, then the *i*-th road isn't the problem road; if *t**i* equals to two, then the *i*-th road is the problem road.
It's guaranteed that the graph structure of the city is a tree.
In the first line print a single non-negative number *k* — the minimum size of the required subset of candidates. Then on the second line print *k* space-separated integers *a*1,<=*a*2,<=... *a**k* — the numbers of the candidates that form the required subset. If there are multiple solutions, you are allowed to print any of them.
Sample Input
5
1 2 2
2 3 2
3 4 2
4 5 2
5
1 2 1
2 3 2
2 4 1
4 5 1
5
1 2 2
1 3 2
1 4 2
1 5 2
Sample Output
1
5
1
3
4
5 4 3 2
| {"inputs": ["5\n1 2 2\n2 3 2\n3 4 2\n4 5 2", "5\n1 2 1\n2 3 2\n2 4 1\n4 5 1", "5\n1 2 2\n1 3 2\n1 4 2\n1 5 2", "5\n1 5 1\n5 4 2\n4 3 1\n3 2 2", "2\n1 2 1", "10\n7 5 1\n2 1 2\n8 7 2\n2 4 1\n4 5 2\n9 5 1\n3 2 2\n2 10 1\n6 5 2", "2\n2 1 1", "2\n1 2 2", "5\n3 1 1\n4 5 1\n1 4 1\n1 2 1", "5\n1 3 2\n5 4 2\n2 1 2\n4 3 2", "10\n1 9 1\n3 2 2\n1 2 2\n4 7 2\n3 5 2\n4 3 2\n10 3 2\n7 8 2\n3 6 1", "10\n7 9 2\n2 6 2\n7 4 1\n5 4 2\n3 2 1\n8 5 2\n4 3 2\n7 10 1\n1 2 2", "10\n3 9 1\n2 10 2\n1 7 1\n3 4 1\n7 8 2\n1 2 1\n5 3 1\n5 6 2\n2 3 2", "10\n1 10 2\n10 9 2\n10 8 2\n9 7 2\n8 6 1\n7 5 1\n6 4 1\n5 3 1\n4 2 1", "10\n1 10 2\n10 9 2\n10 8 2\n9 7 2\n8 6 2\n7 5 2\n6 4 2\n5 3 2\n4 2 2", "4\n1 2 2\n2 3 1\n2 4 2"], "outputs": ["1\n5 ", "1\n3 ", "4\n5 4 3 2 ", "1\n2 ", "0", "3\n8 6 3 ", "0", "1\n2 ", "0", "2\n5 2 ", "3\n8 10 5 ", "3\n9 8 6 ", "3\n6 10 8 ", "2\n7 8 ", "2\n3 2 ", "1\n4 "]} | UNKNOWN | [
"PYTHON3"
] | CODEFORCES | 27 | codeforces |
|
4974f12e3cb593b80705adf0a057f681 | Fair Game | Petya and Vasya decided to play a game. They have *n* cards (*n* is an even number). A single integer is written on each card.
Before the game Petya will choose an integer and after that Vasya will choose another integer (different from the number that Petya chose). During the game each player takes all the cards with number he chose. For example, if Petya chose number 5 before the game he will take all cards on which 5 is written and if Vasya chose number 10 before the game he will take all cards on which 10 is written.
The game is considered fair if Petya and Vasya can take all *n* cards, and the number of cards each player gets is the same.
Determine whether Petya and Vasya can choose integer numbers before the game so that the game is fair.
The first line contains a single integer *n* (2<=≤<=*n*<=≤<=100) — number of cards. It is guaranteed that *n* is an even number.
The following *n* lines contain a sequence of integers *a*1,<=*a*2,<=...,<=*a**n* (one integer per line, 1<=≤<=*a**i*<=≤<=100) — numbers written on the *n* cards.
If it is impossible for Petya and Vasya to choose numbers in such a way that the game will be fair, print "NO" (without quotes) in the first line. In this case you should not print anything more.
In the other case print "YES" (without quotes) in the first line. In the second line print two distinct integers — number that Petya should choose and the number that Vasya should choose to make the game fair. If there are several solutions, print any of them.
Sample Input
4
11
27
27
11
2
6
6
6
10
20
30
20
10
20
6
1
1
2
2
3
3
Sample Output
YES
11 27
NO
NO
NO
| {"inputs": ["4\n11\n27\n27\n11", "2\n6\n6", "6\n10\n20\n30\n20\n10\n20", "6\n1\n1\n2\n2\n3\n3", "2\n1\n100", "2\n1\n1", "2\n100\n100", "14\n43\n43\n43\n43\n43\n43\n43\n43\n43\n43\n43\n43\n43\n43", "100\n14\n14\n14\n14\n14\n14\n14\n14\n14\n14\n14\n14\n14\n14\n14\n14\n14\n14\n14\n14\n14\n14\n14\n14\n14\n14\n14\n14\n14\n14\n14\n14\n14\n14\n14\n14\n14\n14\n14\n14\n14\n14\n14\n14\n14\n14\n14\n14\n14\n14\n32\n32\n32\n32\n32\n32\n32\n32\n32\n32\n32\n32\n32\n32\n32\n32\n32\n32\n32\n32\n32\n32\n32\n32\n32\n32\n32\n32\n32\n32\n32\n32\n32\n32\n32\n32\n32\n32\n32\n32\n32\n32\n32\n32\n32\n32\n32\n32\n32\n32", "2\n50\n100", "2\n99\n100", "4\n4\n4\n5\n5", "10\n10\n10\n10\n10\n10\n23\n23\n23\n23\n23", "20\n34\n34\n34\n34\n34\n34\n34\n34\n34\n34\n11\n11\n11\n11\n11\n11\n11\n11\n11\n11", "40\n20\n20\n20\n20\n20\n20\n20\n20\n20\n20\n20\n20\n20\n20\n20\n20\n20\n20\n20\n20\n30\n30\n30\n30\n30\n30\n30\n30\n30\n30\n30\n30\n30\n30\n30\n30\n30\n30\n30\n30", "58\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1", "98\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n99\n99\n99\n99\n99\n99\n99\n99\n99\n99\n99\n99\n99\n99\n99\n99\n99\n99\n99\n99\n99\n99\n99\n99\n99\n99\n99\n99\n99\n99\n99\n99\n99\n99\n99\n99\n99\n99\n99\n99\n99\n99\n99\n99\n99\n99\n99\n99\n99", "100\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100", "100\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2", "100\n49\n49\n49\n49\n49\n49\n49\n49\n49\n49\n49\n49\n49\n49\n49\n49\n49\n49\n49\n49\n49\n49\n49\n49\n49\n49\n49\n49\n49\n49\n49\n49\n49\n49\n49\n49\n49\n49\n49\n49\n49\n49\n49\n49\n49\n49\n49\n49\n49\n49\n12\n12\n12\n12\n12\n12\n12\n12\n12\n12\n12\n12\n12\n12\n12\n12\n12\n12\n12\n12\n12\n12\n12\n12\n12\n12\n12\n12\n12\n12\n12\n12\n12\n12\n12\n12\n12\n12\n12\n12\n12\n12\n12\n12\n12\n12\n12\n12\n12\n12", "100\n15\n15\n15\n15\n15\n15\n15\n15\n15\n15\n15\n15\n15\n15\n15\n15\n15\n15\n15\n15\n15\n15\n15\n15\n15\n15\n15\n15\n15\n15\n15\n15\n15\n15\n15\n15\n15\n15\n15\n15\n15\n15\n15\n15\n15\n15\n15\n15\n15\n15\n94\n94\n94\n94\n94\n94\n94\n94\n94\n94\n94\n94\n94\n94\n94\n94\n94\n94\n94\n94\n94\n94\n94\n94\n94\n94\n94\n94\n94\n94\n94\n94\n94\n94\n94\n94\n94\n94\n94\n94\n94\n94\n94\n94\n94\n94\n94\n94\n94\n94", "100\n33\n33\n33\n33\n33\n33\n33\n33\n33\n33\n33\n33\n33\n33\n33\n33\n33\n33\n33\n33\n33\n33\n33\n33\n33\n33\n33\n33\n33\n33\n33\n33\n33\n33\n33\n33\n33\n33\n33\n33\n33\n33\n33\n33\n33\n33\n33\n33\n33\n33\n42\n42\n42\n42\n42\n42\n42\n42\n42\n42\n42\n42\n42\n42\n42\n42\n42\n42\n42\n42\n42\n42\n42\n42\n42\n42\n42\n42\n42\n42\n42\n42\n42\n42\n42\n42\n42\n42\n42\n42\n42\n42\n42\n42\n42\n42\n42\n42\n42\n42", "100\n16\n16\n16\n16\n16\n16\n16\n16\n16\n16\n16\n16\n16\n16\n16\n16\n16\n16\n16\n16\n16\n16\n16\n16\n16\n16\n16\n16\n16\n16\n16\n16\n16\n16\n16\n16\n16\n16\n16\n16\n16\n16\n16\n16\n16\n16\n16\n16\n16\n16\n35\n35\n35\n35\n35\n35\n35\n35\n35\n35\n35\n35\n35\n35\n35\n35\n35\n35\n35\n35\n35\n35\n35\n35\n35\n35\n35\n35\n35\n35\n35\n35\n35\n35\n35\n35\n35\n35\n35\n35\n35\n35\n35\n35\n35\n35\n35\n35\n35\n35", "100\n33\n33\n33\n33\n33\n33\n33\n33\n33\n33\n33\n33\n33\n33\n33\n33\n33\n33\n33\n33\n33\n33\n33\n33\n33\n33\n33\n33\n33\n33\n33\n33\n33\n33\n33\n33\n33\n33\n33\n33\n33\n33\n33\n33\n33\n33\n33\n33\n33\n33\n44\n44\n44\n44\n44\n44\n44\n44\n44\n44\n44\n44\n44\n44\n44\n44\n44\n44\n44\n44\n44\n44\n44\n44\n44\n44\n44\n44\n44\n44\n44\n44\n44\n44\n44\n44\n44\n44\n44\n44\n44\n44\n44\n44\n44\n44\n44\n44\n44\n44", "100\n54\n54\n54\n54\n54\n54\n54\n54\n54\n54\n54\n54\n54\n54\n54\n54\n54\n54\n54\n54\n54\n54\n54\n54\n54\n54\n54\n54\n54\n54\n54\n54\n54\n54\n54\n54\n54\n54\n54\n54\n54\n54\n54\n54\n54\n54\n54\n54\n54\n54\n98\n98\n98\n98\n98\n98\n98\n98\n98\n98\n98\n98\n98\n98\n98\n98\n98\n98\n98\n98\n98\n98\n98\n98\n98\n98\n98\n98\n98\n98\n98\n98\n98\n98\n98\n98\n98\n98\n98\n98\n98\n98\n98\n98\n98\n98\n98\n98\n98\n98", "100\n81\n81\n81\n81\n81\n81\n81\n81\n81\n81\n81\n81\n81\n81\n81\n81\n81\n81\n81\n81\n81\n81\n81\n81\n81\n81\n81\n81\n81\n81\n81\n81\n81\n81\n81\n81\n81\n81\n81\n81\n81\n81\n81\n81\n81\n81\n81\n81\n81\n81\n12\n12\n12\n12\n12\n12\n12\n12\n12\n12\n12\n12\n12\n12\n12\n12\n12\n12\n12\n12\n12\n12\n12\n12\n12\n12\n12\n12\n12\n12\n12\n12\n12\n12\n12\n12\n12\n12\n12\n12\n12\n12\n12\n12\n12\n12\n12\n12\n12\n12", "100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100", "100\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1", "40\n20\n20\n30\n30\n20\n20\n20\n30\n30\n20\n20\n30\n30\n30\n30\n20\n30\n30\n30\n30\n20\n20\n30\n30\n30\n20\n30\n20\n30\n20\n30\n20\n20\n20\n30\n20\n20\n20\n30\n30", "58\n100\n100\n100\n100\n100\n1\n1\n1\n1\n1\n1\n100\n100\n1\n100\n1\n100\n100\n1\n1\n100\n100\n1\n100\n1\n100\n100\n1\n1\n100\n1\n1\n1\n100\n1\n1\n1\n1\n100\n1\n100\n100\n100\n100\n100\n1\n1\n100\n100\n100\n100\n1\n100\n1\n1\n1\n1\n1", "98\n2\n99\n99\n99\n99\n2\n99\n99\n99\n2\n2\n99\n2\n2\n2\n2\n99\n99\n2\n99\n2\n2\n99\n99\n99\n99\n2\n2\n99\n2\n99\n99\n2\n2\n99\n2\n99\n2\n99\n2\n2\n2\n99\n2\n2\n2\n2\n99\n99\n99\n99\n2\n2\n2\n2\n2\n2\n2\n2\n99\n2\n99\n99\n2\n2\n99\n99\n99\n99\n99\n99\n99\n99\n2\n99\n2\n99\n2\n2\n2\n99\n99\n99\n99\n99\n99\n2\n99\n99\n2\n2\n2\n2\n2\n99\n99\n99\n2", "100\n100\n1\n100\n1\n1\n100\n1\n1\n1\n100\n100\n1\n100\n1\n100\n100\n1\n1\n1\n100\n1\n100\n1\n100\n100\n1\n100\n1\n100\n1\n1\n1\n1\n1\n100\n1\n100\n100\n100\n1\n100\n100\n1\n100\n1\n1\n100\n100\n100\n1\n100\n100\n1\n1\n100\n100\n1\n100\n1\n100\n1\n1\n100\n100\n100\n100\n100\n100\n1\n100\n100\n1\n100\n100\n1\n100\n1\n1\n1\n100\n100\n1\n100\n1\n100\n1\n1\n1\n1\n100\n1\n1\n100\n1\n100\n100\n1\n100\n1\n100", "100\n100\n100\n100\n1\n100\n1\n1\n1\n100\n1\n1\n1\n1\n100\n1\n100\n1\n100\n1\n100\n100\n100\n1\n100\n1\n1\n1\n100\n1\n1\n1\n1\n1\n100\n100\n1\n100\n1\n1\n100\n1\n1\n100\n1\n100\n100\n100\n1\n100\n100\n100\n1\n100\n1\n100\n100\n100\n1\n1\n100\n100\n100\n100\n1\n100\n36\n100\n1\n100\n1\n100\n100\n100\n1\n1\n1\n1\n1\n1\n1\n1\n1\n100\n1\n1\n100\n100\n100\n100\n100\n1\n100\n1\n100\n1\n1\n100\n100\n1\n100", "100\n2\n1\n1\n2\n2\n1\n1\n1\n1\n2\n1\n1\n1\n2\n2\n2\n1\n1\n1\n2\n1\n2\n2\n2\n2\n1\n1\n2\n1\n1\n2\n1\n27\n1\n1\n1\n2\n2\n2\n1\n2\n1\n2\n1\n1\n2\n2\n2\n2\n2\n2\n2\n2\n1\n2\n2\n2\n2\n1\n2\n1\n1\n1\n1\n1\n2\n1\n1\n1\n2\n2\n2\n2\n2\n2\n1\n1\n1\n1\n2\n2\n1\n2\n2\n1\n1\n1\n2\n1\n2\n2\n1\n1\n2\n1\n1\n1\n2\n2\n1", "100\n99\n99\n100\n99\n99\n100\n100\n100\n99\n100\n99\n99\n100\n99\n99\n99\n99\n99\n99\n100\n100\n100\n99\n100\n100\n99\n100\n99\n100\n100\n99\n100\n99\n99\n99\n100\n99\n10\n99\n100\n100\n100\n99\n100\n100\n100\n100\n100\n100\n100\n99\n100\n100\n100\n99\n99\n100\n99\n100\n99\n100\n100\n99\n99\n99\n99\n100\n99\n100\n100\n100\n100\n100\n100\n99\n99\n100\n100\n99\n99\n99\n99\n99\n99\n100\n99\n99\n100\n100\n99\n100\n99\n99\n100\n99\n99\n99\n99\n100\n100", "100\n29\n43\n43\n29\n43\n29\n29\n29\n43\n29\n29\n29\n29\n43\n29\n29\n29\n29\n43\n29\n29\n29\n43\n29\n29\n29\n43\n43\n43\n43\n43\n43\n29\n29\n43\n43\n43\n29\n43\n43\n43\n29\n29\n29\n43\n29\n29\n29\n43\n43\n43\n43\n29\n29\n29\n29\n43\n29\n43\n43\n29\n29\n43\n43\n29\n29\n95\n29\n29\n29\n43\n43\n29\n29\n29\n29\n29\n43\n43\n43\n43\n29\n29\n43\n43\n43\n43\n43\n43\n29\n43\n43\n43\n43\n43\n43\n29\n43\n29\n43", "100\n98\n98\n98\n88\n88\n88\n88\n98\n98\n88\n98\n88\n98\n88\n88\n88\n88\n88\n98\n98\n88\n98\n98\n98\n88\n88\n88\n98\n98\n88\n88\n88\n98\n88\n98\n88\n98\n88\n88\n98\n98\n98\n88\n88\n98\n98\n88\n88\n88\n88\n88\n98\n98\n98\n88\n98\n88\n88\n98\n98\n88\n98\n88\n88\n98\n88\n88\n98\n27\n88\n88\n88\n98\n98\n88\n88\n98\n98\n98\n98\n98\n88\n98\n88\n98\n98\n98\n98\n88\n88\n98\n88\n98\n88\n98\n98\n88\n98\n98\n88", "100\n50\n1\n1\n50\n50\n50\n50\n1\n50\n100\n50\n50\n50\n100\n1\n100\n1\n100\n50\n50\n50\n50\n50\n1\n50\n1\n100\n1\n1\n50\n100\n50\n50\n100\n50\n50\n100\n1\n50\n50\n100\n1\n1\n50\n1\n100\n50\n50\n100\n100\n1\n100\n1\n50\n100\n50\n50\n1\n1\n50\n100\n50\n100\n100\n100\n50\n50\n1\n1\n50\n100\n1\n50\n100\n100\n1\n50\n50\n50\n100\n50\n50\n100\n1\n50\n50\n50\n50\n1\n50\n50\n50\n50\n1\n50\n50\n100\n1\n50\n100", "100\n45\n45\n45\n45\n45\n45\n44\n44\n44\n43\n45\n44\n44\n45\n44\n44\n45\n44\n43\n44\n43\n43\n43\n45\n43\n45\n44\n45\n43\n44\n45\n45\n45\n45\n45\n45\n45\n45\n43\n45\n43\n43\n45\n44\n45\n45\n45\n44\n45\n45\n45\n45\n45\n45\n44\n43\n45\n45\n43\n44\n45\n45\n45\n45\n44\n45\n45\n45\n43\n43\n44\n44\n43\n45\n43\n45\n45\n45\n44\n44\n43\n43\n44\n44\n44\n43\n45\n43\n44\n43\n45\n43\n43\n45\n45\n44\n45\n43\n43\n45", "100\n12\n12\n97\n15\n97\n12\n15\n97\n12\n97\n12\n12\n97\n12\n15\n12\n12\n15\n12\n12\n97\n12\n12\n15\n15\n12\n97\n15\n12\n97\n15\n12\n12\n15\n15\n15\n97\n15\n97\n12\n12\n12\n12\n12\n97\n12\n97\n12\n15\n15\n12\n15\n12\n15\n12\n12\n12\n12\n12\n12\n12\n12\n97\n97\n12\n12\n97\n12\n97\n97\n15\n97\n12\n97\n97\n12\n12\n12\n97\n97\n15\n12\n12\n15\n12\n15\n97\n97\n12\n15\n12\n12\n97\n12\n15\n15\n15\n15\n12\n12", "12\n2\n3\n1\n3\n3\n1\n2\n1\n2\n1\n3\n2", "48\n99\n98\n100\n100\n99\n100\n99\n100\n100\n98\n99\n98\n98\n99\n98\n99\n98\n100\n100\n98\n100\n98\n99\n100\n98\n99\n98\n99\n99\n100\n98\n99\n99\n98\n100\n99\n98\n99\n98\n100\n100\n100\n99\n98\n99\n98\n100\n100", "4\n1\n3\n3\n3", "6\n1\n1\n1\n1\n2\n2", "4\n1\n1\n1\n2", "4\n1\n2\n2\n2", "4\n1\n2\n3\n4", "8\n1\n1\n2\n2\n3\n3\n4\n4", "4\n1\n3\n2\n4", "4\n10\n10\n10\n20", "4\n11\n12\n13\n13", "4\n1\n1\n1\n3", "6\n1\n1\n2\n2\n2\n2", "10\n1\n1\n2\n2\n2\n3\n3\n4\n4\n4"], "outputs": ["YES\n11 27", "NO", "NO", "NO", "YES\n1 100", "NO", "NO", "NO", "YES\n14 32", "YES\n50 100", "YES\n99 100", "YES\n4 5", "YES\n10 23", "YES\n11 34", "YES\n20 30", "YES\n1 100", "YES\n2 99", "YES\n1 100", "YES\n1 2", "YES\n12 49", "YES\n15 94", "YES\n33 42", "YES\n16 35", "YES\n33 44", "YES\n54 98", "YES\n12 81", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO"]} | UNKNOWN | [
"PYTHON3"
] | CODEFORCES | 208 | codeforces |
|
4982d2f28521315d88b166ca7f5f239e | Cards | User ainta loves to play with cards. He has *a* cards containing letter "o" and *b* cards containing letter "x". He arranges the cards in a row, and calculates the score of the deck by the formula below.
1. At first, the score is 0. 1. For each block of contiguous "o"s with length *x* the score increases by *x*2. 1. For each block of contiguous "x"s with length *y* the score decreases by *y*2.
For example, if *a*<==<=6,<=*b*<==<=3 and ainta have arranged the cards in the order, that is described by string "ooxoooxxo", the score of the deck equals 22<=-<=12<=+<=32<=-<=22<=+<=12<==<=9. That is because the deck has 5 blocks in total: "oo", "x", "ooo", "xx", "o".
User ainta likes big numbers, so he wants to maximize the score with the given cards. Help ainta make the score as big as possible. Note, that he has to arrange all his cards.
The first line contains two space-separated integers *a* and *b* (0<=≤<=*a*,<=*b*<=≤<=105; *a*<=+<=*b*<=≥<=1) — the number of "o" cards and the number of "x" cards.
In the first line print a single integer *v* — the maximum score that ainta can obtain.
In the second line print *a*<=+<=*b* characters describing the deck. If the *k*-th card of the deck contains "o", the *k*-th character must be "o". If the *k*-th card of the deck contains "x", the *k*-th character must be "x". The number of "o" characters must be equal to *a*, and the number of "x " characters must be equal to *b*. If there are many ways to maximize *v*, print any.
Please, do not write the %lld specifier to read or write 64-bit integers in С++. It is preferred to use the cin, cout streams or the %I64d specifier.
Sample Input
2 3
4 0
0 4
Sample Output
-1
xoxox
16
oooo-16
xxxx | {"inputs": ["2 3", "4 0", "0 4", "8 6", "28691 28312", "1 1", "46000 39000", "1234 5678", "19310 18", "38 5", "2 122", "9966 12376", "4 2", "0 26501", "500 500", "98751 29491", "1 18468", "75232 0", "83093 94343", "86224 91008", "92608 85844", "94989 92701", "83195 80484", "4 9", "8 10", "223 874", "206 209", "493 442", "18931 31308", "21944 37439", "29626 16323", "78912 100000", "5 17", "2 60570", "23 89946", "7 18030", "27813 15", "29648 34", "25661 14735", "2596 14758", "21478 14813", "1454 26690", "31161 18112", "1698 32709", "749 9800", "79123 95821", "79979 92032", "99979 12032", "1 2", "2 1", "1 1", "1 0", "0 1", "2 2", "4 1", "4 2", "4 3", "4 4", "4 5", "4 6", "4 7", "99999 99997"], "outputs": ["-1\nxoxox", "16\noooo", "-16\nxxxx", "46\nxxxooooooooxxx", "809737773\nxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxoooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooo...", "0\nox", "2092541530\nxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxoooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooo...", "976892\nxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxoooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooo...", "372875938\nxxxxxxxxxooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooo...", "1431\nxxxooooooooooooooooooooooooooooooooooooooxx", "-4960\nxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxoxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxoxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx", "95873950\nxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxoooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooo...", "14\nxoooox", "-702303001\nxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx...", "220582\nxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooo...", "9725946462\nxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxoooooooooooooooooooooooooooooooooooooooooooooooooooo...", "-170533511\nxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx...", "5659853824\nooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooo...", "6827912284\nxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxoooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooo...", "7359384778\nxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooo...", "8502762302\nxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooo...", "8942524504\nxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooo...", "6856118621\nxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxoooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooo...", "-13\nxxoxxoxxoxxox", "16\nxxxxoooooooxxxoxxx", "15479\nxxxxxxxxxxxxxxxxxxxoooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooxxxxxxxxxxxxxxxxxxxoxxxxxxxxxxxxxxxxxxxoxxxxxxxxxxxxxxxxxxxoxxxxxxxxxxxxxxxxxxxoxxxxxxxxxxxxxxxxxxxoxxxxxxxxxxxxxxxxxxxoxxxxxxxxxxxxxxxxxxxoxxxxxxxxxxxxxxxxxxxoxxxxxxxxxxxxxxxxxxxoxxxxxxxxxxxxxxxxxxxoxxxxxxxxxxxxxxxxxxxoxxxxxxxxxxxxxxxxxxxoxxxxxxxxxxxxxxxxxxxoxxxxxxxxxxxxxxxxxxxoxxxxxxxxxxxxxxxxxxxoxxxxxx...", "34847\nxxxxxxxxxxxxxxxxxxxoooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooxxxxxxxxxxxxxxxxxxxoxxxxxxxxxxxxxxxxxxxoxxxxxxxxxxxxxxxxxxxoxxxxxxxxxxxxxxxxxxxoxxxxxxxxxxxxxxxxxxxoxxxxxxxxxxxxxxxxxxxoxxxxxxxxxxxxxxxxxxxoxxxxxxxxxxxxxxxxxxxoxxxxxxxxxxxxxxxxxxxoxxxxxxxxxxxxxxxxxxx", "217415\nxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooo...", "346300009\nxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxoooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooo...", "465971835\nxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxoooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooo...", "869876049\nxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxoooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooo...", "6148027918\nxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxoooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooo...", "-44\nxxxoxxxoxxxoxxxoxxxoxx", "-1222908298\nxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx...", "-337095103\nxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx...", "-40635107\nxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx...", "773562856\nxxxxxxxxoooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooo...", "879003326\nxxxxxxxxxxxxxxxxxooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooo...", "651917342\nxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooo...", "4665910\nxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooo...", "455254951\nxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxoooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooo...", "-444804\nxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxoooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooo...", "962094403\nxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooo...", "-523357\nxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxoooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooo...", "-113239\nxxxxxxxxxxxxxxxxxxxxxxxxxxxxxoooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooxxxxxxxxxxxxxxxxxxxxxxxxxxxxxoxxxxxxxxxxxxxxxxxxxxxxxxxxxxxo...", "6184587446\nxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooo...", "6323396597\nxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxoooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooo...", "9985440319\nxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxooooooooooooooooooooooooooooooooooooooooooooooooooooo...", "-1\nxox", "3\noox", "0\nox", "1\no", "-1\nx", "2\nxoox", "15\noooox", "14\nxoooox", "11\nxxoooox", "8\nxxooooxx", "3\nxxxooooxx", "-2\nxxxooooxxx", "-7\nxxxoooxxoxx", "9910809718\nxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxoooooooooooooooooooooooooooooooooooooooooooooooooooo..."]} | UNKNOWN | [
"PYTHON3"
] | CODEFORCES | 4 | codeforces |
|
49b905b62f9c5824272b2291ceda48cc | New Year and North Pole | In this problem we assume the Earth to be a completely round ball and its surface a perfect sphere. The length of the equator and any meridian is considered to be exactly 40<=000 kilometers. Thus, travelling from North Pole to South Pole or vice versa takes exactly 20<=000 kilometers.
Limak, a polar bear, lives on the North Pole. Close to the New Year, he helps somebody with delivering packages all around the world. Instead of coordinates of places to visit, Limak got a description how he should move, assuming that he starts from the North Pole. The description consists of *n* parts. In the *i*-th part of his journey, Limak should move *t**i* kilometers in the direction represented by a string *dir**i* that is one of: "North", "South", "West", "East".
Limak isn’t sure whether the description is valid. You must help him to check the following conditions:
- If at any moment of time (before any of the instructions or while performing one of them) Limak is on the North Pole, he can move only to the South. - If at any moment of time (before any of the instructions or while performing one of them) Limak is on the South Pole, he can move only to the North. - The journey must end on the North Pole.
Check if the above conditions are satisfied and print "YES" or "NO" on a single line.
The first line of the input contains a single integer *n* (1<=≤<=*n*<=≤<=50).
The *i*-th of next *n* lines contains an integer *t**i* and a string *dir**i* (1<=≤<=*t**i*<=≤<=106, ) — the length and the direction of the *i*-th part of the journey, according to the description Limak got.
Print "YES" if the description satisfies the three conditions, otherwise print "NO", both without the quotes.
Sample Input
5
7500 South
10000 East
3500 North
4444 West
4000 North
2
15000 South
4000 East
5
20000 South
1000 North
1000000 West
9000 North
10000 North
3
20000 South
10 East
20000 North
2
1000 North
1000 South
4
50 South
50 North
15000 South
15000 North
Sample Output
YES
NO
YES
NO
NO
YES
| {"inputs": ["5\n7500 South\n10000 East\n3500 North\n4444 West\n4000 North", "2\n15000 South\n4000 East", "5\n20000 South\n1000 North\n1000000 West\n9000 North\n10000 North", "3\n20000 South\n10 East\n20000 North", "2\n1000 North\n1000 South", "4\n50 South\n50 North\n15000 South\n15000 North", "1\n1 South", "1\n1 East", "2\n1000000 South\n1000000 North", "1\n149 South", "1\n16277 East", "1\n19701 South", "1\n3125 South", "1\n6549 South", "1\n2677 South", "1\n6101 South", "1\n9525 South", "1\n5653 South", "2\n15072 South\n15072 North", "2\n11200 South\n11200 North", "2\n14624 South\n14624 North", "2\n18048 South\n15452 West", "2\n1472 West\n4930 North", "2\n17600 South\n17600 North", "2\n8320 East\n16589 East", "2\n4448 South\n4448 North", "2\n576 South\n576 North", "3\n14186 South\n2291 West\n14186 North", "3\n10314 South\n15961 North\n5647 South", "3\n1035 East\n18143 South\n18143 North", "3\n17163 South\n7620 East\n17163 North", "3\n587 South\n17098 North\n16511 South", "3\n16715 North\n6576 West\n12132 South", "3\n7435 South\n245 North\n7190 North", "3\n3563 South\n2427 South\n5990 North", "3\n6987 South\n11904 East\n19951 East", "4\n13301 South\n5948 East\n9265 East\n6891 North", "4\n16725 South\n8129 South\n19530 West\n24854 North", "4\n149 South\n17607 West\n18306 South\n18455 North", "4\n16277 South\n19789 North\n4379 South\n867 North", "4\n19701 South\n13458 South\n3156 North\n30003 North", "4\n3125 South\n15640 East\n6125 East\n19535 South", "4\n6549 East\n5118 North\n12198 East\n5118 South", "4\n2677 East\n1891 West\n10974 West\n7511 North", "4\n6102 South\n8265 East\n13943 South\n20045 North", "5\n12416 South\n18116 North\n10553 West\n18435 West\n5700 South", "5\n15840 South\n7594 South\n13522 South\n2423 South\n3334 West", "5\n19264 East\n13968 East\n19595 North\n19115 North\n38710 South", "5\n15392 South\n3445 North\n18372 East\n10399 North\n4403 South", "5\n18816 South\n5627 West\n14045 East\n7091 East\n18816 North", "5\n2240 South\n15104 North\n118 West\n11079 East\n12864 South", "5\n5664 South\n1478 South\n18894 South\n2363 West\n26036 North", "5\n1792 South\n10956 East\n9159 South\n19055 West\n10951 North", "5\n12512 South\n13137 North\n7936 North\n7235 South\n1326 South", "6\n14635 North\n14477 South\n17250 North\n14170 East\n15166 South\n2242 South", "6\n10763 North\n3954 West\n7515 North\n18158 West\n6644 South\n11634 South", "6\n14187 South\n13432 North\n6292 East\n14850 West\n10827 South\n9639 East", "6\n10315 South\n15614 South\n5069 West\n6134 South\n7713 North\n24350 North", "6\n1035 South\n9283 East\n15333 South\n2826 South\n19191 North\n3 North", "6\n17163 West\n11465 North\n14110 South\n6814 North\n3373 East\n4169 South", "6\n587 South\n942 West\n183 North\n18098 North\n260 East\n17694 South", "6\n16715 West\n3124 East\n3152 East\n14790 East\n11738 West\n11461 East", "6\n7435 South\n12602 South\n1929 East\n6074 East\n15920 West\n20037 North", "7\n13750 South\n6645 South\n18539 East\n5713 North\n1580 North\n10012 West\n13102 North", "7\n9878 West\n8827 East\n1508 West\n9702 North\n5763 North\n9755 North\n10034 South", "7\n13302 West\n2496 North\n284 West\n6394 East\n9945 North\n12603 West\n12275 North", "7\n16726 East\n19270 West\n6357 South\n17678 East\n14127 East\n12347 South\n6005 East", "7\n150 South\n1452 North\n9326 North\n1666 West\n18309 East\n19386 East\n8246 West", "7\n16278 South\n10929 South\n8103 East\n18358 West\n2492 West\n11834 South\n39041 North", "7\n19702 South\n13111 East\n6880 East\n9642 South\n6674 West\n18874 East\n1112 North", "7\n3126 South\n6780 North\n9848 West\n6334 North\n10856 West\n14425 West\n10649 East", "7\n6550 South\n8962 West\n15921 South\n17618 North\n15038 South\n1465 North\n18426 North", "8\n12864 South\n3005 West\n16723 West\n17257 West\n12187 East\n12976 South\n1598 North\n24242 North", "8\n8992 South\n12483 North\n15500 South\n1245 South\n9073 East\n12719 East\n3839 East\n7130 South", "8\n12416 North\n14665 South\n14277 North\n2129 South\n13255 East\n19759 South\n10272 West\n9860 North", "8\n15840 South\n4142 East\n17246 North\n13413 North\n4733 West\n15311 North\n12514 South\n17616 South", "8\n19264 South\n10516 North\n3319 East\n17401 East\n1620 West\n2350 West\n6243 North\n2505 North", "8\n15392 South\n7290 West\n2096 West\n14093 East\n5802 South\n2094 North\n8484 East\n19100 North", "8\n6113 South\n16767 East\n5064 South\n5377 West\n17280 South\n1838 West\n2213 West\n28457 North", "8\n2241 West\n18949 South\n11137 South\n2069 West\n14166 South\n1581 South\n4455 South\n50288 North", "8\n5665 South\n8426 East\n9914 North\n13353 South\n18349 North\n4429 East\n18184 North\n27429 South", "9\n11979 South\n2470 East\n10716 North\n12992 East\n15497 West\n15940 North\n8107 West\n18934 East\n6993 South", "9\n8107 South\n4652 North\n9493 North\n16980 West\n12383 West\n2980 West\n17644 South\n11043 West\n11447 North", "9\n18827 South\n18321 West\n8270 East\n968 West\n16565 West\n15427 North\n4077 North\n18960 North\n19006 West", "9\n14955 West\n503 North\n18535 West\n4956 South\n8044 South\n2467 East\n13615 East\n6877 East\n3460 North", "9\n18379 South\n9980 South\n17311 West\n8944 South\n4930 South\n18019 South\n48 West\n14794 South\n75046 North", "9\n14507 East\n12162 East\n16088 South\n5636 North\n9112 North\n5058 East\n9585 South\n2712 East\n10925 North", "9\n5227 East\n8936 North\n6353 North\n16920 North\n591 North\n4802 South\n8722 North\n3333 West\n36720 South", "9\n1355 North\n15309 West\n17834 North\n13612 East\n17477 North\n4546 North\n18260 East\n15442 North\n56654 South", "9\n4779 South\n4787 East\n3907 East\n4896 East\n1659 East\n4289 West\n4693 West\n3359 East\n4779 North", "1\n80000 South", "2\n40000 South\n20000 North", "1\n40000 South", "2\n20001 South\n20001 North", "4\n10000 South\n20000 South\n10000 North\n20000 North", "3\n10 South\n20 North\n10 North", "3\n1000 South\n1001 North\n1 North", "2\n20000 South\n20000 West", "3\n10000 South\n20000 South\n10000 North", "2\n1 East\n1 North", "2\n20000 West\n20000 West", "2\n80000 South\n20000 North", "2\n19999 South\n20001 South", "3\n500 South\n1000 North\n500 North", "1\n400000 South", "2\n40000 South\n80000 North", "2\n100 West\n100 North", "2\n40000 South\n40000 North", "2\n30000 South\n10000 North", "2\n20000 South\n40000 North", "10\n20000 South\n20000 North\n20000 South\n20000 North\n20000 South\n20000 North\n20000 South\n20000 North\n20000 South\n20000 North", "2\n40001 South\n40001 North", "2\n40001 South\n1 North", "2\n50000 South\n50000 North", "2\n30000 South\n30000 South", "2\n10000 South\n50000 North", "4\n15000 South\n15000 South\n15000 North\n15000 North", "3\n50 South\n100 North\n50 North", "2\n20001 South\n1 North", "3\n5 South\n6 North\n1 South", "1\n20000 South", "4\n1 South\n20000 South\n1 North\n20000 North", "2\n30000 South\n30000 North", "3\n1 South\n2 North\n1 South", "2\n60000 South\n60000 North", "2\n50000 South\n10000 North", "1\n5 North", "2\n20010 South\n19990 North", "3\n20000 South\n1 South\n20000 North", "3\n1 South\n2 North\n39999 North", "3\n10 South\n20 North\n10 South", "3\n1 South\n2 North\n1 North", "3\n2000 South\n19000 South\n19000 South", "6\n15000 South\n15000 South\n15000 South\n15000 North\n15000 North\n15000 North", "3\n1 South\n1 North\n1 East", "2\n1 West\n1 North", "3\n1 South\n123456 West\n1 North"], "outputs": ["YES", "NO", "YES", "NO", "NO", "YES", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "YES", "YES", "YES", "NO", "NO", "YES", "NO", "YES", "YES", "YES", "NO", "NO", "YES", "NO", "NO", "YES", "YES", "NO", "NO", "NO", "YES", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "YES", "NO", "NO", "YES", "NO", "NO", "NO", "NO", "NO", "YES", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "YES", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "YES", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "YES", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "YES"]} | UNKNOWN | [
"PYTHON3"
] | CODEFORCES | 6 | codeforces |
|
49bbc3a391b0992b425b3d452dcca37e | The Great Mixing | Sasha and Kolya decided to get drunk with Coke, again. This time they have *k* types of Coke. *i*-th type is characterised by its carbon dioxide concentration . Today, on the party in honour of Sergiy of Vancouver they decided to prepare a glass of Coke with carbon dioxide concentration . The drink should also be tasty, so the glass can contain only integer number of liters of each Coke type (some types can be not presented in the glass). Also, they want to minimize the total volume of Coke in the glass.
Carbon dioxide concentration is defined as the volume of carbone dioxide in the Coke divided by the total volume of Coke. When you mix two Cokes, the volume of carbon dioxide sums up, and the total volume of Coke sums up as well.
Help them, find the minimal natural number of liters needed to create a glass with carbon dioxide concentration . Assume that the friends have unlimited amount of each Coke type.
The first line contains two integers *n*, *k* (0<=≤<=*n*<=≤<=1000, 1<=≤<=*k*<=≤<=106) — carbon dioxide concentration the friends want and the number of Coke types.
The second line contains *k* integers *a*1,<=*a*2,<=...,<=*a**k* (0<=≤<=*a**i*<=≤<=1000) — carbon dioxide concentration of each type of Coke. Some Coke types can have same concentration.
Print the minimal natural number of liter needed to prepare a glass with carbon dioxide concentration , or -1 if it is impossible.
Sample Input
400 4
100 300 450 500
50 2
100 25
Sample Output
2
3
| {"inputs": ["400 4\n100 300 450 500", "50 2\n100 25", "500 3\n1000 5 5", "500 1\n1000", "874 3\n873 974 875", "999 2\n1 1000", "326 18\n684 49 373 57 747 132 441 385 640 575 567 665 323 515 527 656 232 701", "314 15\n160 769 201 691 358 724 248 47 420 432 667 601 596 370 469", "0 1\n0", "0 1\n1000", "345 5\n497 135 21 199 873", "641 8\n807 1000 98 794 536 845 407 331", "852 10\n668 1000 1000 1000 1000 1000 1000 639 213 1000", "710 7\n854 734 63 921 921 187 978", "134 6\n505 10 1 363 344 162", "951 15\n706 1000 987 974 974 706 792 792 974 1000 1000 987 974 953 953", "834 10\n921 995 1000 285 1000 166 1000 999 991 983", "917 21\n999 998 1000 997 1000 998 78 991 964 985 987 78 985 999 83 987 1000 999 999 78 83", "971 15\n692 1000 1000 997 1000 691 996 691 1000 1000 1000 692 1000 997 1000", "971 108\n706 706 991 706 988 997 996 997 991 996 706 706 996 706 996 984 1000 991 996 1000 724 724 997 991 997 984 997 1000 984 996 996 997 724 997 997 1000 997 724 984 997 996 988 997 706 706 997 1000 991 706 988 997 724 988 706 996 706 724 997 988 996 991 1000 1000 724 988 996 1000 988 984 996 991 724 706 988 991 724 1000 1000 991 984 984 706 724 706 988 724 984 984 991 988 991 706 997 984 984 1000 706 724 988 984 996 1000 988 997 984 724 991 991", "1000 16\n536 107 113 397 613 1 535 652 730 137 239 538 764 431 613 273", "998 2\n1 1000", "998 3\n1 999 1000", "998 4\n1 2 999 1000", "500 2\n1000 2", "508 15\n0 998 997 1 1 2 997 1 997 1000 0 3 3 2 4", "492 2\n706 4", "672 5\n4 6 1000 995 997", "410 4\n998 8 990 990", "499 2\n1000 2", "995 5\n996 997 998 999 1000", "500 3\n499 1000 300", "499 2\n0 1000", "1000 10\n0 1 2 3 4 5 6 7 8 9", "501 2\n1 1000"], "outputs": ["2", "3", "199", "-1", "2", "999", "3", "4", "1", "-1", "5", "7", "10", "5", "4", "6", "10", "12", "11", "10", "-1", "999", "500", "499", "499", "53", "351", "46", "54", "998", "-1", "7", "1000", "-1", "999"]} | UNKNOWN | [
"PYTHON3"
] | CODEFORCES | 2 | codeforces |
|
49f2657e95388d8b4d1a4f0171e94002 | Caesar's Legions | Gaius Julius Caesar, a famous general, loved to line up his soldiers. Overall the army had *n*1 footmen and *n*2 horsemen. Caesar thought that an arrangement is not beautiful if somewhere in the line there are strictly more that *k*1 footmen standing successively one after another, or there are strictly more than *k*2 horsemen standing successively one after another. Find the number of beautiful arrangements of the soldiers.
Note that all *n*1<=+<=*n*2 warriors should be present at each arrangement. All footmen are considered indistinguishable among themselves. Similarly, all horsemen are considered indistinguishable among themselves.
The only line contains four space-separated integers *n*1, *n*2, *k*1, *k*2 (1<=≤<=*n*1,<=*n*2<=≤<=100,<=1<=≤<=*k*1,<=*k*2<=≤<=10) which represent how many footmen and horsemen there are and the largest acceptable number of footmen and horsemen standing in succession, correspondingly.
Print the number of beautiful arrangements of the army modulo 100000000 (108). That is, print the number of such ways to line up the soldiers, that no more than *k*1 footmen stand successively, and no more than *k*2 horsemen stand successively.
Sample Input
2 1 1 10
2 3 1 2
2 4 1 1
Sample Output
1
5
0
| {"inputs": ["2 1 1 10", "2 3 1 2", "2 4 1 1", "10 10 5 7", "12 15 7 2", "20 8 4 8", "15 8 2 6", "100 100 10 10", "20 15 10 9", "18 4 3 1", "19 12 5 7", "20 4 9 4", "24 30 5 1", "56 37 4 1", "28 65 5 9", "67 26 6 1", "57 30 5 9", "56 40 3 2", "34 57 1 1", "78 21 10 1", "46 46 2 5", "34 55 2 9", "46 51 4 5", "64 23 3 6", "67 24 6 3", "78 14 3 9", "56 34 8 10", "57 25 10 4", "1 2 1 1", "1 1 1 1", "2 1 1 1", "99 100 10 10", "100 99 10 10", "100 100 9 10", "1 2 10 10", "1 3 10 10", "2 2 10 10", "2 2 1 2"], "outputs": ["1", "5", "0", "173349", "171106", "162585", "156", "950492", "26057516", "0", "77429711", "5631", "0", "84920121", "83961789", "89553795", "17123805", "69253068", "0", "96098560", "84310381", "13600171", "25703220", "7467801", "3793964", "0", "92618496", "4458038", "1", "2", "1", "65210983", "65210983", "67740290", "3", "4", "6", "3"]} | UNKNOWN | [
"PYTHON3"
] | CODEFORCES | 5 | codeforces |
|
4a24486ea6580c3b63d77eca7df64ea9 | New Year's Eve | Since Grisha behaved well last year, at New Year's Eve he was visited by Ded Moroz who brought an enormous bag of gifts with him! The bag contains *n* sweet candies from the good ol' bakery, each labeled from 1 to *n* corresponding to its tastiness. No two candies have the same tastiness.
The choice of candies has a direct effect on Grisha's happiness. One can assume that he should take the tastiest ones — but no, the holiday magic turns things upside down. It is the xor-sum of tastinesses that matters, not the ordinary sum!
A xor-sum of a sequence of integers *a*1,<=*a*2,<=...,<=*a**m* is defined as the bitwise XOR of all its elements: , here denotes the bitwise XOR operation; more about bitwise XOR can be found [here.](https://en.wikipedia.org/wiki/Bitwise_operation#XOR)
Ded Moroz warned Grisha he has more houses to visit, so Grisha can take no more than *k* candies from the bag. Help Grisha determine the largest xor-sum (largest xor-sum means maximum happiness!) he can obtain.
The sole string contains two integers *n* and *k* (1<=≤<=*k*<=≤<=*n*<=≤<=1018).
Output one number — the largest possible xor-sum.
Sample Input
4 3
6 6
Sample Output
7
7
| {"inputs": ["4 3", "6 6", "2 2", "1022 10", "415853337373441 52", "75 12", "1000000000000000000 1000000000000000000", "1 1", "1000000000000000000 2", "49194939 22", "228104606 17", "817034381 7", "700976748 4", "879886415 9", "18007336 10353515", "196917003 154783328", "785846777 496205300", "964756444 503568330", "848698811 317703059", "676400020444788 1", "502643198528213 1", "815936580997298686 684083143940282566", "816762824175382110 752185261508428780", "327942415253132295 222598158321260499", "328768654136248423 284493129147496637", "329594893019364551 25055600080496801", "921874985256864012 297786684518764536", "922701224139980141 573634416190460758", "433880815217730325 45629641110945892", "434707058395813749 215729375494216481", "435533301573897173 34078453236225189", "436359544751980597 199220719961060641", "437185783635096725 370972992240105630", "438012026813180149 111323110116193830", "438838269991263573 295468957052046146", "439664513169346997 46560240538186155", "440490752052463125 216165966013438147", "441316995230546549 401964286420555423", "952496582013329437 673506882352402278", "1000000000000000000 1", "2147483647 1", "2147483647 2", "2147483647 31", "8 2", "3 3", "4 1", "10 2", "288230376151711743 2", "5 2", "576460752303423487 2", "36028797018963967 123", "1125899906842623 2", "576460752303423489 5", "288230376151711743 3", "36028797018963967 345", "18014398509481984 30", "8 8", "8 1"], "outputs": ["7", "7", "3", "1023", "562949953421311", "127", "1152921504606846975", "1", "1152921504606846975", "67108863", "268435455", "1073741823", "1073741823", "1073741823", "33554431", "268435455", "1073741823", "1073741823", "1073741823", "676400020444788", "502643198528213", "1152921504606846975", "1152921504606846975", "576460752303423487", "576460752303423487", "576460752303423487", "1152921504606846975", "1152921504606846975", "576460752303423487", "576460752303423487", "576460752303423487", "576460752303423487", "576460752303423487", "576460752303423487", "576460752303423487", "576460752303423487", "576460752303423487", "576460752303423487", "1152921504606846975", "1000000000000000000", "2147483647", "2147483647", "2147483647", "15", "3", "4", "15", "288230376151711743", "7", "576460752303423487", "36028797018963967", "1125899906842623", "1152921504606846975", "288230376151711743", "36028797018963967", "36028797018963967", "15", "8"]} | UNKNOWN | [
"PYTHON3"
] | CODEFORCES | 176 | codeforces |
|
4a289f586bb2e6645c79c7f0cf249edc | Gerald is into Art | Gerald bought two very rare paintings at the Sotheby's auction and he now wants to hang them on the wall. For that he bought a special board to attach it to the wall and place the paintings on the board. The board has shape of an *a*1<=×<=*b*1 rectangle, the paintings have shape of a *a*2<=×<=*b*2 and *a*3<=×<=*b*3 rectangles.
Since the paintings are painted in the style of abstract art, it does not matter exactly how they will be rotated, but still, one side of both the board, and each of the paintings must be parallel to the floor. The paintings can touch each other and the edges of the board, but can not overlap or go beyond the edge of the board. Gerald asks whether it is possible to place the paintings on the board, or is the board he bought not large enough?
The first line contains two space-separated numbers *a*1 and *b*1 — the sides of the board. Next two lines contain numbers *a*2,<=*b*2,<=*a*3 and *b*3 — the sides of the paintings. All numbers *a**i*,<=*b**i* in the input are integers and fit into the range from 1 to 1000.
If the paintings can be placed on the wall, print "YES" (without the quotes), and if they cannot, print "NO" (without the quotes).
Sample Input
3 2
1 3
2 1
5 5
3 3
3 3
4 2
2 3
1 2
Sample Output
YES
NO
YES
| {"inputs": ["3 2\n1 3\n2 1", "5 5\n3 3\n3 3", "4 2\n2 3\n1 2", "3 3\n1 1\n1 1", "1000 1000\n999 999\n1 1000", "7 7\n5 5\n2 4", "3 3\n2 2\n2 2", "2 9\n5 1\n3 2", "9 9\n3 8\n5 2", "10 10\n10 5\n4 3", "10 6\n10 1\n5 7", "6 10\n6 3\n6 2", "7 10\n7 5\n1 7", "10 10\n7 4\n3 5", "4 10\n1 1\n9 3", "8 7\n1 7\n3 2", "5 10\n5 2\n3 5", "9 9\n9 7\n2 9", "8 10\n3 8\n7 4", "10 10\n6 6\n4 9", "8 9\n7 6\n2 3", "10 10\n9 10\n6 1", "90 100\n52 76\n6 47", "84 99\n82 54\n73 45", "100 62\n93 3\n100 35", "93 98\n75 32\n63 7", "86 100\n2 29\n71 69", "96 100\n76 21\n78 79", "99 100\n95 68\n85 32", "97 100\n95 40\n70 60", "100 100\n6 45\n97 54", "99 100\n99 72\n68 1", "88 100\n54 82\n86 45", "91 100\n61 40\n60 88", "100 100\n36 32\n98 68", "78 86\n63 8\n9 4", "72 93\n38 5\n67 64", "484 1000\n465 2\n9 535", "808 1000\n583 676\n527 416", "965 1000\n606 895\n533 394", "824 503\n247 595\n151 570", "970 999\n457 305\n542 597", "332 834\n312 23\n505 272", "886 724\n830 439\n102 594", "958 1000\n326 461\n836 674", "903 694\n104 488\n567 898", "800 1000\n614 163\n385 608", "926 1000\n813 190\n187 615", "541 1000\n325 596\n403 56", "881 961\n139 471\n323 731", "993 1000\n201 307\n692 758", "954 576\n324 433\n247 911", "7 3\n7 8\n1 5", "5 9\n2 7\n8 10", "10 4\n4 3\n5 10", "2 7\n8 3\n2 7", "1 4\n7 2\n3 2", "5 8\n5 1\n10 5", "3 5\n3 6\n10 7", "6 2\n6 6\n1 2", "10 3\n6 6\n4 7", "9 10\n4 8\n5 6", "3 8\n3 2\n8 7", "3 3\n3 4\n3 6", "6 10\n1 8\n3 2", "8 1\n7 5\n3 9", "9 7\n5 2\n4 1", "100 30\n42 99\n78 16", "64 76\n5 13\n54 57", "85 19\n80 18\n76 70", "57 74\n99 70\n86 29", "22 21\n73 65\n92 35", "90 75\n38 2\n100 61", "62 70\n48 12\n75 51", "23 17\n34 71\n98 34", "95 72\n65 31\n89 50", "68 19\n39 35\n95 65", "28 65\n66 27\n5 72", "100 16\n41 76\n24 15", "21 63\n28 73\n60 72", "85 18\n37 84\n35 62", "58 64\n98 30\n61 52", "32 891\n573 351\n648 892", "796 846\n602 302\n600 698", "665 289\n608 360\n275 640", "237 595\n318 161\n302 838", "162 742\n465 429\n571 29", "222 889\n491 923\n76 195", "794 140\n166 622\n378 905", "663 287\n193 212\n615 787", "427 433\n621 441\n868 558", "1000 388\n332 49\n735 699", "868 535\n409 690\n761 104", "632 786\n710 208\n436 290", "501 932\n463 636\n363 918", "73 79\n626 483\n924 517", "190 34\n653 163\n634 314", "2 4\n1 3\n1 4", "3 10\n1 1\n1 11", "5 4\n3 3\n2 6", "3 4\n1 6\n2 3"], "outputs": ["YES", "NO", "YES", "YES", "YES", "YES", "NO", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "YES", "NO", "NO", "YES", "NO", "YES", "NO", "YES", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "YES", "YES", "NO", "NO", "NO", "YES", "NO", "NO", "NO"]} | UNKNOWN | [
"PYTHON3"
] | CODEFORCES | 90 | codeforces |
|
4a2923425f3801d7d9f54971416d2e24 | Fox And Polygon | Fox Ciel just designed a puzzle game called "Polygon"! It is played using triangulations of a regular *n*-edge polygon. The goal is to transform one triangulation to another by some tricky rules.
Triangulation of an *n*-edge poylgon is a set of *n*<=-<=3 diagonals satisfying the condition that no two diagonals share a common internal point.
For example, the initial state of the game may look like (a) in above figure. And your goal may look like (c). In each step you can choose a diagonal inside the polygon (but not the one of edges of the polygon) and flip this diagonal.
Suppose you are going to flip a diagonal *a*<=–<=*b*. There always exist two triangles sharing *a*<=–<=*b* as a side, let's denote them as *a*<=–<=*b*<=–<=*c* and *a*<=–<=*b*<=–<=*d*. As a result of this operation, the diagonal *a*<=–<=*b* is replaced by a diagonal *c*<=–<=*d*. It can be easily proven that after flip operation resulting set of diagonals is still a triangulation of the polygon.
So in order to solve above case, you may first flip diagonal 6<=–<=3, it will be replaced by diagonal 2<=–<=4. Then you flip diagonal 6<=–<=4 and get figure (c) as result.
Ciel just proved that for any starting and destination triangulations this game has a solution. She wants you to solve it in no more than 20<=000 steps for any puzzle satisfying *n*<=≤<=1000.
The first line contain an integer *n* (4<=≤<=*n*<=≤<=1000), number of edges of the regular polygon.
Then follows two groups of (*n*<=-<=3) lines describing the original triangulation and goal triangulation.
Description of each triangulation consists of (*n*<=-<=3) lines. Each line contains 2 integers *a**i* and *b**i* (1<=≤<=*a**i*,<=*b**i*<=≤<=*n*), describing a diagonal *a**i*<=–<=*b**i*.
It is guaranteed that both original and goal triangulations are correct (i. e. no two diagonals share a common internal point in both of these triangulations).
First, output an integer *k* (0<=≤<=*k*<=≤<=20,<=000): number of steps.
Then output *k* lines, each containing 2 integers *a**i* and *b**i*: the endpoints of a diagonal you are going to flip at step *i*. You may output *a**i* and *b**i* in any order.
If there are several possible solutions, output any of them.
Sample Input
4
1 3
2 4
6
2 6
3 6
4 6
6 2
5 2
4 2
8
7 1
2 7
7 3
6 3
4 6
6 1
6 2
6 3
6 4
6 8
Sample Output
1
1 3
2
6 3
6 4
3
7 3
7 2
7 1 | {"inputs": ["4\n1 3\n2 4", "6\n2 6\n3 6\n4 6\n6 2\n5 2\n4 2", "8\n7 1\n2 7\n7 3\n6 3\n4 6\n6 1\n6 2\n6 3\n6 4\n6 8", "5\n5 2\n2 4\n5 2\n5 3", "5\n5 2\n2 4\n4 1\n3 1", "10\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n5 1\n5 2\n5 3\n5 7\n5 8\n5 9\n5 10", "20\n15 17\n15 18\n11 15\n11 18\n13 15\n13 11\n6 11\n6 18\n8 11\n8 6\n9 11\n5 18\n4 18\n2 4\n2 18\n1 18\n20 18\n11 18\n11 19\n16 18\n16 11\n14 16\n14 11\n13 11\n6 11\n6 19\n9 11\n9 6\n7 9\n3 6\n3 19\n4 6\n1 3\n1 19", "21\n21 3\n21 4\n1 3\n15 21\n15 4\n18 21\n18 15\n19 21\n16 18\n10 15\n10 4\n13 15\n13 10\n11 13\n8 10\n8 4\n6 8\n6 4\n13 16\n13 17\n14 16\n9 13\n9 17\n11 13\n11 9\n6 9\n6 17\n7 9\n20 6\n20 17\n2 6\n2 20\n3 6\n4 6\n21 2\n18 20", "22\n9 12\n9 13\n10 12\n3 9\n3 13\n6 9\n6 3\n7 9\n4 6\n1 3\n1 13\n21 1\n21 13\n18 21\n18 13\n19 21\n16 18\n16 13\n14 16\n14 5\n14 6\n22 5\n22 14\n3 5\n3 22\n1 3\n18 22\n18 14\n19 22\n20 22\n16 18\n16 14\n11 14\n11 6\n12 14\n9 11\n9 6\n7 9", "28\n24 27\n24 28\n25 27\n21 24\n21 28\n22 24\n17 21\n17 28\n19 21\n19 17\n11 17\n11 28\n14 17\n14 11\n15 17\n12 14\n9 11\n9 28\n6 9\n6 28\n7 9\n3 6\n3 28\n4 6\n1 3\n11 28\n11 1\n14 28\n14 11\n24 28\n24 14\n26 28\n26 24\n16 24\n16 14\n19 24\n19 16\n20 24\n22 24\n22 20\n17 19\n12 14\n4 11\n4 1\n9 11\n9 4\n7 9\n7 4\n5 7\n2 4", "29\n1 22\n1 23\n14 22\n14 1\n19 22\n19 14\n20 22\n16 19\n16 14\n17 19\n8 14\n8 1\n11 14\n11 8\n12 14\n9 11\n5 8\n5 1\n6 8\n2 5\n3 5\n27 1\n27 23\n28 1\n25 27\n25 23\n5 17\n5 18\n8 17\n8 5\n13 17\n13 8\n14 17\n15 17\n11 13\n11 8\n9 11\n6 8\n26 5\n26 18\n1 5\n1 26\n2 5\n3 5\n28 1\n28 26\n20 26\n20 18\n23 26\n23 20\n24 26\n21 23", "37\n28 11\n28 12\n1 11\n1 28\n4 11\n4 1\n8 11\n8 4\n9 11\n5 8\n6 8\n2 4\n32 1\n32 28\n35 1\n35 32\n36 1\n33 35\n30 32\n30 28\n24 28\n24 12\n25 28\n26 28\n17 24\n17 12\n21 24\n21 17\n22 24\n18 21\n19 21\n14 17\n14 12\n15 17\n14 20\n14 21\n18 20\n18 14\n15 18\n16 18\n5 14\n5 21\n9 14\n9 5\n11 14\n11 9\n12 14\n7 9\n7 5\n34 5\n34 21\n1 5\n1 34\n3 5\n3 1\n36 1\n36 34\n29 34\n29 21\n31 34\n31 29\n32 34\n26 29\n26 21\n27 29\n24 26\n24 21\n22 24", "7\n2 6\n2 7\n3 6\n4 6\n7 5\n1 5\n2 5\n3 5", "8\n2 7\n2 8\n4 7\n4 2\n5 7\n5 2\n5 3\n7 2\n7 5\n8 2"], "outputs": ["1\n3 1", "5\n6 2\n6 4\n3 1\n6 3\n5 3", "8\n6 3\n7 3\n7 2\n7 1\n7 4\n8 4\n4 1\n4 2", "3\n4 2\n5 2\n3 1", "3\n4 2\n5 2\n5 3", "12\n6 1\n7 1\n8 1\n9 1\n8 5\n9 5\n9 7\n4 1\n3 1\n10 8\n10 7\n9 7", "43\n11 9\n11 8\n11 6\n18 6\n18 5\n18 4\n18 2\n18 1\n18 11\n18 10\n18 15\n13 11\n15 11\n10 4\n10 2\n8 6\n10 6\n4 2\n5 2\n10 8\n7 5\n10 7\n5 1\n10 5\n5 3\n15 13\n12 10\n15 12\n14 12\n20 18\n20 17\n19 17\n17 15\n20 15\n15 10\n19 15\n18 15\n15 11\n20 10\n10 1\n10 3\n19 10\n10 6", "31\n13 10\n15 10\n15 4\n21 4\n21 3\n18 15\n21 15\n15 11\n15 13\n8 4\n10 4\n11 4\n11 3\n10 6\n10 8\n3 1\n11 8\n8 6\n6 1\n21 19\n21 18\n18 16\n21 16\n20 16\n16 11\n11 1\n21 11\n11 2\n20 11\n11 6\n17 11", "32\n12 10\n12 9\n13 9\n13 3\n13 1\n21 1\n18 13\n21 13\n21 11\n21 18\n21 16\n21 19\n18 16\n9 3\n11 3\n9 7\n9 6\n6 4\n11 8\n8 6\n6 1\n6 3\n16 13\n13 11\n19 17\n19 16\n16 11\n22 16\n11 1\n11 3\n22 11\n11 5", "35\n17 11\n28 11\n28 9\n28 6\n28 3\n28 17\n27 25\n27 24\n9 6\n14 6\n14 3\n11 9\n14 9\n14 11\n9 7\n6 3\n7 3\n6 4\n3 1\n10 8\n12 10\n14 10\n10 7\n14 7\n7 1\n11 7\n17 15\n17 14\n21 17\n28 21\n21 14\n21 16\n21 19\n24 21\n14 1", "53\n16 14\n19 14\n22 14\n22 1\n23 1\n27 1\n28 1\n23 15\n27 15\n28 15\n27 23\n27 22\n28 22\n28 25\n19 17\n19 16\n19 15\n22 19\n14 1\n14 8\n14 12\n14 11\n5 3\n5 2\n5 1\n8 5\n6 4\n8 4\n4 1\n4 2\n15 11\n8 1\n18 16\n29 27\n27 25\n29 25\n28 25\n25 22\n25 23\n29 22\n28 22\n22 15\n22 18\n26 22\n22 20\n29 15\n28 15\n15 1\n26 15\n18 15\n15 5\n15 8\n15 13", "76\n21 18\n21 17\n24 17\n24 12\n28 12\n28 11\n28 1\n32 1\n35 1\n36 1\n32 19\n35 19\n36 19\n35 28\n36 28\n35 33\n35 32\n36 32\n36 34\n24 22\n24 21\n24 19\n28 24\n11 9\n11 8\n11 4\n11 1\n17 12\n19 12\n19 11\n17 15\n17 14\n14 11\n8 4\n10 4\n8 6\n8 5\n4 2\n4 1\n10 8\n10 7\n12 10\n19 17\n19 16\n16 14\n10 1\n19 10\n10 5\n14 10\n28 25\n25 23\n23 19\n28 23\n26 23\n23 21\n30 28\n32 30\n37 35\n37 34\n37 32\n36 32\n32 28\n32 29\n37 28\n36 28\n28 19\n34 28\n28 21\n28 26\n37 19\n36 19\n19 1\n34 19\n19 5\n21 19\n19 14", "7\n6 3\n6 2\n7 2\n6 4\n7 4\n4 1\n4 2", "10\n7 2\n8 2\n7 5\n7 4\n8 6\n6 4\n4 1\n8 4\n7 4\n4 2"]} | UNKNOWN | [
"PYTHON3"
] | CODEFORCES | 1 | codeforces |
|
4a300e8ace2b5a9aa665fdd66426a084 | Economy Game | Kolya is developing an economy simulator game. His most favourite part of the development process is in-game testing. Once he was entertained by the testing so much, that he found out his game-coin score become equal to 0.
Kolya remembers that at the beginning of the game his game-coin score was equal to *n* and that he have bought only some houses (for 1<=234<=567 game-coins each), cars (for 123<=456 game-coins each) and computers (for 1<=234 game-coins each).
Kolya is now interested, whether he could have spent all of his initial *n* game-coins buying only houses, cars and computers or there is a bug in the game. Formally, is there a triple of non-negative integers *a*, *b* and *c* such that *a*<=×<=1<=234<=567<=+<=*b*<=×<=123<=456<=+<=*c*<=×<=1<=234<==<=*n*?
Please help Kolya answer this question.
The first line of the input contains a single integer *n* (1<=≤<=*n*<=≤<=109) — Kolya's initial game-coin score.
Print "YES" (without quotes) if it's possible that Kolya spent all of his initial *n* coins buying only houses, cars and computers. Otherwise print "NO" (without quotes).
Sample Input
1359257
17851817
Sample Output
YESNO | {"inputs": ["1359257", "17851817", "1000000000", "17851818", "438734347", "43873430", "999999987", "27406117", "27404883", "27403649", "27402415", "27401181", "999999999", "999999244", "999129999", "17159199", "13606913", "14841529", "915968473", "980698615", "912331505", "917261049", "999999997", "12345", "1234", "124690", "1359257", "1358023", "1234", "1234567", "124690", "1358023", "123456", "2592590", "999999998", "1356789", "12345670", "11", "1480800", "908000000", "3000", "1235801", "991919191", "25613715", "13580237", "14814804", "11403961", "999999989", "1237035", "81134231", "1236", "1359250", "100", "987654321", "122222", "123458", "20987639", "999973333", "253082", "1235", "803219200", "100000000", "1485181"], "outputs": ["YES", "NO", "YES", "YES", "YES", "YES", "YES", "NO", "NO", "NO", "NO", "NO", "YES", "YES", "YES", "NO", "NO", "NO", "YES", "YES", "YES", "YES", "YES", "NO", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "NO", "YES", "NO", "YES", "YES", "NO", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "NO", "YES", "NO", "YES", "NO", "NO", "YES", "YES", "YES", "NO", "YES", "YES", "YES"]} | UNKNOWN | [
"PYTHON3"
] | CODEFORCES | 56 | codeforces |
|
4a3abdb3853aba03dd032f21afa9b29e | Vanya and Cubes | Vanya got *n* cubes. He decided to build a pyramid from them. Vanya wants to build the pyramid as follows: the top level of the pyramid must consist of 1 cube, the second level must consist of 1<=+<=2<==<=3 cubes, the third level must have 1<=+<=2<=+<=3<==<=6 cubes, and so on. Thus, the *i*-th level of the pyramid must have 1<=+<=2<=+<=...<=+<=(*i*<=-<=1)<=+<=*i* cubes.
Vanya wants to know what is the maximum height of the pyramid that he can make using the given cubes.
The first line contains integer *n* (1<=≤<=*n*<=≤<=104) — the number of cubes given to Vanya.
Print the maximum possible height of the pyramid in the single line.
Sample Input
1
25
Sample Output
1
4
| {"inputs": ["1", "25", "2", "4115", "9894", "7969", "6560", "4", "3", "5", "19", "20", "9880", "9879", "7770", "7769", "2925", "220", "219", "3046", "7590", "1014", "7142", "9999", "10000"], "outputs": ["1", "4", "1", "28", "38", "35", "33", "2", "1", "2", "3", "4", "38", "37", "35", "34", "25", "10", "9", "25", "34", "17", "34", "38", "38"]} | UNKNOWN | [
"PYTHON3"
] | CODEFORCES | 291 | codeforces |
|
4a53944b64c9021707880d6929270e7b | Blown Garland | Nothing is eternal in the world, Kostya understood it on the 7-th of January when he saw partially dead four-color garland.
Now he has a goal to replace dead light bulbs, however he doesn't know how many light bulbs for each color are required. It is guaranteed that for each of four colors at least one light is working.
It is known that the garland contains light bulbs of four colors: red, blue, yellow and green. The garland is made as follows: if you take any four consecutive light bulbs then there will not be light bulbs with the same color among them. For example, the garland can look like "RYBGRYBGRY", "YBGRYBGRYBG", "BGRYB", but can not look like "BGRYG", "YBGRYBYGR" or "BGYBGY". Letters denote colors: 'R' — red, 'B' — blue, 'Y' — yellow, 'G' — green.
Using the information that for each color at least one light bulb still works count the number of dead light bulbs of each four colors.
The first and the only line contains the string *s* (4<=≤<=|*s*|<=≤<=100), which describes the garland, the *i*-th symbol of which describes the color of the *i*-th light bulb in the order from the beginning of garland:
- 'R' — the light bulb is red, - 'B' — the light bulb is blue, - 'Y' — the light bulb is yellow, - 'G' — the light bulb is green, - '!' — the light bulb is dead.
The string *s* can not contain other symbols except those five which were described.
It is guaranteed that in the given string at least once there is each of four letters 'R', 'B', 'Y' and 'G'.
It is guaranteed that the string *s* is correct garland with some blown light bulbs, it means that for example the line "GRBY!!!B" can not be in the input data.
In the only line print four integers *k**r*,<=*k**b*,<=*k**y*,<=*k**g* — the number of dead light bulbs of red, blue, yellow and green colors accordingly.
Sample Input
RYBGRYBGR
!RGYB
!!!!YGRB
!GB!RG!Y!
Sample Output
0 0 0 00 1 0 01 1 1 12 1 1 0 | {"inputs": ["RYBGRYBGR", "!RGYB", "!!!!YGRB", "!GB!RG!Y!", "RYBG", "!Y!!!Y!!G!!!G!!B!!R!!!!B!!!!!Y!!G!R!!!!!!!!!!!!B!!!!GY!B!!!!!YR!G!!!!!!B!Y!B!!!!!!R!G!!!!!!!G!R!!!!B", "!R!GBRYG!RYGB!!G!!YG!!Y!!", "RBGYRBGYRBGYRBGYRBGYRBGYRBGYRBGYRBGYRBGYRBGYRBGYRBGYRBGYRBGYRBGYRBGYRBGYRBGYRBGYRBGYRBGYRBGYRBGYRBGY", "GYRB!", "RBYGR", "BRYGB", "YRGBY", "GBYRG", "GBYR!!!!", "!!!BRYG!!", "!!!YBGR!!!", "R!!Y!!B!!G!", "!!!!BR!!!!GY", "!!!!!!!!!!!!!!!!!!Y!!!!!!!!!!!!!!!!!!B!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!G!!R!!!!!!!!!!!!", "!!G!!!G!!!G!!!G!!!GB!!G!!!G!!YG!!!G!!!G!!!G!!!G!!!G!!!G!!!G!!!G!!!G!!!G!!!G!!!G!!!G!!!G!!!G!R!G!!!G!", "!!Y!!!Y!!!Y!!!Y!!!Y!!!Y!!!YR!!Y!!!Y!B!Y!!!Y!!!Y!!!Y!!!Y!!GY!!!Y!!!Y!!!Y!!!Y!!!Y!!!Y!!!Y!!!Y!!!Y!!!Y!", "!B!!!B!!!B!!!B!!!B!!!B!G!B!!!B!!!B!!!B!!!B!!!B!!!BR!!B!!!B!!!B!!!B!!!B!!YB!!!B!!!B!!!B!!!B!!!B!!!B!!", "YR!!!R!!!RB!!R!!!R!!!R!!!R!!!R!!!R!!!R!!!R!!!R!!!R!!!R!!!R!!!R!!!R!!!R!!!R!!!R!!!R!G!R!!!R!!!R!!!R!!", "R!YBRGY!R!", "B!RGB!!GBYR!B!R", "Y!!GYB!G!!!!YB!G!!RG", "R!!BRYG!!YG!R!!!R!!!!!G!R!!!!!", "R!!!R!!!R!!!R!B!RGB!!G!!R!B!R!B!RG!YR!B!", "!Y!R!Y!RB!G!BY!!!!!R!YG!!YGRB!!!!!!!BYGR!!!RBYGRBY", "!!G!!!!!Y!!RYBGRY!!R!!!R!!!!!!!R!B!!!!!R!!!R!!!R!!!R!!!R!!!!", "!!BG!!B!!RBG!!B!YRB!!!B!YRBG!!BG!!B!!!BG!!BG!RB!Y!!!!!B!Y!B!Y!!!!!B!!!", "R!GBRYGBRYGBRYG!RY!BRYGBRYGBRYGBRYGBRYGBRYGBRYGBRYGBR!GBRY!BRY!BRYGBRYGBRYGBRYGB", "!!!!B!!!!G!!B!R!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!YB!R!!!!!!G!!!!!!!!", "G!!!GY!!GYBRGYB!GY!RG!B!GYBRGY!!GY!!GYBRGYBRGY!RGY!!GYBRGY!!G!BRGYB!GYBRGYB!GY!!G!!RGYB!GYB!G!B!GYB!", "R!!!!!!Y!B!!!!!!!!!!!!!!R!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!Y!!G!!!!!!!!!!!!!!!!!!!!!!!!!!!!!", "!!YR!!YR!!YR!!YR!!YR!BYR!!YR!!YR!!YRG!YR!!YR!!YR!!YR!!YR!!YR!!YR!!YR!!YR!!YR!!YR!!YR!!YR!!YR!!YR!!YR", "!!!YR!B!!!B!R!!!R!!YR!BY!G!YR!B!R!BYRG!!!!BY!!!!!!B!!!B!R!!Y!!B!!GB!R!B!!!!!!G!!RG!!R!BYR!!!!!B!!!!!", "B!RG!!R!B!R!B!R!B!R!!!R!B!RG!!RGB!R!!!RGB!!!!YR!B!!!!!RGB!R!B!R!B!!!!!RGBY!!B!RG!Y!GB!!!B!!GB!RGB!R!", "!B!YR!!YR!!YRB!Y!B!Y!B!Y!!!YR!GYR!!YRB!YR!!Y!!!YR!!YRB!YR!!Y!B!Y!!!Y!!!YR!!Y!B!YRB!YR!!YR!!Y!B!Y!B!Y", "!RBYGRBYGRBY!!!!GRBYGRB!GRBY!R!YGRBYG!BYGRBYG!!Y!!BYGRB!G!B!G!!!G!BY!RBYGRB!!R!!GR!YG!BY!!B!GR!Y!!!!", "BRG!!RGYBRGYBRG!B!GY!!GYB!GY!!G!BRGY!RGYB!G!!RGYBRGYB!GY!!GYB!GYBRGY!!GYB!GY!!GYB!GY!!GYBRGY!!GYB!G", "!Y!!!!!!!!!!!!!!!!!GB!!!!!!!!!!!!Y!!!!!!!!!!!!!!!!!!!!!!!!!!!!R!!!!!!!!!!!!!!!!!!!!!!!!!!!R!!!!!!!", "!R!!Y!G!!!!BYR!!!!G!!!!!!R!!!!!!!!!B!!!B!R!BY!!B!!GB!!G!!!G!!!G!!!!!!R!!!!G!!!!!Y!!BY!!!!!!!Y!!!", "!!GYRBGY!BGY!BGY!BGYR!G!RBGYRBGYR!G!RBGY!BGY!!GY!BGY!BGYRBGYR!GYRBGYR!G!!BGY!!GY!!GY!BGY!!GY!BG", "!!!!!!!!Y!!!!!!!!!GR!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!B!!!!!!Y!!!!!!R!!!!!!!!!!!!!!!!!!!!!!!!!!", "!B!!Y!!GY!RGY!!!!!!!!!!!Y!!!!!!!!!!!!!!!!!RG!BR!!!!!!!!G!!!!!B!!!!R!!B!G!B!!YB!!Y!!!!BRG!!!G", "YB!!Y!GR!B!!YB!RYBG!!!!RY!GR!!!R!B!R!B!R!!!R!B!R!B!!!B!!YB!R!!G!YB!!Y!!R!BG!!!!!!B!!!!!R!!!", "R!G!R!GBR!!BR!GB!!!B!!!BR!GBRYG!R!!!R!GBRYGBR!GBR!!BR!GBR!GBRY!B!!!!R!!BR!!BR!!!!!!B!!!BR!", "YRB!Y!B!YRB!Y!!!Y!B!YR!!YR!!Y!!!YRB!YR!!YRB!Y!B!YRB!YR!!Y!!!YR!!YRB!YR!!Y!B!YRB!Y!!GYR!!Y", "!!GBRY!!!YG!R!GBR!G!RY!B!YGB!!G!RYGBRYGB!Y!BR!G!RYGBRYGBRYGBRYGBRYGBRYGB!Y!B!YGBR!!BRYGB", "G!!!!Y!!!!R!!!!B", "!Y!!!!!!G!!!!!!!!!B!!!!!!!!!!!!R", "RGBYRGBYRGBY", "!!!!!!!!!GBYRGBY", "RBYGRBYGRBYGRB!", "R!!!!!!!!!!!!B!!!!!!!!!!!!Y!!!!!!!!!!!!G", "GY!!!!R!!Y!B", "R!!!!!!!!!!!!!!!!!!!!!!!!Y!!!!!!!!!!!!!!!!!!!!!!!!G!!!!!!!!!!!!!!!!!!!!!!!!B!!!!!!!!!!!!!!!!!!!!!!!!", "R!!!!G!!!!B!!!!Y", "R!!!!B!!!!Y!!!!G!!!!", "!R!B!!!!G!Y", "!!!!!R!!!!G!!!!B!!!!Y!!!!!!!!!", "R!!!!B!!!!Y!!!!G", "!!!!!R!!!!G!!!!B!!!!!!!!Y!!!!!!!!!", "!!!!!!!!R!!!!!!!!B!!!!!!!!G!!!!!!!!Y!!!!!!!!"], "outputs": ["0 0 0 0", "0 1 0 0", "1 1 1 1", "2 1 1 0", "0 0 0 0", "20 18 19 18", "3 5 2 1", "0 0 0 0", "0 0 0 1", "0 0 0 0", "0 0 0 0", "0 0 0 0", "0 0 0 0", "1 1 1 1", "2 1 1 1", "1 2 1 2", "2 2 1 2", "2 2 2 2", "24 24 24 24", "24 24 24 0", "24 24 0 24", "24 0 24 24", "0 24 24 24", "0 1 0 2", "1 0 3 1", "4 3 2 1", "3 6 6 4", "1 5 9 7", "5 7 5 7", "5 13 12 13", "14 2 13 11", "0 1 2 3", "20 20 21 21", "15 10 5 0", "23 24 23 24", "0 24 0 24", "13 12 17 20", "7 8 22 15", "11 14 0 24", "10 8 9 8", "15 10 4 0", "22 24 23 23", "19 17 18 17", "14 9 3 0", "21 23 22 22", "18 16 17 16", "10 10 15 18", "5 5 20 12", "8 11 0 21", "7 5 6 5", "3 3 3 3", "7 7 7 7", "0 0 0 0", "3 2 2 2", "0 0 1 0", "9 9 9 9", "2 2 1 2", "24 24 24 24", "3 3 3 3", "4 4 4 4", "2 1 2 2", "7 6 7 6", "3 3 3 3", "8 7 8 7", "10 10 10 10"]} | UNKNOWN | [
"PYTHON3"
] | CODEFORCES | 25 | codeforces |
|
4abb8eb6057670c2c03f4e296ac68c82 | Restaurant Tables | In a small restaurant there are *a* tables for one person and *b* tables for two persons.
It it known that *n* groups of people come today, each consisting of one or two people.
If a group consist of one person, it is seated at a vacant one-seater table. If there are none of them, it is seated at a vacant two-seater table. If there are none of them, it is seated at a two-seater table occupied by single person. If there are still none of them, the restaurant denies service to this group.
If a group consist of two people, it is seated at a vacant two-seater table. If there are none of them, the restaurant denies service to this group.
You are given a chronological order of groups coming. You are to determine the total number of people the restaurant denies service to.
The first line contains three integers *n*, *a* and *b* (1<=≤<=*n*<=≤<=2·105, 1<=≤<=*a*,<=*b*<=≤<=2·105) — the number of groups coming to the restaurant, the number of one-seater and the number of two-seater tables.
The second line contains a sequence of integers *t*1,<=*t*2,<=...,<=*t**n* (1<=≤<=*t**i*<=≤<=2) — the description of clients in chronological order. If *t**i* is equal to one, then the *i*-th group consists of one person, otherwise the *i*-th group consists of two people.
Print the total number of people the restaurant denies service to.
Sample Input
4 1 2
1 2 1 1
4 1 1
1 1 2 1
Sample Output
0
2
| {"inputs": ["4 1 2\n1 2 1 1", "4 1 1\n1 1 2 1", "1 1 1\n1", "2 1 2\n2 2", "5 1 3\n1 2 2 2 1", "7 6 1\n1 1 1 1 1 1 1", "10 2 1\n2 1 2 2 2 2 1 2 1 2", "20 4 3\n2 2 2 2 2 2 2 2 1 2 1 1 2 2 1 2 2 2 1 2", "1 1 1\n1", "1 1 1\n2", "1 200000 200000\n2", "30 10 10\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 2 2 2 2 2 2 2 2 2 2", "4 1 2\n1 1 1 2", "6 2 3\n1 2 1 1 1 2", "6 1 4\n1 1 1 1 1 2", "6 1 3\n1 1 1 1 2 2", "6 1 3\n1 1 1 1 1 2", "6 4 2\n2 1 2 2 1 1", "3 10 1\n2 2 2", "5 1 3\n1 1 1 1 2", "5 2 2\n1 1 1 1 2", "15 5 5\n1 1 1 1 1 1 1 1 1 1 2 2 2 2 2", "5 1 2\n1 1 1 1 1", "3 6 1\n2 2 2", "5 3 3\n2 2 2 2 2", "8 3 3\n1 1 1 1 1 1 2 2", "5 1 2\n1 1 1 2 1", "6 1 4\n1 2 2 1 2 2", "2 1 1\n2 2", "2 2 1\n2 2", "5 8 1\n2 2 2 2 2", "3 1 4\n1 1 2", "7 1 5\n1 1 1 1 1 1 2", "6 1 3\n1 1 1 2 1 1", "6 1 2\n1 1 1 2 2 2", "8 1 4\n2 1 1 1 2 2 2 2", "4 2 3\n2 2 2 2", "3 1 1\n1 1 2", "5 1 1\n2 2 2 2 2", "10 1 5\n1 1 1 1 1 2 2 2 2 2", "5 1 2\n1 1 1 2 2", "4 1 1\n1 1 2 2", "7 1 2\n1 1 1 1 1 1 1", "5 1 4\n2 2 2 2 2", "6 2 3\n1 1 1 1 2 2", "5 2 2\n2 1 2 1 2", "4 6 1\n2 2 2 2", "6 1 4\n1 1 2 1 1 2", "7 1 3\n1 1 1 1 2 2 2", "4 1 2\n1 1 2 2", "3 1 2\n1 1 2", "6 1 3\n1 2 1 1 2 1", "6 1 3\n1 1 1 2 2 2", "10 2 2\n1 1 1 1 2 2 2 2 2 2", "10 1 4\n1 1 1 1 1 2 2 2 2 2", "3 10 2\n2 2 2", "4 3 1\n1 2 2 2", "7 1 4\n1 1 1 1 1 2 2", "3 4 1\n2 2 2", "4 1 2\n2 1 1 2", "10 1 2\n1 1 1 1 1 1 1 1 1 2", "5 1 3\n1 1 2 1 2", "6 1 3\n1 1 1 1 2 1", "6 1 4\n1 1 1 2 2 2", "7 1 2\n1 2 1 1 1 1 1", "6 2 2\n1 1 1 1 1 1", "6 1 2\n1 1 2 1 1 1", "3 3 1\n2 2 1", "8 4 2\n1 1 1 1 1 1 1 2", "9 1 4\n1 1 1 1 1 2 2 2 2", "5 10 1\n2 2 2 2 2", "3 5 1\n2 2 2", "5 100 1\n2 2 2 2 2", "4 1 2\n1 1 1 1", "4 1 1\n1 1 1 1", "7 2 2\n1 1 1 1 1 1 1"], "outputs": ["0", "2", "0", "0", "1", "0", "13", "25", "0", "0", "0", "20", "2", "2", "2", "4", "2", "2", "4", "2", "2", "10", "0", "4", "4", "4", "2", "2", "2", "2", "8", "0", "2", "0", "6", "6", "2", "2", "8", "8", "4", "4", "2", "2", "2", "2", "6", "2", "6", "2", "0", "2", "4", "12", "10", "2", "4", "4", "4", "2", "6", "2", "2", "2", "3", "0", "2", "2", "2", "8", "8", "4", "8", "0", "1", "1"]} | UNKNOWN | [
"PYTHON3"
] | CODEFORCES | 104 | codeforces |
|
4acf4ae14d6675929825cacfbbbf1acd | Nastya Studies Informatics | 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](https://en.wikipedia.org/wiki/Greatest_common_divisor) of *a* and *b*, and *LCM*(*a*,<=*b*) denotes the [least common multiple](https://en.wikipedia.org/wiki/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*.
The only line contains four integers *l*,<=*r*,<=*x*,<=*y* (1<=≤<=*l*<=≤<=*r*<=≤<=109, 1<=≤<=*x*<=≤<=*y*<=≤<=109).
In the only line print the only integer — the answer for the problem.
Sample Input
1 2 1 2
1 12 1 12
50 100 3 30
Sample Output
2
4
0
| {"inputs": ["1 2 1 2", "1 12 1 12", "50 100 3 30", "1 1000000000 1 1000000000", "1 1000000000 158260522 200224287", "1 1000000000 2 755829150", "1 1000000000 158260522 158260522", "1 1000000000 877914575 877914575", "232 380232688 116 760465376", "47259 3393570 267 600661890", "1 1000000000 1 672672000", "1000000000 1000000000 1000000000 1000000000", "1 1000000000 1 649209600", "1 1000000000 1 682290000", "1 1000000000 1 228614400", "1 1000000000 1 800280000", "1 1000000000 1 919987200", "1 1000000000 1 456537870", "1 1000000000 1 7198102", "1 1000000000 1 58986263", "1 1000000000 1 316465536", "1 1000000000 1 9558312", "1 1000000000 1 5461344", "58 308939059 29 617878118", "837 16262937 27 504151047", "47275 402550 25 761222050", "22 944623394 22 944623394", "1032 8756124 12 753026664", "7238 939389 11 618117962", "58351 322621 23 818489477", "3450 7068875 25 975504750", "13266 1606792 22 968895576", "21930 632925 15 925336350", "2193 4224517 17 544962693", "526792 39807152 22904 915564496", "67728 122875524 16932 491502096", "319813 63298373 24601 822878849", "572464 23409136 15472 866138032", "39443 809059020 19716 777638472", "2544768 8906688 27072 837228672", "413592 46975344 21768 892531536", "11349 816231429 11349 816231429", "16578 939956022 16578 939956022", "2783175 6882425 21575 887832825", "2862252 7077972 22188 913058388", "1856828 13124976 25436 958123248", "100 1000000000 158260522 158260522", "100 1000000000 877914575 877914575", "100 1000000000 602436426 602436426", "100 1000000000 24979445 24979445", "1 1000000000 18470 112519240", "1 1000000000 22692 2201124", "1 1000000000 24190 400949250", "1 1000000000 33409 694005157", "1 1000000000 24967 470827686", "1 1000000000 35461 152517761", "2 1000000000 158260522 200224287", "2 1000000000 602436426 611751520", "2 1000000000 861648772 942726551", "2 1000000000 433933447 485982495", "2 1000000000 262703497 480832794", "2672374 422235092 1336187 844470184", "1321815 935845020 1321815 935845020", "29259607 69772909 2250739 907047817", "11678540 172842392 2335708 864211960", "297 173688298 2876112 851329152", "7249 55497026 659 610467286", "398520 1481490 810 728893080", "2354 369467362 1177 738934724", "407264 2497352 1144 889057312", "321399 1651014 603 879990462", "475640 486640 440 526057840", "631714 179724831 1136 717625968", "280476 1595832 588 761211864", "10455 39598005 615 673166085", "24725 19759875 575 849674625", "22 158 2 1738", "1 2623 1 2623", "7 163677675 3 18", "159 20749927 1 158", "5252 477594071 1 5251", "2202 449433679 3 6603", "6 111 3 222", "26 46 2 598", "26 82 2 1066", "1 2993 1 2993", "17 17 1 289", "177 267 3 15753", "7388 22705183 1 7387", "1 100 3 100", "1 1000 6 1024", "1 100 2 4", "1 10000 2 455", "1 1000000000 250000000 1000000000", "3 3 1 1", "1 1000000000 100000000 1000000000", "5 10 3 3", "1 1000 5 13", "2 2 3 3", "1 1000000000 499999993 999999986", "1 1 1 10", "1 10 10 100", "1 1000 4 36", "1 1000000000 10000000 20000000", "100 100 5 5", "3 3 3 9", "36 200 24 144", "1 100 3 10"], "outputs": ["2", "4", "0", "4", "0", "8", "1", "1", "30", "30", "64", "1", "32", "32", "16", "32", "16", "64", "8", "16", "16", "16", "16", "62", "28", "12", "32", "18", "10", "6", "86", "14", "42", "42", "8", "12", "6", "4", "12", "0", "10", "8", "4", "2", "2", "6", "1", "1", "1", "1", "4", "2", "16", "2", "16", "8", "0", "0", "0", "0", "0", "2", "8", "2", "4", "2", "28", "4", "14", "2", "4", "2", "0", "8", "6", "22", "2", "4", "0", "0", "0", "0", "2", "2", "2", "4", "0", "2", "0", "0", "0", "2", "0", "2", "0", "4", "0", "0", "0", "2", "0", "0", "2", "2", "0", "0", "2", "0"]} | UNKNOWN | [
"PYTHON3"
] | CODEFORCES | 30 | codeforces |
|
4adbfa2180fc0d9acc69d767c335bc86 | Chat Order | Polycarp is a big lover of killing time in social networks. A page with a chatlist in his favourite network is made so that when a message is sent to some friend, his friend's chat rises to the very top of the page. The relative order of the other chats doesn't change. If there was no chat with this friend before, then a new chat is simply inserted to the top of the list.
Assuming that the chat list is initially empty, given the sequence of Polycaprus' messages make a list of chats after all of his messages are processed. Assume that no friend wrote any message to Polycarpus.
The first line contains integer *n* (1<=≤<=*n*<=≤<=200<=000) — the number of Polycarpus' messages. Next *n* lines enlist the message recipients in the order in which the messages were sent. The name of each participant is a non-empty sequence of lowercase English letters of length at most 10.
Print all the recipients to who Polycarp talked to in the order of chats with them, from top to bottom.
Sample Input
4
alex
ivan
roman
ivan
8
alina
maria
ekaterina
darya
darya
ekaterina
maria
alina
Sample Output
ivan
roman
alex
alina
maria
ekaterina
darya
| {"inputs": ["4\nalex\nivan\nroman\nivan", "8\nalina\nmaria\nekaterina\ndarya\ndarya\nekaterina\nmaria\nalina", "1\nwdi", "2\nypg\nypg", "3\nexhll\nexhll\narruapexj", "3\nfv\nle\nle", "8\nm\nm\nm\nm\nm\nm\nm\nm", "10\nr\nr\ni\nw\nk\nr\nb\nu\nu\nr", "7\ne\nfau\ncmk\nnzs\nby\nwx\ntjmok", "6\nklrj\nwe\nklrj\nwe\nwe\nwe", "8\nzncybqmh\naeebef\nzncybqmh\nn\naeebef\nzncybqmh\nzncybqmh\nzncybqmh", "30\nkqqcbs\nvap\nkymomn\nj\nkqqcbs\nfuzlzoum\nkymomn\ndbh\nfuzlzoum\nkymomn\nvap\nvlgzs\ndbh\nvlgzs\nbvy\ndbh\nkymomn\nkymomn\neoqql\nkymomn\nkymomn\nkqqcbs\nvlgzs\nkqqcbs\nkqqcbs\nfuzlzoum\nvlgzs\nrylgdoo\nvlgzs\nrylgdoo", "40\nji\nv\nv\nns\nji\nn\nji\nv\nfvy\nvje\nns\nvje\nv\nhas\nv\nusm\nhas\nfvy\nvje\nkdb\nn\nv\nji\nji\nn\nhas\nv\nji\nkdb\nr\nvje\nns\nv\nusm\nn\nvje\nhas\nns\nhas\nn", "50\njcg\nvle\njopb\nepdb\nnkef\nfv\nxj\nufe\nfuy\noqta\ngbc\nyuz\nec\nyji\nkuux\ncwm\ntq\nnno\nhp\nzry\nxxpp\ntjvo\ngyz\nkwo\nvwqz\nyaqc\njnj\nwoav\nqcv\ndcu\ngc\nhovn\nop\nevy\ndc\ntrpu\nyb\nuzfa\npca\noq\nnhxy\nsiqu\nde\nhphy\nc\nwovu\nf\nbvv\ndsik\nlwyg", "100\nvhh\nvhh\nvhh\nfa\nfa\nvhh\nvhh\nvhh\nfa\nfa\nfa\nvhh\nfa\nvhh\nvhh\nvhh\nfa\nvhh\nvhh\nfa\nfa\nfa\nfa\nfa\nfa\nvhh\nfa\nfa\nvhh\nvhh\nvhh\nfa\nfa\nfa\nvhh\nfa\nvhh\nfa\nvhh\nvhh\nfa\nvhh\nfa\nvhh\nvhh\nvhh\nfa\nvhh\nfa\nfa\nvhh\nfa\nvhh\nvhh\nvhh\nvhh\nfa\nvhh\nvhh\nvhh\nvhh\nfa\nvhh\nvhh\nvhh\nvhh\nvhh\nfa\nvhh\nvhh\nfa\nfa\nfa\nvhh\nfa\nfa\nvhh\nfa\nvhh\nfa\nfa\nfa\nfa\nfa\nfa\nvhh\nvhh\nfa\nvhh\nfa\nfa\nvhh\nfa\nfa\nvhh\nfa\nvhh\nvhh\nfa\nvhh", "2\naa\nbb", "2\naa\na", "3\naa\naa\naa", "5\naa\na\naa\na\naa", "7\naaaa\naaaa\naaa\na\naa\naaaaaaa\naaa", "5\na\naa\naaa\naaaa\na", "12\naaaaa\naaaaaa\naaaa\naaaaaa\naa\naaaa\naaaa\naaaaaa\na\naaa\naaaaaaaa\naa", "3\na\naa\naaa", "9\nzzz\nzzzzz\nzzz\nzzzz\nzz\nzzzz\nzzzzz\nzzzz\nzzzzzzz"], "outputs": ["ivan\nroman\nalex", "alina\nmaria\nekaterina\ndarya", "wdi", "ypg", "arruapexj\nexhll", "le\nfv", "m", "r\nu\nb\nk\nw\ni", "tjmok\nwx\nby\nnzs\ncmk\nfau\ne", "we\nklrj", "zncybqmh\naeebef\nn", "rylgdoo\nvlgzs\nfuzlzoum\nkqqcbs\nkymomn\neoqql\ndbh\nbvy\nvap\nj", "n\nhas\nns\nvje\nusm\nv\nr\nkdb\nji\nfvy", "lwyg\ndsik\nbvv\nf\nwovu\nc\nhphy\nde\nsiqu\nnhxy\noq\npca\nuzfa\nyb\ntrpu\ndc\nevy\nop\nhovn\ngc\ndcu\nqcv\nwoav\njnj\nyaqc\nvwqz\nkwo\ngyz\ntjvo\nxxpp\nzry\nhp\nnno\ntq\ncwm\nkuux\nyji\nec\nyuz\ngbc\noqta\nfuy\nufe\nxj\nfv\nnkef\nepdb\njopb\nvle\njcg", "vhh\nfa", "bb\naa", "a\naa", "aa", "aa\na", "aaa\naaaaaaa\naa\na\naaaa", "a\naaaa\naaa\naa", "aa\naaaaaaaa\naaa\na\naaaaaa\naaaa\naaaaa", "aaa\naa\na", "zzzzzzz\nzzzz\nzzzzz\nzz\nzzz"]} | UNKNOWN | [
"PYTHON3"
] | CODEFORCES | 358 | codeforces |
|
4ae677cc69c7c41198e0d5325cef87d9 | Xenia and Divisors | Xenia the mathematician has a sequence consisting of *n* (*n* is divisible by 3) positive integers, each of them is at most 7. She wants to split the sequence into groups of three so that for each group of three *a*,<=*b*,<=*c* the following conditions held:
- *a*<=<<=*b*<=<<=*c*; - *a* divides *b*, *b* divides *c*.
Naturally, Xenia wants each element of the sequence to belong to exactly one group of three. Thus, if the required partition exists, then it has groups of three.
Help Xenia, find the required partition or else say that it doesn't exist.
The first line contains integer *n* (3<=≤<=*n*<=≤<=99999) — the number of elements in the sequence. The next line contains *n* positive integers, each of them is at most 7.
It is guaranteed that *n* is divisible by 3.
If the required partition exists, print groups of three. Print each group as values of the elements it contains. You should print values in increasing order. Separate the groups and integers in groups by whitespaces. If there are multiple solutions, you can print any of them.
If there is no solution, print -1.
Sample Input
6
1 1 1 2 2 2
6
2 2 1 1 4 6
Sample Output
-1
1 2 4
1 2 6
| {"inputs": ["6\n1 1 1 2 2 2", "6\n2 2 1 1 4 6", "3\n1 2 3", "3\n7 5 7", "3\n1 3 4", "3\n1 1 1", "9\n1 3 6 6 3 1 3 1 6", "6\n1 2 4 1 3 5", "3\n1 3 7", "3\n1 1 1", "9\n1 2 4 1 2 4 1 3 6", "12\n3 6 1 1 3 6 1 1 2 6 2 6", "9\n1 1 1 4 4 4 6 2 2", "9\n1 2 4 6 3 1 3 1 5", "15\n2 1 2 1 3 6 1 2 1 6 1 3 4 6 4", "3\n2 3 6", "3\n2 4 6", "3\n2 5 6", "3\n2 4 7", "6\n1 2 3 4 5 6", "3\n7 7 7", "6\n1 2 4 7 7 7", "6\n1 1 2 6 6 6", "9\n1 1 1 3 3 2 4 4 6", "6\n1 2 4 5 5 5", "15\n1 1 1 1 1 2 2 2 2 4 4 6 6 6 6", "6\n1 1 5 5 7 7", "9\n1 1 1 2 3 4 5 6 7", "6\n1 1 4 4 7 7", "24\n1 1 1 1 1 1 1 1 1 2 2 2 3 3 3 3 3 3 4 4 4 6 6 6", "3\n1 7 6", "6\n1 1 2 4 7 7", "9\n1 1 1 7 7 7 7 7 7", "9\n1 1 1 2 3 4 6 5 5"], "outputs": ["-1", "1 2 4\n1 2 6", "-1", "-1", "-1", "-1", "1 3 6\n1 3 6\n1 3 6", "-1", "-1", "-1", "1 2 4\n1 2 4\n1 3 6", "1 3 6\n1 3 6\n1 2 6\n1 2 6", "-1", "-1", "1 2 4\n1 2 4\n1 3 6\n1 3 6\n1 2 6", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1"]} | UNKNOWN | [
"PYTHON3"
] | CODEFORCES | 155 | codeforces |
|
4b157272fc9144a33406e44107e41fc0 | Karen and Coffee | To stay woke and attentive during classes, Karen needs some coffee!
Karen, a coffee aficionado, wants to know the optimal temperature for brewing the perfect cup of coffee. Indeed, she has spent some time reading several recipe books, including the universally acclaimed "The Art of the Covfefe".
She knows *n* coffee recipes. The *i*-th recipe suggests that coffee should be brewed between *l**i* and *r**i* degrees, inclusive, to achieve the optimal taste.
Karen thinks that a temperature is admissible if at least *k* recipes recommend it.
Karen has a rather fickle mind, and so she asks *q* questions. In each question, given that she only wants to prepare coffee with a temperature between *a* and *b*, inclusive, can you tell her how many admissible integer temperatures fall within the range?
The first line of input contains three integers, *n*, *k* (1<=≤<=*k*<=≤<=*n*<=≤<=200000), and *q* (1<=≤<=*q*<=≤<=200000), the number of recipes, the minimum number of recipes a certain temperature must be recommended by to be admissible, and the number of questions Karen has, respectively.
The next *n* lines describe the recipes. Specifically, the *i*-th line among these contains two integers *l**i* and *r**i* (1<=≤<=*l**i*<=≤<=*r**i*<=≤<=200000), describing that the *i*-th recipe suggests that the coffee be brewed between *l**i* and *r**i* degrees, inclusive.
The next *q* lines describe the questions. Each of these lines contains *a* and *b*, (1<=≤<=*a*<=≤<=*b*<=≤<=200000), describing that she wants to know the number of admissible integer temperatures between *a* and *b* degrees, inclusive.
For each question, output a single integer on a line by itself, the number of admissible integer temperatures between *a* and *b* degrees, inclusive.
Sample Input
3 2 4
91 94
92 97
97 99
92 94
93 97
95 96
90 100
2 1 1
1 1
200000 200000
90 100
Sample Output
3
3
0
4
0
| {"inputs": ["3 2 4\n91 94\n92 97\n97 99\n92 94\n93 97\n95 96\n90 100", "2 1 1\n1 1\n200000 200000\n90 100", "1 1 1\n1 1\n1 1", "1 1 1\n200000 200000\n200000 200000"], "outputs": ["3\n3\n0\n4", "0", "1", "1"]} | UNKNOWN | [
"PYTHON3"
] | CODEFORCES | 107 | codeforces |
|
4b2a63e8f645fb7d2ae4b5d1e88f3dd5 | GCD of Polynomials | Suppose you have two polynomials and . Then polynomial can be uniquely represented in the following way:
This can be done using [long division](https://en.wikipedia.org/wiki/Polynomial_long_division). Here, denotes the degree of polynomial *P*(*x*). is called the remainder of division of polynomial by polynomial , it is also denoted as .
Since there is a way to divide polynomials with remainder, we can define Euclid's algorithm of finding the greatest common divisor of two polynomials. The algorithm takes two polynomials . If the polynomial is zero, the result is , otherwise the result is the value the algorithm returns for pair . On each step the degree of the second argument decreases, so the algorithm works in finite number of steps. But how large that number could be? You are to answer this question.
You are given an integer *n*. You have to build two polynomials with degrees not greater than *n*, such that their coefficients are integers not exceeding 1 by their absolute value, the leading coefficients (ones with the greatest power of *x*) are equal to one, and the described Euclid's algorithm performs exactly *n* steps finding their greatest common divisor. Moreover, the degree of the first polynomial should be greater than the degree of the second. By a step of the algorithm we mean the transition from pair to pair .
You are given a single integer *n* (1<=≤<=*n*<=≤<=150) — the number of steps of the algorithm you need to reach.
Print two polynomials in the following format.
In the first line print a single integer *m* (0<=≤<=*m*<=≤<=*n*) — the degree of the polynomial.
In the second line print *m*<=+<=1 integers between <=-<=1 and 1 — the coefficients of the polynomial, from constant to leading.
The degree of the first polynomial should be greater than the degree of the second polynomial, the leading coefficients should be equal to 1. Euclid's algorithm should perform exactly *n* steps when called using these polynomials.
If there is no answer for the given *n*, print -1.
If there are multiple answer, print any of them.
Sample Input
1
2
Sample Output
1
0 1
0
1
2
-1 0 1
1
0 1
| {"inputs": ["1", "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", "101", "102", "103", "104", "105", "106", "107", "108", "109", "110", "111", "112", "113", "114", "115", "116", "117", "118", "119", "120", "121", "122", "123", "124", "125", "126", "127", "128", "129", "130", "131", "132", "133", "134", "135", "136", "137", "138", "139", "140", "141", "142", "143", "144", "145", "146", "147", "148", "149", "150"], "outputs": ["1\n0 1\n0\n1", "2\n-1 0 1\n1\n0 1", "3\n0 0 0 1\n2\n-1 0 1", "4\n1 0 -1 0 1\n3\n0 0 0 1", "5\n0 1 0 0 0 1\n4\n1 0 -1 0 1", "6\n1 0 0 0 1 0 1\n5\n0 1 0 0 0 1", "7\n0 0 0 0 0 0 0 1\n6\n1 0 0 0 1 0 1", "8\n-1 0 0 0 -1 0 -1 0 1\n7\n0 0 0 0 0 0 0 1", "9\n0 -1 0 0 0 -1 0 0 0 1\n8\n-1 0 0 0 -1 0 -1 0 1", "10\n1 0 -1 0 1 0 0 0 -1 0 1\n9\n0 -1 0 0 0 -1 0 0 0 1", "11\n0 0 0 -1 0 0 0 0 0 0 0 1\n10\n1 0 -1 0 1 0 0 0 -1 0 1", "12\n1 0 -1 0 0 0 0 0 -1 0 1 0 1\n11\n0 0 0 -1 0 0 0 0 0 0 0 1", "13\n0 1 0 0 0 0 0 0 0 -1 0 0 0 1\n12\n1 0 -1 0 0 0 0 0 -1 0 1 0 1", "14\n1 0 0 0 0 0 0 0 -1 0 0 0 1 0 1\n13\n0 1 0 0 0 0 0 0 0 -1 0 0 0 1", "15\n0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1\n14\n1 0 0 0 0 0 0 0 -1 0 0 0 1 0 1", "16\n-1 0 0 0 0 0 0 0 1 0 0 0 -1 0 -1 0 1\n15\n0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1", "17\n0 -1 0 0 0 0 0 0 0 1 0 0 0 -1 0 0 0 1\n16\n-1 0 0 0 0 0 0 0 1 0 0 0 -1 0 -1 0 1", "18\n1 0 -1 0 0 0 0 0 -1 0 1 0 1 0 0 0 -1 0 1\n17\n0 -1 0 0 0 0 0 0 0 1 0 0 0 -1 0 0 0 1", "19\n0 0 0 -1 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 1\n18\n1 0 -1 0 0 0 0 0 -1 0 1 0 1 0 0 0 -1 0 1", "20\n-1 0 1 0 -1 0 0 0 1 0 -1 0 0 0 0 0 1 0 -1 0 1\n19\n0 0 0 -1 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 1", "21\n0 -1 0 0 0 -1 0 0 0 1 0 0 0 0 0 0 0 1 0 0 0 1\n20\n-1 0 1 0 -1 0 0 0 1 0 -1 0 0 0 0 0 1 0 -1 0 1", "22\n-1 0 0 0 -1 0 -1 0 1 0 0 0 0 0 0 0 1 0 0 0 1 0 1\n21\n0 -1 0 0 0 -1 0 0 0 1 0 0 0 0 0 0 0 1 0 0 0 1", "23\n0 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1\n22\n-1 0 0 0 -1 0 -1 0 1 0 0 0 0 0 0 0 1 0 0 0 1 0 1", "24\n-1 0 0 0 -1 0 -1 0 0 0 0 0 0 0 0 0 1 0 0 0 1 0 1 0 1\n23\n0 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1", "25\n0 -1 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 1 0 0 0 1\n24\n-1 0 0 0 -1 0 -1 0 0 0 0 0 0 0 0 0 1 0 0 0 1 0 1 0 1", "26\n1 0 -1 0 1 0 0 0 0 0 0 0 0 0 0 0 -1 0 1 0 -1 0 0 0 -1 0 1\n25\n0 -1 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 1 0 0 0 1", "27\n0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 1\n26\n1 0 -1 0 1 0 0 0 0 0 0 0 0 0 0 0 -1 0 1 0 -1 0 0 0 -1 0 1", "28\n1 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 0 1 0 0 0 0 0 -1 0 1 0 1\n27\n0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 1", "29\n0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 -1 0 0 0 1\n28\n1 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 0 1 0 0 0 0 0 -1 0 1 0 1", "30\n1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 -1 0 0 0 1 0 1\n29\n0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 -1 0 0 0 1", "31\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 1\n30\n1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 -1 0 0 0 1 0 1", "32\n-1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 1 0 0 0 -1 0 -1 0 1\n31\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 1", "33\n0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 1 0 0 0 -1 0 0 0 1\n32\n-1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 1 0 0 0 -1 0 -1 0 1", "34\n1 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 0 1 0 0 0 0 0 -1 0 1 0 1 0 0 0 -1 0 1\n33\n0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 1 0 0 0 -1 0 0 0 1", "35\n0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 1\n34\n1 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 0 1 0 0 0 0 0 -1 0 1 0 1 0 0 0 -1 0 1", "36\n-1 0 1 0 -1 0 0 0 0 0 0 0 0 0 0 0 1 0 -1 0 1 0 0 0 1 0 -1 0 0 0 0 0 1 0 -1 0 1\n35\n0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 1", "37\n0 -1 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 1 0 0 0 1 0 0 0 0 0 0 0 1 0 0 0 1\n36\n-1 0 1 0 -1 0 0 0 0 0 0 0 0 0 0 0 1 0 -1 0 1 0 0 0 1 0 -1 0 0 0 0 0 1 0 -1 0 1", "38\n-1 0 0 0 -1 0 -1 0 0 0 0 0 0 0 0 0 1 0 0 0 1 0 1 0 1 0 0 0 0 0 0 0 1 0 0 0 1 0 1\n37\n0 -1 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 1 0 0 0 1 0 0 0 0 0 0 0 1 0 0 0 1", "39\n0 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1\n38\n-1 0 0 0 -1 0 -1 0 0 0 0 0 0 0 0 0 1 0 0 0 1 0 1 0 1 0 0 0 0 0 0 0 1 0 0 0 1 0 1", "40\n1 0 0 0 1 0 1 0 -1 0 0 0 0 0 0 0 -1 0 0 0 -1 0 -1 0 0 0 0 0 0 0 0 0 -1 0 0 0 -1 0 -1 0 1\n39\n0 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1", "41\n0 1 0 0 0 1 0 0 0 -1 0 0 0 0 0 0 0 -1 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 -1 0 0 0 -1 0 0 0 1\n40\n1 0 0 0 1 0 1 0 -1 0 0 0 0 0 0 0 -1 0 0 0 -1 0 -1 0 0 0 0 0 0 0 0 0 -1 0 0 0 -1 0 -1 0 1", "42\n-1 0 1 0 -1 0 0 0 1 0 -1 0 0 0 0 0 1 0 -1 0 1 0 0 0 0 0 0 0 0 0 0 0 1 0 -1 0 1 0 0 0 -1 0 1\n41\n0 1 0 0 0 1 0 0 0 -1 0 0 0 0 0 0 0 -1 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 -1 0 0 0 -1 0 0 0 1", "43\n0 0 0 1 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 1\n42\n-1 0 1 0 -1 0 0 0 1 0 -1 0 0 0 0 0 1 0 -1 0 1 0 0 0 0 0 0 0 0 0 0 0 1 0 -1 0 1 0 0 0 -1 0 1", "44\n-1 0 1 0 0 0 0 0 1 0 -1 0 -1 0 0 0 1 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 -1 0 0 0 0 0 -1 0 1 0 1\n43\n0 0 0 1 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 1", "45\n0 -1 0 0 0 0 0 0 0 1 0 0 0 -1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 -1 0 0 0 1\n44\n-1 0 1 0 0 0 0 0 1 0 -1 0 -1 0 0 0 1 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 -1 0 0 0 0 0 -1 0 1 0 1", "46\n-1 0 0 0 0 0 0 0 1 0 0 0 -1 0 -1 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 -1 0 0 0 1 0 1\n45\n0 -1 0 0 0 0 0 0 0 1 0 0 0 -1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 -1 0 0 0 1", "47\n0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 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 1\n46\n-1 0 0 0 0 0 0 0 1 0 0 0 -1 0 -1 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 -1 0 0 0 1 0 1", "48\n-1 0 0 0 0 0 0 0 1 0 0 0 -1 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 -1 0 0 0 1 0 1 0 1\n47\n0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 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 1", "49\n0 -1 0 0 0 0 0 0 0 1 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 -1 0 0 0 1 0 0 0 1\n48\n-1 0 0 0 0 0 0 0 1 0 0 0 -1 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 -1 0 0 0 1 0 1 0 1", "50\n1 0 -1 0 0 0 0 0 -1 0 1 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 0 1 0 0 0 0 0 1 0 -1 0 -1 0 0 0 -1 0 1\n49\n0 -1 0 0 0 0 0 0 0 1 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 -1 0 0 0 1 0 0 0 1", "51\n0 0 0 -1 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 1\n50\n1 0 -1 0 0 0 0 0 -1 0 1 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 0 1 0 0 0 0 0 1 0 -1 0 -1 0 0 0 -1 0 1", "52\n-1 0 1 0 -1 0 0 0 1 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 -1 0 1 0 0 0 -1 0 1 0 0 0 0 0 1 0 -1 0 1\n51\n0 0 0 -1 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 1", "53\n0 -1 0 0 0 -1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 1 0 0 0 -1 0 0 0 0 0 0 0 1 0 0 0 1\n52\n-1 0 1 0 -1 0 0 0 1 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 -1 0 1 0 0 0 -1 0 1 0 0 0 0 0 1 0 -1 0 1", "54\n-1 0 0 0 -1 0 -1 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 1 0 1 0 -1 0 0 0 0 0 0 0 1 0 0 0 1 0 1\n53\n0 -1 0 0 0 -1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 1 0 0 0 -1 0 0 0 0 0 0 0 1 0 0 0 1", "55\n0 0 0 0 0 0 0 -1 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 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1\n54\n-1 0 0 0 -1 0 -1 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 1 0 1 0 -1 0 0 0 0 0 0 0 1 0 0 0 1 0 1", "56\n-1 0 0 0 -1 0 -1 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 1 0 0 0 1 0 1 0 0 0 0 0 0 0 0 0 1 0 0 0 1 0 1 0 1\n55\n0 0 0 0 0 0 0 -1 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 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1", "57\n0 -1 0 0 0 -1 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 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 1 0 0 0 1\n56\n-1 0 0 0 -1 0 -1 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 1 0 0 0 1 0 1 0 0 0 0 0 0 0 0 0 1 0 0 0 1 0 1 0 1", "58\n1 0 -1 0 1 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 -1 0 1 0 -1 0 0 0 0 0 0 0 0 0 0 0 -1 0 1 0 -1 0 0 0 -1 0 1\n57\n0 -1 0 0 0 -1 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 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 1 0 0 0 1", "59\n0 0 0 -1 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 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 1\n58\n1 0 -1 0 1 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 -1 0 1 0 -1 0 0 0 0 0 0 0 0 0 0 0 -1 0 1 0 -1 0 0 0 -1 0 1", "60\n1 0 -1 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 -1 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 0 1 0 0 0 0 0 -1 0 1 0 1\n59\n0 0 0 -1 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 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 1", "61\n0 1 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 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 -1 0 0 0 1\n60\n1 0 -1 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 -1 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 0 1 0 0 0 0 0 -1 0 1 0 1", "62\n1 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 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 -1 0 0 0 1 0 1\n61\n0 1 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 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 -1 0 0 0 1", "63\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 1\n62\n1 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 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 -1 0 0 0 1 0 1", "64\n-1 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 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 1 0 0 0 -1 0 -1 0 1\n63\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 1", "65\n0 -1 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 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 1 0 0 0 -1 0 0 0 1\n64\n-1 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 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 1 0 0 0 -1 0 -1 0 1", "66\n1 0 -1 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 -1 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 0 1 0 0 0 0 0 -1 0 1 0 1 0 0 0 -1 0 1\n65\n0 -1 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 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 1 0 0 0 -1 0 0 0 1", "67\n0 0 0 -1 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 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 1\n66\n1 0 -1 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 -1 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 0 1 0 0 0 0 0 -1 0 1 0 1 0 0 0 -1 0 1", "68\n-1 0 1 0 -1 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 1 0 -1 0 1 0 0 0 0 0 0 0 0 0 0 0 1 0 -1 0 1 0 0 0 1 0 -1 0 0 0 0 0 1 0 -1 0 1\n67\n0 0 0 -1 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 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 1", "69\n0 -1 0 0 0 -1 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 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 1 0 0 0 1 0 0 0 0 0 0 0 1 0 0 0 1\n68\n-1 0 1 0 -1 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 1 0 -1 0 1 0 0 0 0 0 0 0 0 0 0 0 1 0 -1 0 1 0 0 0 1 0 -1 0 0 0 0 0 1 0 -1 0 1", "70\n-1 0 0 0 -1 0 -1 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 1 0 0 0 1 0 1 0 0 0 0 0 0 0 0 0 1 0 0 0 1 0 1 0 1 0 0 0 0 0 0 0 1 0 0 0 1 0 1\n69\n0 -1 0 0 0 -1 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 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 1 0 0 0 1 0 0 0 0 0 0 0 1 0 0 0 1", "71\n0 0 0 0 0 0 0 -1 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 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1\n70\n-1 0 0 0 -1 0 -1 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 1 0 0 0 1 0 1 0 0 0 0 0 0 0 0 0 1 0 0 0 1 0 1 0 1 0 0 0 0 0 0 0 1 0 0 0 1 0 1", "72\n1 0 0 0 1 0 1 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 0 0 0 -1 0 -1 0 1 0 0 0 0 0 0 0 -1 0 0 0 -1 0 -1 0 0 0 0 0 0 0 0 0 -1 0 0 0 -1 0 -1 0 1\n71\n0 0 0 0 0 0 0 -1 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 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1", "73\n0 1 0 0 0 1 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 0 0 0 -1 0 0 0 1 0 0 0 0 0 0 0 -1 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 -1 0 0 0 -1 0 0 0 1\n72\n1 0 0 0 1 0 1 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 0 0 0 -1 0 -1 0 1 0 0 0 0 0 0 0 -1 0 0 0 -1 0 -1 0 0 0 0 0 0 0 0 0 -1 0 0 0 -1 0 -1 0 1", "74\n-1 0 1 0 -1 0 0 0 1 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 -1 0 1 0 0 0 -1 0 1 0 0 0 0 0 1 0 -1 0 1 0 0 0 0 0 0 0 0 0 0 0 1 0 -1 0 1 0 0 0 -1 0 1\n73\n0 1 0 0 0 1 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 0 0 0 -1 0 0 0 1 0 0 0 0 0 0 0 -1 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 -1 0 0 0 -1 0 0 0 1", "75\n0 0 0 1 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 1\n74\n-1 0 1 0 -1 0 0 0 1 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 -1 0 1 0 0 0 -1 0 1 0 0 0 0 0 1 0 -1 0 1 0 0 0 0 0 0 0 0 0 0 0 1 0 -1 0 1 0 0 0 -1 0 1", "76\n-1 0 1 0 0 0 0 0 1 0 -1 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 -1 0 0 0 0 0 -1 0 1 0 1 0 0 0 1 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 -1 0 0 0 0 0 -1 0 1 0 1\n75\n0 0 0 1 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 1", "77\n0 -1 0 0 0 0 0 0 0 1 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 -1 0 0 0 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 -1 0 0 0 1\n76\n-1 0 1 0 0 0 0 0 1 0 -1 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 -1 0 0 0 0 0 -1 0 1 0 1 0 0 0 1 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 -1 0 0 0 0 0 -1 0 1 0 1", "78\n-1 0 0 0 0 0 0 0 1 0 0 0 -1 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 -1 0 0 0 1 0 1 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 -1 0 0 0 1 0 1\n77\n0 -1 0 0 0 0 0 0 0 1 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 -1 0 0 0 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 -1 0 0 0 1", "79\n0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 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 1 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 1\n78\n-1 0 0 0 0 0 0 0 1 0 0 0 -1 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 -1 0 0 0 1 0 1 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 -1 0 0 0 1 0 1", "80\n1 0 0 0 0 0 0 0 -1 0 0 0 1 0 1 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 1 0 0 0 -1 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 1 0 0 0 -1 0 -1 0 1\n79\n0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 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 1 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 1", "81\n0 1 0 0 0 0 0 0 0 -1 0 0 0 1 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 1 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 1 0 0 0 -1 0 0 0 1\n80\n1 0 0 0 0 0 0 0 -1 0 0 0 1 0 1 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 1 0 0 0 -1 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 1 0 0 0 -1 0 -1 0 1", "82\n-1 0 1 0 0 0 0 0 1 0 -1 0 -1 0 0 0 1 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 -1 0 0 0 0 0 -1 0 1 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 -1 0 0 0 0 0 -1 0 1 0 1 0 0 0 -1 0 1\n81\n0 1 0 0 0 0 0 0 0 -1 0 0 0 1 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 1 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 1 0 0 0 -1 0 0 0 1", "83\n0 0 0 1 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 1\n82\n-1 0 1 0 0 0 0 0 1 0 -1 0 -1 0 0 0 1 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 -1 0 0 0 0 0 -1 0 1 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 -1 0 0 0 0 0 -1 0 1 0 1 0 0 0 -1 0 1", "84\n1 0 -1 0 1 0 0 0 -1 0 1 0 0 0 0 0 -1 0 1 0 -1 0 0 0 0 0 0 0 0 0 0 0 -1 0 1 0 -1 0 0 0 1 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 0 1 0 -1 0 0 0 1 0 -1 0 0 0 0 0 1 0 -1 0 1\n83\n0 0 0 1 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 1", "85\n0 1 0 0 0 1 0 0 0 -1 0 0 0 0 0 0 0 -1 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 -1 0 0 0 -1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 0 0 0 -1 0 0 0 1 0 0 0 0 0 0 0 1 0 0 0 1\n84\n1 0 -1 0 1 0 0 0 -1 0 1 0 0 0 0 0 -1 0 1 0 -1 0 0 0 0 0 0 0 0 0 0 0 -1 0 1 0 -1 0 0 0 1 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 0 1 0 -1 0 0 0 1 0 -1 0 0 0 0 0 1 0 -1 0 1", "86\n1 0 0 0 1 0 1 0 -1 0 0 0 0 0 0 0 -1 0 0 0 -1 0 -1 0 0 0 0 0 0 0 0 0 -1 0 0 0 -1 0 -1 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 0 0 0 -1 0 -1 0 1 0 0 0 0 0 0 0 1 0 0 0 1 0 1\n85\n0 1 0 0 0 1 0 0 0 -1 0 0 0 0 0 0 0 -1 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 -1 0 0 0 -1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 0 0 0 -1 0 0 0 1 0 0 0 0 0 0 0 1 0 0 0 1", "87\n0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 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 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1\n86\n1 0 0 0 1 0 1 0 -1 0 0 0 0 0 0 0 -1 0 0 0 -1 0 -1 0 0 0 0 0 0 0 0 0 -1 0 0 0 -1 0 -1 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 0 0 0 -1 0 -1 0 1 0 0 0 0 0 0 0 1 0 0 0 1 0 1", "88\n1 0 0 0 1 0 1 0 0 0 0 0 0 0 0 0 -1 0 0 0 -1 0 -1 0 -1 0 0 0 0 0 0 0 -1 0 0 0 -1 0 -1 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 -1 0 0 0 -1 0 -1 0 0 0 0 0 0 0 0 0 1 0 0 0 1 0 1 0 1\n87\n0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 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 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1", "89\n0 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 -1 0 0 0 -1 0 0 0 -1 0 0 0 0 0 0 0 -1 0 0 0 -1 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 -1 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 1 0 0 0 1\n88\n1 0 0 0 1 0 1 0 0 0 0 0 0 0 0 0 -1 0 0 0 -1 0 -1 0 -1 0 0 0 0 0 0 0 -1 0 0 0 -1 0 -1 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 -1 0 0 0 -1 0 -1 0 0 0 0 0 0 0 0 0 1 0 0 0 1 0 1 0 1", "90\n-1 0 1 0 -1 0 0 0 0 0 0 0 0 0 0 0 1 0 -1 0 1 0 0 0 1 0 -1 0 0 0 0 0 1 0 -1 0 1 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 1 0 -1 0 1 0 0 0 0 0 0 0 0 0 0 0 -1 0 1 0 -1 0 0 0 -1 0 1\n89\n0 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 -1 0 0 0 -1 0 0 0 -1 0 0 0 0 0 0 0 -1 0 0 0 -1 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 -1 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 1 0 0 0 1", "91\n0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 -1 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 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 1\n90\n-1 0 1 0 -1 0 0 0 0 0 0 0 0 0 0 0 1 0 -1 0 1 0 0 0 1 0 -1 0 0 0 0 0 1 0 -1 0 1 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 1 0 -1 0 1 0 0 0 0 0 0 0 0 0 0 0 -1 0 1 0 -1 0 0 0 -1 0 1", "92\n-1 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 -1 0 0 0 0 0 1 0 -1 0 -1 0 0 0 1 0 -1 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 1 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 0 1 0 0 0 0 0 -1 0 1 0 1\n91\n0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 -1 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 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 1", "93\n0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 1 0 0 0 -1 0 0 0 1 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 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 -1 0 0 0 1\n92\n-1 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 -1 0 0 0 0 0 1 0 -1 0 -1 0 0 0 1 0 -1 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 1 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 0 1 0 0 0 0 0 -1 0 1 0 1", "94\n-1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 1 0 0 0 -1 0 -1 0 1 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 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 -1 0 0 0 1 0 1\n93\n0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 1 0 0 0 -1 0 0 0 1 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 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 -1 0 0 0 1", "95\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 -1 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 1\n94\n-1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 1 0 0 0 -1 0 -1 0 1 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 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 -1 0 0 0 1 0 1", "96\n-1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 1 0 0 0 -1 0 -1 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 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 -1 0 0 0 1 0 1 0 1\n95\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 -1 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 1", "97\n0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 1 0 0 0 -1 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 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 -1 0 0 0 1 0 0 0 1\n96\n-1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 1 0 0 0 -1 0 -1 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 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 -1 0 0 0 1 0 1 0 1", "98\n1 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 0 1 0 0 0 0 0 -1 0 1 0 1 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 -1 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 -1 0 0 0 0 0 1 0 -1 0 -1 0 0 0 -1 0 1\n97\n0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 1 0 0 0 -1 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 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 -1 0 0 0 1 0 0 0 1", "99\n0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 1 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 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 1\n98\n1 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 0 1 0 0 0 0 0 -1 0 1 0 1 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 -1 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 -1 0 0 0 0 0 1 0 -1 0 -1 0 0 0 -1 0 1", "100\n-1 0 1 0 -1 0 0 0 0 0 0 0 0 0 0 0 1 0 -1 0 1 0 0 0 1 0 -1 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 1 0 -1 0 1 0 0 0 0 0 0 0 0 0 0 0 -1 0 1 0 -1 0 0 0 -1 0 1 0 0 0 0 0 1 0 -1 0 1\n99\n0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 1 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 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 1", "101\n0 -1 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 1 0 0 0 1 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 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 -1 0 0 0 -1 0 0 0 -1 0 0 0 0 0 0 0 1 0 0 0 1\n100\n-1 0 1 0 -1 0 0 0 0 0 0 0 0 0 0 0 1 0 -1 0 1 0 0 0 1 0 -1 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 1 0 -1 0 1 0 0 0 0 0 0 0 0 0 0 0 -1 0 1 0 -1 0 0 0 -1 0 1 0 0 0 0 0 1 0 -1 0 1", "102\n-1 0 0 0 -1 0 -1 0 0 0 0 0 0 0 0 0 1 0 0 0 1 0 1 0 1 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 1 0 0 0 1 0 1 0 0 0 0 0 0 0 0 0 -1 0 0 0 -1 0 -1 0 -1 0 0 0 0 0 0 0 1 0 0 0 1 0 1\n101\n0 -1 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 1 0 0 0 1 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 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 -1 0 0 0 -1 0 0 0 -1 0 0 0 0 0 0 0 1 0 0 0 1", "103\n0 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 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 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1\n102\n-1 0 0 0 -1 0 -1 0 0 0 0 0 0 0 0 0 1 0 0 0 1 0 1 0 1 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 1 0 0 0 1 0 1 0 0 0 0 0 0 0 0 0 -1 0 0 0 -1 0 -1 0 -1 0 0 0 0 0 0 0 1 0 0 0 1 0 1", "104\n1 0 0 0 1 0 1 0 -1 0 0 0 0 0 0 0 -1 0 0 0 -1 0 -1 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 -1 0 0 0 -1 0 -1 0 1 0 0 0 0 0 0 0 1 0 0 0 1 0 1 0 0 0 0 0 0 0 0 0 -1 0 0 0 -1 0 -1 0 1\n103\n0 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 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 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1", "105\n0 1 0 0 0 1 0 0 0 -1 0 0 0 0 0 0 0 -1 0 0 0 -1 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 -1 0 0 0 -1 0 0 0 1 0 0 0 0 0 0 0 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 -1 0 0 0 -1 0 0 0 1\n104\n1 0 0 0 1 0 1 0 -1 0 0 0 0 0 0 0 -1 0 0 0 -1 0 -1 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 -1 0 0 0 -1 0 -1 0 1 0 0 0 0 0 0 0 1 0 0 0 1 0 1 0 0 0 0 0 0 0 0 0 -1 0 0 0 -1 0 -1 0 1", "106\n-1 0 1 0 -1 0 0 0 1 0 -1 0 0 0 0 0 1 0 -1 0 1 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 1 0 -1 0 1 0 0 0 -1 0 1 0 0 0 0 0 -1 0 1 0 -1 0 0 0 0 0 0 0 0 0 0 0 1 0 -1 0 1 0 0 0 -1 0 1\n105\n0 1 0 0 0 1 0 0 0 -1 0 0 0 0 0 0 0 -1 0 0 0 -1 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 -1 0 0 0 -1 0 0 0 1 0 0 0 0 0 0 0 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 -1 0 0 0 -1 0 0 0 1", "107\n0 0 0 1 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 -1 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 -1 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 1\n106\n-1 0 1 0 -1 0 0 0 1 0 -1 0 0 0 0 0 1 0 -1 0 1 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 1 0 -1 0 1 0 0 0 -1 0 1 0 0 0 0 0 -1 0 1 0 -1 0 0 0 0 0 0 0 0 0 0 0 1 0 -1 0 1 0 0 0 -1 0 1", "108\n-1 0 1 0 0 0 0 0 1 0 -1 0 -1 0 0 0 1 0 -1 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 1 0 -1 0 0 0 0 0 -1 0 1 0 1 0 0 0 -1 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 -1 0 0 0 0 0 -1 0 1 0 1\n107\n0 0 0 1 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 -1 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 -1 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 1", "109\n0 -1 0 0 0 0 0 0 0 1 0 0 0 -1 0 0 0 1 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 1 0 0 0 0 0 0 0 -1 0 0 0 1 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 -1 0 0 0 1\n108\n-1 0 1 0 0 0 0 0 1 0 -1 0 -1 0 0 0 1 0 -1 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 1 0 -1 0 0 0 0 0 -1 0 1 0 1 0 0 0 -1 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 -1 0 0 0 0 0 -1 0 1 0 1", "110\n-1 0 0 0 0 0 0 0 1 0 0 0 -1 0 -1 0 1 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 1 0 0 0 0 0 0 0 -1 0 0 0 1 0 1 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 -1 0 0 0 1 0 1\n109\n0 -1 0 0 0 0 0 0 0 1 0 0 0 -1 0 0 0 1 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 1 0 0 0 0 0 0 0 -1 0 0 0 1 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 -1 0 0 0 1", "111\n0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 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 1 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 1\n110\n-1 0 0 0 0 0 0 0 1 0 0 0 -1 0 -1 0 1 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 1 0 0 0 0 0 0 0 -1 0 0 0 1 0 1 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 -1 0 0 0 1 0 1", "112\n-1 0 0 0 0 0 0 0 1 0 0 0 -1 0 -1 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 1 0 0 0 0 0 0 0 -1 0 0 0 1 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 -1 0 0 0 1 0 1 0 1\n111\n0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 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 1 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 1", "113\n0 -1 0 0 0 0 0 0 0 1 0 0 0 -1 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 1 0 0 0 0 0 0 0 -1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 -1 0 0 0 1 0 0 0 1\n112\n-1 0 0 0 0 0 0 0 1 0 0 0 -1 0 -1 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 1 0 0 0 0 0 0 0 -1 0 0 0 1 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 -1 0 0 0 1 0 1 0 1", "114\n1 0 -1 0 0 0 0 0 -1 0 1 0 1 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 -1 0 1 0 0 0 0 0 1 0 -1 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 0 1 0 0 0 0 0 1 0 -1 0 -1 0 0 0 -1 0 1\n113\n0 -1 0 0 0 0 0 0 0 1 0 0 0 -1 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 1 0 0 0 0 0 0 0 -1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 -1 0 0 0 1 0 0 0 1", "115\n0 0 0 -1 0 0 0 0 0 0 0 1 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 1 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 1\n114\n1 0 -1 0 0 0 0 0 -1 0 1 0 1 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 -1 0 1 0 0 0 0 0 1 0 -1 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 0 1 0 0 0 0 0 1 0 -1 0 -1 0 0 0 -1 0 1", "116\n-1 0 1 0 -1 0 0 0 1 0 -1 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 1 0 -1 0 1 0 0 0 -1 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 -1 0 1 0 0 0 -1 0 1 0 0 0 0 0 1 0 -1 0 1\n115\n0 0 0 -1 0 0 0 0 0 0 0 1 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 1 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 1", "117\n0 -1 0 0 0 -1 0 0 0 1 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 1 0 0 0 1 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 1 0 0 0 -1 0 0 0 0 0 0 0 1 0 0 0 1\n116\n-1 0 1 0 -1 0 0 0 1 0 -1 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 1 0 -1 0 1 0 0 0 -1 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 -1 0 1 0 0 0 -1 0 1 0 0 0 0 0 1 0 -1 0 1", "118\n-1 0 0 0 -1 0 -1 0 1 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 1 0 0 0 1 0 1 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 1 0 1 0 -1 0 0 0 0 0 0 0 1 0 0 0 1 0 1\n117\n0 -1 0 0 0 -1 0 0 0 1 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 1 0 0 0 1 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 1 0 0 0 -1 0 0 0 0 0 0 0 1 0 0 0 1", "119\n0 0 0 0 0 0 0 -1 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 1 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 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1\n118\n-1 0 0 0 -1 0 -1 0 1 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 1 0 0 0 1 0 1 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 1 0 1 0 -1 0 0 0 0 0 0 0 1 0 0 0 1 0 1", "120\n-1 0 0 0 -1 0 -1 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 1 0 0 0 1 0 1 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 1 0 0 0 1 0 1 0 0 0 0 0 0 0 0 0 1 0 0 0 1 0 1 0 1\n119\n0 0 0 0 0 0 0 -1 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 1 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 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1", "121\n0 -1 0 0 0 -1 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 1 0 0 0 1 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 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 1 0 0 0 1\n120\n-1 0 0 0 -1 0 -1 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 1 0 0 0 1 0 1 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 1 0 0 0 1 0 1 0 0 0 0 0 0 0 0 0 1 0 0 0 1 0 1 0 1", "122\n1 0 -1 0 1 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 -1 0 1 0 -1 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 -1 0 1 0 -1 0 0 0 0 0 0 0 0 0 0 0 -1 0 1 0 -1 0 0 0 -1 0 1\n121\n0 -1 0 0 0 -1 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 1 0 0 0 1 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 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 1 0 0 0 1\n...", "123\n0 0 0 -1 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 1 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 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 1\n122\n1 0 -1 0 1 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 -1 0 1 0 -1 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 -1 0 1 0 -1 0 0 0 0 0 0 0 0 0 0 0 -1 0 1 0 -1 0 0 0 -1 0...", "124\n1 0 -1 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 -1 0 1 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 -1 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 0 1 0 0 0 0 0 -1 0 1 0 1\n123\n0 0 0 -1 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 1 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 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 ...", "125\n0 1 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 -1 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 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 -1 0 0 0 1\n124\n1 0 -1 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 -1 0 1 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 -1 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 0 1 0 0 0 0 0 ...", "126\n1 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 -1 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 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 -1 0 0 0 1 0 1\n125\n0 1 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 -1 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 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 0 0 0 0 0 0...", "127\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 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 1\n126\n1 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 -1 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 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 -...", "128\n-1 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 1 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 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 1 0 0 0 -1 0 -1 0 1\n127\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 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0...", "129\n0 -1 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 1 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 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 1 0 0 0 -1 0 0 0 1\n128\n-1 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 1 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 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0...", "130\n1 0 -1 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 -1 0 1 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 -1 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 0 1 0 0 0 0 0 -1 0 1 0 1 0 0 0 -1 0 1\n129\n0 -1 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 1 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 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0...", "131\n0 0 0 -1 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 1 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 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 1\n130\n1 0 -1 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 -1 0 1 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 -1 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 0 1 0...", "132\n-1 0 1 0 -1 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 1 0 -1 0 1 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 1 0 -1 0 1 0 0 0 0 0 0 0 0 0 0 0 1 0 -1 0 1 0 0 0 1 0 -1 0 0 0 0 0 1 0 -1 0 1\n131\n0 0 0 -1 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 1 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 1 0 0 0 0 0 0 0 0 0 0 0 0 0 ...", "133\n0 -1 0 0 0 -1 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 1 0 0 0 1 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 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 1 0 0 0 1 0 0 0 0 0 0 0 1 0 0 0 1\n132\n-1 0 1 0 -1 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 1 0 -1 0 1 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 1 0 -1 0 1 0 0 0 0 0 0 0 0 0 0 0 1 ...", "134\n-1 0 0 0 -1 0 -1 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 1 0 0 0 1 0 1 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 1 0 0 0 1 0 1 0 0 0 0 0 0 0 0 0 1 0 0 0 1 0 1 0 1 0 0 0 0 0 0 0 1 0 0 0 1 0 1\n133\n0 -1 0 0 0 -1 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 1 0 0 0 1 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 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0...", "135\n0 0 0 0 0 0 0 -1 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 1 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 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1\n134\n-1 0 0 0 -1 0 -1 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 1 0 0 0 1 0 1 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 1 0 0 0 1 0 1 0 0 0 0 0 0 0 0 0 ...", "136\n1 0 0 0 1 0 1 0 -1 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 -1 0 0 0 -1 0 -1 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 0 0 0 -1 0 -1 0 1 0 0 0 0 0 0 0 -1 0 0 0 -1 0 -1 0 0 0 0 0 0 0 0 0 -1 0 0 0 -1 0 -1 0 1\n135\n0 0 0 0 0 0 0 -1 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 1 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 1 0 0 ...", "137\n0 1 0 0 0 1 0 0 0 -1 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 -1 0 0 0 -1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 0 0 0 -1 0 0 0 1 0 0 0 0 0 0 0 -1 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 -1 0 0 0 -1 0 0 0 1\n136\n1 0 0 0 1 0 1 0 -1 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 -1 0 0 0 -1 0 -1 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 0 0 0 -1 0 -1 0 ...", "138\n-1 0 1 0 -1 0 0 0 1 0 -1 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 1 0 -1 0 1 0 0 0 -1 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 -1 0 1 0 0 0 -1 0 1 0 0 0 0 0 1 0 -1 0 1 0 0 0 0 0 0 0 0 0 0 0 1 0 -1 0 1 0 0 0 -1 0 1\n137\n0 1 0 0 0 1 0 0 0 -1 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 -1 0 0 0 -1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 0 0 0 -1 0 0...", "139\n0 0 0 1 0 0 0 0 0 0 0 -1 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 -1 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 1\n138\n-1 0 1 0 -1 0 0 0 1 0 -1 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 1 0 -1 0 1 0 0 0 -1 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 -1 0 1 0 0 0 -...", "140\n-1 0 1 0 0 0 0 0 1 0 -1 0 -1 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 1 0 -1 0 0 0 0 0 -1 0 1 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 -1 0 0 0 0 0 -1 0 1 0 1 0 0 0 1 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 -1 0 0 0 0 0 -1 0 1 0 1\n139\n0 0 0 1 0 0 0 0 0 0 0 -1 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 -1 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 0 0 0...", "141\n0 -1 0 0 0 0 0 0 0 1 0 0 0 -1 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 1 0 0 0 0 0 0 0 -1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 -1 0 0 0 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 -1 0 0 0 1\n140\n-1 0 1 0 0 0 0 0 1 0 -1 0 -1 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 1 0 -1 0 0 0 0 0 -1 0 1 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 -1 0 0 0 0...", "142\n-1 0 0 0 0 0 0 0 1 0 0 0 -1 0 -1 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 1 0 0 0 0 0 0 0 -1 0 0 0 1 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 -1 0 0 0 1 0 1 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 -1 0 0 0 1 0 1\n141\n0 -1 0 0 0 0 0 0 0 1 0 0 0 -1 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 1 0 0 0 0 0 0 0 -1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0...", "143\n0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 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 1 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 1 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 1\n142\n-1 0 0 0 0 0 0 0 1 0 0 0 -1 0 -1 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 1 0 0 0 0 0 0 0 -1 0 0 0 1 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0...", "144\n1 0 0 0 0 0 0 0 -1 0 0 0 1 0 1 0 -1 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 -1 0 0 0 0 0 0 0 1 0 0 0 -1 0 -1 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 1 0 0 0 -1 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 1 0 0 0 -1 0 -1 0 1\n143\n0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 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 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ...", "145\n0 1 0 0 0 0 0 0 0 -1 0 0 0 1 0 0 0 -1 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 -1 0 0 0 0 0 0 0 1 0 0 0 -1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 1 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 1 0 0 0 -1 0 0 0 1\n144\n1 0 0 0 0 0 0 0 -1 0 0 0 1 0 1 0 -1 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 -1 0 0 0 0 0 0 0 1 0 0 0 -1 0 -1 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 ...", "146\n-1 0 1 0 0 0 0 0 1 0 -1 0 -1 0 0 0 1 0 -1 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 1 0 -1 0 0 0 0 0 -1 0 1 0 1 0 0 0 -1 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 -1 0 0 0 0 0 -1 0 1 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 -1 0 0 0 0 0 -1 0 1 0 1 0 0 0 -1 0 1\n145\n0 1 0 0 0 0 0 0 0 -1 0 0 0 1 0 0 0 -1 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 -1 0 0 0 0 0 0 0 1 0 0 0 -1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 ...", "147\n0 0 0 1 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 -1 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 -1 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 1\n146\n-1 0 1 0 0 0 0 0 1 0 -1 0 -1 0 0 0 1 0 -1 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 1 0 -1 0 0 0 0 0 -1 0 1 0 1 0 0 0 -1 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 ...", "148\n1 0 -1 0 1 0 0 0 -1 0 1 0 0 0 0 0 -1 0 1 0 -1 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 -1 0 1 0 -1 0 0 0 1 0 -1 0 0 0 0 0 1 0 -1 0 1 0 0 0 0 0 0 0 0 0 0 0 -1 0 1 0 -1 0 0 0 1 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 0 1 0 -1 0 0 0 1 0 -1 0 0 0 0 0 1 0 -1 0 1\n147\n0 0 0 1 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 -1 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 -1 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 ...", "149\n0 1 0 0 0 1 0 0 0 -1 0 0 0 0 0 0 0 -1 0 0 0 -1 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 -1 0 0 0 -1 0 0 0 1 0 0 0 0 0 0 0 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 -1 0 0 0 -1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 0 0 0 -1 0 0 0 1 0 0 0 0 0 0 0 1 0 0 0 1\n148\n1 0 -1 0 1 0 0 0 -1 0 1 0 0 0 0 0 -1 0 1 0 -1 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 -1 0 1 0 -1 0 0 0 1 0 -1 0 0 0 0 0 1 0 -1 0 1 0 0 0 0 0 0 0...", "150\n1 0 0 0 1 0 1 0 -1 0 0 0 0 0 0 0 -1 0 0 0 -1 0 -1 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 -1 0 0 0 -1 0 -1 0 1 0 0 0 0 0 0 0 1 0 0 0 1 0 1 0 0 0 0 0 0 0 0 0 -1 0 0 0 -1 0 -1 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 0 0 0 -1 0 -1 0 1 0 0 0 0 0 0 0 1 0 0 0 1 0 1\n149\n0 1 0 0 0 1 0 0 0 -1 0 0 0 0 0 0 0 -1 0 0 0 -1 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 -1 0 0 0 -1 0 0 0 1 0 0 0 0 0 0 0 1 0 0 0 1 0 0 0 0 ..."]} | UNKNOWN | [
"PYTHON3"
] | CODEFORCES | 11 | codeforces |
|
4b3f5628318bf19366fb2f1bd0cf93fc | Domino Effect | Little Chris knows there's no fun in playing dominoes, he thinks it's too random and doesn't require skill. Instead, he decided to play with the dominoes and make a "domino show".
Chris arranges *n* dominoes in a line, placing each piece vertically upright. In the beginning, he simultaneously pushes some of the dominoes either to the left or to the right. However, somewhere between every two dominoes pushed in the same direction there is at least one domino pushed in the opposite direction.
After each second, each domino that is falling to the left pushes the adjacent domino on the left. Similarly, the dominoes falling to the right push their adjacent dominoes standing on the right. When a vertical domino has dominoes falling on it from both sides, it stays still due to the balance of the forces. The figure shows one possible example of the process.
Given the initial directions Chris has pushed the dominoes, find the number of the dominoes left standing vertically at the end of the process!
The first line contains a single integer *n* (1<=≤<=*n*<=≤<=3000), the number of the dominoes in the line. The next line contains a character string *s* of length *n*. The *i*-th character of the string *s**i* is equal to
- "L", if the *i*-th domino has been pushed to the left; - "R", if the *i*-th domino has been pushed to the right; - ".", if the *i*-th domino has not been pushed.
It is guaranteed that if *s**i*<==<=*s**j*<==<="L" and *i*<=<<=*j*, then there exists such *k* that *i*<=<<=*k*<=<<=*j* and *s**k*<==<="R"; if *s**i*<==<=*s**j*<==<="R" and *i*<=<<=*j*, then there exists such *k* that *i*<=<<=*k*<=<<=*j* and *s**k*<==<="L".
Output a single integer, the number of the dominoes that remain vertical at the end of the process.
Sample Input
14
.L.R...LR..L..
5
R....
1
.
Sample Output
4
0
1
| {"inputs": ["14\n.L.R...LR..L..", "1\n.", "1\nL", "1\nR", "2\nL.", "2\nRL", "2\n..", "10\nR........L", "9\nR.......L", "6\n..L.RL", "34\n..R...L..RL..RLRLR...L....R....L..", "2\nLR", "2\n.R", "2\nR.", "2\n.L", "3\nRLR", "3\nLRL", "5\n.L.R.", "5\n.R.L.", "5\nRL.RL", "14\nLR..LR....LRLR", "34\n.RL.R.L.R..L.R...L.R....L.R.....L.", "3\nL.R", "11\nLR.......LR", "7\n......R", "9\n........L", "200\n....R..LRLR......LR..L....R..LR.L....R.LR.LR..LR.L...R..L.R.......LR..LRL.R..LR.LRLR..LRLRL....R..LR...LR.L..RL....R.LR..LR..L.R.L...R.LR.....L.R....LR..L.R...L..RLRL...RL..R..L.RLR......L..RL....R.L.", "300\nR.L..R.L.RL....R....L.RLR.L.R......LR....LRL.RL..RLRL..R.LRLRL.R.L.RLRLR.LRL..RL.RL.RLRLRL.R.L.RLR.L.R..LRLRL...RLRL.R.LRL..R..LR.LR.L.R...LR..L..R.L.RL.....R.....LR.....LR..LRL..RLRLRL.RLR....L..RL..RL..RLRLR.LRLR......LR......L..R....L.R.L....RL.R.LRL..RLRL..R..LRL.RLRL...RL..R.LRL.R.LRL.R....L.RL", "400\n.L.R.LR.LRL.R.LR.LR..L....RLR.L..R..LRLRLR.LRL..RLR.LRLRLRLR.LR..LRL.RLR...LRLR.LRL.R.LR..LR.LRLR...LRLRL.R.L.....RL..RL.RLRL.RL.RL...RL..R.LRLRL..R.LRL...R..LRL.RLRL...RL..RLRLRLRL.R..LRL.R..LRLRL.R.L.R.L.RL.RLRLRL....R.LR..L..RL.RL.RLRLR.L..RLRL.RLR..LRLR.L.R..L.R.LR.LRL.....RLRL..RL..RLR.......LRLRLRL..RLRL.RLRLRL.R...L.R.L..RL..R.L.RLRLR.LR..L..RLRLR.L...RLR...L.RL...R...L..R.LRLRLRLR..LRL.RLR", "3\nR..", "5\n...R.", "5\n..RL.", "4\n.LR.", "3\nL.."], "outputs": ["4", "1", "0", "0", "1", "0", "2", "0", "1", "1", "14", "0", "1", "0", "0", "0", "0", "1", "3", "1", "0", "10", "1", "1", "6", "0", "62", "88", "121", "0", "3", "3", "0", "2"]} | UNKNOWN | [
"PYTHON3"
] | CODEFORCES | 2 | codeforces |
|
4b48e957142639581342a8c65a0beda0 | Smallest number | Recently, Vladimir got bad mark in algebra again. To avoid such unpleasant events in future he decided to train his arithmetic skills. He wrote four integer numbers *a*, *b*, *c*, *d* on the blackboard. During each of the next three minutes he took two numbers from the blackboard (not necessarily adjacent) and replaced them with their sum or their product. In the end he got one number. Unfortunately, due to the awful memory he forgot that number, but he remembers four original numbers, sequence of the operations and his surprise because of the very small result. Help Vladimir remember the forgotten number: find the smallest number that can be obtained from the original numbers by the given sequence of operations.
First line contains four integers separated by space: 0<=≤<=*a*,<=*b*,<=*c*,<=*d*<=≤<=1000 — the original numbers. Second line contains three signs ('+' or '*' each) separated by space — the sequence of the operations in the order of performing. ('+' stands for addition, '*' — multiplication)
Output one integer number — the minimal result which can be obtained.
Please, do not use %lld specificator to read or write 64-bit integers in C++. It is preffered to use cin (also you may use %I64d).
Sample Input
1 1 1 1
+ + *
2 2 2 2
* * +
1 2 3 4
* + +
Sample Output
3
8
9
| {"inputs": ["1 1 1 1\n+ + *", "2 2 2 2\n* * +", "1 2 3 4\n* + +", "15 1 3 1\n* * +", "8 1 7 14\n+ + +", "7 17 3 25\n+ * +", "13 87 4 17\n* * *", "7 0 8 15\n+ + *", "52 0 43 239\n+ + +", "1000 1000 999 1000\n* * *", "720 903 589 804\n* * *", "631 149 496 892\n* * +", "220 127 597 394\n* + +", "214 862 466 795\n+ + +", "346 290 587 525\n* * *", "323 771 559 347\n+ * *", "633 941 836 254\n* + +", "735 111 769 553\n+ * *", "622 919 896 120\n* * +", "652 651 142 661\n+ + +", "450 457 975 35\n* * *", "883 954 804 352\n* * +", "847 206 949 358\n* + *", "663 163 339 76\n+ + +", "990 330 253 553\n+ * +", "179 346 525 784\n* * *", "780 418 829 778\n+ + *", "573 598 791 124\n* * *", "112 823 202 223\n* * +", "901 166 994 315\n* + *", "393 342 840 486\n+ * *", "609 275 153 598\n+ + *", "56 828 386 57\n+ * *", "944 398 288 986\n+ + *", "544 177 162 21\n+ + *", "105 238 316 265\n+ + +", "31 353 300 911\n* * *", "46 378 310 194\n* * +", "702 534 357 657\n+ * *", "492 596 219 470\n+ + *", "482 842 982 902\n+ * +", "827 578 394 351\n* * *", "901 884 426 451\n* + *", "210 295 12 795\n* * +", "40 734 948 202\n+ * *", "136 611 963 195\n+ + *", "695 74 871 760\n+ * +", "666 884 772 54\n* + +", "975 785 753 224\n+ * +", "35 187 126 596\n+ + +", "243 386 431 35\n* + *", "229 602 133 635\n* * +", "916 207 238 891\n+ + *", "922 145 883 357\n+ + *", "69 355 762 111\n* + +", "209 206 34 67\n* + *", "693 824 375 361\n* * +", "45 712 635 467\n* + +", "426 283 179 211\n+ + +", "802 387 686 12\n+ + +"], "outputs": ["3", "8", "9", "18", "30", "63", "76908", "0", "334", "999000000000", "307887168960", "445884", "28931", "2337", "30922279500", "149067730", "162559", "92320032", "667592", "2106", "7017806250", "1045740", "62660050", "1241", "85033", "25492034400", "997766", "33608874936", "137222", "47278294", "178222356", "226746", "3875088", "670464", "18543", "924", "2990721900", "77528", "259077042", "341202", "407728", "66105361764", "170223210", "71490", "13590560", "240584", "53061", "37620", "170432", "944", "3298015", "222313", "423315", "313490", "8776", "476374", "557339", "22362", "1099", "1887"]} | UNKNOWN | [
"PYTHON3"
] | CODEFORCES | 34 | codeforces |
|
4b49d862e1af6b9a457569a38e2ed5c2 | Rational Resistance | Mad scientist Mike is building a time machine in his spare time. To finish the work, he needs a resistor with a certain resistance value.
However, all Mike has is lots of identical resistors with unit resistance *R*0<==<=1. Elements with other resistance can be constructed from these resistors. In this problem, we will consider the following as elements:
1. one resistor; 1. an element and one resistor plugged in sequence; 1. an element and one resistor plugged in parallel.
With the consecutive connection the resistance of the new element equals *R*<==<=*R**e*<=+<=*R*0. With the parallel connection the resistance of the new element equals . In this case *R**e* equals the resistance of the element being connected.
Mike needs to assemble an element with a resistance equal to the fraction . Determine the smallest possible number of resistors he needs to make such an element.
The single input line contains two space-separated integers *a* and *b* (1<=≤<=*a*,<=*b*<=≤<=1018). It is guaranteed that the fraction is irreducible. It is guaranteed that a solution always exists.
Print a single number — the answer to the problem.
Please do not use the %lld specifier to read or write 64-bit integers in С++. It is recommended to use the cin, cout streams or the %I64d specifier.
Sample Input
1 1
3 2
199 200
Sample Output
1
3
200
| {"inputs": ["1 1", "3 2", "199 200", "1 1000000000000000000", "3 1", "21 8", "18 55", "1 2", "2 1", "1 3", "2 3", "1 4", "5 2", "2 5", "4 5", "3 5", "13 4", "21 17", "5 8", "13 21", "74 99", "2377 1055", "645597 134285", "29906716 35911991", "3052460231 856218974", "288565475053 662099878640", "11504415412768 12754036168327", "9958408561221547 4644682781404278", "60236007668635342 110624799949034113", "4 43470202936783249", "16 310139055712567491", "15 110897893734203629", "439910263967866789 38", "36 316049483082136289", "752278442523506295 52", "4052739537881 6557470319842", "44945570212853 72723460248141", "498454011879264 806515533049393", "8944394323791464 5527939700884757", "679891637638612258 420196140727489673", "1 923438", "3945894354376 1", "999999999999999999 5", "999999999999999999 1000000000000000000", "999999999999999991 1000000000000000000", "999999999999999993 999999999999999991", "3 1000000000000000000", "1000000000000000000 3", "10000000000 1000000001", "2 999999999999999999", "999999999999999999 2", "2 1000000001", "123 1000000000000000000"], "outputs": ["1", "3", "200", "1000000000000000000", "3", "7", "21", "2", "2", "3", "3", "4", "4", "4", "5", "4", "7", "9", "5", "7", "28", "33", "87", "92", "82", "88", "163", "196", "179", "10867550734195816", "19383690982035476", "7393192915613582", "11576585893891241", "8779152307837131", "14466893125452056", "62", "67", "72", "77", "86", "923438", "3945894354376", "200000000000000004", "1000000000000000000", "111111111111111120", "499999999999999998", "333333333333333336", "333333333333333336", "100000019", "500000000000000001", "500000000000000001", "500000002", "8130081300813023"]} | UNKNOWN | [
"PYTHON3"
] | CODEFORCES | 65 | codeforces |
|
4b555db9f755aa0d187fe9ae322aa163 | Running Track | A boy named Ayrat lives on planet AMI-1511. Each inhabitant of this planet has a talent. Specifically, Ayrat loves running, moreover, just running is not enough for him. He is dreaming of making running a real art.
First, he wants to construct the running track with coating *t*. On planet AMI-1511 the coating of the track is the sequence of colored blocks, where each block is denoted as the small English letter. Therefore, every coating can be treated as a string.
Unfortunately, blocks aren't freely sold to non-business customers, but Ayrat found an infinite number of coatings *s*. Also, he has scissors and glue. Ayrat is going to buy some coatings *s*, then cut out from each of them exactly one continuous piece (substring) and glue it to the end of his track coating. Moreover, he may choose to flip this block before glueing it. Ayrat want's to know the minimum number of coating *s* he needs to buy in order to get the coating *t* for his running track. Of course, he also want's to know some way to achieve the answer.
First line of the input contains the string *s* — the coating that is present in the shop. Second line contains the string *t* — the coating Ayrat wants to obtain. Both strings are non-empty, consist of only small English letters and their length doesn't exceed 2100.
The first line should contain the minimum needed number of coatings *n* or -1 if it's impossible to create the desired coating.
If the answer is not -1, then the following *n* lines should contain two integers *x**i* and *y**i* — numbers of ending blocks in the corresponding piece. If *x**i*<=≤<=*y**i* then this piece is used in the regular order, and if *x**i*<=><=*y**i* piece is used in the reversed order. Print the pieces in the order they should be glued to get the string *t*.
Sample Input
abc
cbaabc
aaabrytaaa
ayrat
ami
no
Sample Output
2
3 1
1 3
3
1 1
6 5
8 7
-1
| {"inputs": ["abc\ncbaabc", "aaabrytaaa\nayrat", "ami\nno", "r\nr", "r\nb", "randb\nbandr", "aaaaaa\naaaaa", "aaaaaa\naaaaaaa", "qwerty\nywertyrewqqq", "qwerty\nytrewq", "azaza\nzazaz", "mnbvcxzlkjhgfdsapoiuytrewq\nqwertyuiopasdfghjklzxcvbnm", "imnothalfthemaniusedtobetheresashadowhangingovermeohyesterdaycamesuddenlywgk\nallmytroublesseemedsofarawaynowitlooksasthoughtheyreheretostayohibelieveinyesterday", "woohoowellilieandimeasyallthetimebutimneversurewhyineedyoupleasedtomeetyouf\nwoohoowhenifeelheavymetalwoohooandimpinsandimneedles", "woohoowhenifeelheavymetalwoohooandimpinsandimneedles\nwoohoowellilieandimeasyallthetimebutimneversurewhyineedyoupleasedtomeetyou", "hhhhhhh\nhhhhhhh", "mmjmmmjjmjmmmm\njmjmjmmjmmjjmj", "mmlmllmllmlmlllmmmlmmmllmmlm\nzllmlllmlmmmllmmlllmllmlmlll", "klllklkllllkllllllkklkkkklklklklllkkkllklkklkklkllkllkkk\npkkkkklklklkkllllkllkkkllkkklkkllllkkkklllklllkllkklklll", "bcbbbccccbbbcbcccccbcbbbccbbcccccbcbcbbcbcbccbbbccccbcccbcbccccccccbcbcccccccccbcbbbccccbbccbcbbcbbccccbbccccbcb\nycccbcbccbcbbcbcbcbcbbccccbccccccbbcbcbbbccccccccccbcccbccbcbcbcbbbcccbcbbbcbccccbcbcbbcbccbbccbcbbcbccccccccccb", "jjjbjjbjbbbbbbjbjbbjbjbbbjbjbbjbbjbbjjbjbjjjbbbbjbjjjjbbbjbjjjjjbjbjbjjjbjjjjjjjjbbjbjbbjbbjbbbbbjjjbbjjbjjbbbbjbbjbbbbbjbbjjbjjbbjjjbjjbbbbjbjjbjbbjbbjbjbjbbbjjjjbjbjbbjbjjjjbbjbjbbbjjjjjbjjbjbjjjbjjjbbbjbjjbbbbbbbjjjjbbbbj\njjbbjbbjjjbjbbjjjjjbjbjjjbjbbbbjbbjbjjbjbbjbbbjjbjjbjbbbjbbjjbbjjjbbbjbbjbjjbbjjjjjjjbbbjjbbjjjjjbbbjjbbbjbbjjjbjbbbjjjjbbbjjjbbjjjjjbjbbbjjjjjjjjjbbbbbbbbbjjbjjbbbjbjjbjbjbjjjjjbjjbjbbjjjbjjjbjbbbbjbjjbbbjbjbjbbjbjbbbjjjbjb", "aaaaaabaa\na", "bbbbbb\na", "bbaabaaaabaaaaaabbaaaa\naaabaaaaaaababbbaaaaaa", "ltfqmwlfkswpmxi\nfkswpmi", "abaaaabaababbaaaaaabaa\nbaaaabaababaabababaaaa", "ababaaaabaaaaaaaaaaaba\nbabaaabbaaaabbaaaabaaa"], "outputs": ["2\n3 1\n1 3", "3\n1 1\n6 5\n8 7", "-1", "1\n1 1", "-1", "3\n5 5\n2 4\n1 1", "1\n1 5", "2\n1 6\n1 1", "5\n6 6\n2 6\n4 1\n1 1\n1 1", "1\n6 1", "2\n2 5\n2 2", "1\n26 1", "52\n7 8\n8 8\n2 2\n53 53\n5 5\n28 28\n4 4\n17 17\n23 23\n8 8\n29 30\n18 19\n12 13\n19 20\n18 18\n4 4\n9 9\n7 7\n28 28\n7 7\n37 37\n60 61\n3 4\n37 37\n1 1\n5 5\n8 8\n4 4\n4 4\n76 76\n30 32\n5 6\n4 4\n17 17\n41 41\n26 25\n11 12\n53 53\n28 26\n27 29\n21 22\n55 56\n60 61\n51 52\n1 1\n23 24\n8 8\n1 1\n47 46\n12 12\n42 43\n53 61", "22\n1 7\n28 29\n52 51\n75 75\n53 54\n9 9\n28 29\n15 15\n41 41\n23 23\n19 20\n27 27\n24 25\n1 6\n15 19\n59 59\n51 52\n63 62\n16 19\n52 55\n60 61\n22 22", "-1", "1\n1 7", "4\n8 11\n3 5\n3 5\n7 10", "-1", "-1", "-1", "26\n38 31\n143 149\n61 68\n144 136\n139 151\n102 108\n22 27\n105 95\n149 142\n73 80\n211 206\n189 180\n22 27\n198 192\n214 222\n98 104\n62 51\n188 181\n214 205\n201 209\n68 58\n180 173\n198 192\n202 211\n163 172\n47 39", "1\n1 1", "-1", "4\n7 16\n4 6\n1 2\n10 16", "2\n8 13\n15 15", "3\n2 12\n8 12\n1 6", "4\n2 7\n2 2\n4 9\n4 12"]} | UNKNOWN | [
"PYTHON3"
] | CODEFORCES | 4 | codeforces |
|
4b567bd6e01c14c6cad914fb1e248b98 | Luxurious Houses | The capital of Berland has *n* multifloor buildings. The architect who built up the capital was very creative, so all the houses were built in one row.
Let's enumerate all the houses from left to right, starting with one. A house is considered to be luxurious if the number of floors in it is strictly greater than in all the houses with larger numbers. In other words, a house is luxurious if the number of floors in it is strictly greater than in all the houses, which are located to the right from it. In this task it is assumed that the heights of floors in the houses are the same.
The new architect is interested in *n* questions, *i*-th of them is about the following: "how many floors should be added to the *i*-th house to make it luxurious?" (for all *i* from 1 to *n*, inclusive). You need to help him cope with this task.
Note that all these questions are independent from each other — the answer to the question for house *i* does not affect other answers (i.e., the floors to the houses are not actually added).
The first line of the input contains a single number *n* (1<=≤<=*n*<=≤<=105) — the number of houses in the capital of Berland.
The second line contains *n* space-separated positive integers *h**i* (1<=≤<=*h**i*<=≤<=109), where *h**i* equals the number of floors in the *i*-th house.
Print *n* integers *a*1,<=*a*2,<=...,<=*a**n*, where number *a**i* is the number of floors that need to be added to the house number *i* to make it luxurious. If the house is already luxurious and nothing needs to be added to it, then *a**i* should be equal to zero.
All houses are numbered from left to right, starting from one.
Sample Input
5
1 2 3 1 2
4
3 2 1 4
Sample Output
3 2 0 2 0 2 3 4 0 | {"inputs": ["5\n1 2 3 1 2", "4\n3 2 1 4", "1\n2", "2\n5 4", "5\n10 18 36 33 20", "5\n91 96 94 95 91", "10\n9 6 8 5 5 2 8 9 2 2", "10\n55 50 51 53 53 52 50 54 54 53", "20\n10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10", "20\n82 78 86 80 80 76 88 74 70 88 71 75 73 72 79 85 79 90 79 77", "40\n66 68 59 100 55 53 63 95 70 55 51 54 97 80 88 83 90 81 84 53 84 91 85 75 82 56 88 86 79 97 56 63 57 55 93 93 81 99 58 54", "40\n99 8 32 95 40 43 69 26 4 81 67 78 17 58 88 55 73 80 16 50 20 14 94 75 66 14 23 68 95 63 1 56 81 68 48 77 2 51 29 27", "50\n50 53 54 54 52 51 53 51 50 52 53 52 55 52 51 55 52 53 53 52 53 53 52 52 51 52 53 54 50 50 55 50 55 50 55 54 53 50 52 52 51 54 52 54 53 51 54 50 55 54", "50\n94 96 98 96 91 90 96 92 95 96 96 99 99 90 93 90 99 95 91 92 99 91 93 92 100 94 93 90 93 93 98 91 95 96 93 90 90 92 94 91 90 90 97 91 100 96 100 96 91 90", "70\n50 5 6 69 36 65 94 57 33 62 72 89 22 83 37 94 72 46 99 43 64 1 69 85 88 63 70 47 64 20 18 66 73 28 39 67 45 41 66 9 77 77 32 11 14 5 17 44 34 76 8 73 20 85 1 89 22 76 93 70 86 65 82 17 69 86 45 11 11 88", "70\n40 43 42 40 42 43 41 43 40 40 41 42 40 40 42 42 42 40 43 40 42 43 41 42 43 42 41 41 41 43 42 42 40 41 41 42 43 41 43 40 42 41 43 43 41 40 41 41 43 43 40 41 43 43 41 42 42 40 42 42 43 43 40 40 41 41 41 42 41 43", "90\n74 78 57 97 75 85 87 89 71 76 50 71 94 82 87 51 84 87 63 51 88 53 82 88 94 90 58 65 91 69 99 56 58 78 74 74 52 80 100 85 72 50 92 97 77 97 91 85 86 64 75 99 51 79 76 64 66 85 64 63 99 84 74 99 83 70 84 54 91 94 51 68 86 61 81 60 100 52 92 52 59 90 57 57 85 83 59 56 67 63", "90\n8 11 37 11 34 18 34 5 35 11 16 20 17 14 9 22 39 13 23 36 26 9 20 18 13 10 11 26 22 2 36 17 23 26 12 1 30 5 19 30 21 8 36 25 2 17 16 32 40 4 11 12 21 39 30 1 18 23 19 1 38 25 12 10 35 27 29 35 15 15 37 35 5 23 33 34 2 35 17 38 40 5 25 8 14 38 34 28 13 22", "100\n9 9 72 55 14 8 55 58 35 67 3 18 73 92 41 49 15 60 18 66 9 26 97 47 43 88 71 97 19 34 48 96 79 53 8 24 69 49 12 23 77 12 21 88 66 9 29 13 61 69 54 77 41 13 4 68 37 74 7 6 29 76 55 72 89 4 78 27 29 82 18 83 12 4 32 69 89 85 66 13 92 54 38 5 26 56 17 55 29 4 17 39 29 94 3 67 85 98 21 14", "100\n1 8 3 8 10 8 5 3 10 3 5 8 4 5 5 5 10 3 6 6 6 6 6 7 2 7 2 4 7 8 3 8 7 2 5 6 1 5 5 7 9 7 6 9 1 8 1 3 6 5 1 3 6 9 5 6 8 4 8 6 10 9 2 9 3 8 7 5 2 10 2 10 3 6 5 5 3 5 10 2 3 7 10 8 8 4 3 4 9 6 10 7 6 6 6 4 9 9 8 9", "10\n4 5 2 3 4 9 1 2 3 10", "1\n100", "2\n1 100", "4\n4 98 99 100", "5\n5 5 5 5 5", "10\n4 1 4 1 4 1 4 1 4 1", "5\n1 3 5 7 9", "2\n1 1", "3\n4 4 4", "2\n2 2", "4\n1 1 1 1", "3\n3 3 3", "6\n3 3 4 2 3 3"], "outputs": ["3 2 0 2 0 ", "2 3 4 0 ", "0 ", "0 0 ", "27 19 0 0 0 ", "6 0 2 0 0 ", "1 4 2 5 5 8 2 0 1 0 ", "0 5 4 2 2 3 5 1 0 0 ", "1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 0 ", "9 13 5 11 11 15 3 17 21 3 20 16 18 19 12 6 12 0 0 0 ", "35 33 42 0 45 47 37 5 30 45 49 46 3 20 12 17 10 19 16 47 16 9 15 25 18 44 12 14 21 3 44 37 43 45 7 7 19 0 0 0 ", "0 88 64 1 56 53 27 70 92 15 29 18 79 38 8 41 23 16 80 46 76 82 2 21 30 82 73 28 0 19 81 26 0 10 30 0 50 0 0 0 ", "6 3 2 2 4 5 3 5 6 4 3 4 1 4 5 1 4 3 3 4 3 3 4 4 5 4 3 2 6 6 1 6 1 6 1 2 3 6 4 4 5 2 4 2 3 5 2 6 0 0 ", "7 5 3 5 10 11 5 9 6 5 5 2 2 11 8 11 2 6 10 9 2 10 8 9 1 7 8 11 8 8 3 10 6 5 8 11 11 9 7 10 11 11 4 10 1 5 0 0 0 0 ", "50 95 94 31 64 35 6 43 67 38 28 11 78 17 63 6 28 54 0 51 30 93 25 9 6 31 24 47 30 74 76 28 21 66 55 27 49 53 28 85 17 17 62 83 80 89 77 50 60 18 86 21 74 9 93 5 72 18 0 19 3 24 7 72 20 3 44 78 78 0 ", "4 1 2 4 2 1 3 1 4 4 3 2 4 4 2 2 2 4 1 4 2 1 3 2 1 2 3 3 3 1 2 2 4 3 3 2 1 3 1 4 2 3 1 1 3 4 3 3 1 1 4 3 1 1 3 2 2 4 2 2 1 1 4 4 3 3 3 2 3 0 ", "27 23 44 4 26 16 14 12 30 25 51 30 7 19 14 50 17 14 38 50 13 48 19 13 7 11 43 36 10 32 2 45 43 23 27 27 49 21 1 16 29 51 9 4 24 4 10 16 15 37 26 2 50 22 25 37 35 16 37 38 2 17 27 2 18 31 17 47 10 7 50 33 15 40 20 41 0 41 0 39 32 0 29 29 0 0 9 12 0 0 ", "33 30 4 30 7 23 7 36 6 30 25 21 24 27 32 19 2 28 18 5 15 32 21 23 28 31 30 15 19 39 5 24 18 15 29 40 11 36 22 11 20 33 5 16 39 24 25 9 1 37 30 29 20 2 11 40 23 18 22 40 3 16 29 31 6 14 12 6 26 26 4 6 36 18 8 7 39 6 24 3 0 34 14 31 25 0 0 0 10 0 ", "90 90 27 44 85 91 44 41 64 32 96 81 26 7 58 50 84 39 81 33 90 73 2 52 56 11 28 2 80 65 51 3 20 46 91 75 30 50 87 76 22 87 78 11 33 90 70 86 38 30 45 22 58 86 95 31 62 25 92 93 70 23 44 27 10 95 21 72 70 17 81 16 87 95 67 30 10 14 33 86 7 45 61 94 73 43 82 44 70 95 82 60 70 5 96 32 14 0 0 0 ", "10 3 8 3 1 3 6 8 1 8 6 3 7 6 6 6 1 8 5 5 5 5 5 4 9 4 9 7 4 3 8 3 4 9 6 5 10 6 6 4 2 4 5 2 10 3 10 8 5 6 10 8 5 2 6 5 3 7 3 5 1 2 9 2 8 3 4 6 9 1 9 1 8 5 6 6 8 6 1 9 8 4 1 3 3 7 8 7 2 5 0 3 4 4 4 6 1 1 2 0 ", "7 6 9 8 7 2 10 9 8 0 ", "0 ", "100 0 ", "97 3 2 0 ", "1 1 1 1 0 ", "1 4 1 4 1 4 1 4 0 0 ", "9 7 5 3 0 ", "1 0 ", "1 1 0 ", "1 0 ", "1 1 1 0 ", "1 1 0 ", "2 2 0 2 1 0 "]} | UNKNOWN | [
"PYTHON3"
] | CODEFORCES | 13 | codeforces |
|
4b60048a0e4b413fa9ba63a4af5433db | Lucky Probability | Petya loves lucky numbers. We all know that lucky numbers are the positive integers whose decimal representations contain only the lucky digits 4 and 7. For example, numbers 47, 744, 4 are lucky and 5, 17, 467 are not.
Petya and his friend Vasya play an interesting game. Petya randomly chooses an integer *p* from the interval [*p**l*,<=*p**r*] and Vasya chooses an integer *v* from the interval [*v**l*,<=*v**r*] (also randomly). Both players choose their integers equiprobably. Find the probability that the interval [*min*(*v*,<=*p*),<=*max*(*v*,<=*p*)] contains exactly *k* lucky numbers.
The single line contains five integers *p**l*, *p**r*, *v**l*, *v**r* and *k* (1<=≤<=*p**l*<=≤<=*p**r*<=≤<=109,<=1<=≤<=*v**l*<=≤<=*v**r*<=≤<=109,<=1<=≤<=*k*<=≤<=1000).
On the single line print the result with an absolute error of no more than 10<=-<=9.
Sample Input
1 10 1 10 2
5 6 8 10 1
Sample Output
0.320000000000
1.000000000000
| {"inputs": ["1 10 1 10 2", "5 6 8 10 1", "1 20 100 120 5", "1 10 1 10 3", "1 100 1 100 2", "47 95 18 147 4", "1 1000000000 1 1000000000 47", "1 2 3 4 12", "1 50 64 80 4", "1 128 45 99 2", "45 855 69 854 7", "1 1000 1 1000 2", "999 999 1000 1000 1", "789 5888 1 10 7", "1 1000 1 1000 14", "4 4 7 7 2", "7 7 4 4 2", "2588 3000 954 8555 4", "1 10000 1 10000 2", "1 10000 1 10000 6", "69 98200 9999 88888 7", "1 1000000000 1 1000000000 1000", "1 1000000 1 1000000 19", "4855 95555 485 95554750 7", "2 999999999 3 999999998 999", "45 8555 969 4000 3", "369 852 741 963 2", "8548 8554575 895 9954448 47", "488 985544 8500 74844999 105", "458995 855555 999999 84444444 245", "8544 8855550 9874 8800000 360", "1 1000000000 1 1000000000 584", "1 1000000000 1 1000000000 48", "1 1000000000 1 1000000000 470", "1 1000000000 1 1000000000 49", "1 1000000000 1 1000000000 998", "4555 99878870 950000 400000000 458", "99999999 989999999 1 1000000000 21", "9887400 488085444 599 600000000 374", "4 47777777 444444444 777777777 320", "4 7 1 1000000000 395", "123456789 987654321 4588 95470 512", "1 1000000000 488 744444444 748", "69 74444 47 744444 100", "1 1000000000 100000000 1000000000 300", "987654215 1000000000 9854874 854888120 270", "85478 999999999 1 1000000000 1000", "47 555555555 8596 584987999 894", "74 182015585 98247 975000999 678", "1 1000000000 7 1000000000 987", "47 47 47 47 1", "6 8 6 8 1", "5 30 6 43 1", "777777776 778777777 777777775 1000000000 1", "28 46 8 45 1", "444444 444445 444440 444446 1", "1 6 2 4 1", "1 10 1 10 1", "4 4 4 4 1", "4 7 4 7 2"], "outputs": ["0.320000000000", "1.000000000000", "0.150000000000", "0.000000000000", "0.362600000000", "0.080533751962", "0.000000010664", "0.000000000000", "0.231764705882", "0.432954545455", "0.005859319848", "0.082970000000", "0.000000000000", "0.000000000000", "0.001792000000", "1.000000000000", "1.000000000000", "0.035122336227", "0.009328580000", "0.009012260000", "0.000104470975", "0.000001185373", "0.000010456080", "0.000000239243", "0.000000001334", "0.000704970039", "0.134584738539", "0.000001161081", "0.000000323831", "0.000000065857", "0.000000000000", "0.000003345099", "0.000094672776", "0.000000073832", "0.000000010664", "0.000000012002", "0.000000218543", "0.000000009517", "0.000000066330", "0.010618322184", "0.000000021000", "0.000734548731", "0.000000298888", "0.000000000000", "0.000000594125", "0.000000031951", "0.000000592737", "0.000000000000", "0.000000083341", "0.000000001335", "1.000000000000", "0.777777777778", "0.159919028340", "0.000002013496", "0.199445983380", "0.857142857143", "0.666666666667", "0.460000000000", "1.000000000000", "0.125000000000"]} | UNKNOWN | [
"PYTHON3"
] | CODEFORCES | 10 | codeforces |
|
4b6a67bb76e77433f586d37d78ecdfae | Sofa Thief | Yet another round on DecoForces is coming! Grandpa Maks wanted to participate in it but someone has stolen his precious sofa! And how can one perform well with such a major loss?
Fortunately, the thief had left a note for Grandpa Maks. This note got Maks to the sofa storehouse. Still he had no idea which sofa belongs to him as they all looked the same!
The storehouse is represented as matrix *n*<=×<=*m*. Every sofa takes two neighbouring by some side cells. No cell is covered by more than one sofa. There can be empty cells.
Sofa *A* is standing to the left of sofa *B* if there exist two such cells *a* and *b* that *x**a*<=<<=*x**b*, *a* is covered by *A* and *b* is covered by *B*. Sofa *A* is standing to the top of sofa *B* if there exist two such cells *a* and *b* that *y**a*<=<<=*y**b*, *a* is covered by *A* and *b* is covered by *B*. Right and bottom conditions are declared the same way.
Note that in all conditions *A*<=≠<=*B*. Also some sofa *A* can be both to the top of another sofa *B* and to the bottom of it. The same is for left and right conditions.
The note also stated that there are *cnt**l* sofas to the left of Grandpa Maks's sofa, *cnt**r* — to the right, *cnt**t* — to the top and *cnt**b* — to the bottom.
Grandpa Maks asks you to help him to identify his sofa. It is guaranteed that there is no more than one sofa of given conditions.
Output the number of Grandpa Maks's sofa. If there is no such sofa that all the conditions are met for it then output -1.
The first line contains one integer number *d* (1<=≤<=*d*<=≤<=105) — the number of sofas in the storehouse.
The second line contains two integer numbers *n*, *m* (1<=≤<=*n*,<=*m*<=≤<=105) — the size of the storehouse.
Next *d* lines contains four integer numbers *x*1, *y*1, *x*2, *y*2 (1<=≤<=*x*1,<=*x*2<=≤<=*n*, 1<=≤<=*y*1,<=*y*2<=≤<=*m*) — coordinates of the *i*-th sofa. It is guaranteed that cells (*x*1,<=*y*1) and (*x*2,<=*y*2) have common side, (*x*1,<=*y*1) <=≠<= (*x*2,<=*y*2) and no cell is covered by more than one sofa.
The last line contains four integer numbers *cnt**l*, *cnt**r*, *cnt**t*, *cnt**b* (0<=≤<=*cnt**l*,<=*cnt**r*,<=*cnt**t*,<=*cnt**b*<=≤<=*d*<=-<=1).
Print the number of the sofa for which all the conditions are met. Sofas are numbered 1 through *d* as given in input. If there is no such sofa then print -1.
Sample Input
2
3 2
3 1 3 2
1 2 2 2
1 0 0 1
3
10 10
1 2 1 1
5 5 6 5
6 4 5 4
2 1 2 0
2
2 2
2 1 1 1
1 2 2 2
1 0 0 0
Sample Output
1
2
-1
| {"inputs": ["2\n3 2\n3 1 3 2\n1 2 2 2\n1 0 0 1", "3\n10 10\n1 2 1 1\n5 5 6 5\n6 4 5 4\n2 1 2 0", "2\n2 2\n2 1 1 1\n1 2 2 2\n1 0 0 0", "1\n1 2\n1 1 1 2\n0 0 0 0", "1\n2 1\n2 1 1 1\n0 0 0 0", "1\n1000 1000\n63 902 63 901\n0 0 0 0", "6\n10 10\n3 6 3 7\n4 9 5 9\n5 4 5 3\n7 1 8 1\n9 10 8 10\n7 7 7 8\n0 5 2 3", "2\n4 4\n3 1 3 2\n2 2 2 1\n0 0 0 0", "2\n2 2\n1 1 1 2\n2 1 2 2\n0 1 1 1", "2\n2 2\n1 1 1 2\n2 1 2 2\n1 0 1 1", "2\n2 2\n1 1 1 2\n2 1 2 2\n0 1 1 0", "1\n1 2\n1 2 1 1\n0 0 0 0", "1\n1 3\n1 2 1 3\n0 0 0 0", "1\n1 4\n1 2 1 1\n0 0 0 0", "1\n1 5\n1 4 1 3\n0 0 0 0", "1\n1 6\n1 6 1 5\n0 0 0 0", "1\n1 7\n1 6 1 7\n0 0 0 0", "1\n2 1\n2 1 1 1\n0 0 0 0", "1\n2 2\n2 2 2 1\n0 0 0 0", "1\n2 3\n1 2 1 1\n0 0 0 0", "1\n2 4\n2 3 2 4\n0 0 0 0", "1\n2 5\n2 4 1 4\n0 0 0 0", "1\n2 6\n2 1 1 1\n0 0 0 0", "1\n2 7\n2 7 2 6\n0 0 0 0", "1\n3 1\n2 1 3 1\n0 0 0 0", "1\n3 2\n1 1 2 1\n0 0 0 0", "1\n3 3\n3 2 3 3\n0 0 0 0", "1\n3 4\n2 1 2 2\n0 0 0 0", "1\n3 5\n2 2 2 1\n0 0 0 0", "1\n3 6\n1 4 2 4\n0 0 0 0", "1\n3 7\n2 2 1 2\n0 0 0 0", "1\n4 1\n1 1 2 1\n0 0 0 0", "1\n4 2\n1 1 1 2\n0 0 0 0", "1\n4 3\n4 3 4 2\n0 0 0 0", "1\n4 4\n3 2 3 3\n0 0 0 0", "1\n4 5\n1 2 2 2\n0 0 0 0", "1\n4 6\n4 3 4 4\n0 0 0 0", "1\n4 7\n3 6 4 6\n0 0 0 0", "1\n5 1\n2 1 1 1\n0 0 0 0", "1\n5 2\n5 1 4 1\n0 0 0 0", "1\n5 3\n4 2 3 2\n0 0 0 0", "1\n5 4\n2 4 3 4\n0 0 0 0", "1\n5 5\n4 1 3 1\n0 0 0 0", "1\n5 6\n3 3 3 2\n0 0 0 0", "1\n5 7\n1 6 1 7\n0 0 0 0", "1\n6 1\n6 1 5 1\n0 0 0 0", "1\n6 2\n4 2 5 2\n0 0 0 0", "1\n6 3\n1 2 1 1\n0 0 0 0", "1\n6 4\n2 2 3 2\n0 0 0 0", "1\n6 5\n6 1 6 2\n0 0 0 0", "1\n6 6\n4 1 3 1\n0 0 0 0", "1\n6 7\n6 7 6 6\n0 0 0 0", "1\n7 1\n6 1 7 1\n0 0 0 0", "1\n7 2\n4 2 4 1\n0 0 0 0", "1\n7 3\n7 1 7 2\n0 0 0 0", "1\n7 4\n3 3 3 4\n0 0 0 0", "1\n7 5\n6 4 7 4\n0 0 0 0", "1\n7 6\n2 2 2 3\n0 0 0 0", "1\n7 7\n1 3 2 3\n0 0 0 0", "1\n1 4\n1 4 1 3\n0 0 0 0", "2\n1 5\n1 5 1 4\n1 1 1 2\n0 0 1 0", "1\n1 6\n1 2 1 3\n0 0 0 0", "2\n1 7\n1 7 1 6\n1 4 1 5\n0 0 1 0", "1\n2 2\n2 1 2 2\n0 0 0 0", "2\n2 3\n2 3 1 3\n1 2 2 2\n0 0 0 1", "2\n2 4\n2 2 2 1\n2 4 1 4\n0 1 1 0", "2\n2 5\n2 2 2 1\n1 3 1 4\n1 0 0 1", "2\n2 6\n1 2 1 1\n2 1 2 2\n1 0 1 1", "2\n2 7\n2 4 2 5\n2 7 1 7\n0 0 1 0", "2\n3 2\n1 2 2 2\n1 1 2 1\n0 0 1 0", "2\n3 3\n2 1 1 1\n1 2 2 2\n0 0 0 1", "1\n3 4\n1 3 1 4\n0 0 0 0", "2\n3 5\n1 2 1 1\n3 1 2 1\n0 1 0 0", "2\n3 6\n3 2 3 1\n3 6 2 6\n0 0 0 1", "2\n3 7\n3 6 3 5\n2 4 2 3\n0 1 0 1", "2\n4 1\n3 1 4 1\n1 1 2 1\n0 1 0 0", "1\n4 2\n4 1 3 1\n0 0 0 0", "2\n4 3\n3 1 2 1\n1 2 1 1\n1 0 0 1", "1\n4 4\n4 1 3 1\n0 0 0 0", "2\n4 5\n3 1 4 1\n4 2 4 3\n0 1 0 1", "2\n4 6\n2 3 2 4\n2 6 2 5\n0 0 0 1", "2\n4 7\n1 7 2 7\n4 1 3 1\n1 0 0 1", "2\n5 1\n2 1 1 1\n5 1 4 1\n1 0 0 0", "2\n5 2\n1 1 1 2\n2 2 3 2\n1 0 1 0", "2\n5 3\n1 1 1 2\n5 2 5 3\n0 1 0 1", "2\n5 4\n4 4 4 3\n4 2 5 2\n0 0 0 1", "2\n5 5\n3 4 3 5\n4 1 3 1\n1 0 0 1", "2\n5 6\n2 4 3 4\n5 2 5 1\n0 1 1 0", "2\n5 7\n2 7 1 7\n2 4 3 4\n0 0 0 1", "1\n6 1\n3 1 4 1\n0 0 0 0", "1\n6 2\n5 1 6 1\n0 0 0 0", "2\n6 3\n2 2 2 1\n3 2 3 1\n0 1 0 0", "2\n6 4\n6 4 5 4\n4 3 4 2\n1 0 1 0", "2\n6 5\n2 4 2 3\n5 4 4 4\n1 0 0 0", "2\n6 6\n6 6 5 6\n1 3 1 2\n1 0 1 0", "2\n6 7\n1 3 1 4\n5 2 5 1\n0 1 1 0", "1\n7 1\n6 1 7 1\n0 0 0 0", "2\n7 2\n5 2 4 2\n2 1 2 2\n0 1 0 1", "2\n7 3\n7 2 6 2\n1 2 2 2\n0 1 0 0", "2\n7 4\n6 1 6 2\n2 3 1 3\n1 0 0 1", "2\n7 5\n2 3 1 3\n4 3 3 3\n1 0 0 0", "2\n7 6\n5 1 6 1\n2 5 3 5\n0 1 1 0", "2\n7 7\n2 3 2 4\n5 4 5 5\n0 1 0 1", "1\n1 6\n1 4 1 5\n0 0 0 0", "1\n1 7\n1 1 1 2\n0 0 0 0", "1\n2 3\n1 1 2 1\n0 0 0 0", "3\n2 4\n1 3 1 4\n2 4 2 3\n2 2 1 2\n0 0 0 2", "3\n2 5\n2 5 1 5\n2 3 2 2\n1 1 2 1\n0 0 1 1", "1\n2 6\n1 3 1 2\n0 0 0 0", "3\n2 7\n2 6 2 7\n1 4 1 5\n2 2 2 3\n1 0 0 2", "1\n3 2\n3 2 2 2\n0 0 0 0", "1\n3 3\n2 3 3 3\n0 0 0 0", "2\n3 4\n3 1 3 2\n3 4 2 4\n0 1 1 0", "3\n3 5\n3 4 3 5\n3 2 3 1\n1 3 2 3\n1 0 0 2", "2\n3 6\n1 1 2 1\n1 3 2 3\n0 0 1 0", "1\n3 7\n2 1 3 1\n0 0 0 0", "3\n4 2\n1 2 2 2\n3 1 4 1\n3 2 4 2\n0 2 1 0", "2\n4 3\n4 3 3 3\n2 2 2 1\n1 0 1 0", "3\n4 4\n2 3 2 4\n4 4 4 3\n2 2 1 2\n0 2 0 2", "3\n4 5\n2 4 1 4\n1 3 1 2\n2 1 1 1\n2 1 2 0", "2\n4 6\n3 3 4 3\n4 6 3 6\n0 0 1 0", "3\n4 7\n2 7 3 7\n4 4 4 5\n3 4 3 3\n2 0 0 1", "1\n5 2\n1 1 1 2\n0 0 0 0", "3\n5 3\n1 2 1 3\n5 2 5 3\n1 1 2 1\n1 1 0 2", "3\n5 4\n4 1 4 2\n1 1 1 2\n5 1 5 2\n0 2 2 2", "2\n5 5\n3 3 4 3\n5 2 4 2\n0 0 0 1", "3\n5 6\n5 2 4 2\n1 1 1 2\n5 1 4 1\n2 1 2 0", "3\n5 7\n5 4 4 4\n1 2 1 1\n2 5 2 4\n0 2 0 2", "2\n6 1\n3 1 2 1\n4 1 5 1\n1 0 0 0", "3\n6 2\n5 2 5 1\n6 1 6 2\n3 2 2 2\n2 0 0 0", "3\n6 3\n2 1 2 2\n6 2 6 1\n1 2 1 1\n1 1 0 0", "3\n6 4\n1 2 2 2\n3 1 3 2\n2 3 2 4\n0 2 0 1", "3\n6 5\n2 2 2 1\n5 4 6 4\n4 4 4 3\n2 0 1 0", "3\n6 6\n4 4 4 5\n2 3 1 3\n3 4 3 3\n0 2 0 1", "3\n6 7\n3 4 3 5\n5 4 6 4\n4 5 4 4\n1 1 1 0", "3\n7 1\n4 1 5 1\n3 1 2 1\n6 1 7 1\n2 0 0 0", "3\n7 2\n7 1 7 2\n5 1 4 1\n3 1 3 2\n0 2 2 1", "3\n7 3\n2 3 3 3\n5 1 6 1\n7 2 7 1\n0 2 2 0", "3\n7 4\n5 4 6 4\n6 1 6 2\n5 1 4 1\n0 2 0 1", "3\n7 5\n2 2 2 3\n7 1 7 2\n1 4 1 3\n2 0 0 2", "3\n7 6\n2 6 2 5\n2 2 1 2\n4 4 3 4\n0 1 0 2", "1\n7 7\n5 4 6 4\n0 0 0 0", "1\n2 4\n1 1 1 2\n0 0 0 0", "3\n2 5\n2 4 2 5\n2 1 1 1\n2 2 1 2\n0 1 1 1", "3\n2 6\n1 3 1 2\n2 2 2 1\n2 5 2 6\n1 0 0 1", "1\n2 7\n2 1 1 1\n0 0 0 0", "4\n3 3\n3 1 2 1\n3 3 2 3\n1 3 1 2\n3 2 2 2\n0 3 2 1", "4\n3 4\n2 4 3 4\n3 3 3 2\n1 2 2 2\n3 1 2 1\n0 3 1 1", "4\n3 5\n2 3 1 3\n1 5 1 4\n2 5 2 4\n2 2 1 2\n1 0 3 1", "2\n3 6\n1 5 1 6\n3 5 3 4\n1 0 0 1", "4\n3 7\n1 2 1 1\n3 3 3 4\n2 1 3 1\n2 6 3 6\n1 1 3 0", "3\n4 2\n2 2 3 2\n1 1 1 2\n4 2 4 1\n2 0 0 0", "2\n4 3\n1 2 1 1\n3 1 3 2\n0 1 0 0", "2\n4 4\n3 1 4 1\n3 4 4 4\n0 0 1 0", "2\n4 5\n3 1 3 2\n2 1 2 2\n1 0 0 0", "4\n4 6\n1 5 2 5\n3 4 3 5\n1 1 1 2\n4 1 4 2\n2 1 2 0", "3\n4 7\n4 2 4 3\n1 4 1 3\n1 2 1 1\n0 1 0 2", "3\n5 2\n1 1 2 1\n3 1 4 1\n3 2 2 2\n1 1 2 0", "1\n5 3\n2 1 1 1\n0 0 0 0", "2\n5 4\n1 2 1 3\n5 4 5 3\n1 0 0 0", "4\n5 5\n5 1 4 1\n3 3 3 4\n1 3 2 3\n2 1 2 2\n0 2 0 2", "3\n5 6\n4 6 4 5\n1 5 1 6\n5 5 5 4\n0 2 1 0", "3\n5 7\n1 5 1 4\n2 5 3 5\n4 4 3 4\n2 0 0 1", "2\n6 2\n1 1 2 1\n6 1 5 1\n0 1 0 0", "2\n6 3\n3 3 4 3\n5 3 6 3\n1 0 0 0", "4\n6 4\n3 2 3 1\n4 1 5 1\n6 1 6 2\n2 2 1 2\n2 1 0 3", "3\n6 5\n5 4 5 3\n1 3 1 2\n2 1 1 1\n1 1 0 2", "3\n6 6\n1 2 2 2\n1 5 1 6\n6 6 6 5\n0 1 1 0", "4\n6 7\n5 4 5 5\n4 4 3 4\n2 1 1 1\n6 3 6 2\n1 2 2 0", "3\n7 2\n5 1 6 1\n2 2 3 2\n2 1 1 1\n2 0 0 1", "4\n7 3\n6 1 7 1\n3 1 4 1\n6 2 5 2\n2 1 1 1\n2 1 3 0", "4\n7 4\n4 2 3 2\n5 2 5 3\n3 4 2 4\n6 2 6 1\n3 0 0 3", "1\n7 5\n6 5 7 5\n0 0 0 0", "3\n7 6\n2 6 1 6\n2 4 2 5\n3 2 2 2\n1 0 0 2", "4\n7 7\n4 6 5 6\n7 4 7 5\n7 1 7 2\n2 6 2 5\n1 2 2 0", "4\n2 5\n1 3 2 3\n1 5 1 4\n1 2 2 2\n1 1 2 1\n0 0 3 0", "2\n2 6\n2 1 2 2\n1 2 1 1\n1 0 0 0", "4\n2 7\n1 2 2 2\n2 6 2 5\n2 3 1 3\n1 5 1 4\n0 3 2 1", "3\n3 4\n2 2 3 2\n1 2 1 3\n3 1 2 1\n1 0 0 2", "4\n3 5\n3 1 3 2\n2 3 2 2\n2 5 1 5\n3 4 3 3\n2 0 2 1", "4\n3 6\n3 1 2 1\n1 2 2 2\n2 3 3 3\n1 5 1 4\n0 2 3 0", "3\n3 7\n3 2 2 2\n3 5 2 5\n3 7 2 7\n0 0 1 1", "4\n4 3\n3 2 3 3\n4 2 4 1\n1 2 1 3\n3 1 2 1\n0 3 1 0", "4\n4 4\n2 4 1 4\n1 2 1 3\n4 3 4 4\n3 3 3 2\n0 2 0 2", "3\n4 5\n4 5 3 5\n4 2 3 2\n2 1 3 1\n0 1 0 2", "5\n4 6\n4 3 3 3\n4 2 4 1\n3 6 2 6\n2 4 2 3\n1 1 1 2\n1 2 2 1", "2\n4 7\n2 6 2 7\n2 5 2 4\n0 0 1 0", "1\n5 2\n2 2 2 1\n0 0 0 0", "1\n5 3\n4 2 3 2\n0 0 0 0", "2\n5 4\n3 1 2 1\n3 4 3 3\n0 0 1 0", "1\n5 5\n3 4 2 4\n0 0 0 0", "4\n5 6\n5 3 5 2\n4 5 3 5\n1 2 1 3\n1 1 2 1\n3 0 1 1", "5\n5 7\n5 5 5 6\n2 4 2 5\n2 3 1 3\n4 7 3 7\n4 1 5 1\n0 3 2 2", "2\n6 2\n5 2 5 1\n4 2 4 1\n1 0 1 1", "3\n6 3\n2 2 2 3\n3 3 4 3\n4 2 4 1\n1 1 1 0", "4\n6 4\n2 3 1 3\n4 4 3 4\n5 4 6 4\n1 4 2 4\n0 2 1 0", "5\n6 5\n1 5 1 4\n4 2 4 3\n2 2 1 2\n2 3 1 3\n3 2 3 3\n0 2 0 3", "4\n6 6\n4 3 4 2\n2 3 2 4\n4 4 5 4\n5 2 5 3\n0 3 2 0", "5\n6 7\n1 6 1 5\n3 6 2 6\n5 1 4 1\n2 5 3 5\n5 3 5 2\n3 0 0 4", "2\n7 2\n3 1 4 1\n7 1 7 2\n0 1 0 1", "2\n7 3\n6 3 7 3\n4 1 3 1\n0 1 0 1", "5\n7 4\n3 1 2 1\n5 2 5 1\n4 2 3 2\n7 3 6 3\n4 3 5 3\n1 2 2 2", "5\n7 5\n5 3 5 2\n3 5 2 5\n1 3 1 4\n3 3 3 4\n4 1 3 1\n1 2 4 0", "5\n7 6\n5 5 5 4\n6 1 7 1\n5 2 5 1\n1 1 2 1\n4 6 3 6\n1 3 4 0", "3\n7 7\n2 6 1 6\n7 2 6 2\n3 1 3 2\n2 0 1 1"], "outputs": ["1", "2", "-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", "1", "1", "1", "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", "2", "-1", "-1", "-1", "1", "-1", "-1", "2", "2", "1", "1", "1", "1", "1", "2", "2", "2", "1", "-1", "2", "1", "-1", "1", "1", "-1", "1", "-1", "1", "1", "1", "2", "2", "1", "2", "2", "1", "1", "1", "1", "-1", "-1", "1", "3", "1", "1", "2", "2", "-1", "1", "1", "1", "3", "1", "-1", "-1", "1", "3", "2", "-1", "1", "2", "2", "-1", "-1", "-1", "-1", "-1", "-1", "3", "3", "1", "-1", "2", "-1", "1", "1", "-1", "-1", "1", "3", "-1", "-1", "2", "-1", "-1", "-1", "-1", "-1", "-1", "3", "3", "1", "-1", "-1", "-1", "-1", "1", "2", "2", "3", "-1", "-1", "1", "3", "4", "1", "-1", "-1", "-1", "-1", "4", "-1", "4", "-1", "-1", "-1", "-1", "-1", "-1", "1", "1", "1", "-1", "1", "-1", "-1", "1", "-1", "-1", "-1", "-1", "-1", "1", "2", "-1", "-1", "5", "2"]} | UNKNOWN | [
"PYTHON3"
] | CODEFORCES | 5 | codeforces |
|
4b6ebb7fe049d8c36c6388590e93ec3c | Prime Gift | Opposite to Grisha's nice behavior, Oleg, though he has an entire year at his disposal, didn't manage to learn how to solve number theory problems in the past year. That's why instead of Ded Moroz he was visited by his teammate Andrew, who solemnly presented him with a set of *n* distinct prime numbers alongside with a simple task: Oleg is to find the *k*-th smallest integer, such that all its prime divisors are in this set.
The first line contains a single integer *n* (1<=≤<=*n*<=≤<=16).
The next line lists *n* distinct prime numbers *p*1,<=*p*2,<=...,<=*p**n* (2<=≤<=*p**i*<=≤<=100) in ascending order.
The last line gives a single integer *k* (1<=≤<=*k*). It is guaranteed that the *k*-th smallest integer such that all its prime divisors are in this set does not exceed 1018.
Print a single line featuring the *k*-th smallest integer. It's guaranteed that the answer doesn't exceed 1018.
Sample Input
3
2 3 5
7
5
3 7 11 13 31
17
Sample Output
8
93
| {"inputs": ["3\n2 3 5\n7", "5\n3 7 11 13 31\n17", "2\n41 61\n66", "1\n2\n55", "7\n2 3 5 7 11 13 17\n2666471", "16\n2 3 5 7 11 13 17 19 23 29 31 37 41 43 47 53\n755104793", "8\n3 7 13 17 19 29 31 37\n68830", "8\n3 7 11 17 19 23 37 43\n528714", "8\n3 7 13 17 29 41 43 47\n430196", "8\n2 5 7 19 29 31 37 41\n912071", "9\n2 3 7 13 17 19 29 31 37\n2353167", "10\n5 7 13 17 19 29 31 37 41 43\n1675780", "11\n2 3 13 17 19 23 29 31 37 41 47\n1057708", "12\n2 3 7 11 13 19 29 31 41 43 47 53\n19281646", "16\n2 3 5 7 11 13 17 23 29 31 37 41 47 53 59 67\n1", "16\n2 3 7 11 13 17 19 23 29 31 37 43 47 53 61 71\n175211930", "16\n2 3 5 7 11 23 29 31 37 41 47 53 59 61 67 71\n48452906", "16\n2 3 5 11 13 23 29 31 37 47 53 73 79 83 89 97\n95494812", "16\n2 7 11 13 19 29 31 43 47 53 61 67 71 73 83 89\n62457792", "16\n2 3 5 7 11 13 19 23 29 31 37 53 59 61 67 79\n342035643", "2\n3 7\n406", "3\n11 19 29\n546", "5\n5 13 19 23 29\n673", "5\n5 7 13 23 29\n20345", "5\n5 7 17 19 23\n19838", "5\n3 5 7 11 29\n9727", "5\n5 7 11 17 23\n15658", "5\n3 17 19 23 29\n14598", "5\n2 5 7 23 29\n28386", "5\n3 5 7 11 29\n18047", "5\n2 7 13 17 19\n1893", "5\n5 11 17 23 29\n4311", "8\n2 3 7 11 17 19 23 29\n2573899", "8\n2 3 5 7 11 13 19 23\n4404338", "8\n2 3 5 7 11 13 23 29\n4014725", "8\n2 3 11 13 17 19 23 29\n1609968", "1\n3\n27", "1\n23\n4", "1\n2\n36", "1\n5\n1", "1\n83\n6", "1\n7\n5", "12\n5 17 23 31 41 47 53 61 67 71 89 97\n1498107", "12\n3 5 7 13 17 19 31 37 61 79 83 97\n8046630", "12\n3 19 23 29 31 37 43 59 67 73 79 89\n1480623", "12\n2 3 5 13 17 29 31 37 47 67 73 89\n8871760", "12\n3 5 11 17 19 23 43 59 73 79 83 89\n2639765", "12\n3 11 17 19 23 29 47 53 59 67 71 79\n37764", "12\n2 5 7 11 23 29 31 53 61 67 83 89\n11925984", "12\n2 5 7 13 19 23 31 37 41 79 89 97\n10850747", "12\n2 3 7 11 19 29 31 53 59 73 83 97\n14165113", "12\n3 5 7 11 17 41 47 59 61 71 73 97\n2487564", "7\n3 17 19 23 31 41 43\n103787", "7\n3 19 37 43 47 73 83\n32338", "7\n5 11 23 41 47 67 89\n21642", "7\n11 13 19 31 47 83 97\n47564", "7\n2 11 13 19 41 59 73\n48718", "7\n2 5 37 41 53 59 73\n78513", "7\n3 29 43 47 53 67 83\n16352", "7\n2 3 5 7 13 37 97\n200297", "16\n2 5 13 17 23 31 37 43 53 59 61 67 73 83 89 97\n14029265", "16\n2 3 5 7 11 17 19 29 31 47 53 67 71 73 83 89\n315508919", "16\n3 11 13 17 19 31 37 47 53 59 61 71 73 79 89 97\n17713810", "16\n3 5 11 13 17 37 41 47 53 59 61 67 73 79 89 97\n7541983", "16\n3 5 13 17 29 37 41 43 47 53 59 67 71 73 83 97\n39768007", "16\n7 19 31 37 41 43 47 53 59 61 71 73 79 83 89 97\n2997553", "16\n2 7 17 19 23 31 41 43 59 61 71 73 79 83 89 97\n35791394", "16\n2 5 7 11 13 19 23 29 37 41 59 61 67 83 89 97\n156644145", "16\n3 5 7 11 13 37 41 43 47 59 61 67 73 83 89 97\n59619226", "16\n3 5 7 17 19 29 31 37 43 61 67 71 73 83 89 97\n52018960", "2\n2 17\n292", "2\n11 13\n156", "2\n7 13\n115", "2\n2 3\n781", "2\n13 29\n23", "2\n11 17\n26", "1\n19\n4", "1\n13\n17", "1\n11\n7", "16\n2 3 5 7 11 13 17 19 23 29 31 37 41 43 47 53\n1"], "outputs": ["8", "93", "550329031716248441", "18014398509481984", "810722946966732800", "1000000000000000000", "2476061307629", "139155272849176437", "305676371111846553", "116333178429440000", "5633116276150272", "352388344647077375", "7257035596446", "32820959594794371", "1", "61877301658877952", "804126613807440", "42119814060080640", "472958488994763772", "237003531345504000", "272393967761220627", "48364216424306959", "138452525", "204919965537148225", "127360414660865575", "394292863125", "3573226485213841", "23610090783396093", "148961113306250", "25488555332625", "53202877", "5920384757045", "222801765143150592", "96144227557297920", "100966044983345542", "52272636008333312", "2541865828329", "12167", "34359738368", "1", "3939040643", "2401", "549909223796509595", "173676038924316695", "50150550157338149", "4695900205082112", "8558183944012725", "3927810717", "301419849067832000", "107689592768850176", "127001325888007494", "2365312425520625", "118287859814130519", "3183280950920513", "342762156070895", "803966969563403789", "37312888001077", "1719827640625000", "108423251809029", "7595621495280", "2418289423929800", "718343216190308352", "80800214839016049", "703144305621225", "749475594623822625", "11399640607831889", "307958802673248128", "991529674686751655", "598041285733749375", "534530840244760065", "84404697300992", "705954940631245019", "51676101935731", "385610460475392", "20511149", "10106041", "6859", "665416609183179841", "1771561", "1"]} | UNKNOWN | [
"PYTHON3"
] | CODEFORCES | 1 | codeforces |
|
4b846aa0277bb4b4c287ebc625fd544d | Interactive Bulls and Cows (Hard) | The only difference from the previous problem is the constraint on the number of requests. In this problem your program should guess the answer doing at most 7 requests.
This problem is a little bit unusual. Here you are to implement an interaction with a testing system. That means that you can make queries and get responses in the online mode. Please be sure to use the stream flushing operation after each query's output in order not to leave part of your output in some buffer. For example, in C++ you've got to use the fflush(stdout) function, in Java — call System.out.flush(), and in Pascal — flush(output).
Bulls and Cows (also known as Cows and Bulls or Pigs and Bulls or Bulls and Cleots) is an old code-breaking paper and pencil game for two players, predating the similar commercially marketed board game Mastermind.
On a sheet of paper, the first player thinks a secret string. This string consists only of digits and has the length 4. The digits in the string must be all different, no two or more equal digits are allowed.
Then the second player tries to guess his opponent's string. For every guess the first player gives the number of matches. If the matching digits are on their right positions, they are "bulls", if on different positions, they are "cows". Thus a response is a pair of numbers — the number of "bulls" and the number of "cows". A try can contain equal digits.
More formally, let's the secret string is *s* and the second player are trying to guess it with a string *x*. The number of "bulls" is a number of such positions *i* (1<=≤<=*i*<=≤<=4) where *s*[*i*]<==<=*x*[*i*]. The number of "cows" is a number of such digits *c* that *s* contains *c* in the position *i* (i.e. *s*[*i*]<==<=*c*), *x* contains *c*, but *x*[*i*]<=≠<=*c*.
For example, the secret string is "0427", the opponent's try is "0724", then the answer is 2 bulls and 2 cows (the bulls are "0" and "2", the cows are "4" and "7"). If the secret string is "0123", the opponent's try is "0330", then the answer is 1 bull and 1 cow.
In this problem you are to guess the string *s* that the system has chosen. You only know that the chosen string consists of 4 distinct digits.
You can make queries to the testing system, each query is the output of a single 4-digit string. The answer to the query is the number of bulls and number of cows. If the system's response equals "4 0", that means the interaction with your problem is over and the program must terminate. That is possible for two reasons — the program either guessed the number *x* or made an invalid action (for example, printed letters instead of digits).
Your program is allowed to do at most 7 queries.
You can hack solutions of other participants providing a 4-digit string containing distinct digits — the secret string.
To read answers to the queries, the program must use the standard input.
The program will receive pairs of non-negative integers in the input, one pair per line. The first number in a pair is a number of bulls and the second one is a number of cows of the string *s* and the string *x**i* printed by your program. If the system response equals "4 0", then your solution should terminate.
The testing system will let your program read the *i*-th pair of integers from the input only after your program displays the corresponding system query in the output: prints value *x**i* in a single line and executes operation flush.
The program must use the standard output to print queries.
Your program must output requests — 4-digit strings *x*1,<=*x*2,<=..., one per line. After the output of each line the program must execute flush operation. The program should read the answer to the query from the standard input.
Your program is allowed to do at most 7 queries.
Sample Input
0 1
2 0
1 1
0 4
2 1
4 0
Sample Output
8000
0179
3159
3210
0112
0123 | {"inputs": ["0123", "1234", "9876", "7158", "7590", "7325", "7524", "7269", "7802", "7436", "7190", "7390", "2548", "2193", "2491", "2469", "2659", "2405", "2058", "2580", "2316", "2516", "8796", "8534", "9067", "8712", "9023", "8645", "8623", "8923", "8567", "8756", "0351", "9863", "0518", "0263", "0462", "0429", "0629", "0374", "0128", "0541", "1680", "1648", "1847", "1592", "1792", "1759", "1958", "1704", "1458", "1870", "3256", "2978", "3189", "2934", "3467", "3102", "3401", "3056", "3024", "3214", "9584", "9340", "9530", "9274", "9706", "9451", "9641", "9618", "9362", "9562", "1047", "0781", "0971", "0947", "1258", "0893", "1094", "1072", "0815", "1026", "2478", "2134", "2645", "2389", "2589", "2345", "2756", "2501", "2701", "2456", "3807", "3561", "3974", "3719", "3918", "3895", "4096", "3840", "4051", "4018", "0946", "1257", "0891", "0635", "1068", "0813", "1024", "0746", "1279", "0924", "2386", "2586", "2340", "2197", "2497", "2153", "2451", "2410", "2610", "2365", "3718", "3917", "3671", "4095", "3829", "3582", "4017", "3750", "3950", "3694", "0179", "0379", "0357", "0547", "0291", "9824", "0468", "0214", "0413", "0379", "1520", "1943", "1687", "1876", "1632", "1598", "1798", "1543", "1743", "1720", "2850", "3284", "3028", "3218", "3195", "2938", "3149", "2873", "3407", "3061", "4513", "4713", "4368", "4658", "4625", "4279", "4579", "4215", "4736", "4390", "0865", "1076", "0821", "1354", "0976", "1287", "0932", "0897", "1098", "0843", "2307", "2507", "2160", "2683", "2418", "2618", "2594", "2349", "2539", "2184", "3647", "3846", "3814", "4025", "3759", "3958", "3926", "3680", "3870", "3847", "0453", "0421", "0165", "0365", "9876", "0532", "0276", "0476", "0453", "0643", "2018", "1752", "1496", "1695", "1673", "1863", "1608", "1807", "1784", "1974", "3458", "3092", "2836", "3269", "3015", "3205", "2947", "3480", "3126", "3416", "9687", "9432", "9176", "9610", "9354", "9543", "9521", "9721", "9465", "9654", "1250", "0874", "0852", "1063", "0795", "0985", "0963", "1274", "0917", "1208", "2580", "2548", "2748", "2491", "2147", "2659", "2405", "2604", "2358", "2780", "8921", "8796", "9102", "8734", "8479", "9023", "8645", "8945", "8923", "9134", "0596", "0351", "0541", "0285", "0263", "0462", "0196", "0396", "0374", "0573", "1936", "1680", "1870", "1847", "1592", "1792", "1537", "1958", "1704", "1904", "3278", "3024", "3214", "3189", "2934", "3145", "3102", "3401", "3056", "3256", "9507", "9251", "9673", "9418", "9618", "9584", "9784", "9530", "9275", "9708", "0948", "0926", "1237", "0861", "1072", "1048", "1348", "0972", "1506", "1259", "7523", "7268", "7468", "7213", "7634", "7389", "7589", "7324", "7845", "7501", "8952", "8609", "8907", "8764", "9075", "8720", "9031", "8975", "9186", "8931", "0416", "0159", "0359", "0327", "0527", "0271", "0471", "0438", "0638", "0382", "1745", "1489", "1923", "1657", "1856", "1602", "2045", "1768", "1967", "1723", "8096", "7831", "8264", "8019", "8209", "8175", "8375", "8130", "8320", "8296", "9427", "9405", "9604", "9348", "9538", "9516", "9715", "9460", "9872", "9627", "1203", "0845", "1056", "0789", "1325", "0957", "1268", "0913", "1436", "1079", "7452", "7642", "7396", "7364", "7563", "7309", "7509", "7485", "7158", "9431"], "outputs": ["1", "4", "5", "3", "7", "5", "5", "6", "5", "6", "5", "6", "5", "7", "6", "5", "5", "6", "5", "6", "4", "4", "6", "6", "7", "7", "7", "5", "5", "4", "6", "5", "4", "6", "5", "4", "5", "6", "5", "4", "6", "5", "5", "5", "4", "6", "5", "5", "5", "5", "4", "5", "6", "5", "4", "6", "5", "5", "5", "5", "5", "5", "6", "6", "6", "6", "6", "6", "6", "6", "5", "7", "4", "4", "6", "6", "5", "4", "6", "5", "6", "4", "5", "4", "5", "5", "6", "5", "5", "4", "5", "5", "6", "4", "4", "6", "6", "5", "5", "6", "4", "5", "5", "4", "6", "4", "5", "6", "3", "4", "6", "6", "4", "6", "4", "5", "5", "4", "3", "4", "4", "6", "6", "6", "5", "6", "5", "5", "6", "5", "6", "6", "5", "5", "4", "5", "7", "5", "4", "2", "3", "5", "3", "5", "4", "5", "4", "6", "6", "5", "5", "5", "5", "5", "6", "6", "6", "5", "5", "6", "6", "5", "6", "6", "6", "4", "4", "5", "4", "5", "6", "6", "5", "4", "6", "3", "5", "5", "7", "5", "5", "5", "5", "6", "4", "6", "5", "5", "5", "5", "6", "5", "6", "6", "6", "4", "5", "4", "6", "6", "5", "6", "3", "4", "4", "3", "5", "5", "4", "4", "3", "5", "6", "5", "5", "6", "3", "5", "4", "5", "6", "6", "4", "7", "5", "5", "5", "5", "6", "6", "4", "6", "5", "6", "5", "6", "5", "5", "6", "6", "6", "6", "3", "4", "5", "4", "5", "5", "5", "5", "6", "6", "6", "5", "5", "6", "4", "5", "6", "6", "5", "5", "6", "6", "7", "6", "6", "7", "5", "5", "4", "6", "5", "4", "5", "5", "4", "5", "5", "5", "4", "4", "6", "5", "5", "4", "6", "5", "5", "5", "5", "6", "4", "5", "5", "4", "6", "5", "5", "5", "5", "6", "7", "6", "5", "6", "6", "6", "5", "6", "6", "6", "5", "5", "5", "5", "5", "5", "6", "6", "5", "6", "5", "7", "5", "5", "7", "5", "4", "4", "5", "5", "6", "7", "4", "5", "6", "6", "7", "5", "5", "6", "4", "6", "6", "5", "5", "5", "4", "5", "4", "6", "4", "6", "7", "5", "5", "4", "5", "5", "5", "5", "5", "6", "6", "4", "5", "5", "6", "6", "6", "7", "5", "6", "7", "5", "6", "6", "5", "6", "6", "5", "4", "6", "5", "4", "3", "6", "5", "7", "3", "6", "5", "6", "5", "6", "6", "7", "6", "5", "3", "7"]} | UNKNOWN | [
"PYTHON3"
] | CODEFORCES | 1 | codeforces |
|
4b8bf6a7e20682853f8d4eb7977979bc | Kefa and Park | Kefa decided to celebrate his first big salary by going to the restaurant.
He lives by an unusual park. The park is a rooted tree consisting of *n* vertices with the root at vertex 1. Vertex 1 also contains Kefa's house. Unfortunaely for our hero, the park also contains cats. Kefa has already found out what are the vertices with cats in them.
The leaf vertices of the park contain restaurants. Kefa wants to choose a restaurant where he will go, but unfortunately he is very afraid of cats, so there is no way he will go to the restaurant if the path from the restaurant to his house contains more than *m* consecutive vertices with cats.
Your task is to help Kefa count the number of restaurants where he can go.
The first line contains two integers, *n* and *m* (2<=≤<=*n*<=≤<=105, 1<=≤<=*m*<=≤<=*n*) — the number of vertices of the tree and the maximum number of consecutive vertices with cats that is still ok for Kefa.
The second line contains *n* integers *a*1,<=*a*2,<=...,<=*a**n*, where each *a**i* either equals to 0 (then vertex *i* has no cat), or equals to 1 (then vertex *i* has a cat).
Next *n*<=-<=1 lines contains the edges of the tree in the format "*x**i* *y**i*" (without the quotes) (1<=≤<=*x**i*,<=*y**i*<=≤<=*n*, *x**i*<=≠<=*y**i*), where *x**i* and *y**i* are the vertices of the tree, connected by an edge.
It is guaranteed that the given set of edges specifies a tree.
A single integer — the number of distinct leaves of a tree the path to which from Kefa's home contains at most *m* consecutive vertices with cats.
Sample Input
4 1
1 1 0 0
1 2
1 3
1 4
7 1
1 0 1 1 0 0 0
1 2
1 3
2 4
2 5
3 6
3 7
Sample Output
2
2
| {"inputs": ["4 1\n1 1 0 0\n1 2\n1 3\n1 4", "7 1\n1 0 1 1 0 0 0\n1 2\n1 3\n2 4\n2 5\n3 6\n3 7", "3 2\n1 1 1\n1 2\n2 3", "5 2\n1 1 0 1 1\n1 2\n2 3\n3 4\n4 5", "6 1\n1 0 1 1 0 0\n1 2\n1 3\n1 4\n1 5\n1 6", "7 3\n1 1 1 1 1 0 1\n1 2\n1 3\n2 4\n3 5\n5 6\n6 7", "15 2\n1 0 1 0 1 0 0 0 0 0 0 0 0 0 0\n1 2\n1 3\n2 4\n2 5\n3 6\n3 7\n4 8\n4 9\n5 10\n5 11\n6 12\n6 13\n7 14\n7 15", "2 1\n1 1\n2 1", "12 3\n1 0 1 0 1 1 1 1 0 0 0 0\n6 7\n12 1\n9 7\n1 4\n10 7\n7 1\n11 8\n5 1\n3 7\n5 8\n4 2"], "outputs": ["2", "2", "0", "1", "3", "2", "8", "0", "7"]} | UNKNOWN | [
"PYTHON3"
] | CODEFORCES | 44 | codeforces |
|
4b9a92245483f4058b4f0cb60081df9b | XOR Equation | Two positive integers *a* and *b* have a sum of *s* and a bitwise XOR of *x*. How many possible values are there for the ordered pair (*a*,<=*b*)?
The first line of the input contains two integers *s* and *x* (2<=≤<=*s*<=≤<=1012, 0<=≤<=*x*<=≤<=1012), the sum and bitwise xor of the pair of positive integers, respectively.
Print a single integer, the number of solutions to the given conditions. If no solutions exist, print 0.
Sample Input
9 5
3 3
5 2
Sample Output
4
2
0
| {"inputs": ["9 5", "3 3", "5 2", "6 0", "549755813887 549755813887", "2 0", "2 2", "433864631347 597596794426", "80 12", "549755813888 549755813886", "643057379466 24429729346", "735465350041 356516240229", "608032203317 318063018433", "185407964720 148793115916", "322414792152 285840263184", "547616456703 547599679487", "274861129991 274861129463", "549688705887 549688703839", "412182675455 412182609919", "552972910589 546530328573", "274869346299 274869346299", "341374319077 341374319077", "232040172650 232040172650", "322373798090 322373798090", "18436 18436", "137707749376 137707749376", "9126813696 9126813696", "419432708 419432708", "1839714 248080", "497110 38", "1420572 139928", "583545 583545", "33411 33411", "66068 66068", "320 320", "1530587 566563", "1988518 108632", "915425594051 155160267299", "176901202458 21535662096", "865893190664 224852444148", "297044970199 121204864", "241173201018 236676464482", "1582116 139808", "1707011 656387", "169616 132704", "2160101 553812", "1322568 271816", "228503520839 471917524248", "32576550340 504864993495", "910648542843 537125462055", "751720572344 569387893618", "629791564846 602334362179", "1000000000000 1000000000000", "1000000000000 999999999999", "1000000000000 4", "1000000000000 4096", "3 1", "2097152 0", "40 390", "22212 39957", "128 36", "14 4", "6 2", "43 18467", "7 1", "7 5", "251059 79687", "17 7", "4 6", "2 4", "3 7"], "outputs": ["4", "2", "0", "1", "549755813886", "1", "0", "0", "4", "274877906944", "2048", "32768", "4096", "16384", "4096", "68719476736", "34359738368", "34359738368", "68719476736", "17179869184", "8589934590", "134217726", "65534", "1048574", "6", "30", "6", "62", "128", "8", "64", "4094", "30", "14", "2", "256", "128", "0", "0", "32768", "0", "0", "0", "0", "32", "0", "0", "0", "0", "0", "0", "0", "8190", "0", "0", "2", "0", "1", "0", "0", "0", "0", "0", "0", "0", "0", "0", "0", "0", "0", "0"]} | UNKNOWN | [
"PYTHON3"
] | CODEFORCES | 22 | codeforces |
|
4b9efbe937a1036c33df235b8132dfe0 | Invariance of Tree | A tree of size *n* is an undirected connected graph consisting of *n* vertices without cycles.
Consider some tree with *n* vertices. We call a tree invariant relative to permutation *p*<==<=*p*1*p*2... *p**n*, if for any two vertices of the tree *u* and *v* the condition holds: "vertices *u* and *v* are connected by an edge if and only if vertices *p**u* and *p**v* are connected by an edge".
You are given permutation *p* of size *n*. Find some tree size *n*, invariant relative to the given permutation.
The first line contains number *n* (1<=≤<=*n*<=≤<=105) — the size of the permutation (also equal to the size of the sought tree).
The second line contains permutation *p**i* (1<=≤<=*p**i*<=≤<=*n*).
If the sought tree does not exist, print "NO" (without the quotes).
Otherwise, print "YES", and then print *n*<=-<=1 lines, each of which contains two integers — the numbers of vertices connected by an edge of the tree you found. The vertices are numbered from 1, the order of the edges and the order of the vertices within the edges does not matter.
If there are multiple solutions, output any of them.
Sample Input
4
4 3 2 1
3
3 1 2
Sample Output
YES
4 1
4 2
1 3
NO
| {"inputs": ["4\n4 3 2 1", "3\n3 1 2", "3\n3 2 1", "4\n3 4 1 2", "5\n5 3 2 1 4", "8\n1 2 6 4 5 7 8 3", "11\n7 3 5 2 10 1 9 6 8 4 11", "1\n1", "2\n1 2", "2\n2 1", "6\n2 1 6 5 3 4", "6\n2 1 4 5 6 3", "4\n2 3 4 1", "6\n2 3 4 1 6 5", "6\n4 1 2 3 6 5"], "outputs": ["YES\n4 1\n4 2\n1 3", "NO", "YES\n2 1\n2 3", "YES\n4 2\n4 1\n2 3", "NO", "YES\n5 1\n5 2\n5 3\n5 4\n5 6\n5 7\n5 8", "YES\n11 1\n11 2\n11 3\n11 4\n11 5\n11 6\n11 7\n11 8\n11 9\n11 10", "YES", "YES\n2 1", "YES\n2 1", "YES\n2 1\n2 3\n2 4\n1 6\n1 5", "YES\n2 1\n2 3\n2 5\n1 4\n1 6", "NO", "YES\n6 5\n6 1\n6 3\n5 2\n5 4", "YES\n6 5\n6 1\n6 3\n5 4\n5 2"]} | UNKNOWN | [
"PYTHON3"
] | CODEFORCES | 5 | codeforces |
|
4bf42ec96ffd1342873f59118733cee4 | Full Binary Tree Queries | You have a full binary tree having infinite levels.
Each node has an initial value. If a node has value *x*, then its left child has value 2·*x* and its right child has value 2·*x*<=+<=1.
The value of the root is 1.
You need to answer *Q* queries.
There are 3 types of queries:
1. Cyclically shift the values of all nodes on the same level as node with value *X* by *K* units. (The values/nodes of any other level are not affected).1. Cyclically shift the nodes on the same level as node with value *X* by *K* units. (The subtrees of these nodes will move along with them).1. Print the value of every node encountered on the simple path from the node with value *X* to the root.
Positive *K* implies right cyclic shift and negative *K* implies left cyclic shift.
It is guaranteed that atleast one type 3 query is present.
The first line contains a single integer *Q* (1<=≤<=*Q*<=≤<=105).
Then *Q* queries follow, one per line:
- Queries of type 1 and 2 have the following format: *T* *X* *K* (1<=≤<=*T*<=≤<=2; 1<=≤<=*X*<=≤<=1018; 0<=≤<=|*K*|<=≤<=1018), where *T* is type of the query.- Queries of type 3 have the following format: 3 *X* (1<=≤<=*X*<=≤<=1018).
For each query of type 3, print the values of all nodes encountered in descending order.
Sample Input
5
3 12
1 2 1
3 12
2 4 -1
3 8
5
3 14
1 5 -3
3 14
1 3 1
3 14
Sample Output
12 6 3 1
12 6 2 1
8 4 2 1
14 7 3 1
14 6 3 1
14 6 2 1
| {"inputs": ["5\n3 12\n1 2 1\n3 12\n2 4 -1\n3 8", "5\n3 14\n1 5 -3\n3 14\n1 3 1\n3 14", "6\n3 1\n2 1 0\n3 10\n2 1 -4\n3 10\n2 10 -5", "3\n3 1000000000000000000\n1 12345 13\n3 1000000000000000000", "10\n3 999\n3 822\n2 339 -75\n2 924 -56\n3 863\n3 311\n1 269 84\n2 604 9\n2 788 -98\n1 233 60", "10\n2 64324170 41321444786551040\n2 58204973 -73473234074970084\n1 56906279 -33102897753191948\n1 50660486 43066512304447265\n2 5614300 55244615832513844\n3 63044213\n3 27109227\n3 65485686\n3 36441490\n1 59699160 -19214308468046677", "2\n2 1 100000000000000000\n3 1000000000000000"], "outputs": ["12 6 3 1 \n12 6 2 1 \n8 4 2 1 ", "14 7 3 1 \n14 6 3 1 \n14 6 2 1 ", "1 \n10 5 2 1 \n10 5 2 1 ", "1000000000000000000 500000000000000000 250000000000000000 125000000000000000 62500000000000000 31250000000000000 15625000000000000 7812500000000000 3906250000000000 1953125000000000 976562500000000 488281250000000 244140625000000 122070312500000 61035156250000 30517578125000 15258789062500 7629394531250 3814697265625 1907348632812 953674316406 476837158203 238418579101 119209289550 59604644775 29802322387 14901161193 7450580596 3725290298 1862645149 931322574 465661287 232830643 116415321 58207660 29103830...", "999 499 249 124 62 31 15 7 3 1 \n822 411 205 102 51 25 12 6 3 1 \n863 403 164 82 41 20 10 5 2 1 \n311 246 123 61 30 15 7 3 1 ", "63044213 19585619 9792809 4896404 4125156 2062578 1031289 515644 257822 128911 64455 32227 16113 8056 4028 2014 1007 503 251 125 62 31 15 7 3 1 \n27109227 13554613 6777306 2968455 1484227 742113 371056 185528 92764 46382 23191 11595 5797 2898 1449 724 362 181 90 45 22 11 5 2 1 \n65485686 20806355 10403177 5201588 2180596 1090298 545149 272574 136287 68143 34071 17035 8517 4258 2129 1064 532 266 133 66 33 16 8 4 2 1 \n36441490 23061473 11530736 5765368 2462486 1231243 615621 307810 153905 76952 38476 19238 ...", "1000000000000000 500000000000000 250000000000000 125000000000000 62500000000000 31250000000000 15625000000000 7812500000000 3906250000000 1953125000000 976562500000 488281250000 244140625000 122070312500 61035156250 30517578125 15258789062 7629394531 3814697265 1907348632 953674316 476837158 238418579 119209289 59604644 29802322 14901161 7450580 3725290 1862645 931322 465661 232830 116415 58207 29103 14551 7275 3637 1818 909 454 227 113 56 28 14 7 3 1 "]} | UNKNOWN | [
"PYTHON3"
] | CODEFORCES | 1 | codeforces |
|
4bfe1e0069a303c77dfd34af728b3070 | Drazil and His Happy Friends | Drazil has many friends. Some of them are happy and some of them are unhappy. Drazil wants to make all his friends become happy. So he invented the following plan.
There are *n* boys and *m* girls among his friends. Let's number them from 0 to *n*<=-<=1 and 0 to *m*<=-<=1 separately. In *i*-th day, Drazil invites -th boy and -th girl to have dinner together (as Drazil is programmer, *i* starts from 0). If one of those two people is happy, the other one will also become happy. Otherwise, those two people remain in their states. Once a person becomes happy (or if he/she was happy originally), he stays happy forever.
Drazil wants to know whether he can use this plan to make all his friends become happy at some moment.
The first line contains two integer *n* and *m* (1<=≤<=*n*,<=*m*<=≤<=100).
The second line contains integer *b* (0<=≤<=*b*<=≤<=*n*), denoting the number of happy boys among friends of Drazil, and then follow *b* distinct integers *x*1,<=*x*2,<=...,<=*x**b* (0<=≤<=*x**i*<=<<=*n*), denoting the list of indices of happy boys.
The third line conatins integer *g* (0<=≤<=*g*<=≤<=*m*), denoting the number of happy girls among friends of Drazil, and then follow *g* distinct integers *y*1,<=*y*2,<=... ,<=*y**g* (0<=≤<=*y**j*<=<<=*m*), denoting the list of indices of happy girls.
It is guaranteed that there is at least one person that is unhappy among his friends.
If Drazil can make all his friends become happy by this plan, print "Yes". Otherwise, print "No".
Sample Input
2 3
0
1 0
2 4
1 0
1 2
2 3
1 0
1 1
Sample Output
Yes
No
Yes
| {"inputs": ["2 3\n0\n1 0", "2 4\n1 0\n1 2", "2 3\n1 0\n1 1", "16 88\n6 5 14 2 0 12 7\n30 21 64 35 79 74 39 63 44 81 73 0 27 33 69 12 86 46 20 25 55 52 7 58 23 5 60 32 41 50 82", "52 91\n13 26 1 3 43 17 19 32 46 33 48 23 37 50\n25 78 26 1 40 2 67 42 4 56 30 70 84 32 20 85 59 8 86 34 73 23 10 88 24 11", "26 52\n8 0 14 16 17 7 9 10 11\n15 39 15 2 41 42 30 17 18 31 6 21 35 48 50 51", "50 50\n0\n0", "27 31\n4 25 5 19 20\n26 5 28 17 2 1 0 26 23 12 29 6 4 25 19 15 13 20 24 8 27 22 30 3 10 9 7", "55 79\n5 51 27 36 45 53\n30 15 28 0 5 38 3 34 30 35 1 32 12 27 42 39 69 33 10 63 16 29 76 19 60 70 67 31 78 68 45", "79 23\n35 31 62 14 9 46 18 68 69 42 13 50 77 23 76 5 53 40 16 32 74 54 38 25 45 39 26 37 66 78 3 48 10 17 56 59\n13 16 0 8 6 18 14 21 11 20 4 15 13 22", "7 72\n1 4\n3 49 32 28", "100 50\n31 52 54 8 60 61 62 63 64 16 19 21 73 25 76 77 79 30 81 32 33 34 37 88 39 40 91 42 94 95 96 98\n18 0 1 3 5 6 7 9 15 18 20 22 24 28 35 36 43 47 49", "98 49\n33 0 51 52 6 57 10 12 63 15 16 19 20 21 72 73 74 76 77 78 30 31 81 33 83 37 38 39 40 92 44 45 95 97\n15 4 5 7 9 11 13 17 18 22 26 35 36 41 42 47", "50 50\n14 7 8 12 16 18 22 23 24 28 30 35 40 46 49\n35 0 1 2 3 4 5 6 9 10 11 13 14 15 17 19 20 21 25 26 27 29 31 32 33 34 36 37 38 39 41 43 44 45 47 48", "30 44\n3 8 26 28\n6 2 30 38 26 8 6", "69 72\n18 58 46 52 43 1 55 16 7 4 38 68 14 32 53 41 29 2 59\n21 22 43 55 13 70 4 7 31 10 23 56 44 62 17 50 53 5 41 11 65 32", "76 28\n10 24 13 61 45 29 57 41 21 37 11\n2 12 9", "65 75\n15 25 60 12 62 37 22 47 52 3 63 58 13 14 49 34\n18 70 10 2 52 22 47 72 57 38 48 13 73 3 19 4 74 49 34", "6 54\n1 5\n14 13 49 31 37 44 2 15 51 52 22 28 10 35 47", "96 36\n34 84 24 0 48 85 13 61 37 62 38 86 75 3 16 64 40 28 76 53 5 17 42 6 7 91 67 55 68 92 57 11 71 35 59\n9 1 14 15 17 18 30 6 8 35", "40 40\n23 0 2 3 4 5 7 11 15 16 17 18 19 22 25 28 29 30 31 32 34 35 36 37\n16 1 6 8 9 10 12 13 14 20 21 23 24 26 27 38 39", "66 66\n24 2 35 3 36 4 5 10 45 14 48 18 51 19 21 55 22 23 24 25 26 63 31 65 32\n21 0 1 37 6 40 7 8 42 45 13 15 16 50 53 23 24 60 28 62 63 31", "20 20\n9 0 3 4 6 7 8 10 12 13\n10 1 2 5 9 11 14 15 16 18 19", "75 30\n18 46 47 32 33 3 34 35 21 51 7 9 54 39 72 42 59 29 14\n8 0 17 5 6 23 26 27 13", "100 50\n30 50 54 7 8 59 60 61 62 63 64 15 16 18 19 20 22 73 27 79 83 86 87 89 42 93 94 45 46 97 98\n20 1 2 3 5 6 17 21 24 25 26 28 30 31 32 34 35 38 40 41 49", "98 98\n43 49 1 51 3 53 4 55 56 8 9 10 60 11 12 61 64 16 65 17 19 20 21 72 24 74 25 77 78 31 34 35 36 37 87 88 89 42 92 43 44 94 46 96\n34 50 2 52 5 54 9 62 63 15 18 68 70 22 72 75 26 27 77 30 81 82 83 35 36 37 87 88 89 90 41 93 95 96 48", "100 100\n45 50 1 4 5 55 7 8 10 60 61 62 63 14 65 66 17 18 20 21 22 24 25 27 78 28 29 30 31 82 83 33 84 36 37 38 39 40 41 42 44 45 46 48 98 49\n34 50 1 2 52 3 54 56 7 9 59 61 14 16 67 18 69 22 73 24 76 79 81 82 84 35 36 38 39 90 43 44 45 47 49", "76 72\n29 4 64 68 20 8 12 50 42 46 0 70 11 37 75 47 45 29 17 19 73 9 41 31 35 67 65 39 51 55\n25 60 32 48 42 8 6 9 7 31 19 25 5 33 51 61 67 55 49 27 29 53 39 65 35 13", "39 87\n16 18 15 30 33 21 9 3 31 16 10 34 20 35 8 26 23\n36 33 75 81 24 42 54 78 39 57 60 30 36 63 4 76 25 1 40 73 22 58 49 85 31 74 59 20 44 83 65 23 41 71 47 14 35", "36 100\n10 0 32 4 5 33 30 18 14 35 7\n29 60 32 20 4 16 69 5 38 50 46 74 94 18 82 2 66 22 42 55 51 91 67 75 35 95 43 79 3 27", "90 25\n26 55 30 35 20 15 26 6 1 41 81 76 46 57 17 12 67 77 27 47 62 8 43 63 3 48 19\n9 10 16 21 7 17 12 13 19 9", "66 66\n26 0 54 6 37 43 13 25 38 2 32 56 20 50 39 27 51 9 64 4 16 17 65 11 5 47 23\n15 6 24 43 49 25 20 14 63 27 3 58 52 53 11 41", "24 60\n4 0 2 19 23\n15 12 24 49 2 14 3 52 28 5 6 19 32 33 34 35", "80 40\n27 0 41 44 45 6 47 8 10 52 13 14 16 17 18 59 21 62 23 64 26 68 29 32 75 37 78 39\n13 2 3 9 11 15 20 25 27 30 31 33 34 36", "66 99\n23 33 35 36 38 8 10 44 11 45 46 47 50 19 54 22 55 23 58 59 27 61 30 65\n32 33 67 69 4 70 38 6 39 7 74 42 9 43 12 13 14 15 81 82 84 85 20 87 89 90 24 58 59 27 95 97 31", "100 40\n25 61 42 2 3 25 46 66 68 69 49 9 10 50 91 72 92 33 73 53 14 15 55 96 36 39\n12 0 22 3 23 4 6 27 11 35 37 38 39", "90 30\n27 15 16 2 32 78 49 64 65 50 6 66 21 22 82 23 39 84 85 10 86 56 27 87 13 58 44 74\n7 19 4 20 24 25 12 27", "75 75\n33 30 74 57 23 19 42 71 11 44 29 58 43 48 61 63 13 27 50 17 18 70 64 39 12 32 36 10 40 51 49 1 54 73\n8 43 23 0 7 63 47 74 28", "98 98\n23 6 81 90 28 38 51 23 69 13 95 15 16 88 58 10 26 42 44 54 92 27 45 39\n18 20 70 38 82 72 61 37 78 74 23 15 56 59 35 93 64 28 57", "75 75\n19 48 3 5 67 23 8 70 45 63 36 38 56 15 10 37 52 11 9 27\n21 13 9 45 28 59 36 30 43 5 38 27 40 50 17 41 71 8 51 63 1 33", "3 20\n0\n1 19", "41 2\n1 33\n0", "50 49\n1 49\n0", "3 50\n0\n1 49", "100 100\n50 0 1 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\n49 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", "100 100\n50 0 1 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\n50 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", "91 98\n78 0 1 2 3 4 5 7 8 9 10 11 12 14 15 16 17 18 19 21 22 23 24 25 26 28 29 30 31 32 33 35 36 37 38 39 40 42 43 44 45 46 47 49 50 51 52 53 54 56 57 58 59 60 61 63 64 65 66 67 68 70 71 72 73 74 75 77 78 79 80 81 82 84 85 86 87 88 89\n84 0 1 2 3 4 5 7 8 9 10 11 12 14 15 16 17 18 19 21 22 23 24 25 26 28 29 30 31 32 33 35 36 37 38 39 40 42 43 44 45 46 47 49 50 51 52 53 54 56 57 58 59 60 61 63 64 65 66 67 68 70 71 72 73 74 75 77 78 79 80 81 82 84 85 86 87 88 89 91 92 93 94 95 96", "99 84\n66 0 2 3 5 6 8 9 11 12 14 15 17 18 20 21 23 24 26 27 29 30 32 33 35 36 38 39 41 42 44 45 47 48 50 51 53 54 56 57 59 60 62 63 65 66 68 69 71 72 74 75 77 78 80 81 83 84 86 87 89 90 92 93 95 96 98\n56 0 2 3 5 6 8 9 11 12 14 15 17 18 20 21 23 24 26 27 29 30 32 33 35 36 38 39 41 42 44 45 47 48 50 51 53 54 56 57 59 60 62 63 65 66 68 69 71 72 74 75 77 78 80 81 83", "75 90\n60 0 2 3 4 5 7 8 9 10 12 13 14 15 17 18 19 20 22 23 24 25 27 28 29 30 32 33 34 35 37 38 39 40 42 43 44 45 47 48 49 50 52 53 54 55 57 58 59 60 62 63 64 65 67 68 69 70 72 73 74\n72 0 2 3 4 5 7 8 9 10 12 13 14 15 17 18 19 20 22 23 24 25 27 28 29 30 32 33 34 35 37 38 39 40 42 43 44 45 47 48 49 50 52 53 54 55 57 58 59 60 62 63 64 65 67 68 69 70 72 73 74 75 77 78 79 80 82 83 84 85 87 88 89", "5 7\n1 0\n1 0", "100 1\n1 99\n0", "4 1\n1 3\n0", "4 5\n3 0 1 3\n4 0 1 3 4", "100 99\n1 99\n0", "2 3\n1 0\n2 0 2"], "outputs": ["Yes", "No", "Yes", "Yes", "No", "No", "No", "Yes", "Yes", "Yes", "Yes", "No", "No", "No", "No", "No", "No", "No", "No", "No", "No", "No", "No", "No", "Yes", "No", "No", "Yes", "Yes", "Yes", "Yes", "No", "Yes", "Yes", "Yes", "Yes", "No", "No", "No", "No", "Yes", "Yes", "Yes", "Yes", "No", "Yes", "No", "No", "No", "Yes", "Yes", "Yes", "Yes", "Yes", "Yes"]} | UNKNOWN | [
"PYTHON3"
] | CODEFORCES | 28 | codeforces |
|
4c06a1bab8e7d9a2924976ed686dc364 | Find Amir | A few years ago Sajjad left his school and register to another one due to security reasons. Now he wishes to find Amir, one of his schoolmates and good friends.
There are *n* schools numerated from 1 to *n*. One can travel between each pair of them, to do so, he needs to buy a ticket. The ticker between schools *i* and *j* costs and can be used multiple times. Help Sajjad to find the minimum cost he needs to pay for tickets to visit all schools. He can start and finish in any school.
The first line contains a single integer *n* (1<=≤<=*n*<=≤<=105) — the number of schools.
Print single integer: the minimum cost of tickets needed to visit all schools.
Sample Input
2
10
Sample Output
0
4
| {"inputs": ["2", "10", "43670", "4217", "17879", "31809", "40873", "77859", "53022", "79227", "100000", "82801", "5188", "86539", "12802", "20289", "32866", "33377", "31775", "60397", "100000", "99999", "99998", "99997", "99996", "1", "2", "3", "4", "1", "3"], "outputs": ["0", "4", "21834", "2108", "8939", "15904", "20436", "38929", "26510", "39613", "49999", "41400", "2593", "43269", "6400", "10144", "16432", "16688", "15887", "30198", "49999", "49999", "49998", "49998", "49997", "0", "0", "1", "1", "0", "1"]} | UNKNOWN | [
"PYTHON3"
] | CODEFORCES | 170 | codeforces |
|
4c0d2851e8af707dd834cb7304166c2a | Young Physicist | A guy named Vasya attends the final grade of a high school. One day Vasya decided to watch a match of his favorite hockey team. And, as the boy loves hockey very much, even more than physics, he forgot to do the homework. Specifically, he forgot to complete his physics tasks. Next day the teacher got very angry at Vasya and decided to teach him a lesson. He gave the lazy student a seemingly easy task: You are given an idle body in space and the forces that affect it. The body can be considered as a material point with coordinates (0; 0; 0). Vasya had only to answer whether it is in equilibrium. "Piece of cake" — thought Vasya, we need only to check if the sum of all vectors is equal to 0. So, Vasya began to solve the problem. But later it turned out that there can be lots and lots of these forces, and Vasya can not cope without your help. Help him. Write a program that determines whether a body is idle or is moving by the given vectors of forces.
The first line contains a positive integer *n* (1<=≤<=*n*<=≤<=100), then follow *n* lines containing three integers each: the *x**i* coordinate, the *y**i* coordinate and the *z**i* coordinate of the force vector, applied to the body (<=-<=100<=≤<=*x**i*,<=*y**i*,<=*z**i*<=≤<=100).
Print the word "YES" if the body is in equilibrium, or the word "NO" if it is not.
Sample Input
3
4 1 7
-2 4 -1
1 -5 -3
3
3 -1 7
-5 2 -4
2 -1 -3
Sample Output
NOYES | {"inputs": ["3\n4 1 7\n-2 4 -1\n1 -5 -3", "3\n3 -1 7\n-5 2 -4\n2 -1 -3", "10\n21 32 -46\n43 -35 21\n42 2 -50\n22 40 20\n-27 -9 38\n-4 1 1\n-40 6 -31\n-13 -2 34\n-21 34 -12\n-32 -29 41", "10\n25 -33 43\n-27 -42 28\n-35 -20 19\n41 -42 -1\n49 -39 -4\n-49 -22 7\n-19 29 41\n8 -27 -43\n8 34 9\n-11 -3 33", "10\n-6 21 18\n20 -11 -8\n37 -11 41\n-5 8 33\n29 23 32\n30 -33 -11\n39 -49 -36\n28 34 -49\n22 29 -34\n-18 -6 7", "10\n47 -2 -27\n0 26 -14\n5 -12 33\n2 18 3\n45 -30 -49\n4 -18 8\n-46 -44 -41\n-22 -10 -40\n-35 -21 26\n33 20 38", "13\n-3 -36 -46\n-11 -50 37\n42 -11 -15\n9 42 44\n-29 -12 24\n3 9 -40\n-35 13 50\n14 43 18\n-13 8 24\n-48 -15 10\n50 9 -50\n21 0 -50\n0 0 -6", "14\n43 23 17\n4 17 44\n5 -5 -16\n-43 -7 -6\n47 -48 12\n50 47 -45\n2 14 43\n37 -30 15\n4 -17 -11\n17 9 -45\n-50 -3 -8\n-50 0 0\n-50 0 0\n-16 0 0", "13\n29 49 -11\n38 -11 -20\n25 1 -40\n-11 28 11\n23 -19 1\n45 -41 -17\n-3 0 -19\n-13 -33 49\n-30 0 28\n34 17 45\n-50 9 -27\n-50 0 0\n-37 0 0", "12\n3 28 -35\n-32 -44 -17\n9 -25 -6\n-42 -22 20\n-19 15 38\n-21 38 48\n-1 -37 -28\n-10 -13 -50\n-5 21 29\n34 28 50\n50 11 -49\n34 0 0", "37\n-64 -79 26\n-22 59 93\n-5 39 -12\n77 -9 76\n55 -86 57\n83 100 -97\n-70 94 84\n-14 46 -94\n26 72 35\n14 78 -62\n17 82 92\n-57 11 91\n23 15 92\n-80 -1 1\n12 39 18\n-23 -99 -75\n-34 50 19\n-39 84 -7\n45 -30 -39\n-60 49 37\n45 -16 -72\n33 -51 -56\n-48 28 5\n97 91 88\n45 -82 -11\n-21 -15 -90\n-53 73 -26\n-74 85 -90\n-40 23 38\n100 -13 49\n32 -100 -100\n0 -100 -70\n0 -100 0\n0 -100 0\n0 -100 0\n0 -100 0\n0 -37 0", "4\n68 3 100\n68 21 -100\n-100 -24 0\n-36 0 0", "33\n-1 -46 -12\n45 -16 -21\n-11 45 -21\n-60 -42 -93\n-22 -45 93\n37 96 85\n-76 26 83\n-4 9 55\n7 -52 -9\n66 8 -85\n-100 -54 11\n-29 59 74\n-24 12 2\n-56 81 85\n-92 69 -52\n-26 -97 91\n54 59 -51\n58 21 -57\n7 68 56\n-47 -20 -51\n-59 77 -13\n-85 27 91\n79 60 -56\n66 -80 5\n21 -99 42\n-31 -29 98\n66 93 76\n-49 45 61\n100 -100 -100\n100 -100 -100\n66 -75 -100\n0 0 -100\n0 0 -87", "3\n1 2 3\n3 2 1\n0 0 0", "2\n5 -23 12\n0 0 0", "1\n0 0 0", "1\n1 -2 0", "2\n-23 77 -86\n23 -77 86", "26\n86 7 20\n-57 -64 39\n-45 6 -93\n-44 -21 100\n-11 -49 21\n73 -71 -80\n-2 -89 56\n-65 -2 7\n5 14 84\n57 41 13\n-12 69 54\n40 -25 27\n-17 -59 0\n64 -91 -30\n-53 9 42\n-54 -8 14\n-35 82 27\n-48 -59 -80\n88 70 79\n94 57 97\n44 63 25\n84 -90 -40\n-100 100 -100\n-92 100 -100\n0 10 -100\n0 0 -82", "42\n11 27 92\n-18 -56 -57\n1 71 81\n33 -92 30\n82 83 49\n-87 -61 -1\n-49 45 49\n73 26 15\n-22 22 -77\n29 -93 87\n-68 44 -90\n-4 -84 20\n85 67 -6\n-39 26 77\n-28 -64 20\n65 -97 24\n-72 -39 51\n35 -75 -91\n39 -44 -8\n-25 -27 -57\n91 8 -46\n-98 -94 56\n94 -60 59\n-9 -95 18\n-53 -37 98\n-8 -94 -84\n-52 55 60\n15 -14 37\n65 -43 -25\n94 12 66\n-8 -19 -83\n29 81 -78\n-58 57 33\n24 86 -84\n-53 32 -88\n-14 7 3\n89 97 -53\n-5 -28 -91\n-100 100 -6\n-84 100 0\n0 100 0\n0 70 0", "3\n96 49 -12\n2 -66 28\n-98 17 -16", "5\n70 -46 86\n-100 94 24\n-27 63 -63\n57 -100 -47\n0 -11 0", "18\n-86 -28 70\n-31 -89 42\n31 -48 -55\n95 -17 -43\n24 -95 -85\n-21 -14 31\n68 -18 81\n13 31 60\n-15 28 99\n-42 15 9\n28 -61 -62\n-16 71 29\n-28 75 -48\n-77 -67 36\n-100 83 89\n100 100 -100\n57 34 -100\n0 0 -53", "44\n52 -54 -29\n-82 -5 -94\n-54 43 43\n91 16 71\n7 80 -91\n3 15 29\n-99 -6 -77\n-3 -77 -64\n73 67 34\n25 -10 -18\n-29 91 63\n-72 86 -16\n-68 85 -81\n-3 36 44\n-74 -14 -80\n34 -96 -97\n-76 -78 -33\n-24 44 -58\n98 12 77\n95 -63 -6\n-51 3 -90\n-92 -10 72\n7 3 -68\n57 -53 71\n29 57 -48\n35 -60 10\n79 -70 -61\n-20 77 55\n-86 -15 -35\n84 -88 -18\n100 -42 77\n-20 46 8\n-41 -43 -65\n38 -98 -23\n-100 65 45\n-7 -91 -63\n46 88 -85\n48 59 100\n0 0 100\n0 0 100\n0 0 100\n0 0 100\n0 0 100\n0 0 1", "18\n-14 -64 -91\n-8 -66 -86\n-23 92 -40\n6 -3 -53\n57 41 78\n-79 42 -22\n-88 -17 45\n4 -45 44\n83 -18 -25\n34 86 -92\n75 -30 12\n44 99 11\n-67 -13 72\n22 83 -56\n-37 71 72\n-9 -100 100\n0 -100 31\n0 -58 0", "23\n-70 37 78\n42 84 6\n28 -94 -24\n-49 76 95\n-67 18 84\n-53 78 -5\n65 -63 -64\n-66 -64 -69\n81 -93 95\n10 52 -79\n-89 -61 -64\n-64 -47 43\n-81 -35 55\n80 82 73\n-60 -81 -18\n49 -10 -19\n-58 70 12\n-24 -15 -93\n98 -93 -54\n-28 -75 11\n100 100 -63\n100 100 0\n56 34 0", "3\n0 2 -2\n1 -1 3\n-3 0 0"], "outputs": ["NO", "YES", "NO", "NO", "NO", "NO", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "NO", "NO", "YES", "NO", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "NO"]} | UNKNOWN | [
"PYTHON3"
] | CODEFORCES | 3,146 | codeforces |
|
4c5d9381944990813e0c5b4985ad0cc7 | Table Tennis | *n* people are standing in a line to play table tennis. At first, the first two players in the line play a game. Then the loser goes to the end of the line, and the winner plays with the next person from the line, and so on. They play until someone wins *k* games in a row. This player becomes the winner.
For each of the participants, you know the power to play table tennis, and for all players these values are different. In a game the player with greater power always wins. Determine who will be the winner.
The first line contains two integers: *n* and *k* (2<=≤<=*n*<=≤<=500, 2<=≤<=*k*<=≤<=1012) — the number of people and the number of wins.
The second line contains *n* integers *a*1,<=*a*2,<=...,<=*a**n* (1<=≤<=*a**i*<=≤<=*n*) — powers of the player. It's guaranteed that this line contains a valid permutation, i.e. all *a**i* are distinct.
Output a single integer — power of the winner.
Sample Input
2 2
1 2
4 2
3 1 2 4
6 2
6 5 3 1 2 4
2 10000000000
2 1
Sample Output
2 3 6 2
| {"inputs": ["2 2\n1 2", "4 2\n3 1 2 4", "6 2\n6 5 3 1 2 4", "2 10000000000\n2 1", "4 4\n1 3 4 2", "2 2147483648\n2 1", "3 2\n1 3 2", "3 3\n1 2 3", "5 2\n2 1 3 4 5", "10 2\n7 10 5 8 9 3 4 6 1 2", "100 2\n62 70 29 14 12 87 94 78 39 92 84 91 61 49 60 33 69 37 19 82 42 8 45 97 81 43 54 67 1 22 77 58 65 17 18 28 25 57 16 90 40 13 4 21 68 35 15 76 73 93 56 95 79 47 74 75 30 71 66 99 41 24 88 83 5 6 31 96 38 80 27 46 51 53 2 86 32 9 20 100 26 36 63 7 52 55 23 3 50 59 48 89 85 44 34 64 10 72 11 98", "4 10\n2 1 3 4", "10 2\n1 2 3 4 5 6 7 8 9 10", "10 2\n10 9 8 7 6 5 4 3 2 1", "4 1000000000000\n3 4 1 2", "100 10\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", "100 50\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", "2 1000000000000\n1 2", "5 2\n1 4 3 5 2", "5 2\n1 3 2 4 5", "4 1000000000000\n3 1 2 4", "4 2\n1 3 2 4", "10 3\n8 1 9 2 3 10 4 5 6 7", "5 2\n2 1 4 3 5", "3 4294967297\n2 1 3", "4 4294967297\n3 2 1 4", "5 4294967298\n3 2 1 4 5", "10 4\n5 4 7 1 2 9 3 6 8 10", "11 21474836489\n10 1 2 3 4 5 6 7 8 9 11"], "outputs": ["2 ", "3 ", "6 ", "2", "4 ", "2", "3 ", "3 ", "5 ", "10 ", "70 ", "4", "10 ", "10 ", "4", "91 ", "100 ", "2", "4 ", "3 ", "4", "3 ", "9 ", "4 ", "3", "4", "5", "9 ", "11"]} | UNKNOWN | [
"PYTHON3"
] | CODEFORCES | 206 | codeforces |
|
4c5e4af36646b7431328b73207d396aa | Diagonal Walking | Mikhail walks on a 2D plane. He can go either up or right. You are given a sequence of Mikhail's moves. He thinks that this sequence is too long and he wants to make it as short as possible.
In the given sequence moving up is described by character U and moving right is described by character R. Mikhail can replace any pair of consecutive moves RU or UR with a diagonal move (described as character D). After that, he can go on and do some other replacements, until there is no pair of consecutive moves RU or UR left.
Your problem is to print the minimum possible length of the sequence of moves after the replacements.
The first line of the input contains one integer *n* (1<=≤<=*n*<=≤<=100) — the length of the sequence. The second line contains the sequence consisting of *n* characters U and R.
Print the minimum possible length of the sequence of moves after all replacements are done.
Sample Input
5
RUURU
17
UUURRRRRUUURURUUU
Sample Output
3
13
| {"inputs": ["5\nRUURU", "17\nUUURRRRRUUURURUUU", "100\nUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU", "100\nRRURRUUUURURRRURRRRURRRRRRURRUURRRUUURUURURRURUURUURRUURUURRURURUUUUURUUUUUURRUUURRRURRURRRUURRUUUUR", "100\nUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUURUUUUUUUUUUUUUUUUUUUUU", "3\nRUR", "1\nR", "5\nRURUU", "1\nU", "2\nUR", "23\nUUUUUUUUUUUUUUUUUUUUUUU"], "outputs": ["3", "13", "100", "67", "99", "2", "1", "3", "1", "1", "23"]} | UNKNOWN | [
"PYTHON3"
] | CODEFORCES | 249 | codeforces |
|
4c628953952ca885e9bdfe1f8d432e5f | Points | You are given *N* points on a plane. Write a program which will find the sum of squares of distances between all pairs of points.
The first line of input contains one integer number *N* (1<=≤<=*N*<=≤<=100<=000) — the number of points. Each of the following *N* lines contain two integer numbers *X* and *Y* (<=-<=10<=000<=≤<=*X*,<=*Y*<=≤<=10<=000) — the coordinates of points. Two or more points may coincide.
The only line of output should contain the required sum of squares of distances between all pairs of points.
Sample Input
4
1 1
-1 -1
1 -1
-1 1
Sample Output
32
| {"inputs": ["4\n1 1\n-1 -1\n1 -1\n-1 1", "1\n6 3", "30\n-7 -12\n-2 5\n14 8\n9 17\n15 -18\n20 6\n20 8\n-13 12\n-4 -20\n-11 -16\n-6 16\n1 -9\n5 -12\n13 -17\n11 5\n8 -9\n-13 5\n19 -13\n-19 -8\n-14 10\n10 3\n-16 -8\n-17 16\n-14 -15\n5 1\n-13 -9\n13 17\n-14 -8\n2 5\n18 5"], "outputs": ["32", "0", "265705"]} | UNKNOWN | [
"PYTHON3"
] | CODEFORCES | 19 | codeforces |
|
4c6f3c4cf65608d51f3e8cb2edb582fa | Summarize to the Power of Two | A sequence $a_1, a_2, \dots, a_n$ is called good if, for each element $a_i$, there exists an element $a_j$ ($i \ne j$) such that $a_i+a_j$ is a power of two (that is, $2^d$ for some non-negative integer $d$).
For example, the following sequences are good:
- $[5, 3, 11]$ (for example, for $a_1=5$ we can choose $a_2=3$. Note that their sum is a power of two. Similarly, such an element can be found for $a_2$ and $a_3$), - $[1, 1, 1, 1023]$, - $[7, 39, 89, 25, 89]$, - $[]$.
Note that, by definition, an empty sequence (with a length of $0$) is good.
For example, the following sequences are not good:
- $[16]$ (for $a_1=16$, it is impossible to find another element $a_j$ such that their sum is a power of two), - $[4, 16]$ (for $a_1=4$, it is impossible to find another element $a_j$ such that their sum is a power of two), - $[1, 3, 2, 8, 8, 8]$ (for $a_3=2$, it is impossible to find another element $a_j$ such that their sum is a power of two).
You are given a sequence $a_1, a_2, \dots, a_n$. What is the minimum number of elements you need to remove to make it good? You can delete an arbitrary set of elements.
The first line contains the integer $n$ ($1 \le n \le 120000$) — the length of the given sequence.
The second line contains the sequence of integers $a_1, a_2, \dots, a_n$ ($1 \le a_i \le 10^9$).
Print the minimum number of elements needed to be removed from the given sequence in order to make it good. It is possible that you need to delete all $n$ elements, make it empty, and thus get a good sequence.
Sample Input
6
4 7 1 5 4 9
5
1 2 3 4 5
1
16
4
1 1 1 1023
Sample Output
1
2
1
0
| {"inputs": ["6\n4 7 1 5 4 9", "5\n1 2 3 4 5", "1\n16", "4\n1 1 1 1023", "10\n2 10 9 1 10 4 7 8 5 4", "2\n1 1", "2\n1 6", "6\n1 7 7 7 7 7", "3\n1 2 3", "3\n1 3 3", "2\n3 3", "2\n3 1", "3\n1 2 2", "2\n2 2", "2\n2 1", "3\n1 1 3", "3\n1 3 2", "3\n1 1 2", "1\n1"], "outputs": ["1", "2", "1", "0", "5", "0", "2", "0", "1", "0", "2", "0", "1", "0", "2", "0", "1", "1", "1"]} | UNKNOWN | [
"PYTHON3"
] | CODEFORCES | 25 | codeforces |
|
4c73f2082dd47092f72be6e744d64e2a | Pursuit For Artifacts | Johnny is playing a well-known computer game. The game are in some country, where the player can freely travel, pass quests and gain an experience.
In that country there are *n* islands and *m* bridges between them, so you can travel from any island to any other. In the middle of some bridges are lying ancient powerful artifacts. Johnny is not interested in artifacts, but he can get some money by selling some artifact.
At the start Johnny is in the island *a* and the artifact-dealer is in the island *b* (possibly they are on the same island). Johnny wants to find some artifact, come to the dealer and sell it. The only difficulty is that bridges are too old and destroying right after passing over them. Johnnie's character can't swim, fly and teleport, so the problem became too difficult.
Note that Johnny can't pass the half of the bridge, collect the artifact and return to the same island.
Determine if Johnny can find some artifact and sell it.
The first line contains two integers *n* and *m* (1<=≤<=*n*<=≤<=3·105, 0<=≤<=*m*<=≤<=3·105) — the number of islands and bridges in the game.
Each of the next *m* lines contains the description of the bridge — three integers *x**i*, *y**i*, *z**i* (1<=≤<=*x**i*,<=*y**i*<=≤<=*n*, *x**i*<=≠<=*y**i*, 0<=≤<=*z**i*<=≤<=1), where *x**i* and *y**i* are the islands connected by the *i*-th bridge, *z**i* equals to one if that bridge contains an artifact and to zero otherwise. There are no more than one bridge between any pair of islands. It is guaranteed that it's possible to travel between any pair of islands.
The last line contains two integers *a* and *b* (1<=≤<=*a*,<=*b*<=≤<=*n*) — the islands where are Johnny and the artifact-dealer respectively.
If Johnny can find some artifact and sell it print the only word "YES" (without quotes). Otherwise print the word "NO" (without quotes).
Sample Input
6 7
1 2 0
2 3 0
3 1 0
3 4 1
4 5 0
5 6 0
6 4 0
1 6
5 4
1 2 0
2 3 0
3 4 0
2 5 1
1 4
5 6
1 2 0
2 3 0
3 1 0
3 4 0
4 5 1
5 3 0
1 2
Sample Output
YES
NO
YES
| {"inputs": ["6 7\n1 2 0\n2 3 0\n3 1 0\n3 4 1\n4 5 0\n5 6 0\n6 4 0\n1 6", "5 4\n1 2 0\n2 3 0\n3 4 0\n2 5 1\n1 4", "5 6\n1 2 0\n2 3 0\n3 1 0\n3 4 0\n4 5 1\n5 3 0\n1 2", "1 0\n1 1", "2 1\n1 2 1\n1 2", "2 1\n1 2 1\n1 1", "3 2\n1 2 1\n2 3 0\n3 1", "3 2\n1 2 1\n2 3 0\n2 3", "3 3\n1 2 0\n2 3 0\n3 1 1\n2 2", "4 4\n1 2 0\n2 3 0\n3 4 1\n4 2 0\n1 2", "4 4\n1 2 1\n2 3 0\n3 4 0\n4 2 0\n2 3", "5 5\n1 2 0\n2 3 0\n3 4 1\n4 2 0\n2 5 0\n1 5", "6 6\n1 2 0\n2 3 0\n3 4 0\n2 5 0\n5 4 1\n4 6 0\n1 6", "9 11\n1 2 0\n2 3 0\n3 1 0\n3 4 0\n4 5 0\n5 6 1\n6 4 0\n6 7 0\n7 8 0\n8 9 0\n9 7 0\n1 9", "9 11\n1 2 0\n2 3 1\n3 1 0\n3 4 0\n4 5 0\n5 6 0\n6 4 0\n6 7 0\n7 8 0\n8 9 0\n9 7 0\n1 9", "9 11\n1 2 0\n2 3 0\n3 1 0\n3 4 0\n4 5 0\n5 6 0\n6 4 0\n6 7 1\n7 8 0\n8 9 0\n9 7 0\n1 9", "9 11\n1 2 0\n2 3 0\n3 1 0\n3 4 0\n4 5 0\n5 6 1\n6 4 0\n6 7 0\n7 8 0\n8 9 0\n9 7 0\n4 5", "9 11\n1 2 0\n2 3 0\n3 1 1\n3 4 0\n4 5 0\n5 6 0\n6 4 0\n6 7 0\n7 8 0\n8 9 1\n9 7 0\n4 5", "12 11\n1 10 0\n5 10 0\n8 10 0\n6 5 0\n9 10 1\n3 6 1\n12 6 0\n4 8 0\n7 9 1\n2 4 1\n11 9 1\n7 2", "12 15\n5 1 0\n11 1 1\n4 11 0\n3 4 0\n2 3 1\n8 4 0\n12 11 0\n6 12 0\n10 6 0\n7 3 0\n9 4 0\n7 8 0\n11 10 0\n10 12 0\n1 6 0\n2 8", "12 17\n8 3 0\n11 8 0\n4 8 0\n6 11 1\n12 11 0\n7 8 0\n10 11 0\n5 4 0\n9 10 0\n2 6 0\n1 4 0\n10 12 0\n9 11 0\n12 1 0\n7 1 0\n9 12 0\n10 8 0\n2 8", "8 7\n3 7 0\n5 3 0\n2 5 0\n1 3 0\n8 3 0\n6 5 0\n4 6 0\n5 8", "33 58\n17 11 0\n9 17 0\n14 9 0\n3 9 0\n26 14 0\n5 14 0\n10 11 0\n23 11 0\n30 9 0\n18 3 0\n25 17 0\n21 5 0\n13 11 0\n20 14 0\n32 23 0\n29 21 0\n16 21 0\n33 20 0\n1 32 0\n15 16 0\n22 13 0\n12 17 0\n8 32 0\n7 11 0\n6 29 0\n2 21 0\n19 3 0\n4 6 0\n27 8 0\n24 26 0\n28 27 0\n31 4 0\n20 23 0\n4 26 0\n33 25 0\n4 20 0\n32 7 0\n24 12 0\n13 17 0\n33 3 0\n22 15 0\n32 17 0\n11 30 0\n19 18 0\n14 22 0\n13 26 0\n6 25 0\n6 15 0\n15 11 0\n20 12 0\n14 11 0\n11 19 0\n19 21 0\n16 28 0\n22 19 0\n21 14 0\n14 27 0\n11 9 0\n3 7"], "outputs": ["YES", "NO", "YES", "NO", "YES", "NO", "YES", "NO", "YES", "YES", "NO", "YES", "YES", "YES", "YES", "YES", "YES", "NO", "YES", "YES", "YES", "NO", "NO"]} | UNKNOWN | [
"PYTHON3"
] | CODEFORCES | 1 | codeforces |
|
4c89c41cf6f52dd1d44ab9210465e0d0 | Codeforces World Finals | 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.
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.
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.
Sample Input
01.01.98
01.01.80
20.10.20
10.02.30
28.02.74
28.02.64
Sample Output
YES
NO
NO
| {"inputs": ["01.01.98\n01.01.80", "20.10.20\n10.02.30", "28.02.74\n28.02.64", "05.05.25\n06.02.71", "19.11.54\n29.11.53", "01.06.84\n24.04.87", "30.06.43\n14.09.27", "09.05.55\n25.09.42", "14.05.21\n02.01.88", "27.12.51\n26.06.22", "12.10.81\n18.11.04", "26.04.11\n11.07.38", "17.01.94\n17.03.58", "15.01.93\n23.04.97", "14.04.92\n27.05.35", "13.08.91\n01.05.26", "14.08.89\n05.06.65", "13.11.88\n09.07.03", "12.11.87\n14.08.42", "11.03.86\n20.08.81", "10.02.37\n25.09.71", "11.06.36\n24.01.25", "02.05.90\n08.03.50", "15.01.15\n01.08.58", "31.10.41\n27.12.13", "14.06.18\n21.04.20", "15.12.62\n17.12.21", "13.03.69\n09.01.83", "26.11.46\n03.05.90", "11.12.72\n29.06.97", "25.08.49\n22.10.05", "08.04.74\n18.03.60", "03.11.79\n10.09.61", "29.03.20\n12.01.09", "13.09.67\n07.09.48", "23.05.53\n31.10.34", "08.07.20\n27.01.01", "10.05.64\n10.05.45", "19.09.93\n17.05.74", "14.06.61\n01.11.42", "29.02.80\n29.02.60", "21.02.59\n24.04.40", "05.04.99\n19.08.80", "02.06.59\n30.01.40", "23.09.93\n12.11.74", "09.08.65\n21.06.46", "29.09.35\n21.07.17", "30.06.58\n21.05.39", "06.08.91\n05.12.73", "08.07.88\n15.01.69", "07.10.55\n13.05.36", "22.03.79\n04.03.61", "30.06.76\n03.10.57", "03.03.70\n18.01.51", "08.07.79\n25.08.60", "01.09.92\n10.05.74", "05.04.73\n28.09.54", "30.08.83\n13.04.65", "08.04.64\n27.01.45", "10.11.95\n09.04.77", "19.11.36\n17.02.21", "28.02.20\n11.01.29", "01.01.35\n16.02.29", "01.01.47\n28.02.29", "06.08.34\n16.02.29", "30.09.46\n24.02.29", "01.03.19\n01.02.29", "30.08.32\n02.02.29", "30.10.46\n25.02.29", "06.03.20\n06.02.03", "01.05.19\n08.01.04", "31.05.19\n12.01.04", "31.03.50\n02.11.32", "03.12.98\n11.12.80", "04.02.19\n01.03.02", "01.05.21\n03.11.04", "31.05.20\n02.12.04", "31.03.36\n10.11.31", "01.05.19\n03.01.28", "30.12.68\n31.12.50", "30.08.55\n31.08.37", "30.08.41\n23.08.31"], "outputs": ["YES", "NO", "NO", "NO", "NO", "NO", "YES", "NO", "NO", "YES", "YES", "NO", "YES", "NO", "YES", "YES", "YES", "YES", "YES", "NO", "NO", "NO", "YES", "NO", "YES", "NO", "YES", "NO", "NO", "NO", "YES", "NO", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "NO", "NO", "NO", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "NO", "NO", "NO"]} | UNKNOWN | [
"PYTHON3"
] | CODEFORCES | 9 | codeforces |
|
4c9a939d342fd4c12a76fa302d4e427b | Sorting by Subsequences | You are given a sequence *a*1,<=*a*2,<=...,<=*a**n* consisting of different integers. It is required to split this sequence into the maximum number of subsequences such that after sorting integers in each of them in increasing order, the total sequence also will be sorted in increasing order.
Sorting integers in a subsequence is a process such that the numbers included in a subsequence are ordered in increasing order, and the numbers which are not included in a subsequence don't change their places.
Every element of the sequence must appear in exactly one subsequence.
The first line of input data contains integer *n* (1<=≤<=*n*<=≤<=105) — the length of the sequence.
The second line of input data contains *n* different integers *a*1,<=*a*2,<=...,<=*a**n* (<=-<=109<=≤<=*a**i*<=≤<=109) — the elements of the sequence. It is guaranteed that all elements of the sequence are distinct.
In the first line print the maximum number of subsequences *k*, which the original sequence can be split into while fulfilling the requirements.
In the next *k* lines print the description of subsequences in the following format: the number of elements in subsequence *c**i* (0<=<<=*c**i*<=≤<=*n*), then *c**i* integers *l*1,<=*l*2,<=...,<=*l**c**i* (1<=≤<=*l**j*<=≤<=*n*) — indices of these elements in the original sequence.
Indices could be printed in any order. Every index from 1 to *n* must appear in output exactly once.
If there are several possible answers, print any of them.
Sample Input
6
3 2 1 6 5 4
6
83 -75 -49 11 37 62
Sample Output
4
2 1 3
1 2
2 4 6
1 5
1
6 1 2 3 4 5 6
| {"inputs": ["6\n3 2 1 6 5 4", "6\n83 -75 -49 11 37 62", "1\n1", "2\n1 2", "2\n2 1", "3\n1 2 3", "3\n3 2 1", "3\n3 1 2", "10\n3 7 10 1 9 5 4 8 6 2", "20\n363756450 -204491568 95834122 -840249197 -49687658 470958158 -445130206 189801569 802780784 -790013317 -192321079 586260100 -751917965 -354684803 418379342 -253230108 193944314 712662868 853829789 735867677", "50\n39 7 45 25 31 26 50 11 19 37 8 16 22 33 14 6 12 46 49 48 29 27 41 15 34 24 3 13 20 47 9 36 5 43 40 21 2 38 35 42 23 28 1 32 10 17 30 18 44 4", "100\n39 77 67 25 81 26 50 11 73 95 86 16 90 33 14 79 12 100 68 64 60 27 41 15 34 24 3 61 83 47 57 65 99 43 40 21 94 72 82 85 23 71 76 32 10 17 30 18 44 59 35 89 6 63 7 69 62 70 4 29 92 87 31 48 36 28 45 97 93 98 56 38 58 80 8 1 74 91 53 55 54 51 96 5 42 52 9 22 78 88 75 13 66 2 37 20 49 19 84 46"], "outputs": ["4\n2 1 3\n1 2\n2 4 6\n1 5", "1\n6 1 2 3 4 5 6", "1\n1 1", "2\n1 1\n1 2", "1\n2 1 2", "3\n1 1\n1 2\n1 3", "2\n2 1 3\n1 2", "1\n3 1 2 3", "3\n6 1 4 7 2 10 3\n3 5 6 9\n1 8", "3\n7 1 4 7 2 10 3 13\n11 5 14 15 6 16 12 17 18 20 19 9\n2 8 11", "6\n20 1 43 34 25 4 50 7 2 37 10 45 3 27 22 13 28 42 40 35 39\n23 5 33 14 15 24 26 6 16 12 17 46 18 48 20 29 21 36 32 44 49 19 9 31\n2 8 11\n2 23 41\n2 30 47\n1 38", "6\n41 1 76 43 34 25 4 59 50 7 55 80 74 77 2 94 37 95 10 45 67 3 27 22 88 90 13 92 61 28 66 93 69 56 71 42 85 40 35 51 82 39\n45 5 84 99 33 14 15 24 26 6 53 79 16 12 17 46 100 18 48 64 20 96 83 29 60 21 36 65 32 44 49 97 68 19 98 70 58 73 9 87 62 57 31 63 54 81\n8 8 75 91 78 89 52 86 11\n2 23 41\n2 30 47\n2 38 72"]} | UNKNOWN | [
"PYTHON3"
] | CODEFORCES | 43 | codeforces |
|
4c9bcbb129bcfcac01bafaf31161d591 | ucyhf | qd ucyhf yi q fhycu dkcruh mxeiu huluhiu yi q tyvvuhudj fhycu dkcruh. oekh jqia yi je vydt jxu djx ucyhf.
jxu ydfkj sediyiji ev q iydwbu ydjuwuh *d* (1<=≤<=*d*<=≤<=11184) — jxu edu-rqiut ydtun ev jxu ucyhf je vydt.
ekjfkj q iydwbu dkcruh.
Sample Input
1
Sample Output
13
| {"inputs": ["1", "2", "3", "4", "5", "6", "7", "8", "9", "10", "8216", "119", "10618", "6692", "10962", "6848", "4859", "8653", "6826", "10526", "9819", "10844", "7779", "1340", "4020", "2279", "5581", "11107", "7397", "5273", "10476", "7161", "4168", "1438", "6327", "10107", "6399", "11182", "11183", "11184"], "outputs": ["13", "17", "31", "37", "71", "73", "79", "97", "107", "113", "768377", "3359", "975193", "399731", "990511", "706463", "323149", "787433", "705533", "971513", "939487", "984341", "748169", "91009", "190871", "122867", "353057", "997001", "731053", "340573", "969481", "720611", "196193", "93887", "384913", "953077", "388313", "999853", "999931", "999983"]} | UNKNOWN | [
"PYTHON3"
] | CODEFORCES | 11 | codeforces |
|
4cb7aba01159e7079d9d6d1b8549c5e8 | Elimination | The finalists of the "Russian Code Cup" competition in 2214 will be the participants who win in one of the elimination rounds.
The elimination rounds are divided into main and additional. Each of the main elimination rounds consists of *c* problems, the winners of the round are the first *n* people in the rating list. Each of the additional elimination rounds consists of *d* problems. The winner of the additional round is one person. Besides, *k* winners of the past finals are invited to the finals without elimination.
As a result of all elimination rounds at least *n*·*m* people should go to the finals. You need to organize elimination rounds in such a way, that at least *n*·*m* people go to the finals, and the total amount of used problems in all rounds is as small as possible.
The first line contains two integers *c* and *d* (1<=≤<=*c*,<=*d*<=≤<=100) — the number of problems in the main and additional rounds, correspondingly. The second line contains two integers *n* and *m* (1<=≤<=*n*,<=*m*<=≤<=100). Finally, the third line contains an integer *k* (1<=≤<=*k*<=≤<=100) — the number of the pre-chosen winners.
In the first line, print a single integer — the minimum number of problems the jury needs to prepare.
Sample Input
1 10
7 2
1
2 2
2 1
2
Sample Output
2
0
| {"inputs": ["1 10\n7 2\n1", "2 2\n2 1\n2", "8 9\n2 2\n3", "5 5\n8 8\n7", "1 8\n8 10\n8", "5 7\n9 1\n8", "35 28\n35 60\n44", "19 76\n91 91\n87", "20 38\n38 70\n58", "2 81\n3 39\n45", "7 63\n18 69\n30", "89 69\n57 38\n15", "3 30\n10 83\n57", "100 3\n93 23\n98", "2 78\n21 24\n88", "40 80\n4 31\n63", "1 48\n89 76\n24", "5 25\n13 76\n86", "23 86\n83 88\n62", "1 93\n76 40\n39", "53 93\n10 70\n9", "100 100\n100 100\n100", "10 100\n100 100\n99", "1 100\n99 100\n1", "10 2\n7 2\n3", "4 1\n5 3\n8", "2 2\n2 1\n20", "7 5\n1 1\n10", "4 5\n9 10\n100", "10 1\n1 2\n1", "16 6\n3 12\n7", "10 1\n1 100\n1", "2 1\n3 4\n2", "2 1\n1 1\n10", "100 1\n2 3\n1", "10 2\n1 11\n1", "10 10\n1 1\n100", "100 1\n50 100\n1", "10 1\n2 2\n3", "3 1\n9 10\n80", "100 1\n1 100\n1", "10 9\n10 10\n9", "1 1\n1 1\n99", "10 9\n1 1\n100", "4 1\n5 1\n10", "5 1\n6 3\n5", "10 1\n1 1\n10", "1 1\n1 1\n10"], "outputs": ["2", "0", "8", "40", "9", "5", "2065", "1729", "1380", "48", "476", "3382", "234", "2200", "40", "640", "76", "350", "2024", "40", "3710", "9900", "1000", "100", "18", "6", "0", "0", "0", "1", "156", "99", "7", "0", "5", "20", "0", "4999", "1", "4", "99", "99", "0", "0", "0", "11", "0", "0"]} | UNKNOWN | [
"PYTHON3"
] | CODEFORCES | 21 | codeforces |
|
4cc15ba1bf48baf470e3df7be87f7edc | none | Есть *n*-подъездный дом, в каждом подъезде по *m* этажей, и на каждом этаже каждого подъезда ровно *k* квартир. Таким образом, в доме всего *n*·*m*·*k* квартир. Они пронумерованы естественным образом от 1 до *n*·*m*·*k*, то есть первая квартира на первом этаже в первом подъезде имеет номер 1, первая квартира на втором этаже первого подъезда имеет номер *k*<=+<=1 и так далее. Особенность этого дома состоит в том, что он круглый. То есть если обходить его по часовой стрелке, то после подъезда номер 1 следует подъезд номер 2, затем подъезд номер 3 и так далее до подъезда номер *n*. После подъезда номер *n* снова идёт подъезд номер 1.
Эдвард живёт в квартире номер *a*, а Наташа — в квартире номер *b*. Переход на 1 этаж вверх или вниз по лестнице занимает 5 секунд, переход от двери подъезда к двери соседнего подъезда — 15 секунд, а переход в пределах одного этажа одного подъезда происходит мгновенно. Также в каждом подъезде дома есть лифт. Он устроен следующим образом: он всегда приезжает ровно через 10 секунд после вызова, а чтобы переместить пассажира на один этаж вверх или вниз, лифт тратит ровно 1 секунду. Посадка и высадка происходят мгновенно.
Помогите Эдварду найти минимальное время, за которое он сможет добраться до квартиры Наташи. Считайте, что Эдвард может выйти из подъезда только с первого этажа соответствующего подъезда (это происходит мгновенно). Если Эдвард стоит перед дверью какого-то подъезда, он может зайти в него и сразу окажется на первом этаже этого подъезда (это также происходит мгновенно). Эдвард может выбирать, в каком направлении идти вокруг дома.
В первой строке входных данных следуют три числа *n*, *m*, *k* (1<=≤<=*n*,<=*m*,<=*k*<=≤<=1000) — количество подъездов в доме, количество этажей в каждом подъезде и количество квартир на каждом этаже каждого подъезда соответственно.
Во второй строке входных данных записаны два числа *a* и *b* (1<=≤<=*a*,<=*b*<=≤<=*n*·*m*·*k*) — номера квартир, в которых живут Эдвард и Наташа, соответственно. Гарантируется, что эти номера различны.
Выведите единственное целое число — минимальное время (в секундах), за которое Эдвард сможет добраться от своей квартиры до квартиры Наташи.
Sample Input
4 10 5
200 6
3 1 5
7 2
Sample Output
39
15
| {"inputs": ["4 10 5\n200 6", "3 1 5\n7 2", "100 100 100\n1 1000000", "1000 1000 1000\n1 1000000000", "125 577 124\n7716799 6501425", "624 919 789\n436620192 451753897", "314 156 453\n9938757 14172410", "301 497 118\n11874825 13582548", "491 980 907\n253658701 421137262", "35 296 7\n70033 65728", "186 312 492\n19512588 5916903", "149 186 417\n11126072 11157575", "147 917 539\n55641190 66272443", "200 970 827\n113595903 145423943", "32 15 441\n163561 23326", "748 428 661\n136899492 11286206", "169 329 585\n30712888 19040968", "885 743 317\n191981621 16917729", "245 168 720\n24072381 125846", "593 174 843\n72930566 9954376", "41 189 839\n6489169 411125", "437 727 320\n93935485 28179924", "722 42 684\n18861511 1741045", "324 584 915\n61572963 155302434", "356 444 397\n1066682 58120717", "266 675 472\n11637902 74714734", "841 727 726\n101540521 305197765", "828 68 391\n3563177 21665321", "666 140 721\n30509638 63426599", "151 489 61\n2561086 4227874", "713 882 468\n5456682 122694685", "676 53 690\n1197227 20721162", "618 373 56\n531564 11056643", "727 645 804\n101269988 374485315", "504 982 254\n101193488 5004310", "872 437 360\n5030750 15975571", "448 297 806\n60062303 9056580", "165 198 834\n16752490 5105535", "816 145 656\n32092038 5951215", "28 883 178\n2217424 1296514", "24 644 653\n1326557 3894568", "717 887 838\n46183300 63974260", "101 315 916\n1624396 1651649", "604 743 433\n78480401 16837572", "100 100 100\n1 10000", "100 100 100\n1000000 990001", "1 1 2\n1 2", "34 34 34\n20000 20001", "139 252 888\n24732218 24830663", "859 96 634\n26337024 26313792", "987 237 891\n41648697 41743430", "411 81 149\n4799008 4796779", "539 221 895\n18072378 18071555", "259 770 448\n19378646 19320867", "387 422 898\n89303312 89285292", "515 563 451\n12182093 12047399", "939 407 197\n42361632 42370846", "518 518 71\n3540577 3556866", "100 1 1\n55 1", "1000 1000 1000\n1 10000000", "1000 1000 1000\n1000000000 990000001", "340 340 340\n200000 200001", "1000 1 1\n556 1", "2 3 4\n1 2", "2 3 4\n1 3", "2 3 4\n1 4", "2 3 4\n1 5", "2 3 4\n1 6", "2 3 4\n1 7", "2 3 4\n1 8", "2 3 4\n7 8", "2 3 4\n7 9", "2 3 4\n7 10", "2 3 4\n7 11", "2 3 4\n7 12", "2 3 4\n11 12", "2 3 4\n12 13", "2 3 4\n12 14", "2 3 4\n12 24", "1000 1000 1000\n600400021 600400051", "1 2 4\n7 8", "1 1000 1\n42 43", "10 10 1\n2 3", "1 3 1\n2 3", "1 9 1\n6 9", "4 10 5\n6 7", "1 10 10\n40 80", "1 5 1\n5 4", "1 1000 1\n42 228", "4 10 5\n200 199", "1 9 1\n6 7", "2 5 1\n10 9", "1 5 1\n1 5", "1 5 1\n2 5", "3 3 2\n3 5", "1 5 1\n4 5", "1 4 1\n2 4", "1 9 1\n3 6"], "outputs": ["39", "15", "124", "1024", "1268", "509", "1104", "994", "3985", "499", "1560", "85", "952", "1484", "202", "5347", "1430", "2825", "726", "2650", "351", "3007", "1958", "2756", "860", "1739", "6264", "2288", "4995", "1640", "4687", "2221", "2020", "3289", "2556", "1736", "3730", "1354", "4281", "424", "377", "556", "40", "3833", "109", "109", "0", "0", "121", "47", "117", "25", "5", "139", "30", "309", "57", "239", "690", "1144", "1144", "0", "6675", "0", "0", "0", "5", "5", "5", "5", "0", "5", "5", "5", "5", "0", "25", "25", "35", "0", "0", "5", "5", "5", "13", "0", "14", "5", "196", "0", "5", "5", "14", "13", "5", "5", "10", "13"]} | UNKNOWN | [
"PYTHON3"
] | CODEFORCES | 9 | codeforces |
|
4cc989015af2251b0ec9feb79fcb0189 | The Union of k-Segments | You are given *n* segments on the coordinate axis Ox and the number *k*. The point is satisfied if it belongs to at least *k* segments. Find the smallest (by the number of segments) set of segments on the coordinate axis Ox which contains all satisfied points and no others.
The first line contains two integers *n* and *k* (1<=≤<=*k*<=≤<=*n*<=≤<=106) — the number of segments and the value of *k*.
The next *n* lines contain two integers *l**i*,<=*r**i* (<=-<=109<=≤<=*l**i*<=≤<=*r**i*<=≤<=109) each — the endpoints of the *i*-th segment. The segments can degenerate and intersect each other. The segments are given in arbitrary order.
First line contains integer *m* — the smallest number of segments.
Next *m* lines contain two integers *a**j*,<=*b**j* (*a**j*<=≤<=*b**j*) — the ends of *j*-th segment in the answer. The segments should be listed in the order from left to right.
Sample Input
3 2
0 5
-3 2
3 8
3 2
0 5
-3 3
3 8
Sample Output
2
0 2
3 5
1
0 5
| {"inputs": ["3 2\n0 5\n-3 2\n3 8", "3 2\n0 5\n-3 3\n3 8", "1 1\n-1 1", "10 2\n27 96\n-22 45\n-68 26\n46 69\n-91 86\n12 73\n-89 76\n-11 33\n17 47\n-57 78", "10 1\n3 60\n-73 -37\n59 69\n-56 1\n-84 -24\n-14 46\n-65 -23\n-66 -57\n-87 -80\n-21 20", "10 10\n-92 87\n-100 -67\n-88 80\n-82 -59\n-72 81\n-50 30\n30 77\n65 92\n-76 -60\n-29 -15", "1 1\n-941727901 756748222", "1 1\n-990637865 387517231", "1 1\n-870080964 571991746", "10 8\n-749560329 759073394\n-186423470 816422576\n-674251064 742056817\n-342947007 954589677\n-306243234 999298121\n-448636479 409818446\n-885248428 624359061\n-936960294 754851875\n-781500924 984124751\n-342740564 618223559", "10 1\n-260424665 -168566709\n299109864 663179811\n769984405 942516913\n-998905510 -707148023\n-167958021 60599275\n658861231 718845364\n79407402 279078536\n13652788 79756488\n-676213666 -339118351\n-349156760 -258185154", "10 8\n-278661264 757623461\n-751226975 996393413\n-721476675 863607399\n-228431002 643113689\n-209293138 701503607\n-433870703 932866969\n-385182911 667745533\n-661057075 783312740\n-617789923 657076219\n-890369225 990071765", "4 2\n2 2\n2 2\n2 3\n3 3", "2 2\n-3 1\n-4 -1", "1 1\n2 2", "2 1\n0 2\n-1 0", "2 2\n-1000000000 1000000000\n-1000000000 100"], "outputs": ["2\n0 2\n3 5", "1\n0 5", "1\n-1 1", "1\n-89 86", "1\n-87 69", "0", "1\n-941727901 756748222", "1\n-990637865 387517231", "1\n-870080964 571991746", "1\n-342740564 624359061", "5\n-998905510 -707148023\n-676213666 -168566709\n-167958021 279078536\n299109864 718845364\n769984405 942516913", "1\n-278661264 667745533", "2\n2 2\n3 3", "1\n-3 -1", "1\n2 2", "1\n-1 2", "1\n-1000000000 100"]} | UNKNOWN | [
"PYTHON3"
] | CODEFORCES | 5 | codeforces |
|
4d20c7698eadee9d13c983381c5be7d6 | Vanya and Cards | Vanya loves playing. He even has a special set of cards to play with. Each card has a single integer. The number on the card can be positive, negative and can even be equal to zero. The only limit is, the number on each card doesn't exceed *x* in the absolute value.
Natasha doesn't like when Vanya spends a long time playing, so she hid all of his cards. Vanya became sad and started looking for the cards but he only found *n* of them. Vanya loves the balance, so he wants the sum of all numbers on found cards equal to zero. On the other hand, he got very tired of looking for cards. Help the boy and say what is the minimum number of cards does he need to find to make the sum equal to zero?
You can assume that initially Vanya had infinitely many cards with each integer number from <=-<=*x* to *x*.
The first line contains two integers: *n* (1<=≤<=*n*<=≤<=1000) — the number of found cards and *x* (1<=≤<=*x*<=≤<=1000) — the maximum absolute value of the number on a card. The second line contains *n* space-separated integers — the numbers on found cards. It is guaranteed that the numbers do not exceed *x* in their absolute value.
Print a single number — the answer to the problem.
Sample Input
3 2
-1 1 2
2 3
-2 -2
Sample Output
1
2
| {"inputs": ["3 2\n-1 1 2", "2 3\n-2 -2", "4 4\n1 2 3 4", "2 2\n-1 -1", "15 5\n-2 -1 2 -4 -3 4 -4 -2 -2 2 -2 -1 1 -4 -2", "15 16\n-15 -5 -15 -14 -8 15 -15 -12 -5 -3 5 -7 3 8 -15", "1 4\n-3", "10 7\n6 4 6 6 -3 4 -1 2 3 3", "2 1\n1 -1", "1 1\n0", "8 13\n-11 -1 -11 12 -2 -2 -10 -11", "16 11\n3 -7 7 -9 -2 -3 -4 -2 -6 8 10 7 1 4 6 7", "67 15\n-2 -2 6 -4 -7 4 3 13 -9 -4 11 -7 -6 -11 1 11 -1 11 14 10 -8 7 5 11 -13 1 -1 7 -14 9 -11 -11 13 -4 12 -11 -8 -5 -11 6 10 -2 6 9 9 6 -11 -2 7 -10 -1 9 -8 -5 1 -7 -2 3 -1 -13 -6 -9 -8 10 13 -3 9", "123 222\n44 -190 -188 -185 -55 17 190 176 157 176 -24 -113 -54 -61 -53 53 -77 68 -12 -114 -217 163 -122 37 -37 20 -108 17 -140 -210 218 19 -89 54 18 197 111 -150 -36 -131 -172 36 67 16 -202 72 169 -137 -34 -122 137 -72 196 -17 -104 180 -102 96 -69 -184 21 -15 217 -61 175 -221 62 173 -93 -106 122 -135 58 7 -110 -108 156 -141 -102 -50 29 -204 -46 -76 101 -33 -190 99 52 -197 175 -71 161 -140 155 10 189 -217 -97 -170 183 -88 83 -149 157 -208 154 -3 77 90 74 165 198 -181 -166 -4 -200 -89 -200 131 100 -61 -149", "130 142\n58 -50 43 -126 84 -92 -108 -92 57 127 12 -135 -49 89 141 -112 -31 47 75 -19 80 81 -5 17 10 4 -26 68 -102 -10 7 -62 -135 -123 -16 55 -72 -97 -34 21 21 137 130 97 40 -18 110 -52 73 52 85 103 -134 -107 88 30 66 97 126 82 13 125 127 -87 81 22 45 102 13 95 4 10 -35 39 -43 -112 -5 14 -46 19 61 -44 -116 137 -116 -80 -39 92 -75 29 -65 -15 5 -108 -114 -129 -5 52 -21 118 -41 35 -62 -125 130 -95 -11 -75 19 108 108 127 141 2 -130 54 96 -81 -102 140 -58 -102 132 50 -126 82 6 45 -114 -42", "7 12\n2 5 -1 -4 -7 4 3", "57 53\n-49 7 -41 7 38 -51 -23 8 45 1 -24 26 37 28 -31 -40 38 25 -32 -47 -3 20 -40 -32 -44 -36 5 33 -16 -5 28 10 -22 3 -10 -51 -32 -51 27 -50 -22 -12 41 3 15 24 30 -12 -34 -15 -29 38 -10 -35 -9 6 -51", "93 273\n-268 -170 -163 19 -69 18 -244 35 -34 125 -224 -48 179 -247 127 -150 271 -49 -102 201 84 -151 -70 -46 -16 216 240 127 3 218 -209 223 -227 -201 228 -8 203 46 -100 -207 126 255 40 -58 -217 93 172 -97 23 183 102 -92 -157 -117 173 47 144 -235 -227 -62 -128 13 -151 158 110 -116 68 -2 -148 -206 -52 79 -152 -223 74 -149 -69 232 38 -70 -256 -213 -236 132 -189 -200 199 -57 -108 -53 269 -101 -134", "1 1000\n997", "4 3\n2 -1 -2 -1", "1 1\n-1", "1 1\n1", "2 2\n1 -1", "2 2\n-1 1", "2 3\n-1 1", "2 2\n-2 2", "2 2\n2 2", "4 2\n-1 -1 -1 -1", "4 1\n-1 -1 -1 1", "3 2\n2 2 2", "10 300\n300 300 300 300 300 300 300 300 300 300"], "outputs": ["1", "2", "3", "1", "4", "6", "1", "5", "0", "0", "3", "2", "1", "8", "5", "1", "8", "8", "1", "1", "1", "1", "0", "0", "0", "0", "2", "2", "2", "3", "10"]} | UNKNOWN | [
"PYTHON3"
] | CODEFORCES | 229 | codeforces |
|
4d2e7d38f23a5531f3d391346ad788ae | Journey | Recently Irina arrived to one of the most famous cities of Berland — the Berlatov city. There are *n* showplaces in the city, numbered from 1 to *n*, and some of them are connected by one-directional roads. The roads in Berlatov are designed in a way such that there are no cyclic routes between showplaces.
Initially Irina stands at the showplace 1, and the endpoint of her journey is the showplace *n*. Naturally, Irina wants to visit as much showplaces as she can during her journey. However, Irina's stay in Berlatov is limited and she can't be there for more than *T* time units.
Help Irina determine how many showplaces she may visit during her journey from showplace 1 to showplace *n* within a time not exceeding *T*. It is guaranteed that there is at least one route from showplace 1 to showplace *n* such that Irina will spend no more than *T* time units passing it.
The first line of the input contains three integers *n*,<=*m* and *T* (2<=≤<=*n*<=≤<=5000,<=<=1<=≤<=*m*<=≤<=5000,<=<=1<=≤<=*T*<=≤<=109) — the number of showplaces, the number of roads between them and the time of Irina's stay in Berlatov respectively.
The next *m* lines describes roads in Berlatov. *i*-th of them contains 3 integers *u**i*,<=*v**i*,<=*t**i* (1<=≤<=*u**i*,<=*v**i*<=≤<=*n*,<=*u**i*<=≠<=*v**i*,<=1<=≤<=*t**i*<=≤<=109), meaning that there is a road starting from showplace *u**i* and leading to showplace *v**i*, and Irina spends *t**i* time units to pass it. It is guaranteed that the roads do not form cyclic routes.
It is guaranteed, that there is at most one road between each pair of showplaces.
Print the single integer *k* (2<=≤<=*k*<=≤<=*n*) — the maximum number of showplaces that Irina can visit during her journey from showplace 1 to showplace *n* within time not exceeding *T*, in the first line.
Print *k* distinct integers in the second line — indices of showplaces that Irina will visit on her route, in the order of encountering them.
If there are multiple answers, print any of them.
Sample Input
4 3 13
1 2 5
2 3 7
2 4 8
6 6 7
1 2 2
1 3 3
3 6 3
2 4 2
4 6 2
6 5 1
5 5 6
1 3 3
3 5 3
1 2 2
2 4 3
4 5 2
Sample Output
3
1 2 4
4
1 2 4 6
3
1 3 5
| {"inputs": ["4 3 13\n1 2 5\n2 3 7\n2 4 8", "6 6 7\n1 2 2\n1 3 3\n3 6 3\n2 4 2\n4 6 2\n6 5 1", "5 5 6\n1 3 3\n3 5 3\n1 2 2\n2 4 3\n4 5 2", "10 10 100\n1 4 1\n6 4 1\n9 3 2\n2 7 2\n5 8 11\n1 2 8\n4 10 10\n8 9 2\n7 5 8\n3 6 4", "10 10 56\n4 8 5\n9 3 11\n2 5 5\n5 9 9\n3 6 1\n1 4 9\n8 7 7\n6 10 1\n1 6 12\n7 2 9", "4 4 3\n1 2 1\n2 3 1\n3 4 1\n1 3 1", "4 4 2\n1 2 1\n2 3 1\n3 4 1\n1 3 1", "10 45 8\n1 2 1\n1 3 1\n1 4 1\n1 5 1\n1 6 1\n1 7 1\n1 8 1\n1 9 1\n1 10 1\n2 3 1\n2 4 1\n2 5 1\n2 6 1\n2 7 1\n2 8 1\n2 9 1\n2 10 1\n3 4 1\n3 5 1\n3 6 1\n3 7 1\n3 8 1\n3 9 1\n3 10 1\n4 5 1\n4 6 1\n4 7 1\n4 8 1\n4 9 1\n4 10 1\n5 6 1\n5 7 1\n5 8 1\n5 9 1\n5 10 1\n6 7 1\n6 8 1\n6 9 1\n6 10 1\n7 8 1\n7 9 1\n7 10 1\n8 9 1\n8 10 1\n9 10 1", "2 1 1\n1 2 1", "12 12 8\n1 2 2\n2 3 5\n3 12 1\n4 5 1000000000\n1 7 1\n7 6 3\n6 12 1\n1 9 1\n9 10 1\n10 11 1\n11 8 1\n8 12 1", "12 12 5\n1 2 2\n2 3 5\n3 12 1\n4 5 1000000000\n1 7 1\n7 6 3\n6 12 1\n1 9 1\n9 10 1\n10 11 1\n11 8 1\n8 12 1", "12 12 4\n1 2 2\n2 3 5\n3 12 1\n4 5 1000000000\n1 7 1\n7 6 2\n6 12 1\n1 9 1\n9 10 1\n10 11 1\n11 8 1\n8 12 1", "11 11 9\n1 2 1\n2 3 1\n1 4 1\n4 5 1\n5 6 1\n6 3 1\n3 7 1\n7 8 1\n8 11 1\n11 10 1\n10 9 1", "11 11 7\n1 2 1\n2 3 1\n1 4 1\n4 5 1\n5 6 1\n6 3 1\n3 7 1\n7 8 1\n8 11 1\n11 10 1\n10 9 1", "11 11 6\n1 2 1\n2 3 1\n1 4 1\n4 5 1\n5 6 1\n6 3 1\n3 7 1\n7 8 1\n8 11 1\n11 10 1\n10 9 1", "12 12 9\n1 2 1\n2 3 1\n1 4 1\n4 5 1\n5 6 1\n6 3 1\n3 7 1\n7 8 1\n8 12 1\n12 10 1\n10 9 1\n11 1 1", "4 4 120\n1 2 11\n1 3 20\n2 3 10\n3 4 100", "4 4 10\n2 1 1\n2 3 1\n1 3 1\n3 4 1", "5 5 200\n1 2 100\n2 4 100\n1 3 1\n3 4 1\n4 5 1", "5 5 2\n1 2 1\n1 3 1\n3 4 1\n2 5 1\n4 2 1", "4 4 1000000000\n1 2 1000000000\n2 3 1000000000\n3 4 1000000000\n1 4 1000000000"], "outputs": ["3\n1 2 4 ", "4\n1 2 4 6 ", "3\n1 3 5 ", "10\n1 2 7 5 8 9 3 6 4 10 ", "3\n1 6 10 ", "4\n1 2 3 4 ", "3\n1 3 4 ", "9\n1 2 3 4 5 6 7 8 10 ", "2\n1 2 ", "6\n1 9 10 11 8 12 ", "6\n1 9 10 11 8 12 ", "4\n1 7 6 12 ", "8\n1 4 5 6 3 7 8 11 ", "8\n1 4 5 6 3 7 8 11 ", "6\n1 2 3 7 8 11 ", "8\n1 4 5 6 3 7 8 12 ", "3\n1 3 4 ", "3\n1 3 4 ", "4\n1 3 4 5 ", "3\n1 2 5 ", "2\n1 4 "]} | UNKNOWN | [
"PYTHON3"
] | CODEFORCES | 7 | codeforces |
|
4d315db31337800f8068a03044a6854a | Crazy Computer | ZS the Coder is coding on a crazy computer. If you don't type in a word for a *c* consecutive seconds, everything you typed disappear!
More formally, if you typed a word at second *a* and then the next word at second *b*, then if *b*<=-<=*a*<=≤<=*c*, just the new word is appended to other words on the screen. If *b*<=-<=*a*<=><=*c*, then everything on the screen disappears and after that the word you have typed appears on the screen.
For example, if *c*<==<=5 and you typed words at seconds 1,<=3,<=8,<=14,<=19,<=20 then at the second 8 there will be 3 words on the screen. After that, everything disappears at the second 13 because nothing was typed. At the seconds 14 and 19 another two words are typed, and finally, at the second 20, one more word is typed, and a total of 3 words remain on the screen.
You're given the times when ZS the Coder typed the words. Determine how many words remain on the screen after he finished typing everything.
The first line contains two integers *n* and *c* (1<=≤<=*n*<=≤<=100<=000,<=1<=≤<=*c*<=≤<=109) — the number of words ZS the Coder typed and the crazy computer delay respectively.
The next line contains *n* integers *t*1,<=*t*2,<=...,<=*t**n* (1<=≤<=*t*1<=<<=*t*2<=<<=...<=<<=*t**n*<=≤<=109), where *t**i* denotes the second when ZS the Coder typed the *i*-th word.
Print a single positive integer, the number of words that remain on the screen after all *n* words was typed, in other words, at the second *t**n*.
Sample Input
6 5
1 3 8 14 19 20
6 1
1 3 5 7 9 10
Sample Output
32 | {"inputs": ["6 5\n1 3 8 14 19 20", "6 1\n1 3 5 7 9 10", "1 1\n1000000000", "5 5\n1 7 12 13 14", "2 1000000000\n1 1000000000", "3 5\n1 10 20", "3 10\n1 2 3", "2 1\n1 100", "3 1\n1 2 10", "2 1\n1 2"], "outputs": ["3", "2", "1", "4", "2", "1", "3", "1", "1", "2"]} | UNKNOWN | [
"PYTHON3"
] | CODEFORCES | 455 | codeforces |
|
4d461faa69703d521ca3e9d5400fb27e | Om Nom and Dark Park | Om Nom is the main character of a game "Cut the Rope". He is a bright little monster who likes visiting friends living at the other side of the park. However the dark old parks can scare even somebody as fearless as Om Nom, so he asks you to help him.
The park consists of 2*n*<=+<=1<=-<=1 squares connected by roads so that the scheme of the park is a full binary tree of depth *n*. More formally, the entrance to the park is located at the square 1. The exits out of the park are located at squares 2*n*,<=2*n*<=+<=1,<=...,<=2*n*<=+<=1<=-<=1 and these exits lead straight to the Om Nom friends' houses. From each square *i* (2<=≤<=*i*<=<<=2*n*<=+<=1) there is a road to the square . Thus, it is possible to go from the park entrance to each of the exits by walking along exactly *n* roads.
Om Nom loves counting lights on the way to his friend. Om Nom is afraid of spiders who live in the park, so he doesn't like to walk along roads that are not enough lit. What he wants is that the way to any of his friends should have in total the same number of lights. That will make him feel safe.
He asked you to help him install additional lights. Determine what minimum number of lights it is needed to additionally place on the park roads so that a path from the entrance to any exit of the park contains the same number of street lights. You may add an arbitrary number of street lights to each of the roads.
The first line contains integer *n* (1<=≤<=*n*<=≤<=10) — the number of roads on the path from the entrance to any exit.
The next line contains 2*n*<=+<=1<=-<=2 numbers *a*2,<=*a*3,<=... *a*2*n*<=+<=1<=-<=1 — the initial numbers of street lights on each road of the park. Here *a**i* is the number of street lights on the road between squares *i* and . All numbers *a**i* are positive integers, not exceeding 100.
Print the minimum number of street lights that we should add to the roads of the park to make Om Nom feel safe.
Sample Input
2
1 2 3 4 5 6
Sample Output
5
| {"inputs": ["2\n1 2 3 4 5 6", "2\n1 2 3 3 2 2", "1\n39 52", "2\n59 96 34 48 8 72", "3\n87 37 91 29 58 45 51 74 70 71 47 38 91 89", "5\n39 21 95 89 73 90 9 55 85 32 30 21 68 59 82 91 20 64 52 70 6 88 53 47 30 47 34 14 11 22 42 15 28 54 37 48 29 3 14 13 18 77 90 58 54 38 94 49 45 66 13 74 11 14 64 72 95 54 73 79 41 35", "1\n49 36", "1\n77 88", "1\n1 33", "2\n72 22 81 23 14 75", "2\n100 70 27 1 68 52", "2\n24 19 89 82 22 21", "3\n86 12 92 91 3 68 57 56 76 27 33 62 71 84", "3\n14 56 53 61 57 45 40 44 31 9 73 2 61 26", "3\n35 96 7 43 10 14 16 36 95 92 16 50 59 55", "4\n1 97 18 48 96 65 24 91 17 45 36 27 74 93 78 86 39 55 53 21 26 68 31 33 79 63 80 92 1 26", "4\n25 42 71 29 50 30 99 79 77 24 76 66 68 23 97 99 65 17 75 62 66 46 48 4 40 71 98 57 21 92", "4\n49 86 17 7 3 6 86 71 36 10 27 10 58 64 12 16 88 67 93 3 15 20 58 87 97 91 11 6 34 62", "5\n16 87 36 16 81 53 87 35 63 56 47 91 81 95 80 96 91 7 58 99 25 28 47 60 7 69 49 14 51 52 29 30 83 23 21 52 100 26 91 14 23 94 72 70 40 12 50 32 54 52 18 74 5 15 62 3 48 41 24 25 56 43", "5\n40 27 82 94 38 22 66 23 18 34 87 31 71 28 95 5 14 61 76 52 66 6 60 40 68 77 70 63 64 18 47 13 82 55 34 64 30 1 29 24 24 9 65 17 29 96 61 76 72 23 32 26 90 39 54 41 35 66 71 29 75 48", "5\n64 72 35 68 92 95 45 15 77 16 26 74 61 65 18 22 32 19 98 97 14 84 70 23 29 1 87 28 88 89 73 79 69 88 43 60 64 64 66 39 17 27 46 71 18 83 73 20 90 77 49 70 84 63 50 72 26 87 26 37 78 65", "6\n35 61 54 77 70 50 53 70 4 66 58 47 76 100 78 5 43 50 55 93 13 93 59 92 30 74 22 23 98 70 19 56 90 92 19 7 28 53 45 77 42 91 71 56 19 83 100 53 13 93 37 13 70 60 16 13 76 3 12 22 17 26 50 6 63 7 25 41 92 29 36 80 11 4 10 14 77 75 53 82 46 24 56 46 82 36 80 75 8 45 24 22 90 34 45 76 18 38 86 43 7 49 80 56 90 53 12 51 98 47 44 58 32 4 2 6 3 60 38 72 74 46 30 86 1 98", "6\n63 13 100 54 31 15 29 58 59 44 2 99 70 33 97 14 70 12 73 42 65 71 68 67 87 83 43 84 18 41 37 22 81 24 27 11 57 28 83 92 39 1 56 15 16 67 16 97 31 52 50 65 63 89 8 52 55 20 71 27 28 35 86 92 94 60 10 65 83 63 89 71 34 20 78 40 34 62 2 86 100 81 87 69 25 4 52 17 57 71 62 38 1 3 54 71 34 85 20 60 80 23 82 47 4 19 7 18 14 18 28 27 4 55 26 71 45 9 2 40 67 28 32 19 81 92", "6\n87 62 58 32 81 92 12 50 23 27 38 39 64 74 16 35 84 59 91 87 14 48 90 47 44 95 64 45 31 11 67 5 80 60 36 15 91 3 21 2 40 24 37 69 5 50 23 37 49 19 68 21 49 9 100 94 45 41 22 31 31 48 25 70 25 25 95 88 82 1 37 53 49 31 57 74 94 45 55 93 43 37 13 85 59 72 15 68 3 90 96 55 100 64 63 69 43 33 66 84 57 97 87 34 23 89 97 77 39 89 8 92 68 13 50 36 95 61 71 96 73 13 30 49 57 89"], "outputs": ["5", "0", "13", "139", "210", "974", "13", "11", "32", "175", "53", "80", "286", "236", "173", "511", "603", "470", "1060", "1063", "987", "2499", "2465", "2513"]} | UNKNOWN | [
"PYTHON3"
] | CODEFORCES | 48 | codeforces |
|
4d4743cbbd6fab36d93393b725364698 | Game Outcome | Sherlock Holmes and Dr. Watson played some game on a checkered board *n*<=×<=*n* in size. During the game they put numbers on the board's squares by some tricky rules we don't know. However, the game is now over and each square of the board contains exactly one number. To understand who has won, they need to count the number of winning squares. To determine if the particular square is winning you should do the following. Calculate the sum of all numbers on the squares that share this column (including the given square) and separately calculate the sum of all numbers on the squares that share this row (including the given square). A square is considered winning if the sum of the column numbers is strictly greater than the sum of the row numbers.
For instance, lets game was ended like is shown in the picture. Then the purple cell is winning, because the sum of its column numbers equals 8<=+<=3<=+<=6<=+<=7<==<=24, sum of its row numbers equals 9<=+<=5<=+<=3<=+<=2<==<=19, and 24<=><=19.
The first line contains an integer *n* (1<=≤<=*n*<=≤<=30). Each of the following *n* lines contain *n* space-separated integers. The *j*-th number on the *i*-th line represents the number on the square that belongs to the *j*-th column and the *i*-th row on the board. All number on the board are integers from 1 to 100.
Print the single number — the number of the winning squares.
Sample Input
1
1
2
1 2
3 4
4
5 7 8 4
9 5 3 2
1 6 6 4
9 5 7 3
Sample Output
0
2
6
| {"inputs": ["1\n1", "2\n1 2\n3 4", "4\n5 7 8 4\n9 5 3 2\n1 6 6 4\n9 5 7 3", "2\n1 1\n1 1", "3\n1 2 3\n4 5 6\n7 8 9", "3\n1 2 3\n3 1 2\n2 3 1", "4\n1 2 3 4\n8 7 6 5\n9 10 11 12\n16 15 14 13", "1\n53", "5\n1 98 22 9 39\n10 9 44 49 66\n79 17 23 8 47\n59 69 72 47 14\n94 91 98 19 54", "1\n31", "1\n92", "5\n61 45 70 19 48\n52 29 98 21 74\n21 66 12 6 55\n62 75 66 62 57\n94 74 9 86 24", "2\n73 99\n13 100", "4\n89 79 14 89\n73 24 58 89\n62 88 69 65\n58 92 18 83", "5\n99 77 32 20 49\n93 81 63 7 58\n37 1 17 35 53\n18 94 38 80 23\n91 50 42 61 63", "4\n81 100 38 54\n8 64 39 59\n6 12 53 65\n79 50 99 71", "5\n42 74 45 85 14\n68 94 11 3 89\n68 67 97 62 66\n65 76 96 18 84\n61 98 28 94 74", "9\n53 80 94 41 58 49 88 24 42\n85 11 32 64 40 56 63 95 73\n17 85 60 41 13 71 54 67 87\n38 14 21 81 66 59 52 33 86\n29 34 46 18 19 80 10 44 51\n4 27 65 75 77 21 15 49 50\n35 68 86 98 98 62 69 52 71\n43 28 56 91 89 21 14 57 79\n27 27 29 26 15 76 21 70 78", "7\n80 81 45 81 72 19 65\n31 24 15 52 47 1 14\n81 35 42 24 96 59 46\n16 2 59 56 60 98 76\n20 95 10 68 68 56 93\n60 16 68 77 89 52 43\n11 22 43 36 99 2 11", "9\n33 80 34 56 56 33 27 74 57\n14 69 78 44 56 70 26 73 47\n13 42 17 33 78 83 94 70 37\n96 78 92 6 16 68 8 31 46\n67 97 21 10 44 64 15 77 28\n34 44 83 96 63 52 29 27 79\n23 23 57 54 35 16 5 64 36\n29 71 36 78 47 81 72 97 36\n24 83 70 58 36 82 42 44 26", "9\n57 70 94 69 77 59 88 63 83\n6 79 46 5 9 43 20 39 48\n46 35 58 22 17 3 81 82 34\n77 10 40 53 71 84 14 58 56\n6 92 77 81 13 20 77 29 40\n59 53 3 97 21 97 22 11 64\n52 91 82 20 6 3 99 17 44\n79 25 43 69 85 55 95 61 31\n89 24 50 84 54 93 54 60 87", "5\n77 44 22 21 20\n84 3 35 86 35\n97 50 1 44 92\n4 88 56 20 3\n32 56 26 17 80", "7\n62 73 50 63 66 92 2\n27 13 83 84 88 81 47\n60 41 25 2 68 32 60\n7 94 18 98 41 25 72\n69 37 4 10 82 49 91\n76 26 67 27 30 49 18\n44 78 6 1 41 94 80", "9\n40 70 98 28 44 78 15 73 20\n25 74 46 3 27 59 33 96 19\n100 47 99 68 68 67 66 87 31\n26 39 8 91 58 20 91 69 81\n77 43 90 60 17 91 78 85 68\n41 46 47 50 96 18 69 81 26\n10 58 2 36 54 64 69 10 65\n6 86 26 7 88 20 43 92 59\n61 76 13 23 49 28 22 79 8", "8\n44 74 25 81 32 33 55 58\n36 13 28 28 20 65 87 58\n8 35 52 59 34 15 33 16\n2 22 42 29 11 66 30 72\n33 47 8 61 31 64 59 63\n79 36 38 42 12 21 92 36\n56 47 44 6 6 1 37 2\n79 88 79 53 50 69 94 39", "5\n4 91 100 8 48\n78 56 61 49 83\n12 21 95 77 78\n40 20 91 79 25\n32 88 94 28 55", "5\n23 70 5 36 69\n83 18 19 98 40\n84 91 18 51 35\n17 18 35 47 59\n29 72 35 87 27", "12\n8 42 23 20 39 5 23 86 26 65 93 82\n48 35 12 4 59 19 19 28 38 81 97 99\n93 24 31 44 97 50 44 99 50 7 10 64\n79 43 65 29 84 43 46 41 89 16 6 1\n34 90 33 1 7 12 46 84 67 30 1 58\n58 21 100 66 56 22 7 24 72 73 86 37\n2 17 85 6 2 73 85 44 43 79 34 65\n3 53 29 76 87 2 27 19 11 42 71 38\n69 82 73 52 44 23 92 10 13 72 59 16\n73 32 37 93 21 94 43 39 27 53 14 15\n86 16 90 91 14 50 73 61 77 36 93 90\n22 56 30 52 81 70 12 92 75 27 38 12", "3\n41 94 58\n73 61 8\n34 88 89", "3\n1 2 3\n1 1 1\n1 1 1", "2\n7 3\n9 5", "3\n4 3 2\n2 2 2\n2 2 2"], "outputs": ["0", "2", "6", "0", "4", "0", "8", "0", "13", "0", "0", "13", "2", "10", "12", "8", "12", "40", "21", "41", "46", "13", "26", "44", "31", "10", "13", "77", "5", "4", "2", "4"]} | UNKNOWN | [
"PYTHON3"
] | CODEFORCES | 139 | codeforces |
|
4d5a50f021c4770a7b23556a5ad893bf | String | You are given a string *s*. Each pair of numbers *l* and *r* that fulfill the condition 1<=≤<=*l*<=≤<=*r*<=≤<=|*s*|, correspond to a substring of the string *s*, starting in the position *l* and ending in the position *r* (inclusive).
Let's define the function of two strings *F*(*x*,<=*y*) like this. We'll find a list of such pairs of numbers for which the corresponding substrings of string *x* are equal to string *y*. Let's sort this list of pairs according to the pair's first number's increasing. The value of function *F*(*x*,<=*y*) equals the number of non-empty continuous sequences in the list.
For example: *F*(*babbabbababbab*,<=*babb*)<==<=6. The list of pairs is as follows:
(1,<=4),<=(4,<=7),<=(9,<=12)
Its continuous sequences are:
- (1,<=4) - (4,<=7) - (9,<=12) - (1,<=4),<=(4,<=7) - (4,<=7),<=(9,<=12) - (1,<=4),<=(4,<=7),<=(9,<=12)
Your task is to calculate for the given string *s* the sum *F*(*s*,<=*x*) for all *x*, that *x* belongs to the set of all substrings of a string *s*.
The only line contains the given string *s*, consisting only of small Latin letters (1<=≤<=|*s*|<=≤<=105).
Print the single number — the sought sum.
Please do not use the %lld specificator to read or write 64-bit integers in С++. It is preferred to use the cin, cout streams or the %I64d specificator.
Sample Input
aaaa
abcdef
abacabadabacaba
Sample Output
20
21
188
| {"inputs": ["aaaa", "abcdef", "abacabadabacaba", "tkth", "eqkrqe", "cwuiax", "hhhhqhqh", "gmxfmcgp", "eleellleeee", "usussubuubbbbs", "lhmpaugvnqzrfxke", "xkkkkkkkkkkkkkkkkxkkkk", "pprppppriiriiiirprppprriir", "jsoxkutcvyshsinfmtrpujedcbmyqlojzco", "emcegmekgnlefkeguqkfffnduqhfhhhndlfhlfdqdncefnn", "ffffdjfddffdjdfffddjfffffffjfffjdjfffjfjfdjjfjdjjdjjjdffd", "cxvhmeyouudwuglhbwndzwmjjsgrnuwnzwaycfspyyrdckjcidfsabvdxzjkvm", "cahdktuxuukmbuqcqactqhqdcxpkqcuumckttdpmpqxxkacpappxuqkxbuahqdphhddhquthqaapm", "hhwhhwhhhwhwwhhwwwhwhhhwhwwwhhwhwhhhhhhwhwhwwwhhwwwhhwhhhhwhwwhwhwwwwhhwwhwhwwwhhhwwhwhwhhwwwhwhhhwwwhwhw", "cnrkvxbljhitbvoysdpghhhnymktvburpvxybnvugkzudmnmpuhevzyjpbtraaepszhhssmcozkgbjayztrvqwdfmjlhtvarkkdsbnjrabqexpfjozmjzfbmdsihovoxmmtjgtfyaisllysnekdxozhdwu", "qasiyhdivaiyyhdqiqsvqhtqsetxqvaeqatxesxehisyqiivhvayaxvsxhsydiesaxydysqhedxqhsqivvidqtsitiiveexiehsqdteahyxtsyqetahviyhqvytexethsqssxiytqhxxxdihxietsyxqhtitheyeateeyhythxhhqaad", "ggwgwwgwwkggwgwwkgwwwggwwwggkgkgwkwgkkgkwwgwkkggwggkwgwgkgwwkwkkkkwggwwkwkkkgwkwwwwwgwkwkkwkggwwgggkkwwkgkgkwgkgkwggkwgggwwkgkwgkwkkgwkkkkggwwwgkggkwwgkwkgwgggkggkkkwwwwwkkgkwggwgkwwwwggwwgkkggwkkwkkgkwggggggkkwkkgkkkwkwwkwggwkkwggggwg", "tmoqyzoikohtgkybnwjizgjypzycmtstmsizrqrmczmqmpewxiwlqzcaufxkchqyjegktxihlksisbgogpyxkltioovelwaqcbebgcyygxsshsirkwvtsvhpqtbomueaszkrlixueyeiccvfiuoogomjlhjkacnxtimkprmjttpmeaminvmcqagrpjighsvaosojymcjoyopsvkrphzbnckcvvckicmjwpvawjuzkofnuvcahwhzjpfngwyobiufivsjnekjcloobvzawrvosnkvalmr", "rrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrbrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrbrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrr", "zzzzooozzzoozozoozzzzzzozooozoozoozzozzozoooozzzzzzoooozzozooozoozzzozozoooooozzzozozooooozozozozzooozozzooozzzzozozoozoozzzozooozzzzoozzzzozzzzoooozozozozozzoooozzzooozzoooooooozozzozozooozzzooooozozooozozzozozoozzozzzzooozzoozozozzozozoozozzzoozozoooozzooozozooooozzzzzoozoozzzozzzoozzoozozzooozzzzzzoozzozzoozzzoozozzooozoozzzozooozozzoozoozozzzzzoozoozzzooooozooooooozooooozzoozoozzzooooozoozozozozzzoozzzzzoozzzzzzooooooozzzzozzozzo"], "outputs": ["20", "21", "188", "11", "23", "21", "59", "38", "104", "138", "136", "1098", "512", "646", "1227", "2564", "2023", "3258", "10856", "12399", "17103", "41166", "42165", "2214420", "190205"]} | UNKNOWN | [
"PYTHON3"
] | CODEFORCES | 1 | codeforces |
|
4d5a544372c1f78904b64c235df052b3 | Maximum Submatrix 2 | You are given a matrix consisting of digits zero and one, its size is *n*<=×<=*m*. You are allowed to rearrange its rows. What is the maximum area of the submatrix that only consists of ones and can be obtained in the given problem by the described operations?
Let's assume that the rows of matrix *a* are numbered from 1 to *n* from top to bottom and the columns are numbered from 1 to *m* from left to right. A matrix cell on the intersection of the *i*-th row and the *j*-th column can be represented as (*i*,<=*j*). Formally, a submatrix of matrix *a* is a group of four integers *d*,<=*u*,<=*l*,<=*r* (1<=≤<=*d*<=≤<=*u*<=≤<=*n*; 1<=≤<=*l*<=≤<=*r*<=≤<=*m*). We will assume that the submatrix contains cells (*i*,<=*j*) (*d*<=≤<=*i*<=≤<=*u*; *l*<=≤<=*j*<=≤<=*r*). The area of the submatrix is the number of cells it contains.
The first line contains two integers *n* and *m* (1<=≤<=*n*,<=*m*<=≤<=5000). Next *n* lines contain *m* characters each — matrix *a*. Matrix *a* only contains characters: "0" and "1". Note that the elements of the matrix follow without any spaces in the lines.
Print a single integer — the area of the maximum obtained submatrix. If we cannot obtain a matrix of numbers one, print 0.
Sample Input
1 1
1
2 2
10
11
4 3
100
011
000
101
Sample Output
1
2
2
| {"inputs": ["1 1\n1", "2 2\n10\n11", "4 3\n100\n011\n000\n101", "11 16\n0111110101100011\n1000101100010000\n0010110110010101\n0110110010110010\n0011101101110000\n1001100011010111\n0010011111111000\n0100100100111110\n1001000000100111\n0110000011001000\n1011111011010000", "19 12\n110001100110\n100100000000\n101011001111\n010111110001\n011000100100\n011111010000\n010011101100\n011010011110\n011001111110\n010111110001\n010000010111\n001111110100\n100100110001\n100110000000\n110000010010\n111101011101\n010111100000\n100000011010\n000100100101", "13 19\n0000111111111111011\n0111000001110001101\n1110100110111011101\n0001101011100001110\n1101100100010000101\n1010100011110011010\n1010011101010000001\n1011101000001111000\n1101110001101011110\n0110101010001111100\n0001011010100111001\n1111101000110001000\n0010010000011100010", "8 5\n00000\n00000\n00000\n00000\n00000\n00000\n00000\n00000", "15 18\n111111111111111111\n111111111111111111\n111111111111111111\n111111111111111111\n111111111111111111\n111111111111111111\n111111111111111111\n111111111111111111\n111111111111111111\n111111111111111111\n111111111111111111\n111111111111111111\n111111111111111111\n111111111111111111\n111111111111111111", "1 1\n0"], "outputs": ["1", "2", "2", "9", "16", "14", "0", "270", "0"]} | UNKNOWN | [
"PYTHON3"
] | CODEFORCES | 2 | codeforces |
|
4d7ccba00f2546ab87348b15d1ccaedd | Palindrome Transformation | Nam is playing with a string on his computer. The string consists of *n* lowercase English letters. It is meaningless, so Nam decided to make the string more beautiful, that is to make it be a palindrome by using 4 arrow keys: left, right, up, down.
There is a cursor pointing at some symbol of the string. Suppose that cursor is at position *i* (1<=≤<=*i*<=≤<=*n*, the string uses 1-based indexing) now. Left and right arrow keys are used to move cursor around the string. The string is cyclic, that means that when Nam presses left arrow key, the cursor will move to position *i*<=-<=1 if *i*<=><=1 or to the end of the string (i. e. position *n*) otherwise. The same holds when he presses the right arrow key (if *i*<==<=*n*, the cursor appears at the beginning of the string).
When Nam presses up arrow key, the letter which the text cursor is pointing to will change to the next letter in English alphabet (assuming that alphabet is also cyclic, i. e. after 'z' follows 'a'). The same holds when he presses the down arrow key.
Initially, the text cursor is at position *p*.
Because Nam has a lot homework to do, he wants to complete this as fast as possible. Can you help him by calculating the minimum number of arrow keys presses to make the string to be a palindrome?
The first line contains two space-separated integers *n* (1<=≤<=*n*<=≤<=105) and *p* (1<=≤<=*p*<=≤<=*n*), the length of Nam's string and the initial position of the text cursor.
The next line contains *n* lowercase characters of Nam's string.
Print the minimum number of presses needed to change string into a palindrome.
Sample Input
8 3
aeabcaez
Sample Output
6
| {"inputs": ["8 3\naeabcaez", "8 3\nabcddcbb", "4 4\nrkoa", "39 30\nyehuqwaffoiyxhkmdipxroolhahbhzprioobxfy", "40 23\nvwjzsgpdsopsrpsyccavfkyyahdgkmdxrquhcplw", "10 5\nabcdeedcba", "5 5\npjfjb", "57 9\nibkypcbtpdlhhpmghwrmuwaqoqxxexxqoqawumrwhgmphhldixezvfpqh", "10 6\nabcdefdcba", "167 152\nvqgjxbuxevpqbpnuyxktgpwdgyebnmrxbnitphshuloyykpgxakxadtguqskmhejndzptproeabnlvfwdyjiydfrjkxpvpbzwutsdpfawwcqqqirxwlkrectlnpdeccaoqetcaqcvyjtfoekyupvbsoiyldggycphddecbf", "93 61\nuecrsqsoylbotwcujcsbjohlyjlpjsjsnvttpytrvztqtkpsdcrvsossimwmglumwzpouhaiqvowthzsyonxjjearhniq", "63 4\nwzxjoumbtneztzheqznngprtcqjvawcycwavjqctrpgnnzqehztzentbmuojxzw", "85 19\nblkimwzicvbdkwfodvigvmnujnotwuobkjvugbtaseebxvdiorffqnhllwtwdnfodkuvdofwkdbvcizwmiklb", "198 3\ntuxqalctjyegbvouezfiqoeoazizhmjhpcmvyvjkyrgxkeupwcmvzcosdrrfgtdmxwfttxjxsbaspjwftgpnvsfyfqsrmyjmypdwonbzwsftepwtjlgbilhcsqyfzfzrfvrvfqiwoemthwvqptqnflqqspvqrnmvucnspexpijnivqpavqxjyucufcullevaedlvut", "46 29\nxxzkzsxlyhotmfjpptrilatgtqpyshraiycmyzzlrcllvu", "1 1\na", "2 2\nat", "10 4\nabcddddcef", "8 8\naccedcba", "1 1\nd"], "outputs": ["6", "3", "14", "138", "169", "0", "12", "55", "1", "666", "367", "0", "187", "692", "168", "0", "7", "11", "5", "0"]} | UNKNOWN | [
"PYTHON3"
] | CODEFORCES | 2 | codeforces |
|
4d80ebfc6443ce589574ba07fc4ccc26 | Lucky Permutation Triple | Bike is interested in permutations. A permutation of length *n* is an integer sequence such that each integer from 0 to (*n*<=-<=1) appears exactly once in it. For example, [0,<=2,<=1] is a permutation of length 3 while both [0,<=2,<=2] and [1,<=2,<=3] is not.
A permutation triple of permutations of length *n* (*a*,<=*b*,<=*c*) is called a Lucky Permutation Triple if and only if . The sign *a**i* denotes the *i*-th element of permutation *a*. The modular equality described above denotes that the remainders after dividing *a**i*<=+<=*b**i* by *n* and dividing *c**i* by *n* are equal.
Now, he has an integer *n* and wants to find a Lucky Permutation Triple. Could you please help him?
The first line contains a single integer *n* (1<=≤<=*n*<=≤<=105).
If no Lucky Permutation Triple of length *n* exists print -1.
Otherwise, you need to print three lines. Each line contains *n* space-seperated integers. The first line must contain permutation *a*, the second line — permutation *b*, the third — permutation *c*.
If there are multiple solutions, print any of them.
Sample Input
5
2
Sample Output
1 4 3 2 0
1 0 2 4 3
2 4 0 1 3
-1
| {"inputs": ["5", "2", "8", "9", "2", "77", "6", "87", "72", "1", "23", "52", "32", "25", "54", "39", "20", "53", "34", "23", "37123", "41904", "46684", "67817", "72598", "85891", "74320", "11805", "16586", "5014", "73268", "61697", "99182", "79771", "68199", "5684", "10465", "31598", "36379", "16968", "93061", "73650", "94783", "99564", "37049", "25478", "30259", "43551", "31980", "69465", "1", "100000", "99999", "99998"], "outputs": ["1 4 3 2 0\n1 0 2 4 3\n2 4 0 1 3", "-1", "-1", "0 1 2 3 4 5 6 7 8 \n0 1 2 3 4 5 6 7 8 \n0 2 4 6 8 1 3 5 7 ", "-1", "0 1 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 \n0 1 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 \n0 2 4 6 8 10 12 14 16 18 20 22 24 26 28 30 32 34 36 38 40 42 44 4...", "-1", "0 1 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 \n0 1 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 \n0 2 4...", "-1", "0 \n0 \n0 ", "0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 \n0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 \n0 2 4 6 8 10 12 14 16 18 20 22 1 3 5 7 9 11 13 15 17 19 21 ", "-1", "-1", "0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 \n0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 \n0 2 4 6 8 10 12 14 16 18 20 22 24 1 3 5 7 9 11 13 15 17 19 21 23 ", "-1", "0 1 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 \n0 1 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 \n0 2 4 6 8 10 12 14 16 18 20 22 24 26 28 30 32 34 36 38 1 3 5 7 9 11 13 15 17 19 21 23 25 27 29 31 33 35 37 ", "-1", "0 1 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 \n0 1 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 \n0 2 4 6 8 10 12 14 16 18 20 22 24 26 28 30 32 34 36 38 40 42 44 46 48 50 52 1 3 5 7 9 11 13 15 17 19 21 23 25 27 29 31 33 35 37 39 41 43 45 47 49 51 ", "-1", "0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 \n0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 \n0 2 4 6 8 10 12 14 16 18 20 22 1 3 5 7 9 11 13 15 17 19 21 ", "0 1 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 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 1...", "-1", "-1", "0 1 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 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 1...", "-1", "0 1 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 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 1...", "-1", "0 1 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 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 1...", "-1", "-1", "-1", "0 1 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 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 1...", "-1", "0 1 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 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 1...", "0 1 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 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 1...", "-1", "0 1 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 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 1...", "-1", "0 1 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 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 1...", "-1", "0 1 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 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 1...", "-1", "0 1 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 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 1...", "-1", "0 1 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 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 1...", "-1", "0 1 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 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 1...", "0 1 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 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 1...", "-1", "0 1 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 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 1...", "0 \n0 \n0 ", "-1", "0 1 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 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 1...", "-1"]} | UNKNOWN | [
"PYTHON3"
] | CODEFORCES | 112 | codeforces |
|
4d8d291a20665d34f57ee85c1c0b09e5 | Nuts | 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.
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.
Print a single integer — the answer to the problem.
Sample Input
3 10 3 3
3 10 1 3
100 100 1 1000
Sample Output
2
3
1
| {"inputs": ["3 10 3 3", "3 10 1 3", "100 100 1 1000", "5 347 20 1", "6 978 10 5", "6 856 50 35", "8 399 13 36", "4 787 48 4", "4 714 7 6", "7 915 12 24", "8 995 3 28", "10 267 4 48", "10 697 1 34", "7 897 49 42", "10 849 3 28", "477 492 438 690", "461 790 518 105", "510 996 830 417", "763 193 388 346", "958 380 405 434", "346 991 4 4", "648 990 5 2", "810 1000 6 5", "683 995 10 1", "307 999 10 7", "974 999 3 4", "60 1000 2 2", "634 993 9 3", "579 990 8 9", "306 993 9 9", "845 996 1 1", "872 997 1 1", "2 990 1 1", "489 992 1 1", "638 1000 1 1", "2 4 1000 1"], "outputs": ["2", "3", "1", "327", "186", "5", "2", "149", "112", "27", "33", "2", "20", "4", "28", "1", "1", "1", "1", "1", "244", "490", "194", "985", "133", "247", "498", "322", "102", "102", "995", "996", "989", "991", "999", "2"]} | UNKNOWN | [
"PYTHON3"
] | CODEFORCES | 66 | codeforces |
|
4d968990515143126bf1c953554bd7af | Bottles | Nick has *n* bottles of soda left after his birthday. Each bottle is described by two values: remaining amount of soda *a**i* and bottle volume *b**i* (*a**i*<=≤<=*b**i*).
Nick has decided to pour all remaining soda into minimal number of bottles, moreover he has to do it as soon as possible. Nick spends *x* seconds to pour *x* units of soda from one bottle to another.
Nick asks you to help him to determine *k* — the minimal number of bottles to store all remaining soda and *t* — the minimal time to pour soda into *k* bottles. A bottle can't store more soda than its volume. All remaining soda should be saved.
The first line contains positive integer *n* (1<=≤<=*n*<=≤<=100) — the number of bottles.
The second line contains *n* positive integers *a*1,<=*a*2,<=...,<=*a**n* (1<=≤<=*a**i*<=≤<=100), where *a**i* is the amount of soda remaining in the *i*-th bottle.
The third line contains *n* positive integers *b*1,<=*b*2,<=...,<=*b**n* (1<=≤<=*b**i*<=≤<=100), where *b**i* is the volume of the *i*-th bottle.
It is guaranteed that *a**i*<=≤<=*b**i* for any *i*.
The only line should contain two integers *k* and *t*, where *k* is the minimal number of bottles that can store all the soda and *t* is the minimal time to pour the soda into *k* bottles.
Sample Input
4
3 3 4 3
4 7 6 5
2
1 1
100 100
5
10 30 5 6 24
10 41 7 8 24
Sample Output
2 6
1 1
3 11
| {"inputs": ["4\n3 3 4 3\n4 7 6 5", "2\n1 1\n100 100", "5\n10 30 5 6 24\n10 41 7 8 24", "1\n1\n100", "1\n100\n100", "1\n50\n100", "10\n18 42 5 1 26 8 40 34 8 29\n18 71 21 67 38 13 99 37 47 76", "20\n24 22 4 34 76 13 78 1 81 51 72 11 25 46 22 33 60 42 25 19\n40 81 10 34 84 16 90 38 99 81 100 19 79 65 26 80 62 47 76 47", "30\n29 3 2 13 3 12 73 22 37 48 59 17 2 13 69 43 32 14 4 2 61 22 40 30 1 4 46 5 65 17\n55 3 3 92 25 27 97 40 55 74 91 31 7 33 72 62 61 40 16 2 70 61 67 72 8 5 48 9 75 84", "40\n9 18 41 31 27 24 76 32 4 38 1 35 21 3 26 32 31 13 41 31 39 14 45 15 12 5 7 14 3 14 19 11 1 81 1 4 7 28 4 62\n70 21 95 63 66 30 100 42 4 80 83 39 34 6 27 55 72 38 43 48 81 53 54 30 63 23 9 59 3 83 83 95 1 81 30 40 35 58 8 66", "50\n48 29 72 22 99 27 40 23 39 4 46 29 39 16 47 35 79 7 15 23 50 34 35 22 9 2 51 10 2 42 4 3 30 2 72 19 50 20 11 29 1 2 1 7 7 6 7 75 40 69\n81 36 76 26 100 41 99 39 52 73 83 51 54 86 73 49 79 27 83 90 100 40 49 81 22 54 85 21 26 79 36 96 73 10 98 31 65 39 89 39 1 32 5 20 71 39 87 80 60 86", "60\n3 3 22 46 23 19 2 27 3 26 34 18 8 50 13 18 23 26 9 14 7 2 17 12 63 25 4 71 14 47 70 13 6 38 28 22 94 10 51 7 29 1 54 12 8 5 4 34 11 24 2 14 54 65 11 30 3 23 12 11\n4 54 69 97 45 53 2 41 4 74 78 66 85 59 19 38 82 28 11 41 15 43 41 43 77 77 50 75 46 66 97 93 50 44 69 22 94 23 61 27 44 1 56 25 31 63 8 37 23 57 6 17 54 68 14 40 43 31 31 60", "70\n17 70 52 31 15 51 8 38 3 43 2 34 7 16 58 29 73 23 41 88 9 24 24 90 33 84 10 29 67 17 47 72 11 79 22 5 8 65 23 7 29 31 11 42 11 14 9 3 54 22 38 34 2 4 39 13 11 34 3 35 22 18 3 57 23 21 13 23 78 7\n18 72 58 55 87 56 9 39 60 79 74 82 9 39 66 32 89 25 46 95 26 31 28 94 36 96 19 37 77 61 50 82 22 81 37 9 11 96 33 12 90 74 11 42 88 86 24 3 85 31 82 81 3 7 69 47 27 51 49 98 33 40 5 94 83 35 21 24 89 49", "80\n2 8 36 12 22 41 1 42 6 66 62 94 37 1 5 1 82 8 9 31 14 8 15 5 21 8 5 22 1 17 1 44 1 12 8 45 37 38 13 4 13 4 8 8 3 15 13 53 22 8 19 14 16 7 7 49 1 10 31 33 7 47 61 6 9 48 6 25 16 4 43 1 5 34 8 22 31 38 59 45\n33 90 47 22 28 67 4 44 13 76 65 94 40 8 12 21 88 15 74 37 37 22 19 53 91 26 88 99 1 61 3 75 2 14 8 96 41 76 13 96 41 44 66 48 40 17 41 60 48 9 62 46 56 46 31 63 6 84 68 43 7 88 62 36 52 92 23 27 46 87 52 9 50 44 33 30 33 63 79 72", "90\n4 2 21 69 53 39 2 2 8 58 7 5 2 82 7 9 13 10 2 44 1 7 2 1 50 42 36 17 14 46 19 1 50 20 51 46 9 59 73 61 76 4 19 22 1 43 53 2 5 5 32 7 5 42 30 14 32 6 6 15 20 24 13 8 5 19 9 9 7 20 7 2 55 36 5 33 64 20 22 22 9 30 67 38 68 2 13 19 2 9\n48 4 39 85 69 70 11 42 65 77 61 6 60 84 67 15 99 12 2 84 51 17 10 3 50 45 57 53 20 52 64 72 74 44 80 83 70 61 82 81 88 17 22 53 1 44 66 21 10 84 39 11 5 77 93 74 90 17 83 85 70 36 28 87 6 48 22 23 100 22 97 64 96 89 52 49 95 93 34 37 18 69 69 43 83 70 14 54 2 30", "10\n96 4 51 40 89 36 35 38 4 82\n99 8 56 42 94 46 35 43 4 84", "20\n59 35 29 57 85 70 26 53 56 3 11 56 43 20 81 72 77 72 36 61\n67 53 80 69 100 71 30 63 60 3 20 56 75 23 97 80 81 85 49 80", "30\n33 4 1 42 86 85 35 51 45 88 23 35 79 92 81 46 47 32 41 17 18 36 28 58 31 15 17 38 49 78\n36 4 1 49 86 86 43 51 64 93 24 42 82 98 92 47 56 41 41 25 20 53 32 61 53 26 20 38 49 98", "40\n31 72 17 63 89 13 72 42 39 30 23 29 5 61 88 37 7 23 49 32 41 25 17 15 9 25 30 61 29 66 24 40 75 67 69 22 61 22 13 35\n32 73 20 68 98 13 74 79 41 33 27 85 5 68 95 44 9 24 95 36 45 26 20 31 10 53 37 72 51 84 24 59 80 75 74 22 72 27 13 39", "50\n72 9 46 38 43 75 63 73 70 11 9 48 32 93 33 24 46 44 27 78 43 2 26 84 42 78 35 34 76 36 67 79 82 63 17 26 30 43 35 34 54 37 13 65 8 37 8 8 70 79\n96 19 54 54 44 75 66 80 71 12 9 54 38 95 39 25 48 52 39 86 44 2 27 99 54 99 35 44 80 36 86 93 98 73 27 30 39 43 80 34 61 38 13 69 9 37 8 9 75 97", "60\n70 19 46 34 43 19 75 42 47 14 66 64 63 58 55 79 38 45 49 80 72 54 96 26 63 41 12 55 14 56 79 51 12 9 14 77 70 75 46 27 45 10 76 59 40 67 55 24 26 90 50 75 12 93 27 39 46 58 66 31\n73 23 48 49 53 23 76 62 65 14 67 89 66 71 59 90 40 47 68 82 81 61 96 48 99 53 13 60 21 63 83 75 15 12 16 80 74 87 66 31 45 12 76 61 45 88 55 32 28 90 50 75 12 94 29 51 57 85 84 38", "70\n67 38 59 72 9 64 12 3 51 58 50 4 16 46 62 77 58 73 7 92 48 9 90 50 35 9 61 57 50 20 48 61 27 77 47 6 83 28 78 14 68 32 2 2 22 57 34 71 26 74 3 76 41 66 30 69 34 16 29 7 14 19 11 5 13 66 19 19 17 55\n69 41 84 91 10 77 12 7 70 74 55 7 30 63 66 79 89 88 10 93 89 15 91 81 41 26 65 67 55 37 73 94 34 94 47 6 90 31 100 25 69 33 2 3 43 97 37 95 35 85 3 78 50 86 30 73 34 21 32 13 21 32 11 5 13 80 23 20 17 58", "80\n36 80 23 45 68 72 2 69 84 33 3 43 6 64 82 54 15 15 17 4 3 29 74 14 53 50 52 27 32 18 60 62 50 29 28 48 77 11 24 17 3 55 58 20 4 32 55 16 27 60 5 77 23 31 11 60 21 65 38 39 82 58 51 78 24 30 75 79 5 41 94 10 14 7 1 26 21 41 6 52\n37 93 24 46 99 74 2 93 86 33 3 44 6 71 88 65 15 19 24 4 3 40 82 14 62 81 56 30 33 30 62 62 70 29 31 53 78 13 27 31 3 65 61 20 5 41 58 25 27 61 6 87 26 31 13 62 25 71 44 45 82 75 62 95 24 44 82 94 6 50 94 10 15 15 1 29 35 60 8 68", "10\n5 12 10 18 10 9 2 20 5 20\n70 91 36 94 46 15 10 73 55 43", "20\n8 1 44 1 12 1 9 11 1 1 5 2 9 16 16 2 1 5 4 1\n88 2 80 33 55 3 74 61 17 11 11 16 42 81 88 14 4 81 60 10", "30\n10 1 8 10 2 6 45 7 3 7 1 3 1 1 14 2 5 19 4 1 13 3 5 6 1 5 1 1 23 1\n98 4 43 41 56 58 85 51 47 55 20 85 93 12 49 15 95 72 20 4 68 24 16 97 21 52 18 69 89 15", "40\n10 32 10 7 10 6 25 3 18 4 24 4 8 14 6 15 11 8 2 8 2 5 19 9 5 5 3 34 5 1 6 6 1 4 5 26 34 2 21 1\n35 66 54 11 58 68 75 12 69 94 80 33 23 48 45 66 94 53 25 53 83 30 64 49 69 84 73 85 26 41 10 65 23 56 58 93 58 7 100 7", "50\n2 1 2 2 38 19 1 2 7 1 2 5 5 1 14 53 21 1 17 9 4 1 24 8 1 1 1 5 4 14 37 1 15 1 4 15 1 3 3 16 17 1 10 18 36 14 25 8 8 48\n45 24 8 12 83 37 6 20 88 9 10 11 28 9 60 98 76 20 84 95 15 45 74 48 37 2 46 34 99 57 94 70 31 22 11 88 58 25 20 73 64 64 81 80 59 64 92 31 43 89", "60\n9 9 11 16 58 6 25 6 3 23 1 14 1 8 4 2 1 18 10 1 13 4 23 1 38 6 1 13 5 1 1 1 2 1 1 17 1 24 18 20 2 1 9 26 1 12 3 6 7 17 18 1 2 9 3 6 3 30 7 12\n47 82 78 52 99 51 90 23 58 49 2 98 100 60 25 60 6 69 79 6 91 47 69 18 99 46 30 51 11 3 42 17 33 61 14 81 16 76 72 94 13 5 51 88 26 43 80 31 26 70 93 76 18 67 25 86 60 81 40 38", "70\n20 7 5 7 3 10 1 14 33 1 5 3 4 21 7 7 1 2 2 2 8 15 18 2 7 1 1 1 15 2 27 2 6 21 4 2 7 5 1 6 13 36 13 1 10 5 8 13 24 2 10 16 11 9 4 1 1 8 6 26 9 3 3 2 8 5 17 9 1 13\n85 36 76 36 65 24 37 56 78 42 33 13 29 93 31 38 1 59 71 31 28 55 70 14 33 9 1 5 41 22 86 41 92 89 88 10 39 54 6 32 58 82 49 22 62 44 29 19 54 12 59 54 51 80 66 16 22 74 8 68 35 34 24 8 22 14 55 76 32 75", "80\n11 6 9 6 5 18 21 11 6 6 2 9 4 1 10 12 2 9 1 14 6 12 16 14 4 5 1 16 3 4 6 1 11 30 2 4 1 11 1 6 1 3 2 14 6 14 13 1 10 2 4 14 11 8 28 2 2 3 1 6 26 3 11 4 1 1 29 4 5 4 3 5 1 4 2 12 59 3 18 1\n94 43 36 86 12 75 50 80 55 14 5 97 17 25 28 86 51 56 17 88 48 40 31 39 51 58 4 75 70 30 11 8 61 88 10 25 35 46 31 51 20 79 22 54 19 67 31 89 42 70 30 37 35 78 95 31 31 51 31 50 54 90 63 27 6 2 92 80 48 9 27 33 61 63 30 38 95 46 86 45", "90\n1 9 3 3 14 3 2 32 17 3 1 1 4 1 18 1 1 21 9 1 2 10 6 9 27 15 5 1 3 37 1 2 1 12 6 1 8 4 1 5 1 3 8 9 1 9 23 1 1 2 1 2 2 19 2 6 5 6 1 7 12 35 1 2 8 1 11 32 7 4 12 9 18 8 9 27 31 15 16 4 16 13 2 2 1 4 12 17 10 1\n8 52 13 56 42 40 8 98 64 47 84 11 12 1 97 8 8 66 35 4 6 62 22 38 68 57 50 28 28 88 7 57 9 81 14 37 71 57 33 24 2 21 54 58 58 27 79 3 55 13 2 95 17 97 61 22 28 85 78 72 68 80 12 41 98 18 35 70 40 22 98 85 51 70 79 100 68 29 73 45 89 64 53 6 16 29 73 53 24 69", "32\n4 1 1 6 2 5 8 6 5 6 3 2 1 3 1 9 1 2 1 5 2 1 6 5 3 7 3 3 2 5 1 1\n8 1 3 6 4 7 9 8 6 8 10 2 5 3 2 10 1 10 9 5 4 1 8 7 8 7 4 10 4 6 9 2", "38\n2 1 1 1 1 9 5 2 1 3 4 3 1 7 4 4 8 7 1 5 4 9 1 6 3 4 1 4 1 5 5 1 8 3 1 3 6 3\n2 1 6 2 9 10 6 2 1 5 4 6 1 7 4 6 10 8 8 6 4 10 1 6 4 4 6 4 4 8 5 2 10 7 3 5 6 3", "35\n9 7 34 3 2 6 36 3 26 12 17 8 5 32 55 10 24 19 2 3 30 17 14 1 33 36 42 14 51 1 2 22 13 34 28\n9 9 55 17 16 12 37 14 27 58 51 16 10 37 69 15 43 26 14 60 86 34 54 1 37 50 58 18 92 66 7 24 25 92 30", "35\n21 2 68 56 41 25 42 17 21 20 29 26 38 37 29 77 43 13 32 48 38 31 15 8 52 6 63 45 70 2 21 13 3 14 47\n46 83 100 87 59 95 47 33 56 60 38 76 63 75 60 92 65 43 56 94 70 80 46 40 64 6 83 50 75 19 52 66 13 88 62", "69\n24 32 19 37 36 7 15 10 54 12 15 46 3 25 12 16 3 8 55 21 23 57 17 45 11 4 25 35 39 3 69 24 78 40 12 39 1 44 4 75 53 60 1 6 30 7 6 39 44 13 31 6 4 4 32 11 52 58 81 2 33 7 29 19 21 26 22 60 24\n57 56 50 64 40 58 31 20 81 14 43 64 48 38 56 71 58 26 98 92 52 88 71 93 11 20 79 39 56 7 92 54 88 58 19 85 12 71 4 87 78 90 29 18 89 13 86 71 100 24 65 95 46 8 91 35 62 66 96 36 80 24 81 58 53 86 89 67 73", "63\n8 23 6 19 1 34 23 1 15 58 22 10 5 14 41 1 16 48 68 5 13 19 1 4 35 2 42 8 45 24 52 44 59 78 5 11 14 41 10 26 60 26 9 15 34 1 14 5 2 6 19 7 4 26 49 39 13 40 18 62 66 8 4\n17 25 39 45 2 44 40 1 82 68 80 27 7 58 90 20 100 80 79 21 53 62 2 11 51 98 78 55 48 37 89 74 83 91 64 30 20 50 24 74 81 94 33 64 56 28 57 9 27 50 81 34 18 33 53 61 39 89 44 77 86 40 89", "73\n69 67 34 35 10 27 30 27 31 48 25 18 81 54 32 54 5 62 20 4 94 2 60 4 6 11 62 68 14 18 42 18 33 71 72 2 29 7 36 60 10 25 17 2 38 77 34 36 74 76 63 32 42 29 22 14 5 1 6 2 14 19 20 19 41 31 16 17 50 49 2 22 51\n73 70 58 54 10 71 59 35 91 61 52 65 90 70 37 80 12 94 78 34 97 4 62 95 10 11 93 100 14 38 56 42 96 96 84 71 69 43 50 79 11 83 95 76 39 79 61 42 89 90 71 62 43 38 39 21 5 40 27 13 21 73 30 46 47 34 23 22 57 59 6 25 72", "90\n1 43 87 1 6 12 49 6 3 9 38 1 64 49 11 18 5 1 46 25 30 82 17 4 8 9 5 5 4 1 10 4 13 42 44 90 1 11 27 23 25 4 12 19 48 3 59 48 39 14 1 5 64 46 39 24 28 77 25 20 3 14 28 2 20 63 2 1 13 11 44 49 61 76 20 1 3 42 38 8 69 17 27 18 29 54 2 1 2 7\n8 96 91 1 11 20 83 34 41 88 54 4 65 82 48 60 62 18 76 74 75 89 87 8 11 32 67 7 5 1 92 88 57 92 76 95 35 58 68 23 30 25 12 31 85 5 89 84 71 23 1 5 76 56 57 57 76 94 33 34 66 20 54 5 22 69 2 19 28 62 74 88 91 86 30 6 3 48 80 10 84 20 44 37 81 100 12 3 6 8", "85\n20 47 52 6 5 15 35 42 5 84 4 8 61 47 7 50 20 24 15 27 86 28 1 39 1 2 63 2 31 33 47 4 33 68 20 4 4 42 20 67 7 10 46 4 22 36 30 40 4 15 51 2 39 50 65 48 34 6 50 19 32 48 8 23 42 70 69 8 29 81 5 1 7 21 3 30 78 6 2 1 3 69 34 34 18\n74 64 89 61 5 17 75 43 13 87 30 51 93 54 7 76 44 44 98 77 86 97 1 41 1 3 69 3 80 87 67 6 90 100 31 5 7 46 99 67 9 44 56 7 39 39 55 80 80 33 77 9 89 79 86 53 49 49 72 87 43 84 24 23 43 94 74 17 54 96 28 64 14 42 91 60 87 69 20 1 30 95 44 50 20", "81\n21 13 1 25 14 33 33 41 53 89 2 18 61 8 3 35 15 59 2 2 3 5 75 37 1 34 7 12 33 66 6 4 14 78 3 16 12 45 3 2 1 17 17 45 4 30 68 40 44 3 1 21 64 63 14 19 75 63 7 9 12 75 20 28 16 20 53 26 13 46 18 8 28 32 9 29 1 11 75 4 21\n45 90 21 31 36 68 71 47 59 89 61 32 98 67 7 53 90 86 6 28 4 83 93 62 8 56 18 35 33 92 36 37 23 98 44 21 23 79 10 4 2 18 48 87 29 86 79 74 45 3 6 23 79 71 17 39 88 73 50 15 13 92 33 47 83 48 73 33 15 63 43 14 90 72 9 95 1 22 83 20 29", "2\n1 1\n1 1", "1\n1\n1", "1\n1\n2", "2\n1 1\n1 100", "2\n1 1\n100 1", "86\n5 1 3 1 1 1 1 9 4 1 3 1 4 6 3 2 2 7 1 1 3 1 2 1 1 5 4 3 6 3 3 4 8 2 1 3 1 2 7 2 5 4 2 1 1 2 1 3 2 9 1 4 2 1 1 9 6 1 8 1 7 9 4 3 4 1 3 1 1 3 1 1 3 1 1 10 7 7 4 1 1 3 1 6 1 3\n10 2 5 7 1 4 7 9 4 7 3 1 5 6 3 8 4 10 5 1 9 3 4 2 1 5 7 4 7 7 7 5 9 5 3 3 6 4 7 2 9 7 3 4 2 3 1 5 6 9 10 4 8 10 10 9 7 8 10 1 7 10 10 7 8 5 8 2 1 4 1 2 3 8 1 10 9 7 4 2 1 3 4 9 2 3", "90\n9 2 2 3 4 1 9 8 3 3 1 1 1 1 2 2 1 3 4 8 8 1 2 7 3 4 5 6 1 2 9 4 2 5 6 1 1 2 6 5 1 4 3 2 4 1 1 3 1 1 3 1 8 3 1 4 1 2 2 3 5 2 8 6 2 5 2 1 4 2 1 5 4 2 1 1 2 1 1 6 4 4 3 4 1 4 4 6 2 3\n10 6 2 3 10 1 10 10 6 4 1 3 6 1 2 5 3 7 7 9 9 2 3 8 3 4 9 7 8 4 10 7 8 10 9 5 1 4 6 5 1 9 10 4 6 4 1 3 3 1 6 1 9 4 1 6 4 5 5 10 7 9 9 10 4 5 2 1 4 2 1 7 6 5 3 9 2 5 1 8 6 4 6 10 1 7 5 9 6 4", "33\n33 20 33 40 58 50 5 6 13 12 4 33 11 50 12 19 16 36 68 57 23 17 6 22 39 58 49 21 10 35 35 17 12\n62 22 53 44 66 60 97 7 33 18 10 59 33 77 55 63 91 86 87 86 27 62 65 53 46 69 64 63 10 53 52 23 24", "83\n13 20 5 29 48 53 88 17 11 5 44 15 85 13 2 55 6 16 57 29 12 15 12 92 21 25 1 2 4 5 2 22 8 18 22 2 3 10 43 71 3 41 1 73 6 18 32 63 26 13 6 75 19 10 41 30 15 12 14 8 15 77 73 7 5 39 83 19 2 2 3 61 53 43 3 15 76 29 8 46 19 3 8\n54 34 15 58 50 67 100 43 30 15 46 26 94 75 2 58 85 38 68 98 83 51 82 100 61 27 5 5 41 89 17 34 10 48 48 4 15 13 71 75 4 44 2 82 18 82 59 96 26 13 66 95 81 33 85 45 16 92 41 37 85 78 83 17 7 72 83 38 69 24 18 76 71 66 3 66 78 31 73 72 43 89 49", "70\n13 42 8 56 21 58 39 2 49 39 15 26 62 45 26 8 47 40 9 36 41 2 4 38 6 55 2 41 72 18 10 2 6 11 4 39 19 39 14 59 5 42 19 79 12 3 1 1 21 6 5 9 36 6 38 2 7 26 8 15 66 7 1 30 93 34 45 24 12 20\n26 56 25 60 26 79 99 7 68 92 99 32 81 48 39 97 49 95 18 82 59 4 99 41 10 63 43 54 76 97 73 7 17 43 4 84 35 86 20 63 8 59 87 80 34 3 8 13 49 55 14 11 68 8 41 33 14 39 43 31 89 13 7 88 93 51 84 73 26 30", "77\n19 34 39 56 1 2 47 8 17 28 23 45 18 7 5 3 11 20 30 24 13 34 11 1 4 14 68 23 13 33 3 8 1 5 8 23 12 1 19 14 22 67 26 55 10 1 63 82 82 6 38 5 6 11 1 62 1 12 5 40 19 20 37 9 5 3 2 44 13 20 44 32 11 29 12 19 35\n28 41 43 68 1 36 57 13 84 89 26 92 47 19 7 94 79 75 74 42 32 44 46 23 96 46 82 86 91 33 25 11 12 68 22 31 89 14 81 32 50 94 27 66 50 39 98 90 91 11 69 6 45 19 15 74 22 31 7 92 23 98 88 32 8 4 2 51 79 69 70 43 16 60 29 20 98", "77\n44 2 13 14 8 46 65 14 1 39 12 18 15 10 2 40 71 40 17 1 16 72 13 7 41 23 81 12 4 1 19 18 41 35 23 56 21 5 17 47 88 1 24 15 48 15 1 13 50 5 31 16 21 47 4 1 49 2 15 23 46 47 27 22 23 40 29 4 30 50 51 12 20 14 41 25 12\n57 16 72 59 28 80 74 19 4 60 52 52 97 20 5 69 84 66 63 38 50 79 24 84 58 92 99 36 38 97 66 79 41 48 26 95 28 38 28 72 95 71 30 15 63 17 7 69 90 29 89 40 21 83 73 24 51 14 15 74 100 88 74 27 46 61 38 4 32 52 52 51 47 51 81 75 19"], "outputs": ["2 6", "1 1", "3 11", "1 0", "1 0", "1 0", "3 100", "9 217", "10 310", "11 560", "17 563", "19 535", "26 756", "21 909", "25 955", "8 8", "13 187", "22 123", "24 290", "34 283", "42 368", "38 484", "50 363", "2 71", "2 90", "3 122", "5 281", "6 337", "7 368", "7 426", "8 434", "8 562", "13 46", "19 40", "10 307", "14 432", "22 801", "18 638", "30 808", "26 899", "29 987", "26 754", "2 0", "1 0", "1 0", "1 1", "1 1", "32 101", "35 109", "13 356", "26 944", "21 867", "19 937", "24 932"]} | UNKNOWN | [
"PYTHON3"
] | CODEFORCES | 16 | codeforces |
|
4d9ab805a078033afdc5d734124742b1 | Bank Hacking | Although Inzane successfully found his beloved bone, Zane, his owner, has yet to return. To search for Zane, he would need a lot of money, of which he sadly has none. To deal with the problem, he has decided to hack the banks.
There are *n* banks, numbered from 1 to *n*. There are also *n*<=-<=1 wires connecting the banks. All banks are initially online. Each bank also has its initial strength: bank *i* has initial strength *a**i*.
Let us define some keywords before we proceed. Bank *i* and bank *j* are neighboring if and only if there exists a wire directly connecting them. Bank *i* and bank *j* are semi-neighboring if and only if there exists an online bank *k* such that bank *i* and bank *k* are neighboring and bank *k* and bank *j* are neighboring.
When a bank is hacked, it becomes offline (and no longer online), and other banks that are neighboring or semi-neighboring to it have their strengths increased by 1.
To start his plan, Inzane will choose a bank to hack first. Indeed, the strength of such bank must not exceed the strength of his computer. After this, he will repeatedly choose some bank to hack next until all the banks are hacked, but he can continue to hack bank *x* if and only if all these conditions are met:
1. Bank *x* is online. That is, bank *x* is not hacked yet. 1. Bank *x* is neighboring to some offline bank. 1. The strength of bank *x* is less than or equal to the strength of Inzane's computer.
Determine the minimum strength of the computer Inzane needs to hack all the banks.
The first line contains one integer *n* (1<=≤<=*n*<=≤<=3·105) — the total number of banks.
The second line contains *n* integers *a*1,<=*a*2,<=...,<=*a**n* (<=-<=109<=≤<=*a**i*<=≤<=109) — the strengths of the banks.
Each of the next *n*<=-<=1 lines contains two integers *u**i* and *v**i* (1<=≤<=*u**i*,<=*v**i*<=≤<=*n*, *u**i*<=≠<=*v**i*) — meaning that there is a wire directly connecting banks *u**i* and *v**i*.
It is guaranteed that the wires connect the banks in such a way that Inzane can somehow hack all the banks using a computer with appropriate strength.
Print one integer — the minimum strength of the computer Inzane needs to accomplish the goal.
Sample Input
5
1 2 3 4 5
1 2
2 3
3 4
4 5
7
38 -29 87 93 39 28 -55
1 2
2 5
3 2
2 4
1 7
7 6
5
1 2 7 6 7
1 5
5 3
3 4
2 4
Sample Output
5938 | {"inputs": ["5\n1 2 3 4 5\n1 2\n2 3\n3 4\n4 5", "7\n38 -29 87 93 39 28 -55\n1 2\n2 5\n3 2\n2 4\n1 7\n7 6", "5\n1 2 7 6 7\n1 5\n5 3\n3 4\n2 4", "3\n2 2 2\n3 2\n1 2", "3\n999397 999397 999397\n2 3\n2 1", "5\n1000000000 0 1000000000 0 1000000000\n1 2\n2 3\n3 4\n4 5", "10\n-1000000000 -1000000000 -1000000000 -1000000000 -1000000000 -1000000000 -1000000000 -1000000000 -1000000000 -1000000000\n10 3\n7 4\n2 6\n9 2\n5 10\n1 8\n7 8\n7 2\n10 6", "1\n0", "2\n0 0\n2 1", "3\n0 0 0\n1 3\n2 3", "1\n0", "2\n0 0\n2 1", "2\n0 1\n2 1", "3\n0 0 0\n1 3\n2 3", "3\n1 0 0\n2 1\n3 2", "3\n-2 -2 2\n1 3\n2 1", "4\n0 0 0 0\n2 4\n1 4\n3 2", "4\n0 0 0 -1\n3 1\n4 1\n2 4", "4\n1 -2 2 2\n4 3\n2 4\n1 2", "5\n0 0 0 0 0\n3 2\n1 2\n5 1\n4 2", "5\n-1 -1 -1 0 0\n4 3\n5 3\n1 4\n2 5", "5\n-2 -1 -2 1 0\n3 1\n5 1\n2 1\n4 2", "1\n-1000000000", "2\n-1000000000 -1000000000\n2 1", "2\n-999999999 -1000000000\n1 2", "3\n-1000000000 -1000000000 -1000000000\n3 1\n2 1", "3\n-1000000000 -999999999 -1000000000\n1 2\n3 1", "3\n-999999999 -999999998 -1000000000\n2 3\n1 2", "1\n1000000000", "2\n1000000000 1000000000\n2 1", "2\n999999999 1000000000\n2 1", "3\n1000000000 1000000000 1000000000\n1 3\n2 1", "3\n999999999 1000000000 1000000000\n2 1\n3 2", "3\n999999998 999999998 999999998\n1 3\n2 1", "3\n1000000000 -1000000000 1000000000\n1 2\n2 3", "4\n1000000000 -1000000000 -1000000000 1000000000\n1 2\n3 2\n4 3", "1\n-1000000000", "2\n-1000000000 -1\n1 2", "3\n-1 -1000000000 -1000000000\n2 1\n3 1", "5\n-1 -1000000000 -1 -2 -1\n5 2\n1 2\n3 2\n4 1", "10\n-2 -1000000000 -2 -1000000000 -2 -5 -3 -1 -2 -1000000000\n8 6\n10 6\n5 10\n3 10\n7 5\n2 8\n1 6\n4 1\n9 5", "4\n1 2 2 2\n1 2\n1 3\n1 4", "5\n1 1 7 7 7\n1 3\n2 3\n3 4\n4 5", "3\n10 1 10\n1 2\n2 3", "3\n8 7 8\n1 2\n2 3", "1\n-11", "6\n10 1 10 1 1 1\n1 2\n2 3\n3 4\n4 5\n5 6", "3\n7 6 7\n1 2\n2 3", "7\n5 0 0 0 0 5 5\n1 2\n1 3\n1 4\n1 5\n4 6\n4 7", "4\n7 1 1 7\n1 2\n1 3\n3 4", "6\n5 5 5 4 4 4\n1 2\n1 3\n3 4\n3 5\n3 6", "4\n1 93 93 93\n1 2\n1 3\n1 4", "3\n2 1 2\n1 2\n2 3", "6\n10 10 10 1 1 1\n1 2\n2 3\n3 4\n1 5\n1 6"], "outputs": ["5", "93", "8", "3", "999398", "1000000002", "-999999998", "0", "1", "1", "0", "1", "1", "1", "2", "2", "2", "2", "3", "2", "1", "2", "-1000000000", "-999999999", "-999999999", "-999999999", "-999999998", "-999999998", "1000000000", "1000000001", "1000000000", "1000000001", "1000000001", "999999999", "1000000001", "1000000002", "-1000000000", "-1", "-1", "0", "0", "3", "8", "11", "9", "-11", "11", "8", "6", "8", "6", "94", "3", "11"]} | UNKNOWN | [
"PYTHON3"
] | CODEFORCES | 7 | codeforces |
|
4dc3104dd6c4d9f7b9c8e2f32e3e753a | Letters Cyclic Shift | You are given a non-empty string *s* consisting of lowercase English letters. You have to pick exactly one non-empty substring of *s* and shift all its letters 'z' 'y' 'x' 'b' 'a' 'z'. In other words, each character is replaced with the previous character of English alphabet and 'a' is replaced with 'z'.
What is the lexicographically minimum string that can be obtained from *s* by performing this shift exactly once?
The only line of the input contains the string *s* (1<=≤<=|*s*|<=≤<=100<=000) consisting of lowercase English letters.
Print the lexicographically minimum string that can be obtained from *s* by shifting letters of exactly one non-empty substring.
Sample Input
codeforces
abacaba
Sample Output
bncdenqbdr
aaacaba
| {"inputs": ["codeforces", "abacaba", "babbbabaababbaa", "bcbacaabcababaccccaaaabacbbcbbaa", "cabaccaacccabaacdbdcbcdbccbccbabbdadbdcdcdbdbcdcdbdadcbcda", "a", "eeeedddccbceaabdaecaebaeaecccbdeeeaadcecdbeacecdcdcceabaadbcbbadcdaeddbcccaaeebccecaeeeaebcaaccbdaccbdcadadaaeacbbdcbaeeaecedeeeedadec", "fddfbabadaadaddfbfecadfaefaefefabcccdbbeeabcbbddefbafdcafdfcbdffeeaffcaebbbedabddeaecdddffcbeaafffcddccccfffdbcddcfccefafdbeaacbdeeebdeaaacdfdecadfeafaeaefbfdfffeeaefebdceebcebbfeaccfafdccdcecedeedadcadbfefccfdedfaaefabbaeebdebeecaadbebcfeafbfeeefcfaecadfe", "aaaaaaaaaa", "abbabaaaaa", "bbbbbbbbbbbb", "aabaaaaaaaaaaaa", "aaaaaaaaaaaaaaaaaaaa", "abaabaaaaaabbaaaaaaabaaaaaaaaabaaaabaaaaaaabaaaaaaaaaabaaaaaaaaaaaaaaabaaaabbaaaaabaaaaaaaabaaaaaaaa", "abbbbbbbabbbbbbbbbbbbbbbbbbbbbbbabbabbbbbabbbbbbbbbbbabbbbbbbbabbabbbbbbbbbbbbbbabbabbbaababbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbabbabbbbbbbbbbbbbbbbabbbbabbbbbbbbbbbbbbbabbbbbbbbbaababbbbbbbbabbbbbbbbbbbbbbbbbbbbbbbbbbbbabbbbbbbbbbbbbbbbbbbbabbabbbbbbbbbbbbbbbbabbbabbbbbaabbabbbbbbbbbbbbbbbbbbbbbbbbbbbbbabbbbbbbbbbbbbbbbaabbbbbbbbbbbbababbabbbbbbbbbbbbbbbbbbbbbbbbabbbbbbbbbbbbbbbabbbbbbbbbbbabbbbbbbbbbbbbbbbbbbbbbabbbbbbbabbbbbbb", "aaaaa", "aaa", "aa"], "outputs": ["bncdenqbdr", "aaacaba", "aabbbabaababbaa", "abaacaabcababaccccaaaabacbbcbbaa", "babaccaacccabaacdbdcbcdbccbccbabbdadbdcdcdbdbcdcdbdadcbcda", "z", "ddddcccbbabdaabdaecaebaeaecccbdeeeaadcecdbeacecdcdcceabaadbcbbadcdaeddbcccaaeebccecaeeeaebcaaccbdaccbdcadadaaeacbbdcbaeeaecedeeeedadec", "ecceaabadaadaddfbfecadfaefaefefabcccdbbeeabcbbddefbafdcafdfcbdffeeaffcaebbbedabddeaecdddffcbeaafffcddccccfffdbcddcfccefafdbeaacbdeeebdeaaacdfdecadfeafaeaefbfdfffeeaefebdceebcebbfeaccfafdccdcecedeedadcadbfefccfdedfaaefabbaeebdebeecaadbebcfeafbfeeefcfaecadfe", "aaaaaaaaaz", "aaaabaaaaa", "aaaaaaaaaaaa", "aaaaaaaaaaaaaaa", "aaaaaaaaaaaaaaaaaaaz", "aaaabaaaaaabbaaaaaaabaaaaaaaaabaaaabaaaaaaabaaaaaaaaaabaaaaaaaaaaaaaaabaaaabbaaaaabaaaaaaaabaaaaaaaa", "aaaaaaaaabbbbbbbbbbbbbbbbbbbbbbbabbabbbbbabbbbbbbbbbbabbbbbbbbabbabbbbbbbbbbbbbbabbabbbaababbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbabbabbbbbbbbbbbbbbbbabbbbabbbbbbbbbbbbbbbabbbbbbbbbaababbbbbbbbabbbbbbbbbbbbbbbbbbbbbbbbbbbbabbbbbbbbbbbbbbbbbbbbabbabbbbbbbbbbbbbbbbabbbabbbbbaabbabbbbbbbbbbbbbbbbbbbbbbbbbbbbbabbbbbbbbbbbbbbbbaabbbbbbbbbbbbababbabbbbbbbbbbbbbbbbbbbbbbbbabbbbbbbbbbbbbbbabbbbbbbbbbbabbbbbbbbbbbbbbbbbbbbbbabbbbbbbabbbbbbb", "aaaaz", "aaz", "az"]} | UNKNOWN | [
"PYTHON3"
] | CODEFORCES | 56 | codeforces |
|
4e08ca09a438f1950115137022731cbe | Pens And Days Of Week | Stepan has *n* pens. Every day he uses them, and on the *i*-th day he uses the pen number *i*. On the (*n*<=+<=1)-th day again he uses the pen number 1, on the (*n*<=+<=2)-th — he uses the pen number 2 and so on.
On every working day (from Monday to Saturday, inclusive) Stepan spends exactly 1 milliliter of ink of the pen he uses that day. On Sunday Stepan has a day of rest, he does not stend the ink of the pen he uses that day.
Stepan knows the current volume of ink in each of his pens. Now it's the Monday morning and Stepan is going to use the pen number 1 today. Your task is to determine which pen will run out of ink before all the rest (that is, there will be no ink left in it), if Stepan will use the pens according to the conditions described above.
The first line contains the integer *n* (1<=≤<=*n*<=≤<=50<=000) — the number of pens Stepan has.
The second line contains the sequence of integers *a*1,<=*a*2,<=...,<=*a**n* (1<=≤<=*a**i*<=≤<=109), where *a**i* is equal to the number of milliliters of ink which the pen number *i* currently has.
Print the index of the pen which will run out of ink before all (it means that there will be no ink left in it), if Stepan will use pens according to the conditions described above.
Pens are numbered in the order they are given in input data. The numeration begins from one.
Note that the answer is always unambiguous, since several pens can not end at the same time.
Sample Input
3
3 3 3
5
5 4 5 4 4
Sample Output
2
5
| {"inputs": ["3\n3 3 3", "5\n5 4 5 4 4", "28\n2033 2033 2033 2033 2033 2033 2033 2033 2033 2033 2033 2033 2033 2033 2033 2033 2033 2033 2033 2033 2033 2033 2033 2033 2033 2033 2033 2033", "7\n10 10 10 10 10 10 10", "28\n1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000", "21\n996 995 996 996 996 996 995 996 996 995 996 996 995 996 995 995 995 995 996 996 996", "28\n2033 2033 2034 2033 2034 2034 2033 2034 2033 2034 2033 2034 2034 2033 2033 2034 2034 2033 2034 2034 2034 2033 2034 2033 2034 2034 2034 2034", "1\n1", "1\n2", "1\n1123", "1\n1000000000", "2\n1000000000 1000000000", "2\n999999999 999999999", "3\n1000000000 1000000000 1000000000", "3\n999999999 1000000000 1000000000", "4\n1000000000 1000000000 1000000000 1000000000", "4\n999999999 999999999 999999999 999999999", "5\n1000000000 1000000000 1000000000 1000000000 1000000000", "5\n999999999 1000000000 999999999 1000000000 999999999", "6\n1000000000 1000000000 1000000000 1000000000 1000000000 1000000000", "6\n1000000000 999999999 999999999 999999999 1000000000 1000000000", "7\n1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000", "7\n1000000000 1000000000 1000000000 1000000000 999999999 999999999 999999999", "8\n1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000", "8\n1000000000 999999999 1000000000 999999999 1000000000 999999999 999999999 999999999", "7\n1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1"], "outputs": ["2", "5", "1", "1", "1", "2", "1", "1", "1", "1", "1", "2", "1", "2", "1", "1", "1", "1", "1", "4", "3", "1", "5", "1", "2", "1"]} | UNKNOWN | [
"PYTHON3"
] | CODEFORCES | 1 | codeforces |
|
4e1001b37563a9d7ff5a7f598df7bd5e | Arithmetic Progression | Everybody knows what an arithmetic progression is. Let us remind you just in case that an arithmetic progression is such sequence of numbers *a*1,<=*a*2,<=...,<=*a**n* of length *n*, that the following condition fulfills:
For example, sequences [1, 5], [10], [5, 4, 3] are arithmetic progressions and sequences [1, 3, 2], [1, 2, 4] are not.
Alexander has *n* cards containing integers. Arthur wants to give Alexander exactly one more card with a number so that he could use the resulting *n*<=+<=1 cards to make an arithmetic progression (Alexander has to use all of his cards).
Arthur has already bought a card but he hasn't written a number on it. Help him, print all integers that you can write on a card so that the described condition fulfilled.
The first line contains integer *n* (1<=≤<=*n*<=≤<=105) — the number of cards. The next line contains the sequence of integers — the numbers on Alexander's cards. The numbers are positive integers, each of them doesn't exceed 108.
If Arthur can write infinitely many distinct integers on the card, print on a single line -1.
Otherwise, print on the first line the number of integers that suit you. In the second line, print the numbers in the increasing order. Note that the numbers in the answer can exceed 108 or even be negative (see test samples).
Sample Input
3
4 1 7
1
10
4
1 3 5 9
4
4 3 4 5
2
2 4
Sample Output
2
-2 10
-1
1
7
0
3
0 3 6
| {"inputs": ["3\n4 1 7", "1\n10", "4\n1 3 5 9", "4\n4 3 4 5", "2\n2 4", "4\n1 3 4 5", "2\n3 3", "2\n13 2", "5\n2 2 2 2 2", "6\n11 1 7 9 5 13", "2\n100000000 1", "5\n2 3 1 4 6", "5\n1 2 2 3 4", "3\n1 4 2", "3\n8 8 8", "5\n2 2 2 2 3", "1\n100000000", "20\n27 6 3 18 54 33 9 15 39 12 57 48 21 51 60 30 24 36 42 45", "40\n100000000 100000000 100000000 100000000 100000000 100000000 100000000 100000000 100000000 100000000 100000000 100000000 100000000 100000000 100000000 100000000 100000000 100000000 100000000 100000000 100000000 100000000 100000000 100000000 100000000 100000000 100000000 100000000 100000000 100000000 100000000 100000000 100000000 100000000 100000000 100000000 100000000 100000000 100000000 100000000", "49\n81787 163451 104059 89211 96635 133755 148603 141179 159739 122619 123 144891 70651 11259 63227 3835 44667 37243 100347 26107 137467 18683 156027 59515 22395 40955 111483 52091 7547 85499 107771 178299 115195 152315 74363 126331 33531 130043 14971 48379 167163 182011 170875 78075 174587 55803 66939 29819 118907", "9\n1 2 3 3 4 4 5 5 6", "7\n1 1 2 3 4 5 6", "2\n4 1", "2\n2 100000000", "8\n1 2 3 4 11 12 13 14", "7\n5 40 45 50 55 60 65", "1\n1", "2\n1 1", "2\n100000000 2", "3\n2 2 3", "5\n1 3 5 9 13", "5\n1 2 4 8 16", "3\n2 2 5", "5\n1 2 3 4 8", "3\n1 3 4", "5\n1 2 4 6 7", "4\n1 5 9 11", "4\n3 4 5 9", "4\n1 5 6 8", "4\n2 6 8 12", "5\n1 2 3 5 7", "6\n1 2 3 4 6 8"], "outputs": ["2\n-2 10", "-1", "1\n7", "0", "3\n0 3 6", "1\n2", "1\n3", "2\n-9 24", "1\n2", "1\n3", "2\n-99999998 199999999", "1\n5", "0", "1\n3", "1\n8", "0", "-1", "2\n0 63", "1\n100000000", "1\n92923", "0", "0", "2\n-2 7", "3\n-99999996 50000001 199999998", "0", "0", "-1", "1\n1", "3\n-99999996 50000001 199999998", "0", "0", "0", "0", "0", "1\n2", "0", "0", "0", "0", "0", "0", "0"]} | UNKNOWN | [
"PYTHON3"
] | CODEFORCES | 14 | codeforces |
|
4e13badfe8593ea28f7db56aa201e76c | Median on Segments (General Case Edition) | You are given an integer sequence $a_1, a_2, \dots, a_n$.
Find the number of pairs of indices $(l, r)$ ($1 \le l \le r \le n$) such that the value of median of $a_l, a_{l+1}, \dots, a_r$ is exactly the given number $m$.
The median of a sequence is the value of an element which is in the middle of the sequence after sorting it in non-decreasing order. If the length of the sequence is even, the left of two middle elements is used.
For example, if $a=[4, 2, 7, 5]$ then its median is $4$ since after sorting the sequence, it will look like $[2, 4, 5, 7]$ and the left of two middle elements is equal to $4$. The median of $[7, 1, 2, 9, 6]$ equals $6$ since after sorting, the value $6$ will be in the middle of the sequence.
Write a program to find the number of pairs of indices $(l, r)$ ($1 \le l \le r \le n$) such that the value of median of $a_l, a_{l+1}, \dots, a_r$ is exactly the given number $m$.
The first line contains integers $n$ and $m$ ($1 \le n,m \le 2\cdot10^5$) — the length of the given sequence and the required value of the median.
The second line contains an integer sequence $a_1, a_2, \dots, a_n$ ($1 \le a_i \le 2\cdot10^5$).
Print the required number.
Sample Input
5 4
1 4 5 60 4
3 1
1 1 1
15 2
1 2 3 1 2 3 1 2 3 1 2 3 1 2 3
Sample Output
8
6
97
| {"inputs": ["5 4\n1 4 5 60 4", "3 1\n1 1 1", "15 2\n1 2 3 1 2 3 1 2 3 1 2 3 1 2 3", "1 1\n1", "2 1\n1 2", "2 1\n2 1", "2 2\n1 2", "2 2\n2 1", "3 1\n1 2 3", "3 1\n1 3 2", "3 1\n2 1 3", "3 1\n2 3 1", "3 1\n3 1 2", "3 1\n3 2 1", "2 2\n1 1", "3 2\n1 1 2", "2 1\n1 1", "1 1\n2", "2 2\n4 1", "3 3\n5 5 3", "4 3\n3 5 2 3", "5 2\n1 9 2 8 10", "6 5\n7 2 11 8 9 12", "7 5\n14 4 1 11 12 3 4", "8 2\n2 6 11 14 10 9 9 5", "9 8\n10 8 8 15 1 2 13 8 6", "10 7\n14 20 3 3 8 16 17 13 6 4", "1 200000\n1", "1 200000\n200000"], "outputs": ["8", "6", "97", "1", "2", "2", "1", "1", "2", "2", "3", "2", "3", "2", "0", "1", "3", "0", "0", "2", "6", "5", "0", "0", "2", "27", "0", "0", "1"]} | UNKNOWN | [
"PYTHON3"
] | CODEFORCES | 4 | codeforces |
|
4e1984b93f1c4fa1a4de130e3bd4e45c | Bipartite Checking | You are given an undirected graph consisting of *n* vertices. Initially there are no edges in the graph. Also you are given *q* queries, each query either adds one undirected edge to the graph or removes it. After each query you have to check if the resulting graph is bipartite (that is, you can paint all vertices of the graph into two colors so that there is no edge connecting two vertices of the same color).
The first line contains two integers *n* and *q* (2<=≤<=*n*,<=*q*<=≤<=100000).
Then *q* lines follow. *i*th line contains two numbers *x**i* and *y**i* (1<=≤<=*x**i*<=<<=*y**i*<=≤<=*n*). These numbers describe *i*th query: if there is an edge between vertices *x**i* and *y**i*, then remove it, otherwise add it.
Print *q* lines. *i*th line must contain YES if the graph is bipartite after *i*th query, and NO otherwise.
Sample Input
3 5
2 3
1 3
1 2
1 2
1 2
Sample Output
YES
YES
NO
YES
NO
| {"inputs": ["3 5\n2 3\n1 3\n1 2\n1 2\n1 2", "5 10\n1 5\n2 5\n2 4\n1 4\n4 5\n2 4\n2 5\n1 4\n2 3\n1 2", "10 20\n1 10\n5 7\n1 2\n3 5\n3 6\n4 9\n3 4\n6 9\n4 8\n6 9\n7 8\n3 8\n7 10\n2 7\n3 7\n5 9\n6 7\n4 6\n2 10\n8 10", "10 30\n5 6\n5 9\n4 9\n6 7\n7 9\n3 10\n5 6\n5 7\n6 10\n2 4\n2 6\n2 5\n3 7\n1 8\n8 9\n3 4\n3 5\n1 9\n6 7\n4 8\n4 5\n1 5\n2 3\n4 10\n1 7\n2 8\n3 10\n1 7\n1 7\n3 8", "10 40\n6 9\n1 5\n2 6\n2 5\n7 9\n7 9\n5 6\n5 8\n6 9\n1 7\n5 6\n1 7\n1 9\n4 5\n4 6\n6 8\n7 8\n1 8\n5 7\n1 7\n8 9\n5 6\n6 7\n1 4\n3 7\n9 10\n1 7\n4 7\n4 10\n3 8\n7 10\n3 6\n1 10\n6 10\n8 9\n8 10\n7 10\n2 5\n1 9\n3 6", "30 40\n5 15\n13 16\n12 17\n19 23\n1 27\n16 25\n20 21\n6 18\n10 17\n7 13\n20 24\n4 17\n8 12\n12 25\n25 29\n4 7\n1 14\n2 21\n4 26\n2 13\n20 24\n23 24\n8 16\n16 18\n8 10\n25 28\n4 22\n11 25\n13 24\n19 22\n18 20\n22 30\n4 13\n28 29\n6 13\n18 22\n18 28\n4 20\n14 21\n5 6", "50 60\n7 36\n43 45\n12 17\n10 40\n30 47\n18 30\n3 9\n5 6\n13 49\n5 26\n4 20\n5 50\n27 41\n3 21\n15 43\n24 41\n6 30\n40 50\n8 13\n9 21\n2 47\n23 26\n21 22\n15 31\n28 38\n1 50\n24 35\n2 13\n4 33\n14 42\n10 28\n3 5\n18 19\n9 40\n11 21\n22 36\n6 11\n36 44\n20 35\n7 38\n9 33\n29 31\n6 14\n22 32\n27 48\n19 31\n39 47\n12 50\n8 38\n35 36\n1 43\n7 49\n10 25\n10 21\n14 15\n1 44\n8 32\n17 50\n42 45\n13 44"], "outputs": ["YES\nYES\nNO\nYES\nNO", "YES\nYES\nYES\nYES\nNO\nNO\nNO\nYES\nYES\nYES", "YES\nYES\nYES\nYES\nYES\nYES\nYES\nYES\nYES\nYES\nNO\nNO\nNO\nNO\nNO\nNO\nNO\nNO\nNO\nNO", "YES\nYES\nYES\nYES\nYES\nYES\nYES\nNO\nNO\nNO\nNO\nNO\nNO\nNO\nNO\nNO\nNO\nNO\nNO\nNO\nNO\nNO\nNO\nNO\nNO\nNO\nNO\nNO\nNO\nNO", "YES\nYES\nYES\nYES\nYES\nYES\nNO\nNO\nNO\nNO\nYES\nYES\nYES\nYES\nYES\nYES\nYES\nNO\nNO\nNO\nNO\nNO\nNO\nNO\nNO\nNO\nNO\nNO\nNO\nNO\nNO\nNO\nNO\nNO\nNO\nNO\nNO\nNO\nNO\nNO", "YES\nYES\nYES\nYES\nYES\nYES\nYES\nYES\nYES\nYES\nYES\nYES\nYES\nYES\nYES\nNO\nNO\nNO\nNO\nNO\nNO\nNO\nNO\nNO\nNO\nNO\nNO\nNO\nNO\nNO\nNO\nNO\nNO\nNO\nNO\nNO\nNO\nNO\nNO\nNO", "YES\nYES\nYES\nYES\nYES\nYES\nYES\nYES\nYES\nYES\nYES\nYES\nYES\nYES\nYES\nYES\nYES\nYES\nYES\nNO\nNO\nNO\nNO\nNO\nNO\nNO\nNO\nNO\nNO\nNO\nNO\nNO\nNO\nNO\nNO\nNO\nNO\nNO\nNO\nNO\nNO\nNO\nNO\nNO\nNO\nNO\nNO\nNO\nNO\nNO\nNO\nNO\nNO\nNO\nNO\nNO\nNO\nNO\nNO\nNO"]} | UNKNOWN | [
"PYTHON3"
] | CODEFORCES | 1 | codeforces |
|
4e220ac1005c900d81bf721ad9ab46cb | Devu and his Brother | Devu and his brother love each other a lot. As they are super geeks, they only like to play with arrays. They are given two arrays *a* and *b* by their father. The array *a* is given to Devu and *b* to his brother.
As Devu is really a naughty kid, he wants the minimum value of his array *a* should be at least as much as the maximum value of his brother's array *b*.
Now you have to help Devu in achieving this condition. You can perform multiple operations on the arrays. In a single operation, you are allowed to decrease or increase any element of any of the arrays by 1. Note that you are allowed to apply the operation on any index of the array multiple times.
You need to find minimum number of operations required to satisfy Devu's condition so that the brothers can play peacefully without fighting.
The first line contains two space-separated integers *n*, *m* (1<=≤<=*n*,<=*m*<=≤<=105). The second line will contain *n* space-separated integers representing content of the array *a* (1<=≤<=*a**i*<=≤<=109). The third line will contain *m* space-separated integers representing content of the array *b* (1<=≤<=*b**i*<=≤<=109).
You need to output a single integer representing the minimum number of operations needed to satisfy Devu's condition.
Sample Input
2 2
2 3
3 5
3 2
1 2 3
3 4
3 2
4 5 6
1 2
Sample Output
3
4
0
| {"inputs": ["2 2\n2 3\n3 5", "3 2\n1 2 3\n3 4", "3 2\n4 5 6\n1 2", "10 10\n23 100 38 38 73 54 59 69 44 86\n100 100 100 100 100 100 100 100 100 100", "1 1\n401114\n998223974", "1 1\n100\n4", "1 1\n100\n183299", "1 1\n999999999\n1000000000", "1 1\n1000000000\n1000000000", "1 1\n1\n2", "1 1\n1\n1", "1 1\n2\n1", "1 1\n1\n2", "1 1\n1\n3", "1 2\n1\n2 2", "2 1\n2 2\n3"], "outputs": ["3", "4", "0", "416", "997822860", "0", "183199", "1", "0", "1", "0", "0", "1", "2", "1", "1"]} | UNKNOWN | [
"PYTHON3"
] | CODEFORCES | 24 | codeforces |
|
4e2f2585b450362d7e2a53f3e8966fe1 | none | It's another Start[c]up finals, and that means there is pizza to order for the onsite contestants. There are only 2 types of pizza (obviously not, but let's just pretend for the sake of the problem), and all pizzas contain exactly *S* slices.
It is known that the *i*-th contestant will eat *s**i* slices of pizza, and gain *a**i* happiness for each slice of type 1 pizza they eat, and *b**i* happiness for each slice of type 2 pizza they eat. We can order any number of type 1 and type 2 pizzas, but we want to buy the minimum possible number of pizzas for all of the contestants to be able to eat their required number of slices. Given that restriction, what is the maximum possible total happiness that can be achieved?
The first line of input will contain integers *N* and *S* (1<=≤<=*N*<=≤<=105,<=1<=≤<=*S*<=≤<=105), the number of contestants and the number of slices per pizza, respectively. *N* lines follow.
The *i*-th such line contains integers *s**i*, *a**i*, and *b**i* (1<=≤<=*s**i*<=≤<=105,<=1<=≤<=*a**i*<=≤<=105,<=1<=≤<=*b**i*<=≤<=105), the number of slices the *i*-th contestant will eat, the happiness they will gain from each type 1 slice they eat, and the happiness they will gain from each type 2 slice they eat, respectively.
Print the maximum total happiness that can be achieved.
Sample Input
3 12
3 5 7
4 6 7
5 9 5
6 10
7 4 7
5 8 8
12 5 8
6 11 6
3 3 7
5 9 6
Sample Output
84
314
| {"inputs": ["3 12\n3 5 7\n4 6 7\n5 9 5", "6 10\n7 4 7\n5 8 8\n12 5 8\n6 11 6\n3 3 7\n5 9 6", "1 100\n97065 97644 98402", "1 100000\n1 82372 5587", "25 6\n1 10 5\n1 8 4\n1 8 2\n4 8 9\n3 2 8\n1 9 5\n2 10 10\n3 9 6\n3 5 4\n2 7 8\n2 3 2\n2 6 8\n3 7 8\n4 3 7\n1 8 1\n3 6 4\n3 2 8\n2 2 1\n4 8 8\n4 8 4\n3 10 2\n3 6 6\n2 2 5\n1 6 2\n4 1 5", "3 10\n10 3 4\n5 1 100\n5 100 1", "3 3\n6 5 6\n2 5 4\n2 4 5", "3 5\n6 4 5\n6 5 5\n8 7 5", "3 5\n2 7 4\n6 5 9\n6 5 6", "2 100000\n50000 1 100000\n50000 100000 1", "2 9\n6 1 7\n6 7 1", "10 8\n7 1 4\n4 8 9\n3 4 10\n5 5 9\n1 5 6\n1 8 5\n5 7 4\n5 4 6\n10 5 7\n9 7 3", "2 10\n7 2 1\n7 1 2", "2 3\n5 10 5\n5 5 10", "2 3\n5 5 10\n5 10 5", "2 3\n2 10 1\n2 1 10", "2 10\n9 1 2\n9 2 1", "3 4\n2 1 10\n1 2 1\n1 3 1"], "outputs": ["84", "314", "9551390130", "82372", "449", "1035", "56", "116", "102", "5000050000", "84", "351", "28", "100", "100", "40", "36", "22"]} | UNKNOWN | [
"PYTHON3"
] | CODEFORCES | 2 | codeforces |
|
4e6946d661b5320cd47b3c77431ea1bd | Food on the Plane | A new airplane SuperPuperJet has an infinite number of rows, numbered with positive integers starting with 1 from cockpit to tail. There are six seats in each row, denoted with letters from 'a' to 'f'. Seats 'a', 'b' and 'c' are located to the left of an aisle (if one looks in the direction of the cockpit), while seats 'd', 'e' and 'f' are located to the right. Seats 'a' and 'f' are located near the windows, while seats 'c' and 'd' are located near the aisle.
It's lunch time and two flight attendants have just started to serve food. They move from the first rows to the tail, always maintaining a distance of two rows from each other because of the food trolley. Thus, at the beginning the first attendant serves row 1 while the second attendant serves row 3. When both rows are done they move one row forward: the first attendant serves row 2 while the second attendant serves row 4. Then they move three rows forward and the first attendant serves row 5 while the second attendant serves row 7. Then they move one row forward again and so on.
Flight attendants work with the same speed: it takes exactly 1 second to serve one passenger and 1 second to move one row forward. Each attendant first serves the passengers on the seats to the right of the aisle and then serves passengers on the seats to the left of the aisle (if one looks in the direction of the cockpit). Moreover, they always serve passengers in order from the window to the aisle. Thus, the first passenger to receive food in each row is located in seat 'f', and the last one — in seat 'c'. Assume that all seats are occupied.
Vasya has seat *s* in row *n* and wants to know how many seconds will pass before he gets his lunch.
The only line of input contains a description of Vasya's seat in the format *ns*, where *n* (1<=≤<=*n*<=≤<=1018) is the index of the row and *s* is the seat in this row, denoted as letter from 'a' to 'f'. The index of the row and the seat are not separated by a space.
Print one integer — the number of seconds Vasya has to wait until he gets his lunch.
Sample Input
1f
2d
4a
5e
Sample Output
1
10
11
18
| {"inputs": ["1f", "2d", "4a", "5e", "2c", "1b", "1000000000000000000d", "999999999999999997a", "1c", "1d", "1e", "1a", "2a", "2b", "2e", "2f", "3a", "3b", "3c", "3d", "3e", "3f", "4b", "4c", "4d", "4e", "4f", "999999997a", "999999997b", "999999997c", "999999997d", "999999997e", "999999997f", "999999998a", "999999998b", "999999998c", "999999998d", "999999998e", "999999998f", "999999999a", "999999999b", "999999999c", "999999999d", "999999999e", "999999999f", "1000000000a", "1000000000b", "1000000000c", "1000000000d", "1000000000e", "1000000000f", "100000b", "100000f", "100001d", "100001e", "100001f", "100002a", "100002b", "100002d", "1231273a", "82784f", "88312c", "891237e", "999999999999999997b", "999999999999999997c", "999999999999999997d", "999999999999999997e", "999999999999999997f", "999999999999999998a", "999999999999999998b", "999999999999999998c", "999999999999999998d", "999999999999999998e", "999999999999999998f", "999999999999999999a", "999999999999999999b", "999999999999999999c", "999999999999999999d", "1000000000000000000a", "1000000000000000000e", "1000000000000000000f", "1000000000000000000c", "97a", "6f", "7f", "7e", "999999999999999992c", "7a", "8f", "999999999999999992a", "999999999999999992b", "999999999999999992c", "999999999999999992d", "999999999999999992e", "999999999999999992f", "999999999999999993a", "999999999999999993b", "999999999999999993c", "999999999999999993d", "999999999999999993e", "999999999999999993f", "999999999999999994a", "999999999999999994b", "999999999999999994c", "999999999999999994d", "999999999999999994e", "999999999999999994f", "999999999999999995a", "999999999999999995b", "999999999999999995c", "999999999999999995d", "999999999999999995e", "999999999999999995f", "10a", "11f", "681572647b", "23f", "123a", "999999888888777777a"], "outputs": ["1", "10", "11", "18", "13", "5", "3999999999999999994", "3999999999999999988", "6", "3", "2", "4", "11", "12", "9", "8", "4", "5", "6", "3", "2", "1", "12", "13", "10", "9", "8", "3999999988", "3999999989", "3999999990", "3999999987", "3999999986", "3999999985", "3999999995", "3999999996", "3999999997", "3999999994", "3999999993", "3999999992", "3999999988", "3999999989", "3999999990", "3999999987", "3999999986", "3999999985", "3999999995", "3999999996", "3999999997", "3999999994", "3999999993", "3999999992", "399996", "399992", "400003", "400002", "400001", "400011", "400012", "400010", "4925092", "331128", "353245", "3564946", "3999999999999999989", "3999999999999999990", "3999999999999999987", "3999999999999999986", "3999999999999999985", "3999999999999999995", "3999999999999999996", "3999999999999999997", "3999999999999999994", "3999999999999999993", "3999999999999999992", "3999999999999999988", "3999999999999999989", "3999999999999999990", "3999999999999999987", "3999999999999999995", "3999999999999999993", "3999999999999999992", "3999999999999999997", "388", "24", "17", "18", "3999999999999999965", "20", "24", "3999999999999999963", "3999999999999999964", "3999999999999999965", "3999999999999999962", "3999999999999999961", "3999999999999999960", "3999999999999999972", "3999999999999999973", "3999999999999999974", "3999999999999999971", "3999999999999999970", "3999999999999999969", "3999999999999999979", "3999999999999999980", "3999999999999999981", "3999999999999999978", "3999999999999999977", "3999999999999999976", "3999999999999999972", "3999999999999999973", "3999999999999999974", "3999999999999999971", "3999999999999999970", "3999999999999999969", "43", "33", "2726290581", "81", "484", "3999999555555111108"]} | UNKNOWN | [
"PYTHON3"
] | CODEFORCES | 101 | codeforces |
|
4e6f6cbabbc99f8cca4697f102ddcb4a | Kyoya and Photobooks | Kyoya Ootori is selling photobooks of the Ouran High School Host Club. He has 26 photos, labeled "a" to "z", and he has compiled them into a photo booklet with some photos in some order (possibly with some photos being duplicated). A photo booklet can be described as a string of lowercase letters, consisting of the photos in the booklet in order. He now wants to sell some "special edition" photobooks, each with one extra photo inserted anywhere in the book. He wants to make as many distinct photobooks as possible, so he can make more money. He asks Haruhi, how many distinct photobooks can he make by inserting one extra photo into the photobook he already has?
Please help Haruhi solve this problem.
The first line of input will be a single string *s* (1<=≤<=|*s*|<=≤<=20). String *s* consists only of lowercase English letters.
Output a single integer equal to the number of distinct photobooks Kyoya Ootori can make.
Sample Input
a
hi
Sample Output
51
76
| {"inputs": ["a", "hi", "y", "kgan", "zoabkyuvus", "spyemhyznjieyhhbk", "xulsyfkuizjauadjjopu", "e", "zv", "jgv", "zsfo", "jselr", "dwemig", "mddoxsf", "jgirkrmi", "spkxurcum", "fykkiubdkt", "fznbcxsxygs", "qcrvrdqcbtou", "qktrbjzrqgmlr", "foamodbvptlxxg", "ydzpjhsidipricw", "lpfpndmjfvqejdgf", "ofkvparuvjtggnmab", "xxncfutrtxcwdzwbgs", "zovhffccflkgqncsdte", "cskgsxywlvfeicoueglr", "gggggggggggggggggggg", "qdqdddqddqqddqddqdqd", "takttttaakaaktakttkt", "coccoooogogcgocccmcg", "kskkskkkssksssk", "lllllllllllllll"], "outputs": ["51", "76", "51", "126", "276", "451", "526", "51", "76", "101", "126", "151", "176", "201", "226", "251", "276", "301", "326", "351", "376", "401", "426", "451", "476", "501", "526", "526", "526", "526", "526", "401", "401"]} | UNKNOWN | [
"PYTHON3"
] | CODEFORCES | 398 | codeforces |
|
4e7689d6c8eafdd03fd8c880eb071bcf | Enemy is weak | The Romans have attacked again. This time they are much more than the Persians but Shapur is ready to defeat them. He says: "A lion is never afraid of a hundred sheep".
Nevertheless Shapur has to find weaknesses in the Roman army to defeat them. So he gives the army a weakness number.
In Shapur's opinion the weakness of an army is equal to the number of triplets *i*,<=*j*,<=*k* such that *i*<=<<=*j*<=<<=*k* and *a**i*<=><=*a**j*<=><=*a**k* where *a**x* is the power of man standing at position *x*. The Roman army has one special trait — powers of all the people in it are distinct.
Help Shapur find out how weak the Romans are.
The first line of input contains a single number *n* (3<=≤<=*n*<=≤<=106) — the number of men in Roman army. Next line contains *n* different positive integers *a**i* (1<=≤<=*i*<=≤<=*n*,<=1<=≤<=*a**i*<=≤<=109) — powers of men in the Roman army.
A single integer number, the weakness of the Roman army.
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).
Sample Input
3
3 2 1
3
2 3 1
4
10 8 3 1
4
1 5 4 3
Sample Output
1
0
4
1
| {"inputs": ["3\n3 2 1", "3\n2 3 1", "4\n10 8 3 1", "4\n1 5 4 3", "9\n10 9 5 6 8 3 4 7 11", "7\n11 3 8 4 2 9 6", "6\n2 1 10 7 3 5", "4\n1 5 3 10", "3\n2 7 11", "5\n4 11 7 5 10", "72\n685 154 298 660 716 963 692 257 397 974 92 191 519 838 828 957 687 776 636 997 101 800 579 181 691 256 95 531 333 347 803 682 252 655 297 892 833 31 239 895 45 235 394 909 486 400 621 443 348 471 59 791 934 195 861 356 876 741 763 431 781 639 193 291 230 171 288 187 657 273 200 924", "20\n840 477 436 149 554 528 671 67 630 382 805 329 781 980 237 589 743 451 633 24", "59\n996 800 927 637 393 741 650 524 863 789 517 467 408 442 988 701 528 215 490 764 282 990 991 244 70 510 36 151 193 378 102 818 384 621 349 476 658 985 465 366 807 32 430 814 945 733 382 751 380 136 405 585 494 862 598 425 421 90 72", "97\n800 771 66 126 231 306 981 96 196 229 253 35 903 739 461 962 979 347 152 424 934 586 225 838 103 178 524 400 156 149 560 629 697 417 717 738 181 430 611 513 754 595 847 464 356 640 24 854 138 481 98 371 142 460 194 288 605 41 999 581 441 407 301 651 271 226 457 393 980 166 272 250 900 337 358 359 80 904 53 39 558 569 101 339 752 432 889 285 836 660 190 180 601 136 527 990 612", "45\n955 94 204 615 69 519 960 791 977 603 294 391 662 364 139 222 748 742 540 567 230 830 558 959 329 169 854 503 423 210 832 87 990 44 7 777 138 898 845 733 570 476 113 233 630", "84\n759 417 343 104 908 84 940 248 210 10 6 529 289 826 890 982 533 506 412 280 709 175 425 891 727 914 235 882 834 445 912 163 263 998 391 948 836 538 615 854 275 198 631 267 148 955 418 961 642 132 599 657 389 879 177 739 536 932 682 928 660 821 15 878 521 990 518 765 79 544 771 134 611 244 608 809 733 832 933 270 397 349 798 857", "32\n915 740 482 592 394 648 919 705 443 418 719 315 916 287 289 743 319 270 269 668 203 119 20 224 847 500 949 910 164 468 965 846", "34\n718 63 972 81 233 861 250 515 676 825 431 453 543 748 41 503 104 34 126 57 346 616 557 615 733 15 938 495 491 667 177 317 367 85", "73\n874 34 111 922 71 426 229 972 557 232 144 590 170 210 792 616 890 798 983 797 488 8 859 538 736 319 82 966 474 513 721 860 493 375 81 69 662 444 766 451 571 94 365 833 720 703 826 270 437 542 147 800 146 173 564 160 928 57 732 774 292 250 716 131 949 1 216 456 53 322 403 195 460", "90\n301 241 251 995 267 292 335 623 270 144 291 757 950 21 808 109 971 340 678 377 743 841 669 333 528 988 336 233 118 781 138 47 972 68 234 812 629 701 520 842 156 348 600 26 94 912 903 552 470 456 61 273 93 810 545 231 450 926 172 246 884 79 614 728 533 491 76 589 668 487 409 650 433 677 124 407 956 794 299 763 843 290 591 216 844 731 327 34 687 649"], "outputs": ["1", "0", "4", "1", "20", "7", "2", "0", "0", "1", "12140", "185", "7842", "26086", "2676", "12571", "1230", "1202", "13229", "17239"]} | UNKNOWN | [
"PYTHON3"
] | CODEFORCES | 21 | codeforces |
|
4e7ef17cfdabf27d2d245b8f76ac89d4 | Tetrahedron | You are given a tetrahedron. Let's mark its vertices with letters *A*, *B*, *C* and *D* correspondingly.
An ant is standing in the vertex *D* of the tetrahedron. The ant is quite active and he wouldn't stay idle. At each moment of time he makes a step from one vertex to another one along some edge of the tetrahedron. The ant just can't stand on one place.
You do not have to do much to solve the problem: your task is to count the number of ways in which the ant can go from the initial vertex *D* to itself in exactly *n* steps. In other words, you are asked to find out the number of different cyclic paths with the length of *n* from vertex *D* to itself. As the number can be quite large, you should print it modulo 1000000007 (109<=+<=7).
The first line contains the only integer *n* (1<=≤<=*n*<=≤<=107) — the required length of the cyclic path.
Print the only integer — the required number of ways modulo 1000000007 (109<=+<=7).
Sample Input
2
4
Sample Output
3
21
| {"inputs": ["2", "4", "1", "3", "5", "6", "7", "8", "9", "10", "15", "30", "10000000", "100", "300", "900", "1500", "3000", "5000", "10000", "50000", "90000", "99999", "100000", "300000", "800000", "1000000", "4000000", "9000000", "9999999", "1000000", "9999999", "10000000", "9999998", "30", "31"], "outputs": ["3", "21", "0", "6", "60", "183", "546", "1641", "4920", "14763", "3587226", "782663359", "192336614", "721510432", "327873818", "295068084", "451187545", "645417275", "755610910", "723907367", "969527595", "548978368", "909741855", "729225554", "93822635", "178940616", "266233856", "882155933", "295060537", "730778875", "266233856", "730778875", "192336614", "576926295", "782663359", "347990060"]} | UNKNOWN | [
"PYTHON3"
] | CODEFORCES | 129 | codeforces |
|
4e93562b61be1dc35e16228296a50a7a | Jumping Ball | In a new version of the famous Pinball game, one of the most important parts of the game field is a sequence of *n* bumpers. The bumpers are numbered with integers from 1 to *n* from left to right. There are two types of bumpers. They are denoted by the characters '<' and '>'. When the ball hits the bumper at position *i* it goes one position to the right (to the position *i*<=+<=1) if the type of this bumper is '>', or one position to the left (to *i*<=-<=1) if the type of the bumper at position *i* is '<'. If there is no such position, in other words if *i*<=-<=1<=<<=1 or *i*<=+<=1<=><=*n*, the ball falls from the game field.
Depending on the ball's starting position, the ball may eventually fall from the game field or it may stay there forever. You are given a string representing the bumpers' types. Calculate the number of positions such that the ball will eventually fall from the game field if it starts at that position.
The first line of the input contains a single integer *n* (1<=≤<=*n*<=≤<=200<=000) — the length of the sequence of bumpers. The second line contains the string, which consists of the characters '<' and '>'. The character at the *i*-th position of this string corresponds to the type of the *i*-th bumper.
Print one integer — the number of positions in the sequence such that the ball will eventually fall from the game field if it starts at that position.
Sample Input
4
<<><
5
>>>>>
4
>><<
Sample Output
250 | {"inputs": ["4\n<<><", "5\n>>>>>", "4\n>><<", "3\n<<>", "3\n<<<", "3\n><<", "1\n<", "2\n<>", "3\n<>>", "3\n><>", "2\n><", "2\n>>", "2\n<<", "1\n>", "3\n>><", "3\n>>>", "3\n<><", "10\n<<<><<<>>>", "20\n><><<><<<>>>>>>>>>>>", "20\n<<<<<<<<<<><<<<>>>>>", "50\n<<<<<<<<<<<<<<<<<<<<<<<<<>>>>>>>>>>>>>>>>>>>>>>>>>", "100\n<<<<<<<<<<<<<<<<<<<<<<<<>><<>><<<<<>><>><<<>><><<>>><<>>><<<<><><><<><<<<><>>>>>>>>>>>>>>>>>>>>>>>>>", "100\n<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<>>>><<>><>><>><<><><><><>>>><><<<>>>><<<>>>>>>><><", "100\n<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<", "100\n>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>", "12\n<<>><<>><<>>", "6\n<<><>>", "6\n><>>>>", "8\n>>>><<<>", "4\n<><>", "4\n><><", "7\n<<>>><>", "10\n><><>>>>>>", "5\n<><>>", "12\n<><<<<>>>>>>", "6\n<>><<>", "6\n>>><>>", "10\n><><>>>><>", "5\n><>>>", "5\n<<><>", "5\n<><<<", "4\n<><<", "8\n<<>><<>>", "7\n<<><>>>", "5\n><<>>", "10\n<<<<<>>>>>", "6\n><<<<<", "8\n<<><><>>", "10\n<<<<><<<><", "12\n<<<>>>><<>>>", "4\n><>>", "11\n<<><<>><<>>"], "outputs": ["2", "5", "0", "3", "3", "0", "1", "2", "3", "1", "0", "2", "2", "1", "0", "3", "1", "6", "11", "15", "50", "49", "50", "100", "100", "4", "4", "4", "1", "2", "0", "3", "6", "3", "7", "2", "2", "1", "3", "3", "1", "1", "4", "5", "2", "10", "0", "4", "4", "6", "2", "4"]} | UNKNOWN | [
"PYTHON3"
] | CODEFORCES | 163 | codeforces |
|
4e9884823cc182d8bcd7b08538d77a54 | MUH and Sticks | Two polar bears Menshykov and Uslada from the St.Petersburg zoo and elephant Horace from the Kiev zoo got six sticks to play with and assess the animals' creativity. Menshykov, Uslada and Horace decided to make either an elephant or a bear from those sticks. They can make an animal from sticks in the following way:
- Four sticks represent the animal's legs, these sticks should have the same length. - Two remaining sticks represent the animal's head and body. The bear's head stick must be shorter than the body stick. The elephant, however, has a long trunk, so his head stick must be as long as the body stick. Note that there are no limits on the relations between the leg sticks and the head and body sticks.
Your task is to find out which animal can be made from the given stick set. The zoo keeper wants the sticks back after the game, so they must never be broken, even bears understand it.
The single line contains six space-separated integers *l**i* (1<=≤<=*l**i*<=≤<=9) — the lengths of the six sticks. It is guaranteed that the input is such that you cannot make both animals from the sticks.
If you can make a bear from the given set, print string "Bear" (without the quotes). If you can make an elephant, print string "Elephant" (wıthout the quotes). If you can make neither a bear nor an elephant, print string "Alien" (without the quotes).
Sample Input
4 2 5 4 4 4
4 4 5 4 4 5
1 2 3 4 5 6
Sample Output
BearElephantAlien | {"inputs": ["4 2 5 4 4 4", "4 4 5 4 4 5", "1 2 3 4 5 6", "5 5 5 5 5 5", "1 1 1 2 3 5", "1 1 1 1 1 1", "9 9 9 9 9 9", "1 8 9 1 1 1", "9 9 9 1 9 9", "1 2 3 8 9 7", "5 5 5 6 6 6", "1 1 2 2 3 4", "4 4 4 4 4 2", "2 2 3 3 4 4", "4 4 4 4 4 5", "1 1 2 2 2 2", "1 2 5 5 5 5", "4 4 2 2 2 2", "1 1 1 1 1 2", "2 2 4 4 4 4", "4 4 4 4 4 3", "4 4 5 6 7 8", "4 4 4 4 2 2", "1 1 1 1 2 2", "1 1 3 3 3 5", "1 2 2 3 3 3", "1 2 2 2 2 2", "1 3 3 3 4 5", "5 1 1 1 1 1"], "outputs": ["Bear", "Elephant", "Alien", "Elephant", "Alien", "Elephant", "Elephant", "Bear", "Bear", "Alien", "Alien", "Alien", "Bear", "Alien", "Bear", "Elephant", "Bear", "Elephant", "Bear", "Elephant", "Bear", "Alien", "Elephant", "Elephant", "Alien", "Alien", "Bear", "Alien", "Bear"]} | UNKNOWN | [
"PYTHON3"
] | CODEFORCES | 200 | codeforces |
|
4eb717ee9cf01551ebb483e88ba4b9f5 | Vladik and Entertaining Flags | In his spare time Vladik estimates beauty of the flags.
Every flag could be represented as the matrix *n*<=×<=*m* which consists of positive integers.
Let's define the beauty of the flag as number of components in its matrix. We call component a set of cells with same numbers and between any pair of cells from that set there exists a path through adjacent cells from same component. Here is the example of the partitioning some flag matrix into components:
But this time he decided to change something in the process. Now he wants to estimate not the entire flag, but some segment. Segment of flag can be described as a submatrix of the flag matrix with opposite corners at (1,<=*l*) and (*n*,<=*r*), where conditions 1<=≤<=*l*<=≤<=*r*<=≤<=*m* are satisfied.
Help Vladik to calculate the beauty for some segments of the given flag.
First line contains three space-separated integers *n*, *m*, *q* (1<=≤<=*n*<=≤<=10, 1<=≤<=*m*,<=*q*<=≤<=105) — dimensions of flag matrix and number of segments respectively.
Each of next *n* lines contains *m* space-separated integers — description of flag matrix. All elements of flag matrix is positive integers not exceeding 106.
Each of next *q* lines contains two space-separated integers *l*, *r* (1<=≤<=*l*<=≤<=*r*<=≤<=*m*) — borders of segment which beauty Vladik wants to know.
For each segment print the result on the corresponding line.
Sample Input
4 5 4
1 1 1 1 1
1 2 2 3 3
1 1 1 2 5
4 4 5 5 5
1 5
2 5
1 2
4 5
Sample Output
6
7
3
4
| {"inputs": ["4 5 4\n1 1 1 1 1\n1 2 2 3 3\n1 1 1 2 5\n4 4 5 5 5\n1 5\n2 5\n1 2\n4 5", "5 2 9\n6 1\n6 6\n6 6\n6 6\n5 6\n1 2\n1 1\n1 2\n1 2\n1 2\n1 1\n1 1\n1 2\n1 1", "5 4 10\n5 5 5 5\n5 5 5 5\n5 5 5 5\n5 5 5 5\n5 5 5 5\n2 4\n2 2\n1 2\n1 4\n1 1\n1 3\n2 4\n2 3\n1 3\n3 3", "8 4 12\n7 20 20 29\n29 7 29 29\n29 20 20 29\n29 20 20 29\n29 8 29 29\n20 29 29 29\n29 29 32 29\n29 29 29 29\n2 4\n1 4\n2 3\n2 3\n1 4\n2 4\n1 1\n3 3\n3 3\n2 3\n3 4\n1 2", "7 8 14\n8 8 36 8 36 36 5 36\n25 36 36 8 36 25 36 36\n36 36 36 8 36 36 36 36\n36 36 36 36 36 36 8 55\n8 8 36 36 36 36 36 36\n49 36 36 36 8 36 36 36\n36 36 5 44 5 36 36 48\n2 3\n1 4\n6 8\n1 2\n5 8\n2 8\n1 5\n5 8\n6 7\n1 3\n2 6\n1 6\n3 6\n2 4", "1 6 9\n1 2 3 4 5 6\n2 6\n4 5\n3 4\n3 5\n6 6\n3 6\n4 6\n2 3\n1 6", "4 8 6\n23 23 23 23 23 13 23 23\n23 23 23 23 23 23 23 23\n23 23 23 23 13 23 23 23\n23 23 26 23 23 23 23 23\n5 8\n2 8\n6 8\n5 5\n7 7\n2 4", "2 10 7\n8 13 13 8 8 8 8 8 8 8\n8 8 8 8 8 8 8 8 8 8\n4 9\n1 7\n6 6\n7 8\n4 4\n1 8\n2 10", "5 12 6\n25 24 24 53 53 53 53 53 5 20 53 53\n24 53 24 53 53 3 5 53 53 53 53 53\n24 53 53 5 53 5 53 53 53 17 53 60\n49 53 53 24 53 53 53 53 53 53 53 35\n53 53 5 53 53 53 53 53 53 53 53 53\n6 8\n8 10\n4 11\n4 8\n6 12\n8 9", "4 14 4\n8 8 8 8 46 46 48 8 8 8 8 13 24 40\n8 46 46 46 8 8 46 8 8 8 8 24 24 24\n8 46 46 8 8 8 23 23 8 8 8 8 8 8\n8 8 8 8 8 8 8 8 8 8 8 8 8 55\n10 10\n10 14\n3 5\n10 12", "1 16 10\n2 2 2 2 6 2 8 2 2 12 10 9 9 2 16 2\n9 9\n5 5\n6 9\n6 8\n7 11\n6 16\n4 7\n6 15\n7 9\n11 11", "7 12 11\n73 14 4 73 42 42 73 73 73 67 73 24\n73 73 73 73 73 73 72 73 73 73 73 11\n73 73 4 72 73 73 73 73 73 73 67 72\n73 74 73 72 73 73 73 73 73 73 73 73\n4 73 73 73 73 73 73 73 73 57 73 73\n72 73 73 4 73 73 73 73 33 73 73 73\n73 73 73 15 42 72 67 67 33 67 73 73\n9 12\n6 6\n10 11\n8 10\n1 9\n6 9\n3 5\n2 4\n2 4\n7 11\n1 12", "5 16 10\n32 4 4 4 4 4 4 52 4 4 4 4 29 30 4 4\n4 4 67 52 4 4 4 67 4 4 4 4 4 4 4 4\n4 52 52 52 4 4 4 67 67 52 32 4 4 4 4 52\n4 52 4 4 4 4 4 4 67 52 49 4 4 4 4 62\n49 4 4 4 4 72 55 4 4 52 49 52 4 62 4 62\n5 16\n9 13\n2 12\n3 13\n8 14\n7 7\n3 9\n1 4\n1 5\n7 7"], "outputs": ["6\n7\n3\n4", "3\n2\n3\n3\n3\n2\n2\n3\n2", "1\n1\n1\n1\n1\n1\n1\n1\n1\n1", "6\n9\n7\n7\n9\n6\n4\n6\n6\n7\n4\n8", "4\n8\n7\n6\n8\n13\n10\n8\n5\n6\n9\n11\n7\n6", "5\n2\n2\n3\n1\n4\n3\n2\n6", "3\n4\n2\n3\n1\n2", "1\n2\n1\n1\n1\n2\n2", "4\n4\n9\n6\n9\n2", "1\n5\n4\n3", "1\n1\n3\n3\n4\n9\n4\n8\n2\n1", "9\n3\n5\n7\n16\n6\n8\n9\n9\n8\n23", "15\n8\n12\n13\n11\n2\n8\n6\n5\n2"]} | UNKNOWN | [
"PYTHON3"
] | CODEFORCES | 1 | codeforces |
|
4ec79af96774776f3541a3c3c00f4d6a | Mike and Foam | Mike is a bartender at Rico's bar. At Rico's, they put beer glasses in a special shelf. There are *n* kinds of beer at Rico's numbered from 1 to *n*. *i*-th kind of beer has *a**i* milliliters of foam on it.
Maxim is Mike's boss. Today he told Mike to perform *q* queries. Initially the shelf is empty. In each request, Maxim gives him a number *x*. If beer number *x* is already in the shelf, then Mike should remove it from the shelf, otherwise he should put it in the shelf.
After each query, Mike should tell him the score of the shelf. Bears are geeks. So they think that the score of a shelf is the number of pairs (*i*,<=*j*) of glasses in the shelf such that *i*<=<<=*j* and where is the greatest common divisor of numbers *a* and *b*.
Mike is tired. So he asked you to help him in performing these requests.
The first line of input contains numbers *n* and *q* (1<=≤<=*n*,<=*q*<=≤<=2<=×<=105), the number of different kinds of beer and number of queries.
The next line contains *n* space separated integers, *a*1,<=*a*2,<=... ,<=*a**n* (1<=≤<=*a**i*<=≤<=5<=×<=105), the height of foam in top of each kind of beer.
The next *q* lines contain the queries. Each query consists of a single integer integer *x* (1<=≤<=*x*<=≤<=*n*), the index of a beer that should be added or removed from the shelf.
For each query, print the answer for that query in one line.
Sample Input
5 6
1 2 3 4 6
1
2
3
4
5
1
Sample Output
0
1
3
5
6
2
| {"inputs": ["5 6\n1 2 3 4 6\n1\n2\n3\n4\n5\n1", "3 3\n151790 360570 1\n2\n3\n3", "1 1\n1\n1", "5 10\n1 1 1 1 1\n1\n2\n3\n4\n5\n5\n4\n3\n2\n1", "1 2\n499590\n1\n1"], "outputs": ["0\n1\n3\n5\n6\n2", "0\n1\n0", "0", "0\n1\n3\n6\n10\n6\n3\n1\n0\n0", "0\n0"]} | UNKNOWN | [
"PYTHON3"
] | CODEFORCES | 2 | codeforces |
|
4ecaefff8877a36ffd6fb1febd12369d | The Untended Antiquity | Adieu l'ami.
Koyomi is helping Oshino, an acquaintance of his, to take care of an open space around the abandoned Eikou Cram School building, Oshino's makeshift residence.
The space is represented by a rectangular grid of *n*<=×<=*m* cells, arranged into *n* rows and *m* columns. The *c*-th cell in the *r*-th row is denoted by (*r*,<=*c*).
Oshino places and removes barriers around rectangular areas of cells. Specifically, an action denoted by "1 *r*1 *c*1 *r*2 *c*2" means Oshino's placing barriers around a rectangle with two corners being (*r*1,<=*c*1) and (*r*2,<=*c*2) and sides parallel to squares sides. Similarly, "2 *r*1 *c*1 *r*2 *c*2" means Oshino's removing barriers around the rectangle. Oshino ensures that no barriers staying on the ground share any common points, nor do they intersect with boundaries of the *n*<=×<=*m* area.
Sometimes Koyomi tries to walk from one cell to another carefully without striding over barriers, in order to avoid damaging various items on the ground. "3 *r*1 *c*1 *r*2 *c*2" means that Koyomi tries to walk from (*r*1,<=*c*1) to (*r*2,<=*c*2) without crossing barriers.
And you're here to tell Koyomi the feasibility of each of his attempts.
The first line of input contains three space-separated integers *n*, *m* and *q* (1<=≤<=*n*,<=*m*<=≤<=2<=500, 1<=≤<=*q*<=≤<=100<=000) — the number of rows and columns in the grid, and the total number of Oshino and Koyomi's actions, respectively.
The following *q* lines each describes an action, containing five space-separated integers *t*, *r*1, *c*1, *r*2, *c*2 (1<=≤<=*t*<=≤<=3, 1<=≤<=*r*1,<=*r*2<=≤<=*n*, 1<=≤<=*c*1,<=*c*2<=≤<=*m*) — the type and two coordinates of an action. Additionally, the following holds depending on the value of *t*:
- If *t*<==<=1: 2<=≤<=*r*1<=≤<=*r*2<=≤<=*n*<=-<=1, 2<=≤<=*c*1<=≤<=*c*2<=≤<=*m*<=-<=1; - If *t*<==<=2: 2<=≤<=*r*1<=≤<=*r*2<=≤<=*n*<=-<=1, 2<=≤<=*c*1<=≤<=*c*2<=≤<=*m*<=-<=1, the specified group of barriers exist on the ground before the removal. - If *t*<==<=3: no extra restrictions.
For each of Koyomi's attempts (actions with *t*<==<=3), output one line — containing "Yes" (without quotes) if it's feasible, and "No" (without quotes) otherwise.
Sample Input
5 6 5
1 2 2 4 5
1 3 3 3 3
3 4 4 1 1
2 2 2 4 5
3 1 1 4 4
2500 2500 8
1 549 1279 1263 2189
1 303 795 1888 2432
1 2227 622 2418 1161
3 771 2492 1335 1433
1 2017 2100 2408 2160
3 48 60 798 729
1 347 708 1868 792
3 1940 2080 377 1546
Sample Output
No
Yes
No
Yes
No
| {"inputs": ["5 6 5\n1 2 2 4 5\n1 3 3 3 3\n3 4 4 1 1\n2 2 2 4 5\n3 1 1 4 4", "2500 2500 8\n1 549 1279 1263 2189\n1 303 795 1888 2432\n1 2227 622 2418 1161\n3 771 2492 1335 1433\n1 2017 2100 2408 2160\n3 48 60 798 729\n1 347 708 1868 792\n3 1940 2080 377 1546", "3 3 5\n3 1 3 1 3\n3 1 1 3 1\n1 2 2 2 2\n3 2 3 2 2\n3 1 1 2 2", "3 4 5\n3 3 4 3 4\n1 2 2 2 3\n3 2 2 2 3\n3 3 3 2 4\n3 2 2 1 1", "5 5 10\n1 3 2 4 2\n1 4 4 4 4\n1 2 4 2 4\n3 4 2 4 1\n3 2 2 5 3\n3 2 2 1 5\n3 3 2 5 1\n3 4 5 2 3\n3 1 5 4 2\n3 1 2 5 2", "10 10 10\n1 5 7 8 8\n3 8 2 6 7\n1 5 4 9 4\n3 4 2 3 3\n1 2 3 3 4\n3 5 7 2 9\n1 3 6 9 9\n2 2 3 3 4\n3 1 2 2 2\n3 4 9 2 7", "10 10 10\n1 5 4 8 5\n3 3 6 5 9\n3 3 10 1 1\n1 3 5 3 5\n1 3 7 8 8\n1 2 2 2 3\n3 9 7 7 3\n1 4 2 8 2\n3 9 2 9 3\n3 7 4 7 4", "2450 100 20\n1 333 19 414 95\n1 1121 15 2270 28\n3 539 27 2026 84\n1 1286 78 2422 84\n1 717 3 1051 65\n2 1121 15 2270 28\n3 1127 42 42 92\n3 1701 70 503 6\n1 2008 7 2363 59\n3 2183 52 282 43\n1 530 7 642 32\n3 13 57 2127 1\n2 717 3 1051 65\n2 2008 7 2363 59\n1 1501 10 2213 66\n3 596 15 1215 15\n1 1016 13 1262 65\n1 815 23 841 39\n2 530 7 642 32\n3 1189 5 794 33", "1 1 1\n3 1 1 1 1"], "outputs": ["No\nYes", "No\nYes\nNo", "Yes\nYes\nNo\nNo", "Yes\nYes\nYes\nNo", "No\nYes\nYes\nNo\nYes\nNo\nYes", "No\nYes\nNo\nYes\nNo", "Yes\nYes\nYes\nYes\nYes", "Yes\nYes\nYes\nNo\nYes\nNo\nYes", "Yes"]} | UNKNOWN | [
"PYTHON3"
] | CODEFORCES | 1 | codeforces |
|
4ed5cab6a6a8f2e20270f96bf0b11ab9 | You're Given a String... | 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).
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.
Output one number — length of the longest substring that can be met in the string at least twice.
Sample Input
abcd
ababa
zzz
Sample Output
032 | {"inputs": ["abcd", "ababa", "zzz", "kmmm", "wzznz", "qlzazaaqll", "lzggglgpep", "iegdlraaidefgegiagrdfhihe", "esxpqmdrtidgtkxojuxyrcwxlycywtzbjzpxvbngnlepgzcaeg", "garvpaimjdjiivamusjdwfcaoswuhxyyxvrxzajoyihggvuxumaadycfphrzbprraicvjjlsdhojihaw", "ckvfndqgkmhcyojaqgdkenmbexufryhqejdhctxujmtrwkpbqxufxamgoeigzfyzbhevpbkvviwntdhqscvkmphnkkljizndnbjt", "bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb", "ikiikiikikiiikkkkkikkkkiiiiikkiiikkiikiikkkkikkkikikkikiiikkikikiiikikkkiiikkkikkikkikkkkiiikkiiiiii", "ovovhoovvhohhhvhhvhhvhovoohovhhoooooovohvooooohvvoooohvvovhhvhovhhvoovhvhvoovovvhooovhhooovohvhhovhv", "ccwckkkycccccckwckwkwkwkkkkyycykcccycyckwywcckwykcycykkkwcycwwcykcwkwkwwykwkwcykywwwyyykckkyycckwcwk", "ttketfkefktfztezzkzfkkeetkkfktftzktezekkeezkeeetteeteefetefkzzzetekfftkeffzkktffzkzzeftfeezfefzffeef", "rtharczpfznrgdnkltchafduydgbgkdjqrmjqyfmpwjwphrtsjbmswkanjlprbnduaqbcjqxlxmkspkhkcnzbqwxonzxxdmoigti", "fplrkfklvwdeiynbjgaypekambmbjfnoknlhczhkdmljicookdywdgpnlnqlpunnkebnikgcgcjefeqhknvlynmvjcegvcdgvvdb", "txbciieycswqpniwvzipwlottivvnfsysgzvzxwbctcchfpvlbcjikdofhpvsknptpjdbxemtmjcimetkemdbettqnbvzzbdyxxb", "fmubmfwefikoxtqvmaavwjxmoqltapexkqxcsztpezfcltqavuicefxovuswmqimuikoppgqpiapqutkczgcvxzutavkujxvpklv", "ipsrjylhpkjvlzncfixipstwcicxqygqcfrawpzzvckoveyqhathglblhpkjvlzncfixipfajaqobtzvthmhgbuawoxoknirclxg", "kcnjsntjzcbgzjscrsrjkrbytqsrptzspzctjrorsyggrtkcnjsntjzcbgzjscrsrjyqbrtpcgqirsrrjbbbrnyqstnrozcoztt", "unhcfnrhsqetuerjqcetrhlsqgfnqfntvkgxsscquolxxroqgtchffyccetrhlsqgfnqfntvkgxsscquolxxroqgtchffhfqvx", "kkcckkccckkcckcccckcckkkkcckkkkckkkcckckkkkkckkkkkcckkccckkcckcccckcckkkkcckkkkckkkcckckkkkkckckckkc", "mlhsyijxeydqxhtkmpdeqwzogjvxahmssyhfhqessbxzvydbrxdmlhsyijxeydqxhtkmpdeqwzogjvxahmssyhfhqessbxzvydik", "abcdefghijklmnopqrstuvwxyz", "tttttbttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttmttttttt", "ffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffbfffffffffffffffffffffffffffffffffffff", "cccccccccccccccccccccccwcccccccccccccccccccccuccccccccccccccnccccccccccccccccccccccccccccccccccccccc", "ffffffffffffffffffffffffffufffgfffffffffffffffffffffffffffffffffffffffgffffffftffffffgffffffffffffff", "rrrrrrrrrrrrrrrrrrrlhbrrrrrrrrurrrrrrrfrrqrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrewrrrrrrryrrxrrrrrrrrrrr", "vyvvvvvvvvzvvvvvzvvvwvvvvrvvvvvvvvvvvvvvvrvvvvvvvvvpkvvpvgvvvvvvvvvvvvvgvvvvvvvvvvvvvvvvvvysvvvbvvvv", "cbubbbbbbbbbbfbbbbbbbbjbobbbbbbbbbbibbubbbbjbbbnzgbbzbbfbbbbbbbbbbbfbpbbbbbbbbbbygbbbgbabbbbbbbhibbb", "lrqrrrrrrrjrrrrrcdrrgrrmwvrrrrrrrrrxfzrmrmrryrrrurrrdrrrrrrrrrrererrrsrrrrrrrrrrrqrrrrcrrwjsrrlrrrrr", "ssssusisisosscssssztzessssyspskjssvosiissussszsosssslsssdsssvssvsssslsssmsfjasjsssssowscsjsssszsspss", "uukuuuumueuuuujuukgdhbztuuuubbguuocuozfaunqufjujuguyuuvkuuauubuubuucuvtjuuuuuusduduuuuuuuueunuuuuuzu", "jpkkgwklngwqcfzmwkkpcwkkkkkekkkekkkdsykqwjkkkhkkkxdnukkkkkkmkqykkkxqklkskkrkkkkkqqjikkkkkkpknkkkkkoh", "bmzbbfbbhqxwthtbbisbbbbbtbbfbbpbfbbpbkbjfbcbbbbzbbbdwmbbbrnvqdbbtbbuglrnbbbbvmbyblebbabibrevaxbbjbqb", "qqqmqqqsbteqqopsuqiqumrqzpqnqgqeniqqkyqqyqqqpxzqeqqquhdqquhqqqfqjirqaqqaquxqoqqjqqqqbjbgqcqqqqicnkqc", "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaasaaaavaaaaaaauaaeaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa", "a", "fg", "yy", "abcabcabc", "qwerqwedqwes"], "outputs": ["0", "3", "2", "2", "1", "2", "2", "2", "1", "2", "3", "99", "10", "8", "5", "4", "2", "2", "2", "3", "15", "20", "37", "46", "47", "0", "85", "61", "38", "38", "33", "17", "12", "10", "8", "7", "7", "6", "4", "44", "0", "0", "1", "6", "3"]} | UNKNOWN | [
"PYTHON3"
] | CODEFORCES | 147 | codeforces |
|
4eddd3363623be37a94dbf0b2b374a00 | Cowslip Collections | In an attempt to make peace with the Mischievious Mess Makers, Bessie and Farmer John are planning to plant some flower gardens to complement the lush, grassy fields of Bovinia. As any good horticulturist knows, each garden they plant must have the exact same arrangement of flowers. Initially, Farmer John has *n* different species of flowers he can plant, with *a**i* flowers of the *i*-th species.
On each of the next *q* days, Farmer John will receive a batch of flowers of a new species. On day *j*, he will receive *c**j* flowers of the same species, but of a different species from those Farmer John already has.
Farmer John, knowing the right balance between extravagance and minimalism, wants exactly *k* species of flowers to be used. Furthermore, to reduce waste, each flower of the *k* species Farmer John chooses must be planted in some garden. And each of the gardens must be identical; that is to say that each of the *k* chosen species should have an equal number of flowers in each garden. As Farmer John is a proponent of national equality, he would like to create the greatest number of gardens possible.
After receiving flowers on each of these *q* days, Farmer John would like to know the sum, over all possible choices of *k* species, of the maximum number of gardens he could create. Since this could be a large number, you should output your result modulo 109<=+<=7.
The first line of the input contains three integers *n*, *k* and *q* (1<=≤<=*k*<=≤<=*n*<=≤<=100<=000, 1<=≤<=*q*<=≤<=100<=000).
The *i*-th (1<=≤<=*i*<=≤<=*n*) of the next *n* lines of the input contains an integer *a**i* (1<=≤<=*a**i*<=≤<=1<=000<=000), the number of flowers of species *i* Farmer John has initially.
The *j*-th (1<=≤<=*j*<=≤<=*q*) of the next *q* lines of the input contains an integer *c**j* (1<=≤<=*c**j*<=≤<=1<=000<=000), the number of flowers of a new species Farmer John receives on day *j*.
After each of the *q* days, output the sum of the maximum possible number of gardens, where the sum is taken over all possible choices of *k* species, modulo 109<=+<=7.
Sample Input
3 3 2
4
6
9
8
6
4 1 2
6
5
4
3
2
1
Sample Output
5
16
20
21
| {"inputs": ["3 3 2\n4\n6\n9\n8\n6", "4 1 2\n6\n5\n4\n3\n2\n1", "3 3 3\n6\n8\n10\n12\n14\n16", "1 1 1\n1\n1", "10 10 10\n10\n10\n10\n10\n10\n10\n10\n10\n10\n10\n10\n10\n10\n10\n10\n10\n10\n10\n10\n10", "7 1 9\n3\n6\n7\n2\n10\n8\n1\n3\n9\n2\n9\n10\n2\n4\n5\n2", "5 1 7\n10\n8\n4\n5\n8\n3\n9\n3\n9\n3\n10\n1", "7 2 8\n2\n5\n7\n9\n6\n2\n5\n2\n8\n7\n10\n8\n8\n5\n7", "9 8 10\n10\n9\n6\n8\n8\n8\n8\n6\n2\n7\n1\n9\n5\n10\n8\n1\n1\n6\n10"], "outputs": ["5\n16", "20\n21", "8\n20\n42", "2", "110\n660\n2860\n10010\n30030\n80080\n194480\n437580\n923780\n1847560", "40\n49\n51\n60\n70\n72\n76\n81\n83", "38\n47\n50\n59\n62\n72\n73", "40\n52\n67\n90\n113\n144\n169\n195", "46\n166\n496\n1288\n3012\n6480\n12915\n24355\n43923\n76077"]} | UNKNOWN | [
"PYTHON3"
] | CODEFORCES | 1 | codeforces |
|
4ee030eb81b88d70cace434a5be31ced | Multipliers | Ayrat has number *n*, represented as it's prime factorization *p**i* of size *m*, i.e. *n*<==<=*p*1·*p*2·...·*p**m*. Ayrat got secret information that that the product of all divisors of *n* taken modulo 109<=+<=7 is the password to the secret data base. Now he wants to calculate this value.
The first line of the input contains a single integer *m* (1<=≤<=*m*<=≤<=200<=000) — the number of primes in factorization of *n*.
The second line contains *m* primes numbers *p**i* (2<=≤<=*p**i*<=≤<=200<=000).
Print one integer — the product of all divisors of *n* modulo 109<=+<=7.
Sample Input
2
2 3
3
2 3 2
Sample Output
36
1728
| {"inputs": ["2\n2 3", "3\n2 3 2", "1\n2017", "2\n63997 63997", "5\n11 7 11 7 11", "5\n2 2 2 2 2", "4\n3 3 3 5", "6\n101 103 107 109 101 103", "10\n3 3 3 3 3 3 3 3 3 3", "5\n7 5 2 3 13", "23\n190979 191627 93263 72367 52561 188317 198397 24979 70313 105239 86263 78697 6163 7673 84137 199967 14657 84391 101009 16231 175103 24239 123289", "7\n34429 104287 171293 101333 104287 34429 104287", "27\n151153 29429 91411 91411 194507 194819 91411 91411 194507 181211 194507 131363 9371 194819 181211 194507 151153 91411 91411 192391 192391 151153 151153 194507 192391 192391 194819", "47\n9041 60013 53609 82939 160861 123377 74383 74383 184039 19867 123377 101879 74383 193603 123377 115331 101879 53609 74383 115331 51869 51869 184039 193603 91297 160861 160861 115331 184039 51869 123377 74383 160861 74383 115331 115331 51869 74383 19867 193603 193603 115331 184039 9041 53609 53609 193603", "67\n98929 19079 160079 181891 17599 91807 19079 98929 182233 92647 77477 98929 98639 182233 181891 182233 160079 98929 19079 98639 114941 98929 161341 91807 160079 22777 132361 92647 98929 77477 182233 103913 160079 77477 55711 77477 77477 182233 114941 91807 98929 19079 104393 182233 182233 131009 132361 16883 161341 103913 16883 98929 182233 114941 92647 92647 104393 132361 181891 114941 19079 91807 114941 132361 98639 161341 182233", "44\n73 59 17 41 37 7 71 47 29 83 67 17 53 61 43 43 3 23 29 11 7 83 61 79 31 37 37 83 41 71 11 19 83 2 83 73 7 67 83 13 2 53 31 47", "100\n2 3 5 7 11 13 17 19 23 29 31 37 41 43 47 53 59 61 67 71 73 79 83 89 97 101 103 107 109 113 127 131 137 139 149 151 157 163 167 173 179 181 191 193 197 199 211 223 227 229 233 239 241 251 257 263 269 271 277 281 283 293 307 311 313 317 331 337 347 349 353 359 367 373 379 383 389 397 401 409 419 421 431 433 439 443 449 457 461 463 467 479 487 491 499 503 509 521 523 541", "130\n2 2 2 2 2 2 2 2 2 2 3 3 3 3 3 3 3 3 3 3 5 5 5 5 5 5 5 5 5 5 7 7 7 7 7 7 7 7 7 7 11 11 11 11 11 11 11 11 11 11 13 13 13 13 13 13 13 13 13 13 17 17 17 17 17 17 17 17 17 17 19 19 19 19 19 19 19 19 19 19 23 23 23 23 23 23 23 23 23 23 29 29 29 29 29 29 29 29 29 29 31 31 31 31 31 31 31 31 31 31 37 37 37 37 37 37 37 37 37 37 41 41 41 41 41 41 41 41 41 41", "101\n2 3 5 7 11 13 17 19 23 29 31 37 41 43 47 53 59 61 67 71 73 79 83 89 97 101 103 107 109 113 127 131 137 139 149 151 157 163 167 173 179 181 191 193 197 199 211 223 227 229 233 239 241 251 257 263 269 271 277 281 283 293 307 311 313 317 331 337 347 349 353 359 367 373 379 383 389 397 401 409 419 421 431 433 439 443 449 457 461 463 467 479 487 491 499 503 509 521 523 541 2", "42\n1657 1871 2423 3037 5023 5099 5449 5701 6361 6619 7393 7489 8179 9743 9791 9907 12289 12457 13063 13933 14947 16141 16829 16943 17191 17863 20161 20947 21661 22727 23197 23201 23813 24023 24181 24223 24391 26479 28619 30529 32441 32611"], "outputs": ["36", "1728", "2017", "135893224", "750455957", "32768", "332150625", "760029909", "555340537", "133580280", "727083628", "249330396", "132073405", "648634399", "5987226", "464170294", "72902143", "869075922", "918713851", "468186759"]} | UNKNOWN | [
"PYTHON3"
] | CODEFORCES | 12 | codeforces |
|
4efe90f9fc3fbf649ac705ac3ad803c1 | Multitasking | Iahub wants to enhance his multitasking abilities. In order to do this, he wants to sort *n* arrays simultaneously, each array consisting of *m* integers.
Iahub can choose a pair of distinct indices *i* and *j* (1<=≤<=*i*,<=*j*<=≤<=*m*,<=*i*<=≠<=*j*). Then in each array the values at positions *i* and *j* are swapped only if the value at position *i* is strictly greater than the value at position *j*.
Iahub wants to find an array of pairs of distinct indices that, chosen in order, sort all of the *n* arrays in ascending or descending order (the particular order is given in input). The size of the array can be at most (at most pairs). Help Iahub, find any suitable array.
The first line contains three integers *n* (1<=≤<=<=*n*<=≤<=1000), *m* (1<=≤<=*m*<=≤<=<=100) and *k*. Integer *k* is 0 if the arrays must be sorted in ascending order, and 1 if the arrays must be sorted in descending order. Each line *i* of the next *n* lines contains *m* integers separated by a space, representing the *i*-th array. For each element *x* of the array *i*, 1<=≤<=*x*<=≤<=106 holds.
On the first line of the output print an integer *p*, the size of the array (*p* can be at most ). Each of the next *p* lines must contain two distinct integers *i* and *j* (1<=≤<=*i*,<=*j*<=≤<=*m*,<=*i*<=≠<=*j*), representing the chosen indices.
If there are multiple correct answers, you can print any.
Sample Input
2 5 0
1 3 2 5 4
1 4 3 2 5
3 2 1
1 2
2 3
3 4
Sample Output
3
2 4
2 3
4 5
1
2 1
| {"inputs": ["2 5 0\n1 3 2 5 4\n1 4 3 2 5", "3 2 1\n1 2\n2 3\n3 4", "2 5 0\n836096 600367 472071 200387 79763\n714679 505282 233544 157810 152591", "2 5 1\n331081 525217 574775 753333 840639\n225591 347017 538639 620341 994088", "1 1 0\n1", "1 1 1\n1", "2 1 0\n1\n2", "1 2 1\n2 1", "2 2 0\n2 1\n3 1", "2 2 0\n2 1\n1 3", "2 2 1\n2 1\n3 1"], "outputs": ["3\n2 4\n2 3\n4 5", "1\n2 1", "10\n1 2\n1 3\n1 4\n1 5\n2 3\n2 4\n2 5\n3 4\n3 5\n4 5", "10\n2 1\n3 1\n4 1\n5 1\n3 2\n4 2\n5 2\n4 3\n5 3\n5 4", "0", "0", "0", "1\n2 1", "1\n1 2", "1\n1 2", "1\n2 1"]} | UNKNOWN | [
"PYTHON3"
] | CODEFORCES | 28 | codeforces |
|
4f3f1b3886bf8084ebd7c68cecda1017 | Ring road | Nowadays the one-way traffic is introduced all over the world in order to improve driving safety and reduce traffic jams. The government of Berland decided to keep up with new trends. Formerly all *n* cities of Berland were connected by *n* two-way roads in the ring, i. e. each city was connected directly to exactly two other cities, and from each city it was possible to get to any other city. Government of Berland introduced one-way traffic on all *n* roads, but it soon became clear that it's impossible to get from some of the cities to some others. Now for each road is known in which direction the traffic is directed at it, and the cost of redirecting the traffic. What is the smallest amount of money the government should spend on the redirecting of roads so that from every city you can get to any other?
The first line contains integer *n* (3<=≤<=*n*<=≤<=100) — amount of cities (and roads) in Berland. Next *n* lines contain description of roads. Each road is described by three integers *a**i*, *b**i*, *c**i* (1<=≤<=*a**i*,<=*b**i*<=≤<=*n*,<=*a**i*<=≠<=*b**i*,<=1<=≤<=*c**i*<=≤<=100) — road is directed from city *a**i* to city *b**i*, redirecting the traffic costs *c**i*.
Output single integer — the smallest amount of money the government should spend on the redirecting of roads so that from every city you can get to any other.
Sample Input
3
1 3 1
1 2 1
3 2 1
3
1 3 1
1 2 5
3 2 1
6
1 5 4
5 3 8
2 4 15
1 6 16
2 3 23
4 6 42
4
1 2 9
2 3 8
3 4 7
4 1 5
Sample Output
1
2
39
0
| {"inputs": ["3\n1 3 1\n1 2 1\n3 2 1", "3\n1 3 1\n1 2 5\n3 2 1", "6\n1 5 4\n5 3 8\n2 4 15\n1 6 16\n2 3 23\n4 6 42", "4\n1 2 9\n2 3 8\n3 4 7\n4 1 5", "5\n5 3 89\n2 3 43\n4 2 50\n1 4 69\n1 5 54", "10\n1 8 16\n6 1 80\n6 5 27\n5 7 86\n7 9 72\n4 9 20\n4 3 54\n3 2 57\n10 2 61\n8 10 90", "17\n8 12 43\n13 12 70\n7 13 68\n11 7 19\n5 11 24\n5 1 100\n4 1 10\n3 4 68\n2 3 46\n15 2 58\n15 6 38\n6 9 91\n9 10 72\n14 10 32\n14 17 97\n17 16 67\n8 16 40", "22\n18 22 46\n18 21 87\n5 21 17\n5 10 82\n10 12 81\n17 12 98\n16 17 17\n16 13 93\n4 13 64\n4 11 65\n15 11 18\n6 15 35\n6 7 61\n7 19 12\n19 1 65\n8 1 32\n8 2 46\n9 2 19\n9 3 58\n3 14 65\n20 14 67\n20 22 2", "39\n18 11 10\n5 18 97\n5 39 77\n39 24 64\n24 28 79\n28 14 6\n34 14 72\n6 34 64\n6 12 93\n12 8 66\n13 8 40\n35 13 20\n35 32 4\n32 19 55\n19 3 18\n3 21 26\n30 21 54\n30 27 5\n4 27 8\n22 4 89\n15 22 54\n15 2 90\n36 2 58\n33 36 4\n33 17 50\n17 16 21\n31 16 64\n1 31 77\n1 23 89\n23 7 62\n38 7 74\n9 38 15\n9 25 93\n25 10 32\n10 26 78\n20 26 63\n37 20 9\n29 37 33\n11 29 45", "50\n30 34 48\n11 30 15\n11 5 98\n4 5 57\n43 4 21\n14 43 74\n14 19 52\n45 19 60\n45 28 52\n24 28 94\n24 26 2\n48 26 48\n48 13 53\n13 42 7\n42 37 23\n37 17 70\n17 7 29\n20 7 93\n33 20 21\n33 2 53\n21 2 83\n49 21 33\n46 49 28\n18 46 1\n36 18 99\n47 36 52\n47 29 41\n41 29 40\n31 41 45\n31 38 25\n38 25 41\n25 8 18\n9 8 60\n9 27 29\n16 27 17\n16 22 6\n22 39 1\n1 39 8\n1 50 89\n50 12 64\n40 12 7\n40 44 71\n44 10 23\n15 10 70\n15 32 53\n23 32 92\n35 23 14\n35 3 25\n3 6 93\n6 34 99", "3\n3 1 1\n2 1 1\n2 3 1"], "outputs": ["1", "2", "39", "0", "143", "267", "435", "413", "950", "1117", "1"]} | UNKNOWN | [
"PYTHON3"
] | CODEFORCES | 90 | codeforces |
|
4f57807abc657d81814ba2545baf08e5 | Race | Today *s* kilometer long auto race takes place in Berland. The track is represented by a straight line as long as *s* kilometers. There are *n* cars taking part in the race, all of them start simultaneously at the very beginning of the track. For every car is known its behavior — the system of segments on each of which the speed of the car is constant. The *j*-th segment of the *i*-th car is pair (*v**i*,<=*j*,<=*t**i*,<=*j*), where *v**i*,<=*j* is the car's speed on the whole segment in kilometers per hour and *t**i*,<=*j* is for how many hours the car had been driving at that speed. The segments are given in the order in which they are "being driven on" by the cars.
Your task is to find out how many times during the race some car managed to have a lead over another car. A lead is considered a situation when one car appears in front of another car. It is known, that all the leads happen instantly, i. e. there are no such time segment of positive length, during which some two cars drive "together". At one moment of time on one and the same point several leads may appear. In this case all of them should be taken individually. Meetings of cars at the start and finish are not considered to be counted as leads.
The first line contains two integers *n* and *s* (2<=≤<=*n*<=≤<=100,<=1<=≤<=*s*<=≤<=106) — the number of cars and the length of the track in kilometers. Then follow *n* lines — the description of the system of segments for each car. Every description starts with integer *k* (1<=≤<=*k*<=≤<=100) — the number of segments in the system. Then *k* space-separated pairs of integers are written. Each pair is the speed and time of the segment. These integers are positive and don't exceed 1000. It is guaranteed, that the sum of lengths of all segments (in kilometers) for each car equals to *s*; and all the leads happen instantly.
Print the single number — the number of times some car managed to take the lead over another car during the race.
Sample Input
2 33
2 5 1 2 14
1 3 11
2 33
2 1 3 10 3
1 11 3
5 33
2 1 3 3 10
1 11 3
2 5 3 3 6
2 3 1 10 3
2 6 3 3 5
Sample Output
1
0
2
| {"inputs": ["2 33\n2 5 1 2 14\n1 3 11", "2 33\n2 1 3 10 3\n1 11 3", "5 33\n2 1 3 3 10\n1 11 3\n2 5 3 3 6\n2 3 1 10 3\n2 6 3 3 5", "2 166755\n2 733 187 362 82\n3 813 147 565 57 557 27", "3 228385\n2 307 733 43 78\n2 252 801 157 169\n3 86 346 133 886 467 173", "4 773663\n9 277 398 57 73 62 736 625 393 186 761 129 716 329 179 54 223 554 114\n4 463 333 547 696 33 89 505 467\n2 527 792 661 539\n2 643 976 479 305", "5 835293\n2 421 965 758 566\n3 357 337 956 745 4 691\n2 433 925 464 937\n5 67 581 109 375 463 71 499 819 589 533\n2 918 828 353 213", "6 896922\n8 295 313 551 122 299 965 189 619 139 566 311 427 47 541 411 231\n5 743 210 82 451 921 124 792 397 742 371\n7 173 247 608 603 615 383 307 10 112 670 991 103 361 199\n2 190 209 961 892\n2 821 870 186 982\n5 563 456 293 568 247 955 134 787 151 877", "7 958552\n4 773 315 702 379 382 277 411 835\n3 365 416 554 861 921 358\n9 137 278 394 557 233 404 653 77 114 527 117 790 338 507 107 353 557 350\n3 776 928 43 258 895 254\n2 613 684 590 914\n4 568 326 917 201 379 173 698 750\n2 536 687 785 752", "8 394115\n8 350 64 117 509 217 451 393 118 99 454 136 37 240 183 937 79\n5 222 43 727 39 724 318 281 281 797 59\n4 440 139 367 155 415 250 359 480\n6 191 480 653 202 367 291 241 167 13 123 706 31\n2 410 369 883 275\n2 205 307 571 580\n2 469 211 452 653\n2 822 431 61 653", "9 81812\n8 31 410 547 18 22 77 449 5 491 8 10 382 746 21 61 523\n1 452 181\n1 724 113\n1 113 724\n1 226 362\n46 5 257 2 126 373 6 6 491 9 7 137 23 93 73 163 13 17 106 3 100 5 415 270 2 7 723 597 4 176 3 274 18 1 852 334 14 7 25 163 1 3 199 29 140 32 32 191 2 583 3 23 11 22 23 250 1 79 3 33 83 8 433 59 11 2 466 7 761 1 386 6 2 12 68 79 13 4 346 455 1 21 194 58 1 154 12 49 23 7 79 64 87\n12 449 11 21 192 328 9 35 381 5 492 361 9 604 11 47 239 543 22 40 265 9 105 27 351\n1 181 452\n1 362 226", "10 746595\n4 361 446 717 421 143 532 404 514\n2 327 337 724 879\n6 733 80 2 994 396 774 841 35 159 15 361 963\n5 283 973 43 731 633 521 335 269 173 115\n2 727 587 886 361\n6 223 683 98 367 80 293 612 584 128 991 224 226\n2 911 468 783 409\n2 308 983 529 839\n2 698 639 367 819\n2 275 397 785 812", "2 5\n3 2 1 1 1 2 1\n3 1 1 2 1 1 2", "2 6\n3 1 2 2 1 1 2\n3 2 1 1 2 2 1"], "outputs": ["1", "0", "2", "0", "0", "0", "4", "13", "10", "15", "5", "21", "0", "0"]} | UNKNOWN | [
"PYTHON3"
] | CODEFORCES | 2 | codeforces |
|
4f681d465ce8905f9eebe024d288c041 | Laser | Petya is the most responsible worker in the Research Institute. So he was asked to make a very important experiment: to melt the chocolate bar with a new laser device. The device consists of a rectangular field of *n*<=×<=*m* cells and a robotic arm. Each cell of the field is a 1<=×<=1 square. The robotic arm has two lasers pointed at the field perpendicularly to its surface. At any one time lasers are pointed at the centres of some two cells. Since the lasers are on the robotic hand, their movements are synchronized — if you move one of the lasers by a vector, another one moves by the same vector.
The following facts about the experiment are known:
- initially the whole field is covered with a chocolate bar of the size *n*<=×<=*m*, both lasers are located above the field and are active; - the chocolate melts within one cell of the field at which the laser is pointed; - all moves of the robotic arm should be parallel to the sides of the field, after each move the lasers should be pointed at the centres of some two cells; - at any one time both lasers should be pointed at the field. Petya doesn't want to become a second Gordon Freeman.
You are given *n*, *m* and the cells (*x*1,<=*y*1) and (*x*2,<=*y*2), where the lasers are initially pointed at (*x**i* is a column number, *y**i* is a row number). Rows are numbered from 1 to *m* from top to bottom and columns are numbered from 1 to *n* from left to right. You are to find the amount of cells of the field on which the chocolate can't be melted in the given conditions.
The first line contains one integer number *t* (1<=≤<=*t*<=≤<=10000) — the number of test sets. Each of the following *t* lines describes one test set. Each line contains integer numbers *n*, *m*, *x*1, *y*1, *x*2, *y*2, separated by a space (2<=≤<=*n*,<=*m*<=≤<=109, 1<=≤<=*x*1,<=*x*2<=≤<=*n*, 1<=≤<=*y*1,<=*y*2<=≤<=*m*). Cells (*x*1,<=*y*1) and (*x*2,<=*y*2) are distinct.
Each of the *t* lines of the output should contain the answer to the corresponding input test set.
Sample Input
2
4 4 1 1 3 3
4 3 1 1 2 2
Sample Output
8
2
| {"inputs": ["2\n4 4 1 1 3 3\n4 3 1 1 2 2", "1\n2 2 1 2 2 1", "1\n2 2 1 2 2 1", "1\n3 3 3 2 1 1", "1\n3 4 1 1 1 2", "1\n4 3 3 1 4 1", "1\n3 5 2 4 3 5", "1\n4 5 2 2 4 2", "1\n2 5 1 5 2 2", "1\n2 6 2 6 2 3", "1\n3 6 3 5 2 4", "1\n4 6 2 1 2 3", "1\n5 6 3 4 4 2", "1\n7 3 6 2 5 2", "1\n8 2 6 1 7 2", "1\n9 6 6 5 3 1", "20\n100 200 100 1 100 100\n100 200 1 100 100 100\n2 2 1 1 2 2\n100 100 50 50 1 1\n10 10 5 5 1 1\n100 100 99 1 1 99\n100 100 1 99 99 1\n100 100 1 10 10 1\n100 100 1 1 10 10\n9 6 1 3 3 1\n1000000000 1000000000 1 1 1000000000 1000000000\n9 4 1 4 4 1\n6 4 1 1 5 4\n6 2 1 1 5 2\n8 2 1 1 5 2\n10 2 1 1 5 2\n10 2 1 1 3 2\n4 3 1 1 2 2\n3 3 1 1 2 2\n3 3 1 1 2 1"], "outputs": ["8\n2", "2", "2", "5", "0", "0", "2", "0", "6", "0", "2", "0", "4", "0", "2", "30", "0\n19600\n2\n4802\n32\n9992\n9992\n162\n162\n8\n999999999999999998\n24\n20\n8\n8\n8\n4\n2\n2\n0"]} | UNKNOWN | [
"PYTHON3"
] | CODEFORCES | 15 | codeforces |
|
4f6d771773c09a28a6671135a970f49c | Death Stars (easy) | The stardate is 1977 and the science and art of detecting Death Stars is in its infancy. Princess Heidi has received information about the stars in the nearby solar system from the Rebel spies and now, to help her identify the exact location of the Death Star, she needs to know whether this information is correct.
Two rebel spies have provided her with the maps of the solar system. Each map is an *N*<=×<=*N* grid, where each cell is either occupied by a star or empty. To see whether the information is correct, Heidi needs to know whether the two maps are of the same solar system, or if possibly one of the spies is actually an Empire double agent, feeding her false information.
Unfortunately, spies may have accidentally rotated a map by 90, 180, or 270 degrees, or flipped it along the vertical or the horizontal axis, before delivering it to Heidi. If Heidi can rotate or flip the maps so that two of them become identical, then those maps are of the same solar system. Otherwise, there are traitors in the Rebel ranks! Help Heidi find out.
The first line of the input contains one number *N* (1<=≤<=*N*<=≤<=10) – the dimension of each map. Next *N* lines each contain *N* characters, depicting the first map: 'X' indicates a star, while 'O' indicates an empty quadrant of space. Next *N* lines each contain *N* characters, depicting the second map in the same format.
The only line of output should contain the word Yes if the maps are identical, or No if it is impossible to match them by performing rotations and translations.
Sample Input
4
XOOO
XXOO
OOOO
XXXX
XOOO
XOOO
XOXO
XOXX
2
XX
OO
XO
OX
Sample Output
Yes
No
| {"inputs": ["4\nXOOO\nXXOO\nOOOO\nXXXX\nXOOO\nXOOO\nXOXO\nXOXX", "2\nXX\nOO\nXO\nOX", "1\nO\nO", "1\nX\nO", "2\nOX\nXX\nOX\nXX", "2\nOX\nXO\nXO\nOX", "2\nOX\nOX\nXX\nOX", "2\nOO\nOO\nOO\nOO", "2\nOX\nOX\nXO\nXO", "10\nXXXOOOOXOX\nOOOXXXOXXO\nXOXXXXOOXX\nXOOOXXOXOO\nOOXOOOOOOX\nXXXXOXOOOO\nXXXOOXOXOX\nOOOOXOXOXX\nXOXXOXOOXO\nOOOOOXOOOO\nXXXOOOOXOX\nOOOXXXOXXO\nXOXXXXOOXX\nXOOOXXOXOO\nOOXOOOOOOX\nXXXXOXOOOO\nXXXOOXOXOX\nOOOOXOXOXX\nXOXXOXOOXO\nOOOOOXOOOO", "10\nXXOXXOXOOX\nOOOOXOOXXO\nOXXXOOXOOO\nOOXOOOOOOO\nXXXOXOXXXX\nOXXXXOXXOO\nOXXXXOOXXX\nXXOXXOXOXO\nOOOXOOOOOO\nXOOXOOOOXX\nXOOXOOOOXX\nOOOXOOOOOO\nXXOXXOXOXO\nOXXXXOOXXX\nOXXXXOXXOO\nXXXOXOXXXX\nOOXOOOOOOO\nOXXXOOXOOO\nOOOOXOOXXO\nXXOXXOXOOX", "10\nXXOOOOOXXO\nOXOOXOOXXO\nXOOXOXXXXO\nOXXXXOXOXO\nXXXOXXOXOO\nOXOOOOOXOX\nXOXOXOOOXO\nOXXXOOOOOX\nXXOOOOOXOO\nXOXXXOOXXX\nXXOXOXOXOX\nOXXOXXXOXX\nXOXXOXXOOO\nXOXOOOXXOO\nXOOXOXXOXO\nOOOOOXOXOO\nOXOOOOXXOO\nXXOOXXOXXX\nXOOXOOXXXX\nXOXOXOOOOO", "10\nXOOXOXXXXX\nXOXXOXOXXX\nOOOXOXOOOX\nOOOXXXOOXX\nOXOXXOXOXO\nOXXOXOOOOO\nOXOOXXOXXO\nOOXOXXXXOX\nXOXXXXOOXX\nXOOOOXXOOX\nXXXOOOXXXX\nOXOXOXXOXX\nOOXXOOOOXX\nXOXOOXOOOX\nXXXXOOXXXX\nOXXXXXXOOO\nOXOOOXXXXX\nOXXOXOOOXO\nOOOXXXOOOO\nXXOOOOOOXX", "10\nXXOOXOOOXO\nXXOXXXXXXX\nXOOOXOOXXX\nOXOOOXXXXO\nXOOOOOOOOO\nXXOXXXXOOX\nOOOXOXOOOX\nXOXOOXOOXO\nOOXOOXOXXO\nXOXOXOXXOO\nOOOXXOOXXO\nOXXOOOOXOX\nXXOOOOXXXO\nXOOOXOXOXO\nOXXXXOXOXO\nXOOOXOOXXX\nOOOXXOOOXO\nXXXOOOOOOO\nOOOOXOXOXX\nXOXOXXOXXX", "10\nXOOOOXOOOX\nOOOOOOOXXX\nOXOOOXXOXO\nOOXXXOOXOX\nOOXXOOOXXO\nXXXXOXOXXX\nXXXOOXOOOO\nXXXXOOXXXO\nOXXXXXXOXX\nXXXOOOXOXO\nXOOOXOOOOX\nXXXOOOOOOO\nOXOXXOOOXO\nXOXOOXXXOO\nOXXOOOXXOO\nXXXOXOXXXX\nOOOOXOOXXX\nOXXXOOXXXX\nXXOXXXXXXO\nOXOXOOOXXX", "10\nXOXXOXXOOX\nOXXOXOXXXX\nXXOOXOXOOO\nOXOOOOXOOO\nOOOOOOOXOX\nXXOXXOOXOX\nXOXOXOOOOX\nOXOXOOXXOX\nXOXOXOXXXO\nOOXOXXXXXX\nOOXOOXXXXX\nXOXOXOXXXO\nOXOXOOXXOX\nXOXXXOOOOX\nXXOXXOOXOX\nOOOOOOOXOX\nOXOOOOXOOO\nXXOOXOXOOO\nOXXOXOXXXX\nXOXOOXXOOX", "10\nXXXOXOOXXX\nOOXXOXXOXO\nOOOOXOOXOX\nXOOXOXOOXX\nXOXXOXOOXX\nOOOXXOXOXX\nOOOXOOOOXO\nOOXOOXXOXX\nXXOXOOXOOX\nOXXXOOXOXX\nXXOXOOXXXO\nXOOXOOXOXX\nXXOXXOOXOO\nOXOOOOXOOO\nXXOXOXXOOO\nXXOOXOXXOX\nXXOOXOXOOX\nXOXOOXOOOO\nOXOXXOXXOO\nXXXOOXOXXX", "10\nXOXXXXXXXX\nOOOOXXXOXO\nXOXXXXOOXX\nXXXOXXXXXO\nOXXXXOXOOO\nOOOOOXOXXX\nXOOOXOOXXX\nXOOOXXXXOO\nOXOOXOXXOX\nOXOXXOXXOX\nXXOXXOOXOX\nOOOXXOXXXX\nXXXXXOXOOX\nXXXOOXXOXO\nOOXOXOXXXX\nXXXXOXXXXX\nXOOOOXOXOX\nOOOXOXXXXX\nXXOOOXXOOO\nOOXXOOXOOX", "10\nXXXOOOOOXO\nXXOXOOXOXX\nXOXXXXXXXO\nXOXOXOOXXX\nXXOOXXOXXO\nOOOOOOOOXX\nOOXOXXOOXX\nXXXXOXXOOO\nXOXOXXXOXX\nOXXOXXOOOO\nOXOXOXXOXO\nXXXXXXXOXO\nOOXXXOOOOO\nOXXOOOOXXO\nOOXOXOXXXX\nOOXXXOXOXX\nOXXOOOOXOO\nXOXXOOXXXX\nXXOOXOOXOX\nXXXXXOOXXO", "10\nXXOXOOOOXX\nXOXXXOXOXO\nOXXXOOXOOO\nXXOXOOXXOX\nXXOXXOXXOO\nOOOXXXXOXO\nOXXXOXOXOO\nOXOXXXXXXX\nXXXOOXXXXX\nXXOOXOOXXO\nXOOOOXXOXX\nXXXXOXXXOX\nOXOXOOOXXO\nOOXXXXXXXX\nXOXOXXOOXO\nOXXXXOOOXX\nOXXXXXXXXO\nXXXXOXXOOO\nXXXOXOOOXX\nOXXXOOXOOX", "10\nXOXXXXXOOO\nOXXOOXXOXX\nXXXXXOOXOX\nOOOOOXOXOX\nOXXOXXXOXO\nXOOXOXXXXX\nXOOOOOOOOX\nOOXXOOXXXX\nOOOOXXOOOX\nXXXXXOOOXX\nXXOOOXXXXX\nXOOOXXOOOO\nXXXXOOXXOO\nXOOOOOOOOX\nXXXXXOXOOX\nOXOXXXOXXO\nXOXOXOOOOO\nXOXOOXXXXX\nXXOXXOOXXO\nOOOXXXXXOX", "10\nXXOOOOOXOX\nOOOOXXXOXX\nOOOXOOOOXX\nOXXXXXXOOX\nXOOXOXOOXX\nXOOOOOOXXO\nXXXOOOOXOO\nOOOOXOXOOO\nOXOOOOOXOX\nXXOXXXOXOX\nXXOOOXXXXO\nOOOOXXOOXO\nXXOXXOOOOX\nXOXOOOXOXO\nXOOOOXXOXO\nXOXOOOXOXO\nXOOXOXXXXO\nOOOXOOXOOO\nXXOXOXXOOX\nXOOXXXOOOX", "3\nOXO\nOXO\nOOO\nOOO\nOXO\nOXO", "3\nOXX\nOOO\nXXO\nOOX\nXOO\nOOO", "4\nXXXX\nXXOO\nOOOX\nXXOX\nXXOX\nXXOX\nXOOO\nXOXX", "4\nOXOO\nXOXX\nOOOO\nOXXX\nOXOO\nXXXO\nOXOO\nOOOO", "5\nXXXXO\nOXOXO\nXOXOO\nXOXXX\nXOXXX\nXXXXO\nOXOXO\nXOXOO\nXOXXX\nXOXXX", "5\nXOXXX\nXOXXO\nOXOOX\nOOXXX\nOOXXX\nXOXXO\nXXXXO\nOXOOX\nXXXOX\nOOOXX", "6\nOOOOOX\nOXOXXX\nXXOOOO\nXXXOXX\nXOOOOX\nOOOXOX\nXXXOXX\nOOXOXO\nXOOOXO\nOOXOOO\nOOXXXO\nOXXXOO", "6\nXOOXOO\nXXOOXO\nOXXOOO\nXOOXOO\nOXXXXX\nOOOOXX\nXXOXOO\nOXOOXO\nOOXOOX\nXXOXXO\nOXOOXX\nOOOOXX", "7\nOOXXOOX\nXOXOOXO\nOOOXOOO\nXXOOOXX\nXXXXXOX\nXOXOOOO\nXOXOOOX\nOXOXXXX\nOOOXXOO\nXXOOXXX\nXOXOXOO\nOOOOXOO\nOXOXOOO\nXOOXXOX", "7\nXOXOOXO\nXOOOXXO\nXOOXXXO\nXOOXXOO\nOXXOOXX\nXXOOOXO\nXXOXXXX\nXOXOOXX\nXOOOXXO\nXOOOXXO\nXOOXXOO\nXXXXOXX\nXXOOOXO\nXXOXOOX", "8\nOXOXXXXX\nXXXXOXOO\nOXOXOXOX\nXXXOXXOX\nOXXOXXXX\nXXOXXXOO\nXXXXOOOO\nOXXXOOOO\nOOOOXXXO\nOOOOXXXX\nOOXXXOXX\nXXXXOXXO\nXOXXOXXX\nXOXOXOXO\nOOXOXXXX\nXXXXXOXO", "8\nOXOOOOOO\nXOXOXXXO\nOXXXXXOX\nOOXXOXOO\nXOOOXOOO\nXOOXXOXO\nOOXXXXXX\nXXXOOXXX\nOXOOXXOO\nXOXOOOOX\nOOXXOOXX\nOOXXOXXO\nOXXOXXXX\nOXOXXOXO\nOXOOOXXX\nOOXOOOXX", "9\nXXXOXOOXO\nXOOOOXOOO\nOOXXOXOXO\nXXXXOXOXX\nXXXXXXOXO\nOOXOXXOXX\nXXOXXXXXO\nXXXOXOOOO\nXXOOXOOXX\nXXXOXOOXO\nXOOOOXOOO\nOOXXOXOXO\nXXXXOXOXX\nXXXXXXOXO\nOOXOXXOXX\nXXOXXXXXO\nXXXOXOOOO\nXXOOXOOXX", "9\nOXOXXXXOX\nXOXXOXOOO\nOOXOOOXOO\nOOOXXOXOX\nOOXOOOOXX\nOXXXOXOOO\nOOOXXOXOO\nOOXOXXOXO\nOOXOOOXOX\nOXOOOOXOO\nXOOOOXOOO\nOXXOXXOXO\nXXOXOXXOO\nXOOOOOOXO\nXXOOOXOXO\nXOXOOOXOX\nOOXOXOOXO\nXOOXXOOOX"], "outputs": ["Yes", "No", "Yes", "No", "Yes", "Yes", "No", "Yes", "Yes", "Yes", "Yes", "No", "Yes", "No", "Yes", "No", "Yes", "No", "Yes", "No", "Yes", "No", "Yes", "No", "Yes", "No", "Yes", "No", "Yes", "No", "Yes", "No", "Yes", "No", "Yes", "No"]} | UNKNOWN | [
"PYTHON3"
] | CODEFORCES | 22 | codeforces |
|
4f84f706f58aeadbed87aac8b2b1859c | Multiplication Table | Bizon the Champion isn't just charming, he also is very smart.
While some of us were learning the multiplication table, Bizon the Champion had fun in his own manner. Bizon the Champion painted an *n*<=×<=*m* multiplication table, where the element on the intersection of the *i*-th row and *j*-th column equals *i*·*j* (the rows and columns of the table are numbered starting from 1). Then he was asked: what number in the table is the *k*-th largest number? Bizon the Champion always answered correctly and immediately. Can you repeat his success?
Consider the given multiplication table. If you write out all *n*·*m* numbers from the table in the non-decreasing order, then the *k*-th number you write out is called the *k*-th largest number.
The single line contains integers *n*, *m* and *k* (1<=≤<=*n*,<=*m*<=≤<=5·105; 1<=≤<=*k*<=≤<=*n*·*m*).
Print the *k*-th largest number in a *n*<=×<=*m* multiplication table.
Sample Input
2 2 2
2 3 4
1 10 5
Sample Output
2
3
5
| {"inputs": ["2 2 2", "2 3 4", "1 10 5", "1 1 1", "10 1 7", "10 10 33", "500000 500000 1", "500000 500000 250000000000", "3 3 1", "3 3 2", "3 3 3", "3 3 5", "3 3 8", "3 3 9", "1 500000 74747", "500000 1 47474", "499975 499981 12345", "499997 499989 248758432143", "5 1 2", "2 2 4", "1 2 1", "2 44 36", "2 28 49", "3 48 30", "5 385 1296", "1 454 340", "1 450 399", "1 3304 218", "3 4175 661", "4 1796 2564", "2 33975 17369", "4 25555 45556", "5 17136 9220", "3 355632 94220", "5 353491 107977", "4 194790 114613", "47 5 157", "26 5 79", "40 2 3", "12 28 127", "32 12 132", "48 40 937", "45 317 6079", "18 459 7733", "38 127 1330", "25 1155 9981", "41 4600 39636", "20 2222 11312", "32 11568 36460", "48 33111 5809", "27 24692 71714", "46 356143 2399416", "25 127045 1458997", "41 246624 2596292", "264 3 775", "495 3 17", "252 5 672", "314 32 3903", "472 15 932", "302 39 4623", "318 440 57023", "403 363 932", "306 433 25754", "143 1735 246128", "447 4446 802918", "132 3890 439379", "366 45769 5885721", "123 37349 4224986", "427 46704 7152399", "357 184324 28748161", "187 425625 25103321", "345 423483 40390152", "4775 3 7798", "1035 2 2055", "3119 3 7305", "1140 18 11371", "4313 40 86640", "2396 24 55229", "2115 384 385536", "2376 308 665957", "4460 377 1197310", "2315 1673 225263", "1487 3295 736705", "3571 3828 7070865", "3082 23173 68350097", "1165 34678 7211566", "1426 26259 37212278", "2930 491026 923941798", "3191 454046 718852491", "1274 295345 301511265", "10657 3 9816", "38939 3 6757", "37107 4 28350", "19618 16 313726", "27824 40 906786", "46068 31 424079", "40716 482 14569037", "48922 150 653002", "37203 219 2355222", "23808 3322 48603931", "12090 2766 12261436", "20296 4388 29300901", "29699 38801 37684232", "17980 28231 221639883", "16148 39736 239320912", "35531 340928 9207622511", "43737 111829 865416726", "21980 353130 2233068545", "339697 4 1259155", "404625 2 132619", "226111 2 359116", "318377 38 7214261", "139863 21 1834174", "204791 41 8382971", "149281 382 51428462", "370768 123 15161219", "313975 448 85041752", "136614 3211 364472869", "201542 4833 512478332", "423029 1365 126620483", "110941 47433 2098952903", "175869 39014 3201917805", "397356 10518 874806404", "118728 168631 16269281609", "183656 409931 42943608085", "283422 407789 73398688052", "500000 500000 888888"], "outputs": ["2", "3", "5", "1", "7", "14", "1", "250000000000", "1", "2", "2", "3", "6", "9", "74747", "47474", "1634", "225563648440", "2", "4", "1", "24", "42", "17", "711", "340", "399", "218", "361", "1232", "11580", "21868", "4039", "51393", "47290", "55015", "87", "42", "2", "49", "50", "364", "2160", "5684", "404", "3318", "10865", "3502", "8988", "1308", "18432", "598032", "548779", "751716", "741", "10", "328", "1345", "283", "1589", "19203", "175", "6500", "218316", "268036", "265096", "1841004", "2895390", "2256408", "9992350", "7534560", "11441760", "4254", "2040", "5024", "4830", "33496", "43102", "140250", "445248", "581462", "40950", "169290", "2696688", "51543000", "1745254", "33359110", "409544625", "267275676", "165699050", "5355", "3686", "13608", "311296", "518185", "131352", "7363656", "135716", "681502", "20824476", "3894264", "8862304", "6032628", "76707084", "76569666", "4761654318", "208223208", "638445948", "993876", "88413", "266010", "3108710", "833220", "8020256", "33762615", "4677246", "36070940", "209750632", "197440230", "32780826", "693548595", "1148848775", "222468766", "9092195490", "17438143800", "32237937640", "77856"]} | UNKNOWN | [
"PYTHON3"
] | CODEFORCES | 34 | codeforces |
|
4f926e59c7bf0478b3b3f334a6fa879a | Shell Game | Bomboslav likes to look out of the window in his room and watch lads outside playing famous shell game. The game is played by two persons: operator and player. Operator takes three similar opaque shells and places a ball beneath one of them. Then he shuffles the shells by swapping some pairs and the player has to guess the current position of the ball.
Bomboslav noticed that guys are not very inventive, so the operator always swaps the left shell with the middle one during odd moves (first, third, fifth, etc.) and always swaps the middle shell with the right one during even moves (second, fourth, etc.).
Let's number shells from 0 to 2 from left to right. Thus the left shell is assigned number 0, the middle shell is 1 and the right shell is 2. Bomboslav has missed the moment when the ball was placed beneath the shell, but he knows that exactly *n* movements were made by the operator and the ball was under shell *x* at the end. Now he wonders, what was the initial position of the ball?
The first line of the input contains an integer *n* (1<=≤<=*n*<=≤<=2·109) — the number of movements made by the operator.
The second line contains a single integer *x* (0<=≤<=*x*<=≤<=2) — the index of the shell where the ball was found after *n* movements.
Print one integer from 0 to 2 — the index of the shell where the ball was initially placed.
Sample Input
4
2
1
1
Sample Output
1
0
| {"inputs": ["4\n2", "1\n1", "2\n2", "3\n1", "3\n2", "3\n0", "2000000000\n0", "2\n0", "2\n1", "4\n0", "4\n1", "5\n0", "5\n1", "5\n2", "6\n0", "6\n1", "6\n2", "7\n0", "7\n1", "7\n2", "100000\n0", "100000\n1", "100000\n2", "99999\n1", "99998\n1", "99997\n1", "99996\n1", "99995\n1", "1999999995\n0", "1999999995\n1", "1999999995\n2", "1999999996\n0", "1999999996\n1", "1999999996\n2", "1999999997\n0", "1999999997\n1", "1999999997\n2", "1999999998\n0", "1999999998\n1", "1999999998\n2", "1999999999\n0", "1999999999\n1", "1999999999\n2", "2000000000\n1", "2000000000\n2", "1234567890\n0", "1234567890\n1", "1234567890\n2", "123456789\n0", "123456789\n1", "123456789\n2", "123456790\n0", "12\n2", "32\n1", "20\n2", "10\n1", "1\n0", "76994383\n1", "25\n2", "1\n2", "12\n0", "150\n2", "15\n0", "21\n2", "18\n2", "8\n2", "10\n0", "16\n0"], "outputs": ["1", "0", "0", "1", "0", "2", "1", "1", "2", "2", "0", "0", "2", "1", "0", "1", "2", "1", "0", "2", "2", "0", "1", "1", "2", "0", "1", "2", "2", "1", "0", "2", "0", "1", "0", "2", "1", "0", "1", "2", "1", "0", "2", "2", "0", "0", "1", "2", "2", "1", "0", "2", "2", "2", "0", "0", "1", "0", "2", "2", "0", "2", "2", "0", "2", "0", "2", "2"]} | UNKNOWN | [
"PYTHON3"
] | CODEFORCES | 172 | codeforces |
|
4f96c364ed54ea97246ce9afac3b7d1b | Closest Equals | You are given sequence *a*1,<=*a*2,<=...,<=*a**n* and *m* queries *l**j*,<=*r**j* (1<=≤<=*l**j*<=≤<=*r**j*<=≤<=*n*). For each query you need to print the minimum distance between such pair of elements *a**x* and *a**y* (*x*<=≠<=*y*), that:
- both indexes of the elements lie within range [*l**j*,<=*r**j*], that is, *l**j*<=≤<=*x*,<=*y*<=≤<=*r**j*; - the values of the elements are equal, that is *a**x*<==<=*a**y*.
The text above understands distance as |*x*<=-<=*y*|.
The first line of the input contains a pair of integers *n*, *m* (1<=≤<=*n*,<=*m*<=≤<=5·105) — the length of the sequence and the number of queries, correspondingly.
The second line contains the sequence of integers *a*1,<=*a*2,<=...,<=*a**n* (<=-<=109<=≤<=*a**i*<=≤<=109).
Next *m* lines contain the queries, one per line. Each query is given by a pair of numbers *l**j*,<=*r**j* (1<=≤<=*l**j*<=≤<=*r**j*<=≤<=*n*) — the indexes of the query range limits.
Print *m* integers — the answers to each query. If there is no valid match for some query, please print -1 as an answer to this query.
Sample Input
5 3
1 1 2 3 2
1 5
2 4
3 5
6 5
1 2 1 3 2 3
4 6
1 3
2 5
2 4
1 6
Sample Output
1
-1
2
2
2
3
-1
2
| {"inputs": ["5 3\n1 1 2 3 2\n1 5\n2 4\n3 5", "6 5\n1 2 1 3 2 3\n4 6\n1 3\n2 5\n2 4\n1 6", "10 6\n2 2 1 5 6 4 9 8 5 4\n1 2\n1 10\n2 10\n2 9\n5 5\n2 8", "1 1\n1\n1 1", "1 3\n1\n1 1\n1 1\n1 1", "2 1\n1 1\n1 2", "2 1\n1 1\n1 1", "2 5\n1 1\n1 1\n1 2\n2 2\n1 2\n1 1", "2 4\n1 2\n1 1\n1 2\n2 2\n1 2"], "outputs": ["1\n-1\n2", "2\n2\n3\n-1\n2", "1\n1\n4\n5\n-1\n-1", "-1", "-1\n-1\n-1", "1", "-1", "-1\n1\n-1\n1\n-1", "-1\n-1\n-1\n-1"]} | UNKNOWN | [
"PYTHON3"
] | CODEFORCES | 2 | codeforces |
|
4faaadd1d15296e368288dbc1e242dd8 | Coins | In Berland a money reform is being prepared. New coins are being introduced. After long economic calculations was decided that the most expensive coin should possess the denomination of exactly *n* Berland dollars. Also the following restriction has been introduced for comfort: the denomination of each coin should be divisible by the denomination of any cheaper coin. It is known that among all the possible variants the variant with the largest number of new coins will be chosen. Find this variant. Print in the order of decreasing of the coins' denominations.
The first and only line contains an integer *n* (1<=≤<=*n*<=≤<=106) which represents the denomination of the most expensive coin.
Print the denominations of all the coins in the order of decreasing. The number of coins must be the largest possible (with the given denomination *n* of the most expensive coin). Also, the denomination of every coin must be divisible by the denomination of any cheaper coin. Naturally, the denominations of all the coins should be different. If there are several solutins to that problem, print any of them.
Sample Input
10
4
3
Sample Output
10 5 1
4 2 1
3 1
| {"inputs": ["10", "4", "3", "2", "5", "6", "7", "1", "8", "12", "100", "1000", "10000", "100000", "1000000", "509149", "572877", "152956", "733035", "313114", "893193", "473273", "537000", "117079", "784653", "627251", "9", "999999", "120", "720", "648", "2430", "119070", "15", "21", "25", "100", "524287", "1000000", "600", "1000000", "36", "1000000", "20", "999983", "9", "999983", "20", "121", "1331"], "outputs": ["10 5 1", "4 2 1", "3 1", "2 1", "5 1", "6 3 1", "7 1", "1", "8 4 2 1", "12 6 3 1", "100 50 25 5 1", "1000 500 250 125 25 5 1", "10000 5000 2500 1250 625 125 25 5 1", "100000 50000 25000 12500 6250 3125 625 125 25 5 1", "1000000 500000 250000 125000 62500 31250 15625 3125 625 125 25 5 1", "509149 1", "572877 190959 63653 1201 1", "152956 76478 38239 1", "733035 244345 48869 1", "313114 156557 3331 1", "893193 297731 42533 1", "473273 2243 1", "537000 268500 134250 67125 22375 4475 895 179 1", "117079 6887 97 1", "784653 261551 9019 311 1", "627251 1", "9 3 1", "999999 333333 111111 37037 5291 481 37 1", "120 60 30 15 5 1", "720 360 180 90 45 15 5 1", "648 324 162 81 27 9 3 1", "2430 1215 405 135 45 15 5 1", "119070 59535 19845 6615 2205 735 245 49 7 1", "15 5 1", "21 7 1", "25 5 1", "100 50 25 5 1", "524287 1", "1000000 500000 250000 125000 62500 31250 15625 3125 625 125 25 5 1", "600 300 150 75 25 5 1", "1000000 500000 250000 125000 62500 31250 15625 3125 625 125 25 5 1", "36 18 9 3 1", "1000000 500000 250000 125000 62500 31250 15625 3125 625 125 25 5 1", "20 10 5 1", "999983 1", "9 3 1", "999983 1", "20 10 5 1", "121 11 1", "1331 121 11 1"]} | UNKNOWN | [
"PYTHON3"
] | CODEFORCES | 86 | codeforces |
|
4fb8a4af89091c7d09f011d25922a148 | Crossword solving | Erelong Leha was bored by calculating of the greatest common divisor of two factorials. Therefore he decided to solve some crosswords. It's well known that it is a very interesting occupation though it can be very difficult from time to time. In the course of solving one of the crosswords, Leha had to solve a simple task. You are able to do it too, aren't you?
Leha has two strings *s* and *t*. The hacker wants to change the string *s* at such way, that it can be found in *t* as a substring. All the changes should be the following: Leha chooses one position in the string *s* and replaces the symbol in this position with the question mark "?". The hacker is sure that the question mark in comparison can play the role of an arbitrary symbol. For example, if he gets string *s*="ab?b" as a result, it will appear in *t*="aabrbb" as a substring.
Guaranteed that the length of the string *s* doesn't exceed the length of the string *t*. Help the hacker to replace in *s* as few symbols as possible so that the result of the replacements can be found in *t* as a substring. The symbol "?" should be considered equal to any other symbol.
The first line contains two integers *n* and *m* (1<=≤<=*n*<=≤<=*m*<=≤<=1000) — the length of the string *s* and the length of the string *t* correspondingly.
The second line contains *n* lowercase English letters — string *s*.
The third line contains *m* lowercase English letters — string *t*.
In the first line print single integer *k* — the minimal number of symbols that need to be replaced.
In the second line print *k* distinct integers denoting the positions of symbols in the string *s* which need to be replaced. Print the positions in any order. If there are several solutions print any of them. The numbering of the positions begins from one.
Sample Input
3 5
abc
xaybz
4 10
abcd
ebceabazcd
Sample Output
2
2 3
1
2
| {"inputs": ["3 5\nabc\nxaybz", "4 10\nabcd\nebceabazcd", "1 1\na\na", "1 1\na\nz", "3 5\naaa\naaaaa", "3 5\naaa\naabaa", "5 5\ncoder\ncored", "1 1\nz\nz", "1 2\nf\nrt", "1 2\nf\nfg", "1 2\nf\ngf", "2 5\naa\naabaa", "2 5\naa\navaca", "3 5\naaa\nbbbbb", "3 5\naba\ncbcbc", "3 5\naba\nbbbbb", "3 5\naaa\naabvd", "3 5\nvvv\nbqavv", "10 100\nmpmmpmmmpm\nmppppppmppmmpmpppmpppmmpppmpppppmpppmmmppmpmpmmmpmmpmppmmpppppmpmppppmmppmpmppmmmmpmmppmmmpmpmmmpppp", "26 26\nabcdefghijklmnopqrstuvwxyz\nffffffffffffffffffffffffff", "3 5\nabc\nxyzab", "4 4\nabcd\nxabc", "3 4\nabc\nabcd", "3 3\nabc\nxxa", "3 5\naab\nzfhka", "3 3\nabc\nxya", "3 3\nabc\ncab", "5 5\nabcde\nxxabc", "3 10\nass\nabcdefssss", "4 4\nabcd\neeab", "3 4\nabh\nbhaa", "2 3\nzb\naaz", "2 3\nab\ndda", "3 3\ncba\nbac", "3 4\nabc\nxxxa", "2 3\nab\nbbb", "10 15\nsdkjeaafww\nefjklffnkddkfey", "3 3\nabc\nzbc", "3 7\nabc\neeeeeab", "2 6\nab\nxyxbab", "4 7\nabcd\nzzzzabc", "3 5\nabc\nabzzz", "3 3\naaz\nzaa", "3 6\nabc\nxaybzd", "4 5\naaaa\naaaap"], "outputs": ["2\n2 3 ", "1\n2 ", "0", "1\n1 ", "0", "1\n3 ", "2\n3 5 ", "0", "1\n1 ", "0", "0", "0", "1\n2 ", "3\n1 2 3 ", "2\n1 3 ", "2\n1 3 ", "1\n3 ", "1\n1 ", "2\n5 6 ", "25\n1 2 3 4 5 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 ", "3\n1 2 3 ", "4\n1 2 3 4 ", "0", "3\n1 2 3 ", "3\n1 2 3 ", "3\n1 2 3 ", "3\n1 2 3 ", "5\n1 2 3 4 5 ", "1\n1 ", "4\n1 2 3 4 ", "3\n1 2 3 ", "2\n1 2 ", "2\n1 2 ", "3\n1 2 3 ", "3\n1 2 3 ", "1\n1 ", "9\n1 2 4 5 6 7 8 9 10 ", "1\n1 ", "3\n1 2 3 ", "0", "4\n1 2 3 4 ", "1\n3 ", "2\n1 3 ", "2\n2 3 ", "0"]} | UNKNOWN | [
"PYTHON3"
] | CODEFORCES | 27 | codeforces |
|
4fcfeab57c0f51c448943dcc7cb20eb1 | Knights of a Polygonal Table | Unlike Knights of a Round Table, Knights of a Polygonal Table deprived of nobility and happy to kill each other. But each knight has some power and a knight can kill another knight if and only if his power is greater than the power of victim. However, even such a knight will torment his conscience, so he can kill no more than $k$ other knights. Also, each knight has some number of coins. After a kill, a knight can pick up all victim's coins.
Now each knight ponders: how many coins he can have if only he kills other knights?
You should answer this question for each knight.
The first line contains two integers $n$ and $k$ $(1 \le n \le 10^5, 0 \le k \le \min(n-1,10))$ — the number of knights and the number $k$ from the statement.
The second line contains $n$ integers $p_1, p_2 ,\ldots,p_n$ $(1 \le p_i \le 10^9)$ — powers of the knights. All $p_i$ are distinct.
The third line contains $n$ integers $c_1, c_2 ,\ldots,c_n$ $(0 \le c_i \le 10^9)$ — the number of coins each knight has.
Print $n$ integers — the maximum number of coins each knight can have it only he kills other knights.
Sample Input
4 2
4 5 9 7
1 2 11 33
5 1
1 2 3 4 5
1 2 3 4 5
1 0
2
3
Sample Output
1 3 46 36 1 3 5 7 9 3 | {"inputs": ["4 2\n4 5 9 7\n1 2 11 33", "5 1\n1 2 3 4 5\n1 2 3 4 5", "1 0\n2\n3", "7 1\n2 3 4 5 7 8 9\n0 3 7 9 5 8 9", "7 2\n2 4 6 7 8 9 10\n10 8 4 8 4 5 9", "11 10\n1 2 3 4 5 6 7 8 9 10 11\n1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000", "2 0\n2 3\n3 3", "7 3\n1 2 3 4 5 6 7\n3 3 3 4 5 6 7", "3 0\n3 2 1\n1 2 3", "5 3\n4 5 7 9 11\n10 10 10 10 10", "4 0\n4 5 9 7\n1 2 11 33", "7 3\n1 2 3 4 5 6 7\n3 3 3 8 8 8 8", "3 0\n1 2 3\n5 5 5", "4 2\n4 5 9 7\n2 2 11 33", "6 3\n1 2 3 4 5 6\n1 1 1 1 1 1", "10 5\n1 2 3 4 5 6 7 8 9 10\n1 1 1 1 1 1 1 1 1 1", "3 2\n1 2 3\n1 1 1", "3 0\n1 2 3\n10 20 30", "4 0\n4 5 9 7\n1 2 3 4", "5 4\n1 2 3 4 5\n1 1 1 1 1", "4 3\n1 2 3 4\n5 5 5 5", "5 3\n1 2 3 4 5\n7 7 7 7 7"], "outputs": ["1 3 46 36 ", "1 3 5 7 9 ", "3 ", "0 3 10 16 14 17 18 ", "10 18 22 26 22 23 27 ", "1000000000 2000000000 3000000000 4000000000 5000000000 6000000000 7000000000 8000000000 9000000000 10000000000 11000000000 ", "3 3 ", "3 6 9 13 15 18 22 ", "1 2 3 ", "10 20 30 40 40 ", "1 2 11 33 ", "3 6 9 17 22 27 32 ", "5 5 5 ", "2 4 46 37 ", "1 2 3 4 4 4 ", "1 2 3 4 5 6 6 6 6 6 ", "1 2 3 ", "10 20 30 ", "1 2 3 4 ", "1 2 3 4 5 ", "5 10 15 20 ", "7 14 21 28 28 "]} | UNKNOWN | [
"PYTHON3"
] | CODEFORCES | 73 | codeforces |
|
4fe0252045164e7628be3435258cb5a1 | Alice and Bob | It is so boring in the summer holiday, isn't it? So Alice and Bob have invented a new game to play. The rules are as follows. First, they get a set of *n* distinct integers. And then they take turns to make the following moves. During each move, either Alice or Bob (the player whose turn is the current) can choose two distinct integers *x* and *y* from the set, such that the set doesn't contain their absolute difference |*x*<=-<=*y*|. Then this player adds integer |*x*<=-<=*y*| to the set (so, the size of the set increases by one).
If the current player has no valid move, he (or she) loses the game. The question is who will finally win the game if both players play optimally. Remember that Alice always moves first.
The first line contains an integer *n* (2<=≤<=*n*<=≤<=100) — the initial number of elements in the set. The second line contains *n* distinct space-separated integers *a*1,<=*a*2,<=...,<=*a**n* (1<=≤<=*a**i*<=≤<=109) — the elements of the set.
Print a single line with the winner's name. If Alice wins print "Alice", otherwise print "Bob" (without quotes).
Sample Input
2
2 3
2
5 3
3
5 6 7
Sample Output
Alice
Alice
Bob
| {"inputs": ["2\n2 3", "2\n5 3", "3\n5 6 7", "10\n72 96 24 66 6 18 12 30 60 48", "10\n78 66 6 60 18 84 36 96 72 48", "10\n98 63 42 56 14 77 70 35 84 21", "2\n1 1000000000", "2\n1000000000 999999999", "3\n2 4 6", "2\n4 6", "2\n2 6", "2\n6 2", "10\n100000000 200000000 300000000 400000000 500000000 600000000 700000000 800000000 900000000 1000000000", "2\n1 2", "10\n1 999999999 999999998 999999997 999999996 999999995 999999994 999999993 999999992 999999991", "3\n6 14 21", "3\n4 12 18", "4\n2 3 15 30", "2\n10 4"], "outputs": ["Alice", "Alice", "Bob", "Bob", "Bob", "Bob", "Bob", "Bob", "Bob", "Alice", "Alice", "Alice", "Bob", "Bob", "Alice", "Bob", "Bob", "Bob", "Alice"]} | UNKNOWN | [
"PYTHON3"
] | CODEFORCES | 98 | codeforces |
|
4fe552649d99fa72c49afc64c9577426 | Lucky Division | Petya loves lucky numbers. Everybody knows that lucky numbers are positive integers whose decimal representation contains only the lucky digits 4 and 7. For example, numbers 47, 744, 4 are lucky and 5, 17, 467 are not.
Petya calls a number almost lucky if it could be evenly divided by some lucky number. Help him find out if the given number *n* is almost lucky.
The single line contains an integer *n* (1<=≤<=*n*<=≤<=1000) — the number that needs to be checked.
In the only line print "YES" (without the quotes), if number *n* is almost lucky. Otherwise, print "NO" (without the quotes).
Sample Input
47
16
78
Sample Output
YES
YES
NO
| {"inputs": ["47", "16", "78", "48", "100", "107", "77", "477", "480", "1", "3", "4", "49", "56", "124", "1000", "999", "298", "274", "998", "42", "788", "70", "444", "777", "799", "25", "882", "88", "11", "2", "7", "8", "94", "477", "141"], "outputs": ["YES", "YES", "NO", "YES", "YES", "NO", "YES", "YES", "YES", "NO", "NO", "YES", "YES", "YES", "YES", "YES", "NO", "NO", "NO", "NO", "YES", "YES", "YES", "YES", "YES", "YES", "NO", "YES", "YES", "NO", "NO", "YES", "YES", "YES", "YES", "YES"]} | UNKNOWN | [
"PYTHON3"
] | CODEFORCES | 451 | codeforces |
|
4ff1d09db6f2d9a2ebec4be3201d5014 | Squats | Pasha has many hamsters and he makes them work out. Today, *n* hamsters (*n* is even) came to work out. The hamsters lined up and each hamster either sat down or stood up.
For another exercise, Pasha needs exactly hamsters to stand up and the other hamsters to sit down. In one minute, Pasha can make some hamster ether sit down or stand up. How many minutes will he need to get what he wants if he acts optimally well?
The first line contains integer *n* (2<=≤<=*n*<=≤<=200; *n* is even). The next line contains *n* characters without spaces. These characters describe the hamsters' position: the *i*-th character equals 'X', if the *i*-th hamster in the row is standing, and 'x', if he is sitting.
In the first line, print a single integer — the minimum required number of minutes. In the second line, print a string that describes the hamsters' position after Pasha makes the required changes. If there are multiple optimal positions, print any of them.
Sample Input
4
xxXx
2
XX
6
xXXxXx
Sample Output
1
XxXx
1
xX
0
xXXxXx
| {"inputs": ["4\nxxXx", "2\nXX", "6\nxXXxXx", "4\nxXXX", "2\nXx", "22\nXXxXXxxXxXxXXXXXXXXXxx", "30\nXXxXxxXXXXxxXXxxXXxxxxXxxXXXxx", "104\nxxXxXxxXXXxxXxXxxXXXxxxXxxXXXxxXXXxXxXxXXxxXxxxxxXXXXxXXXXxXXXxxxXxxxxxxxXxxXxXXxxXXXXxXXXxxXXXXXXXXXxXX", "78\nxxxXxxXxXxxXxxxxxXxXXXxXXXXxxxxxXxXXXxxXxXXXxxxxXxxXXXxxxxxxxxXXXXxXxXXxXXXxXX", "200\nxxXXxxXXxXxxXxxXxXxxXxXxXxXxxxxxXXxXXxxXXXXxXXXxXXxXxXxxxxXxxXXXxxxXxXxxxXxxXXxXxXxxxxxxxXxxXxXxxXxXXXxxXxXXXXxxXxxxXxXXXXXXxXxXXxxxxXxxxXxxxXxXXXxXxXXXXxXXxxxXxXXxxXXxxxXxXxXXxXXXxXxXxxxXXxxxxXXxXXXX", "198\nxXxxXxxXxxXXxXxXxXxxXXXxxXxxxxXXXXxxXxxxxXXXXxXxXXxxxXXXXXXXxXXXxxxxXXxXXxXxXXxxxxXxXXXXXXxXxxXxXxxxXxXXXXxxXXxxXxxxXXxXxXXxXxXXxXXXXxxxxxXxXXxxxXxXXXXxXxXXxxXxXXxXxXXxxxXxXXXXxXxxXxXXXxxxxXxXXXXxXx", "200\nxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx", "198\nxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx", "200\nXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX", "198\nXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX", "2\nxx", "2\nXx", "2\nxX", "4\nXXXX", "4\nxxxx", "4\nxxXX", "4\nXXxx", "4\nxXxx", "4\nXxxx", "4\nxxxX", "4\nxxXx", "4\nXXXx", "4\nxXXX", "4\nXxXX", "4\nXXxX", "4\nXxXx", "6\nxXXxXX"], "outputs": ["1\nXxXx", "1\nxX", "0\nxXXxXx", "1\nxxXX", "0\nXx", "4\nxxxxxxxXxXxXXXXXXXXXxx", "0\nXXxXxxXXXXxxXXxxXXxxxxXxxXXXxx", "4\nxxxxxxxxxXxxXxXxxXXXxxxXxxXXXxxXXXxXxXxXXxxXxxxxxXXXXxXXXXxXXXxxxXxxxxxxxXxxXxXXxxXXXXxXXXxxXXXXXXXXXxXX", "3\nXXXXxxXxXxxXxxxxxXxXXXxXXXXxxxxxXxXXXxxXxXXXxxxxXxxXXXxxxxxxxxXXXXxXxXXxXXXxXX", "4\nXXXXXXXXxXxxXxxXxXxxXxXxXxXxxxxxXXxXXxxXXXXxXXXxXXxXxXxxxxXxxXXXxxxXxXxxxXxxXXxXxXxxxxxxxXxxXxXxxXxXXXxxXxXXXXxxXxxxXxXXXXXXxXxXXxxxxXxxxXxxxXxXXXxXxXXXXxXXxxxXxXXxxXXxxxXxXxXXxXXXxXxXxxxXXxxxxXXxXXXX", "5\nxxxxxxxxxxxxxXxXxXxxXXXxxXxxxxXXXXxxXxxxxXXXXxXxXXxxxXXXXXXXxXXXxxxxXXxXXxXxXXxxxxXxXXXXXXxXxxXxXxxxXxXXXXxxXXxxXxxxXXxXxXXxXxXXxXXXXxxxxxXxXXxxxXxXXXXxXxXXxxXxXXxXxXXxxxXxXXXXxXxxXxXXXxxxxXxXXXXxXx", "100\nXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx", "99\nXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx", "100\nxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX", "99\nxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX", "1\nXx", "0\nXx", "0\nxX", "2\nxxXX", "2\nXXxx", "0\nxxXX", "0\nXXxx", "1\nXXxx", "1\nXXxx", "1\nXxxX", "1\nXxXx", "1\nxXXx", "1\nxxXX", "1\nxxXX", "1\nxXxX", "0\nXxXx", "1\nxxXxXX"]} | UNKNOWN | [
"PYTHON3"
] | CODEFORCES | 177 | codeforces |
|
50193bc9e697c53d3b8f630d05729da8 | Elections | The country of Byalechinsk is running elections involving *n* candidates. The country consists of *m* cities. We know how many people in each city voted for each candidate.
The electoral system in the country is pretty unusual. At the first stage of elections the votes are counted for each city: it is assumed that in each city won the candidate who got the highest number of votes in this city, and if several candidates got the maximum number of votes, then the winner is the one with a smaller index.
At the second stage of elections the winner is determined by the same principle over the cities: the winner of the elections is the candidate who won in the maximum number of cities, and among those who got the maximum number of cities the winner is the one with a smaller index.
Determine who will win the elections.
The first line of the input contains two integers *n*, *m* (1<=≤<=*n*,<=*m*<=≤<=100) — the number of candidates and of cities, respectively.
Each of the next *m* lines contains *n* non-negative integers, the *j*-th number in the *i*-th line *a**ij* (1<=≤<=*j*<=≤<=*n*, 1<=≤<=*i*<=≤<=*m*, 0<=≤<=*a**ij*<=≤<=109) denotes the number of votes for candidate *j* in city *i*.
It is guaranteed that the total number of people in all the cities does not exceed 109.
Print a single number — the index of the candidate who won the elections. The candidates are indexed starting from one.
Sample Input
3 3
1 2 3
2 3 1
1 2 1
3 4
10 10 3
5 1 6
2 2 2
1 5 7
Sample Output
21 | {"inputs": ["3 3\n1 2 3\n2 3 1\n1 2 1", "3 4\n10 10 3\n5 1 6\n2 2 2\n1 5 7", "1 3\n5\n3\n2", "3 1\n1 2 3", "3 1\n100 100 100", "2 2\n1 2\n2 1", "2 2\n2 1\n2 1", "2 2\n1 2\n1 2", "3 3\n0 0 0\n1 1 1\n2 2 2", "1 1\n1000000000", "5 5\n1 2 3 4 5\n2 3 4 5 6\n3 4 5 6 7\n4 5 6 7 8\n5 6 7 8 9", "4 4\n1 3 1 3\n3 1 3 1\n2 0 0 2\n0 1 1 0", "4 4\n1 4 1 3\n3 1 2 1\n1 0 0 2\n0 1 10 0", "4 4\n1 4 1 300\n3 1 2 1\n5 0 0 2\n0 1 10 100", "5 5\n15 45 15 300 10\n53 15 25 51 10\n5 50 50 2 10\n1000 1 10 100 10\n10 10 10 10 10", "1 100\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1", "100 1\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", "1 100\n859\n441\n272\n47\n355\n345\n612\n569\n545\n599\n410\n31\n720\n303\n58\n537\n561\n730\n288\n275\n446\n955\n195\n282\n153\n455\n996\n121\n267\n702\n769\n560\n353\n89\n990\n282\n801\n335\n573\n258\n722\n768\n324\n41\n249\n125\n557\n303\n664\n945\n156\n884\n985\n816\n433\n65\n976\n963\n85\n647\n46\n877\n665\n523\n714\n182\n377\n549\n994\n385\n184\n724\n447\n99\n766\n353\n494\n747\n324\n436\n915\n472\n879\n582\n928\n84\n627\n156\n972\n651\n159\n372\n70\n903\n590\n480\n184\n540\n270\n892", "100 1\n439 158 619 538 187 153 973 781 610 475 94 947 449 531 220 51 788 118 189 501 54 434 465 902 280 635 688 214 737 327 682 690 683 519 261 923 254 388 529 659 662 276 376 735 976 664 521 285 42 147 187 259 407 977 879 465 522 17 550 701 114 921 577 265 668 812 232 267 135 371 586 201 608 373 771 358 101 412 195 582 199 758 507 882 16 484 11 712 916 699 783 618 405 124 904 257 606 610 230 718", "1 99\n511\n642\n251\n30\n494\n128\n189\n324\n884\n656\n120\n616\n959\n328\n411\n933\n895\n350\n1\n838\n996\n761\n619\n131\n824\n751\n707\n688\n915\n115\n244\n476\n293\n986\n29\n787\n607\n259\n756\n864\n394\n465\n303\n387\n521\n582\n485\n355\n299\n997\n683\n472\n424\n948\n339\n383\n285\n957\n591\n203\n866\n79\n835\n980\n344\n493\n361\n159\n160\n947\n46\n362\n63\n553\n793\n754\n429\n494\n523\n227\n805\n313\n409\n243\n927\n350\n479\n971\n825\n460\n544\n235\n660\n327\n216\n729\n147\n671\n738", "99 1\n50 287 266 159 551 198 689 418 809 43 691 367 160 664 86 805 461 55 127 950 576 351 721 493 972 560 934 885 492 92 321 759 767 989 883 7 127 413 404 604 80 645 666 874 371 718 893 158 722 198 563 293 134 255 742 913 252 378 859 721 502 251 839 284 133 209 962 514 773 124 205 903 785 859 911 93 861 786 747 213 690 69 942 697 211 203 284 961 351 137 962 952 408 249 238 850 944 40 346", "100 1\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 2", "1 1\n0", "2 1\n0 0", "2 2\n0 0\n0 0", "2 2\n1 2\n0 0", "3 3\n0 0 0\n0 0 0\n0 0 0", "2 3\n0 0\n0 0\n0 1", "3 2\n1 1 3\n0 0 0", "3 4\n1 10 3\n0 0 0\n0 0 0\n0 0 0", "2 4\n2 1\n1 2\n0 0\n1 2", "2 2\n0 1\n0 1", "2 3\n1 2\n0 0\n2 1", "2 2\n0 0\n4 5", "3 2\n10 15 20\n0 0 0", "3 4\n0 0 0\n0 0 0\n0 0 0\n1 2 3", "3 3\n0 0 0\n0 0 0\n0 0 1", "3 3\n0 0 0\n1 2 3\n1 3 2", "3 1\n0 0 0", "3 3\n0 0 1\n0 0 0\n0 0 0"], "outputs": ["2", "1", "1", "3", "1", "1", "1", "2", "1", "1", "5", "1", "1", "1", "1", "1", "1", "1", "54", "1", "34", "100", "1", "1", "1", "1", "1", "1", "1", "1", "1", "2", "1", "1", "1", "1", "1", "1", "1", "1"]} | UNKNOWN | [
"PYTHON3"
] | CODEFORCES | 180 | codeforces |
|
5027834466ec82df4cc3c1242f683414 | none | A tree is a connected undirected graph consisting of *n* vertices and *n*<=<=-<=<=1 edges. Vertices are numbered 1 through *n*.
Limak is a little polar bear and Radewoosh is his evil enemy. Limak once had a tree but Radewoosh stolen it. Bear is very sad now because he doesn't remember much about the tree — he can tell you only three values *n*, *d* and *h*:
- The tree had exactly *n* vertices. - The tree had diameter *d*. In other words, *d* was the biggest distance between two vertices. - Limak also remembers that he once rooted the tree in vertex 1 and after that its height was *h*. In other words, *h* was the biggest distance between vertex 1 and some other vertex.
The distance between two vertices of the tree is the number of edges on the simple path between them.
Help Limak to restore his tree. Check whether there exists a tree satisfying the given conditions. Find any such tree and print its edges in any order. It's also possible that Limak made a mistake and there is no suitable tree – in this case print "-1".
The first line contains three integers *n*, *d* and *h* (2<=≤<=*n*<=≤<=100<=000,<=1<=≤<=*h*<=≤<=*d*<=≤<=*n*<=-<=1) — the number of vertices, diameter, and height after rooting in vertex 1, respectively.
If there is no tree matching what Limak remembers, print the only line with "-1" (without the quotes).
Otherwise, describe any tree matching Limak's description. Print *n*<=-<=1 lines, each with two space-separated integers – indices of vertices connected by an edge. If there are many valid trees, print any of them. You can print edges in any order.
Sample Input
5 3 2
8 5 2
8 4 2
Sample Output
1 2
1 3
3 4
3 5-1
4 8
5 7
2 3
8 1
2 1
5 6
1 5
| {"inputs": ["5 3 2", "8 5 2", "8 4 2", "2 1 1", "10 3 3", "15 6 4", "16 15 14", "1000 51 25", "100000 10 7", "3 1 1", "3 2 1", "3 2 2", "4 1 1", "4 2 1", "4 2 2", "4 3 1", "4 3 2", "4 3 3", "8 5 3", "20 19 19", "30 14 14", "33 5 3", "5432 200 100", "5433 200 99", "99999 1 1", "99999 2 1", "99999 7 4", "9999 7 3", "100000 1 1", "100000 2 1", "100000 2 2", "100000 3 1", "100000 10 5", "100000 10 6", "100000 10 9", "100000 10 10", "100000 99900 78900", "100000 99998 1", "100000 99998 49999", "100000 99998 50000", "100000 99998 69001", "100000 99998 99055", "100000 99998 99998", "100000 99999 1", "100000 99999 49999", "100000 99999 50000", "100000 99999 50001", "100000 99999 77777", "100000 99999 99998", "100000 99999 99999", "3 1 1", "5 1 1", "10 1 1", "3 2 1", "8 1 1", "4 1 1", "6 1 1", "20 1 1", "5 2 1", "100 1 1", "10 2 1", "100 2 1", "47 1 1", "7 1 1", "4 2 1", "5 2 2", "8 2 1", "1000 1 1", "11 1 1", "15 2 1", "3 2 2", "8 2 2"], "outputs": ["1 2\n2 3\n1 4\n5 1", "-1", "4 8\n5 7\n2 3\n8 1\n2 1\n5 6\n1 5", "1 2", "1 2\n2 3\n3 4\n5 2\n6 2\n7 2\n8 2\n9 2\n10 2", "1 2\n2 3\n3 4\n4 5\n1 6\n6 7\n8 1\n9 1\n10 1\n11 1\n12 1\n13 1\n14 1\n15 1", "1 2\n2 3\n3 4\n4 5\n5 6\n6 7\n7 8\n8 9\n9 10\n10 11\n11 12\n12 13\n13 14\n14 15\n1 16", "-1", "1 2\n2 3\n3 4\n4 5\n5 6\n6 7\n7 8\n1 9\n9 10\n10 11\n12 1\n13 1\n14 1\n15 1\n16 1\n17 1\n18 1\n19 1\n20 1\n21 1\n22 1\n23 1\n24 1\n25 1\n26 1\n27 1\n28 1\n29 1\n30 1\n31 1\n32 1\n33 1\n34 1\n35 1\n36 1\n37 1\n38 1\n39 1\n40 1\n41 1\n42 1\n43 1\n44 1\n45 1\n46 1\n47 1\n48 1\n49 1\n50 1\n51 1\n52 1\n53 1\n54 1\n55 1\n56 1\n57 1\n58 1\n59 1\n60 1\n61 1\n62 1\n63 1\n64 1\n65 1\n66 1\n67 1\n68 1\n69 1\n70 1\n71 1\n72 1\n73 1\n74 1\n75 1\n76 1\n77 1\n78 1\n79 1\n80 1\n81 1\n82 1\n83 1\n84 1\n85 1\n86 1\n87 1\n88...", "-1", "1 2\n1 3", "1 2\n2 3", "-1", "1 2\n1 3\n4 1", "1 2\n2 3\n4 2", "-1", "1 2\n2 3\n1 4", "1 2\n2 3\n3 4", "1 2\n2 3\n3 4\n1 5\n5 6\n7 1\n8 1", "1 2\n2 3\n3 4\n4 5\n5 6\n6 7\n7 8\n8 9\n9 10\n10 11\n11 12\n12 13\n13 14\n14 15\n15 16\n16 17\n17 18\n18 19\n19 20", "1 2\n2 3\n3 4\n4 5\n5 6\n6 7\n7 8\n8 9\n9 10\n10 11\n11 12\n12 13\n13 14\n14 15\n16 2\n17 2\n18 2\n19 2\n20 2\n21 2\n22 2\n23 2\n24 2\n25 2\n26 2\n27 2\n28 2\n29 2\n30 2", "1 2\n2 3\n3 4\n1 5\n5 6\n7 1\n8 1\n9 1\n10 1\n11 1\n12 1\n13 1\n14 1\n15 1\n16 1\n17 1\n18 1\n19 1\n20 1\n21 1\n22 1\n23 1\n24 1\n25 1\n26 1\n27 1\n28 1\n29 1\n30 1\n31 1\n32 1\n33 1", "1 2\n2 3\n3 4\n4 5\n5 6\n6 7\n7 8\n8 9\n9 10\n10 11\n11 12\n12 13\n13 14\n14 15\n15 16\n16 17\n17 18\n18 19\n19 20\n20 21\n21 22\n22 23\n23 24\n24 25\n25 26\n26 27\n27 28\n28 29\n29 30\n30 31\n31 32\n32 33\n33 34\n34 35\n35 36\n36 37\n37 38\n38 39\n39 40\n40 41\n41 42\n42 43\n43 44\n44 45\n45 46\n46 47\n47 48\n48 49\n49 50\n50 51\n51 52\n52 53\n53 54\n54 55\n55 56\n56 57\n57 58\n58 59\n59 60\n60 61\n61 62\n62 63\n63 64\n64 65\n65 66\n66 67\n67 68\n68 69\n69 70\n70 71\n71 72\n72 73\n73 74\n74 75\n75 76\n76 ...", "-1", "-1", "1 2\n1 3\n4 1\n5 1\n6 1\n7 1\n8 1\n9 1\n10 1\n11 1\n12 1\n13 1\n14 1\n15 1\n16 1\n17 1\n18 1\n19 1\n20 1\n21 1\n22 1\n23 1\n24 1\n25 1\n26 1\n27 1\n28 1\n29 1\n30 1\n31 1\n32 1\n33 1\n34 1\n35 1\n36 1\n37 1\n38 1\n39 1\n40 1\n41 1\n42 1\n43 1\n44 1\n45 1\n46 1\n47 1\n48 1\n49 1\n50 1\n51 1\n52 1\n53 1\n54 1\n55 1\n56 1\n57 1\n58 1\n59 1\n60 1\n61 1\n62 1\n63 1\n64 1\n65 1\n66 1\n67 1\n68 1\n69 1\n70 1\n71 1\n72 1\n73 1\n74 1\n75 1\n76 1\n77 1\n78 1\n79 1\n80 1\n81 1\n82 1\n83 1\n84 1\n85 1\n86 1\n87 1\n88 ...", "1 2\n2 3\n3 4\n4 5\n1 6\n6 7\n7 8\n9 1\n10 1\n11 1\n12 1\n13 1\n14 1\n15 1\n16 1\n17 1\n18 1\n19 1\n20 1\n21 1\n22 1\n23 1\n24 1\n25 1\n26 1\n27 1\n28 1\n29 1\n30 1\n31 1\n32 1\n33 1\n34 1\n35 1\n36 1\n37 1\n38 1\n39 1\n40 1\n41 1\n42 1\n43 1\n44 1\n45 1\n46 1\n47 1\n48 1\n49 1\n50 1\n51 1\n52 1\n53 1\n54 1\n55 1\n56 1\n57 1\n58 1\n59 1\n60 1\n61 1\n62 1\n63 1\n64 1\n65 1\n66 1\n67 1\n68 1\n69 1\n70 1\n71 1\n72 1\n73 1\n74 1\n75 1\n76 1\n77 1\n78 1\n79 1\n80 1\n81 1\n82 1\n83 1\n84 1\n85 1\n86 1\n87 1\n88 ...", "-1", "-1", "1 2\n1 3\n4 1\n5 1\n6 1\n7 1\n8 1\n9 1\n10 1\n11 1\n12 1\n13 1\n14 1\n15 1\n16 1\n17 1\n18 1\n19 1\n20 1\n21 1\n22 1\n23 1\n24 1\n25 1\n26 1\n27 1\n28 1\n29 1\n30 1\n31 1\n32 1\n33 1\n34 1\n35 1\n36 1\n37 1\n38 1\n39 1\n40 1\n41 1\n42 1\n43 1\n44 1\n45 1\n46 1\n47 1\n48 1\n49 1\n50 1\n51 1\n52 1\n53 1\n54 1\n55 1\n56 1\n57 1\n58 1\n59 1\n60 1\n61 1\n62 1\n63 1\n64 1\n65 1\n66 1\n67 1\n68 1\n69 1\n70 1\n71 1\n72 1\n73 1\n74 1\n75 1\n76 1\n77 1\n78 1\n79 1\n80 1\n81 1\n82 1\n83 1\n84 1\n85 1\n86 1\n87 1\n88 ...", "1 2\n2 3\n4 2\n5 2\n6 2\n7 2\n8 2\n9 2\n10 2\n11 2\n12 2\n13 2\n14 2\n15 2\n16 2\n17 2\n18 2\n19 2\n20 2\n21 2\n22 2\n23 2\n24 2\n25 2\n26 2\n27 2\n28 2\n29 2\n30 2\n31 2\n32 2\n33 2\n34 2\n35 2\n36 2\n37 2\n38 2\n39 2\n40 2\n41 2\n42 2\n43 2\n44 2\n45 2\n46 2\n47 2\n48 2\n49 2\n50 2\n51 2\n52 2\n53 2\n54 2\n55 2\n56 2\n57 2\n58 2\n59 2\n60 2\n61 2\n62 2\n63 2\n64 2\n65 2\n66 2\n67 2\n68 2\n69 2\n70 2\n71 2\n72 2\n73 2\n74 2\n75 2\n76 2\n77 2\n78 2\n79 2\n80 2\n81 2\n82 2\n83 2\n84 2\n85 2\n86 2\n87 2\n88 ...", "-1", "1 2\n2 3\n3 4\n4 5\n5 6\n1 7\n7 8\n8 9\n9 10\n10 11\n12 1\n13 1\n14 1\n15 1\n16 1\n17 1\n18 1\n19 1\n20 1\n21 1\n22 1\n23 1\n24 1\n25 1\n26 1\n27 1\n28 1\n29 1\n30 1\n31 1\n32 1\n33 1\n34 1\n35 1\n36 1\n37 1\n38 1\n39 1\n40 1\n41 1\n42 1\n43 1\n44 1\n45 1\n46 1\n47 1\n48 1\n49 1\n50 1\n51 1\n52 1\n53 1\n54 1\n55 1\n56 1\n57 1\n58 1\n59 1\n60 1\n61 1\n62 1\n63 1\n64 1\n65 1\n66 1\n67 1\n68 1\n69 1\n70 1\n71 1\n72 1\n73 1\n74 1\n75 1\n76 1\n77 1\n78 1\n79 1\n80 1\n81 1\n82 1\n83 1\n84 1\n85 1\n86 1\n87 1\n88...", "1 2\n2 3\n3 4\n4 5\n5 6\n6 7\n1 8\n8 9\n9 10\n10 11\n12 1\n13 1\n14 1\n15 1\n16 1\n17 1\n18 1\n19 1\n20 1\n21 1\n22 1\n23 1\n24 1\n25 1\n26 1\n27 1\n28 1\n29 1\n30 1\n31 1\n32 1\n33 1\n34 1\n35 1\n36 1\n37 1\n38 1\n39 1\n40 1\n41 1\n42 1\n43 1\n44 1\n45 1\n46 1\n47 1\n48 1\n49 1\n50 1\n51 1\n52 1\n53 1\n54 1\n55 1\n56 1\n57 1\n58 1\n59 1\n60 1\n61 1\n62 1\n63 1\n64 1\n65 1\n66 1\n67 1\n68 1\n69 1\n70 1\n71 1\n72 1\n73 1\n74 1\n75 1\n76 1\n77 1\n78 1\n79 1\n80 1\n81 1\n82 1\n83 1\n84 1\n85 1\n86 1\n87 1\n88...", "1 2\n2 3\n3 4\n4 5\n5 6\n6 7\n7 8\n8 9\n9 10\n1 11\n12 1\n13 1\n14 1\n15 1\n16 1\n17 1\n18 1\n19 1\n20 1\n21 1\n22 1\n23 1\n24 1\n25 1\n26 1\n27 1\n28 1\n29 1\n30 1\n31 1\n32 1\n33 1\n34 1\n35 1\n36 1\n37 1\n38 1\n39 1\n40 1\n41 1\n42 1\n43 1\n44 1\n45 1\n46 1\n47 1\n48 1\n49 1\n50 1\n51 1\n52 1\n53 1\n54 1\n55 1\n56 1\n57 1\n58 1\n59 1\n60 1\n61 1\n62 1\n63 1\n64 1\n65 1\n66 1\n67 1\n68 1\n69 1\n70 1\n71 1\n72 1\n73 1\n74 1\n75 1\n76 1\n77 1\n78 1\n79 1\n80 1\n81 1\n82 1\n83 1\n84 1\n85 1\n86 1\n87 1\n88 ...", "1 2\n2 3\n3 4\n4 5\n5 6\n6 7\n7 8\n8 9\n9 10\n10 11\n12 2\n13 2\n14 2\n15 2\n16 2\n17 2\n18 2\n19 2\n20 2\n21 2\n22 2\n23 2\n24 2\n25 2\n26 2\n27 2\n28 2\n29 2\n30 2\n31 2\n32 2\n33 2\n34 2\n35 2\n36 2\n37 2\n38 2\n39 2\n40 2\n41 2\n42 2\n43 2\n44 2\n45 2\n46 2\n47 2\n48 2\n49 2\n50 2\n51 2\n52 2\n53 2\n54 2\n55 2\n56 2\n57 2\n58 2\n59 2\n60 2\n61 2\n62 2\n63 2\n64 2\n65 2\n66 2\n67 2\n68 2\n69 2\n70 2\n71 2\n72 2\n73 2\n74 2\n75 2\n76 2\n77 2\n78 2\n79 2\n80 2\n81 2\n82 2\n83 2\n84 2\n85 2\n86 2\n87 2\n88...", "1 2\n2 3\n3 4\n4 5\n5 6\n6 7\n7 8\n8 9\n9 10\n10 11\n11 12\n12 13\n13 14\n14 15\n15 16\n16 17\n17 18\n18 19\n19 20\n20 21\n21 22\n22 23\n23 24\n24 25\n25 26\n26 27\n27 28\n28 29\n29 30\n30 31\n31 32\n32 33\n33 34\n34 35\n35 36\n36 37\n37 38\n38 39\n39 40\n40 41\n41 42\n42 43\n43 44\n44 45\n45 46\n46 47\n47 48\n48 49\n49 50\n50 51\n51 52\n52 53\n53 54\n54 55\n55 56\n56 57\n57 58\n58 59\n59 60\n60 61\n61 62\n62 63\n63 64\n64 65\n65 66\n66 67\n67 68\n68 69\n69 70\n70 71\n71 72\n72 73\n73 74\n74 75\n75 76\n76 ...", "-1", "1 2\n2 3\n3 4\n4 5\n5 6\n6 7\n7 8\n8 9\n9 10\n10 11\n11 12\n12 13\n13 14\n14 15\n15 16\n16 17\n17 18\n18 19\n19 20\n20 21\n21 22\n22 23\n23 24\n24 25\n25 26\n26 27\n27 28\n28 29\n29 30\n30 31\n31 32\n32 33\n33 34\n34 35\n35 36\n36 37\n37 38\n38 39\n39 40\n40 41\n41 42\n42 43\n43 44\n44 45\n45 46\n46 47\n47 48\n48 49\n49 50\n50 51\n51 52\n52 53\n53 54\n54 55\n55 56\n56 57\n57 58\n58 59\n59 60\n60 61\n61 62\n62 63\n63 64\n64 65\n65 66\n66 67\n67 68\n68 69\n69 70\n70 71\n71 72\n72 73\n73 74\n74 75\n75 76\n76 ...", "1 2\n2 3\n3 4\n4 5\n5 6\n6 7\n7 8\n8 9\n9 10\n10 11\n11 12\n12 13\n13 14\n14 15\n15 16\n16 17\n17 18\n18 19\n19 20\n20 21\n21 22\n22 23\n23 24\n24 25\n25 26\n26 27\n27 28\n28 29\n29 30\n30 31\n31 32\n32 33\n33 34\n34 35\n35 36\n36 37\n37 38\n38 39\n39 40\n40 41\n41 42\n42 43\n43 44\n44 45\n45 46\n46 47\n47 48\n48 49\n49 50\n50 51\n51 52\n52 53\n53 54\n54 55\n55 56\n56 57\n57 58\n58 59\n59 60\n60 61\n61 62\n62 63\n63 64\n64 65\n65 66\n66 67\n67 68\n68 69\n69 70\n70 71\n71 72\n72 73\n73 74\n74 75\n75 76\n76 ...", "1 2\n2 3\n3 4\n4 5\n5 6\n6 7\n7 8\n8 9\n9 10\n10 11\n11 12\n12 13\n13 14\n14 15\n15 16\n16 17\n17 18\n18 19\n19 20\n20 21\n21 22\n22 23\n23 24\n24 25\n25 26\n26 27\n27 28\n28 29\n29 30\n30 31\n31 32\n32 33\n33 34\n34 35\n35 36\n36 37\n37 38\n38 39\n39 40\n40 41\n41 42\n42 43\n43 44\n44 45\n45 46\n46 47\n47 48\n48 49\n49 50\n50 51\n51 52\n52 53\n53 54\n54 55\n55 56\n56 57\n57 58\n58 59\n59 60\n60 61\n61 62\n62 63\n63 64\n64 65\n65 66\n66 67\n67 68\n68 69\n69 70\n70 71\n71 72\n72 73\n73 74\n74 75\n75 76\n76 ...", "1 2\n2 3\n3 4\n4 5\n5 6\n6 7\n7 8\n8 9\n9 10\n10 11\n11 12\n12 13\n13 14\n14 15\n15 16\n16 17\n17 18\n18 19\n19 20\n20 21\n21 22\n22 23\n23 24\n24 25\n25 26\n26 27\n27 28\n28 29\n29 30\n30 31\n31 32\n32 33\n33 34\n34 35\n35 36\n36 37\n37 38\n38 39\n39 40\n40 41\n41 42\n42 43\n43 44\n44 45\n45 46\n46 47\n47 48\n48 49\n49 50\n50 51\n51 52\n52 53\n53 54\n54 55\n55 56\n56 57\n57 58\n58 59\n59 60\n60 61\n61 62\n62 63\n63 64\n64 65\n65 66\n66 67\n67 68\n68 69\n69 70\n70 71\n71 72\n72 73\n73 74\n74 75\n75 76\n76 ...", "1 2\n2 3\n3 4\n4 5\n5 6\n6 7\n7 8\n8 9\n9 10\n10 11\n11 12\n12 13\n13 14\n14 15\n15 16\n16 17\n17 18\n18 19\n19 20\n20 21\n21 22\n22 23\n23 24\n24 25\n25 26\n26 27\n27 28\n28 29\n29 30\n30 31\n31 32\n32 33\n33 34\n34 35\n35 36\n36 37\n37 38\n38 39\n39 40\n40 41\n41 42\n42 43\n43 44\n44 45\n45 46\n46 47\n47 48\n48 49\n49 50\n50 51\n51 52\n52 53\n53 54\n54 55\n55 56\n56 57\n57 58\n58 59\n59 60\n60 61\n61 62\n62 63\n63 64\n64 65\n65 66\n66 67\n67 68\n68 69\n69 70\n70 71\n71 72\n72 73\n73 74\n74 75\n75 76\n76 ...", "-1", "-1", "1 2\n2 3\n3 4\n4 5\n5 6\n6 7\n7 8\n8 9\n9 10\n10 11\n11 12\n12 13\n13 14\n14 15\n15 16\n16 17\n17 18\n18 19\n19 20\n20 21\n21 22\n22 23\n23 24\n24 25\n25 26\n26 27\n27 28\n28 29\n29 30\n30 31\n31 32\n32 33\n33 34\n34 35\n35 36\n36 37\n37 38\n38 39\n39 40\n40 41\n41 42\n42 43\n43 44\n44 45\n45 46\n46 47\n47 48\n48 49\n49 50\n50 51\n51 52\n52 53\n53 54\n54 55\n55 56\n56 57\n57 58\n58 59\n59 60\n60 61\n61 62\n62 63\n63 64\n64 65\n65 66\n66 67\n67 68\n68 69\n69 70\n70 71\n71 72\n72 73\n73 74\n74 75\n75 76\n76 ...", "1 2\n2 3\n3 4\n4 5\n5 6\n6 7\n7 8\n8 9\n9 10\n10 11\n11 12\n12 13\n13 14\n14 15\n15 16\n16 17\n17 18\n18 19\n19 20\n20 21\n21 22\n22 23\n23 24\n24 25\n25 26\n26 27\n27 28\n28 29\n29 30\n30 31\n31 32\n32 33\n33 34\n34 35\n35 36\n36 37\n37 38\n38 39\n39 40\n40 41\n41 42\n42 43\n43 44\n44 45\n45 46\n46 47\n47 48\n48 49\n49 50\n50 51\n51 52\n52 53\n53 54\n54 55\n55 56\n56 57\n57 58\n58 59\n59 60\n60 61\n61 62\n62 63\n63 64\n64 65\n65 66\n66 67\n67 68\n68 69\n69 70\n70 71\n71 72\n72 73\n73 74\n74 75\n75 76\n76 ...", "1 2\n2 3\n3 4\n4 5\n5 6\n6 7\n7 8\n8 9\n9 10\n10 11\n11 12\n12 13\n13 14\n14 15\n15 16\n16 17\n17 18\n18 19\n19 20\n20 21\n21 22\n22 23\n23 24\n24 25\n25 26\n26 27\n27 28\n28 29\n29 30\n30 31\n31 32\n32 33\n33 34\n34 35\n35 36\n36 37\n37 38\n38 39\n39 40\n40 41\n41 42\n42 43\n43 44\n44 45\n45 46\n46 47\n47 48\n48 49\n49 50\n50 51\n51 52\n52 53\n53 54\n54 55\n55 56\n56 57\n57 58\n58 59\n59 60\n60 61\n61 62\n62 63\n63 64\n64 65\n65 66\n66 67\n67 68\n68 69\n69 70\n70 71\n71 72\n72 73\n73 74\n74 75\n75 76\n76 ...", "1 2\n2 3\n3 4\n4 5\n5 6\n6 7\n7 8\n8 9\n9 10\n10 11\n11 12\n12 13\n13 14\n14 15\n15 16\n16 17\n17 18\n18 19\n19 20\n20 21\n21 22\n22 23\n23 24\n24 25\n25 26\n26 27\n27 28\n28 29\n29 30\n30 31\n31 32\n32 33\n33 34\n34 35\n35 36\n36 37\n37 38\n38 39\n39 40\n40 41\n41 42\n42 43\n43 44\n44 45\n45 46\n46 47\n47 48\n48 49\n49 50\n50 51\n51 52\n52 53\n53 54\n54 55\n55 56\n56 57\n57 58\n58 59\n59 60\n60 61\n61 62\n62 63\n63 64\n64 65\n65 66\n66 67\n67 68\n68 69\n69 70\n70 71\n71 72\n72 73\n73 74\n74 75\n75 76\n76 ...", "1 2\n2 3\n3 4\n4 5\n5 6\n6 7\n7 8\n8 9\n9 10\n10 11\n11 12\n12 13\n13 14\n14 15\n15 16\n16 17\n17 18\n18 19\n19 20\n20 21\n21 22\n22 23\n23 24\n24 25\n25 26\n26 27\n27 28\n28 29\n29 30\n30 31\n31 32\n32 33\n33 34\n34 35\n35 36\n36 37\n37 38\n38 39\n39 40\n40 41\n41 42\n42 43\n43 44\n44 45\n45 46\n46 47\n47 48\n48 49\n49 50\n50 51\n51 52\n52 53\n53 54\n54 55\n55 56\n56 57\n57 58\n58 59\n59 60\n60 61\n61 62\n62 63\n63 64\n64 65\n65 66\n66 67\n67 68\n68 69\n69 70\n70 71\n71 72\n72 73\n73 74\n74 75\n75 76\n76 ...", "-1", "-1", "-1", "1 2\n1 3", "-1", "-1", "-1", "-1", "1 2\n1 3\n4 1\n5 1", "-1", "1 2\n1 3\n4 1\n5 1\n6 1\n7 1\n8 1\n9 1\n10 1", "1 2\n1 3\n4 1\n5 1\n6 1\n7 1\n8 1\n9 1\n10 1\n11 1\n12 1\n13 1\n14 1\n15 1\n16 1\n17 1\n18 1\n19 1\n20 1\n21 1\n22 1\n23 1\n24 1\n25 1\n26 1\n27 1\n28 1\n29 1\n30 1\n31 1\n32 1\n33 1\n34 1\n35 1\n36 1\n37 1\n38 1\n39 1\n40 1\n41 1\n42 1\n43 1\n44 1\n45 1\n46 1\n47 1\n48 1\n49 1\n50 1\n51 1\n52 1\n53 1\n54 1\n55 1\n56 1\n57 1\n58 1\n59 1\n60 1\n61 1\n62 1\n63 1\n64 1\n65 1\n66 1\n67 1\n68 1\n69 1\n70 1\n71 1\n72 1\n73 1\n74 1\n75 1\n76 1\n77 1\n78 1\n79 1\n80 1\n81 1\n82 1\n83 1\n84 1\n85 1\n86 1\n87 1\n88 ...", "-1", "-1", "1 2\n1 3\n4 1", "1 2\n2 3\n4 2\n5 2", "1 2\n1 3\n4 1\n5 1\n6 1\n7 1\n8 1", "-1", "-1", "1 2\n1 3\n4 1\n5 1\n6 1\n7 1\n8 1\n9 1\n10 1\n11 1\n12 1\n13 1\n14 1\n15 1", "1 2\n2 3", "1 2\n2 3\n4 2\n5 2\n6 2\n7 2\n8 2"]} | UNKNOWN | [
"PYTHON3"
] | CODEFORCES | 22 | codeforces |
|
50337a54eefe8cc0b248d33a7c217796 | Spelling Check | Petya has noticed that when he types using a keyboard, he often presses extra buttons and adds extra letters to the words. Of course, the spell-checking system underlines the words for him and he has to click every word and choose the right variant. Petya got fed up with correcting his mistakes himself, that’s why he decided to invent the function that will correct the words itself. Petya started from analyzing the case that happens to him most of the time, when all one needs is to delete one letter for the word to match a word from the dictionary. Thus, Petya faces one mini-task: he has a printed word and a word from the dictionary, and he should delete one letter from the first word to get the second one. And now the very non-trivial question that Petya faces is: which letter should he delete?
The input data contains two strings, consisting of lower-case Latin letters. The length of each string is from 1 to 106 symbols inclusive, the first string contains exactly 1 symbol more than the second one.
In the first line output the number of positions of the symbols in the first string, after the deleting of which the first string becomes identical to the second one. In the second line output space-separated positions of these symbols in increasing order. The positions are numbered starting from 1. If it is impossible to make the first string identical to the second string by deleting one symbol, output one number 0.
Sample Input
abdrakadabra
abrakadabra
aa
a
competition
codeforces
Sample Output
1
3
2
1 2
0
| {"inputs": ["abdrakadabra\nabrakadabra", "aa\na", "competition\ncodeforces", "ab\na", "bb\nb", "aab\nab", "aabb\nabb", "babaacaacaa\nbbaacaacaa", "bccaabbcccc\nbccaabcccc", "ababcaabaaa\nabacaabaaa", "cccacaccacb\ncccacaccac", "aaaaaaaaaaa\naaaaaaaaaa", "lcaaxcbcjca\nccaaacccca", "babbbtaamba\nbabbbaabba", "xdfxmcnzpch\nazvotghvtk", "ki\nb", "vct\nie", "feee\nsnl", "cbxxxxzvks\ncbxxxzvks", "qybldcgfhdhhhhhhhhhhopqkhuczzytzluiahwbqjltgafvvoecititchjwdoljiehubngmtjckqymldhoncgtqhxnqvoagnrmur\nqybldcgfhdhhhhhhhhhopqkhuczzytzluiahwbqjltgafvvoecititchjwdoljiehubngmtjckqymldhoncgtqhxnqvoagnrmur"], "outputs": ["1\n3 ", "2\n1 2 ", "0", "1\n2 ", "2\n1 2 ", "2\n1 2 ", "2\n1 2 ", "1\n2 ", "2\n6 7 ", "1\n4 ", "1\n11 ", "11\n1 2 3 4 5 6 7 8 9 10 11 ", "0", "0", "0", "0", "0", "0", "4\n3 4 5 6 ", "10\n11 12 13 14 15 16 17 18 19 20 "]} | UNKNOWN | [
"PYTHON3"
] | CODEFORCES | 19 | codeforces |
|
503aa9522a8ac3af4f5e2355c3273d17 | Sereja and Contest | During the last Sereja's Codesecrof round the server crashed many times, so the round was decided to be made unrated for some participants.
Let's assume that *n* people took part in the contest. Let's assume that the participant who got the first place has rating *a*1, the second place participant has rating *a*2, ..., the *n*-th place participant has rating *a**n*. Then changing the rating on the Codesecrof site is calculated by the formula .
After the round was over, the Codesecrof management published the participants' results table. They decided that if for a participant *d**i*<=<<=*k*, then the round can be considered unrated for him. But imagine the management's surprise when they found out that the participants' rating table is dynamic. In other words, when some participant is removed from the rating, he is removed from the results' table and the rating is recalculated according to the new table. And of course, all applications for exclusion from the rating are considered in view of the current table.
We know that among all the applications for exclusion from the rating the first application to consider is from the participant with the best rank (the rank with the minimum number), for who *d**i*<=<<=*k*. We also know that the applications for exclusion from rating were submitted by all participants.
Now Sereja wonders, what is the number of participants to be excluded from the contest rating, and the numbers of the participants in the original table in the order of their exclusion from the rating. Pay attention to the analysis of the first test case for a better understanding of the statement.
The first line contains two integers *n*, *k* (1<=≤<=*n*<=≤<=2·105,<=<=-<=109<=≤<=*k*<=≤<=0). The second line contains *n* space-separated integers *a*1,<=*a*2,<=...,<=*a**n* (1<=≤<=*a**i*<=≤<=109) — ratings of the participants in the initial table.
Print the numbers of participants in the order in which they were removed from the table. Print the initial numbers of the participants, that is, the numbers that the participants had in the initial table.
Sample Input
5 0
5 3 4 1 2
10 -10
5 5 1 7 5 1 2 4 9 2
Sample Output
2
3
4
2
4
5
7
8
9
| {"inputs": ["5 0\n5 3 4 1 2", "10 -10\n5 5 1 7 5 1 2 4 9 2"], "outputs": ["2\n3\n4", "2\n4\n5\n7\n8\n9"]} | UNKNOWN | [
"PYTHON3"
] | CODEFORCES | 12 | codeforces |
|
50551a5504711861b7c6daf400d98f68 | Sleepy Game | Petya and Vasya arranged a game. The game runs by the following rules. Players have a directed graph consisting of *n* vertices and *m* edges. One of the vertices contains a chip. Initially the chip is located at vertex *s*. Players take turns moving the chip along some edge of the graph. Petya goes first. Player who can't move the chip loses. If the game lasts for 106 turns the draw is announced.
Vasya was performing big laboratory work in "Spelling and parts of speech" at night before the game, so he fell asleep at the very beginning of the game. Petya decided to take the advantage of this situation and make both Petya's and Vasya's moves.
Your task is to help Petya find out if he can win the game or at least draw a tie.
The first line of input contain two integers *n* and *m* — the number of vertices and the number of edges in the graph (2<=≤<=*n*<=≤<=105, 0<=≤<=*m*<=≤<=2·105).
The next *n* lines contain the information about edges of the graph. *i*-th line (1<=≤<=*i*<=≤<=*n*) contains nonnegative integer *c**i* — number of vertices such that there is an edge from *i* to these vertices and *c**i* distinct integers *a**i*,<=*j* — indices of these vertices (1<=≤<=*a**i*,<=*j*<=≤<=*n*, *a**i*,<=*j*<=≠<=*i*).
It is guaranteed that the total sum of *c**i* equals to *m*.
The next line contains index of vertex *s* — the initial position of the chip (1<=≤<=*s*<=≤<=*n*).
If Petya can win print «Win» in the first line. In the next line print numbers *v*1,<=*v*2,<=...,<=*v**k* (1<=≤<=*k*<=≤<=106) — the sequence of vertices Petya should visit for the winning. Vertex *v*1 should coincide with *s*. For *i*<==<=1... *k*<=-<=1 there should be an edge from *v**i* to *v**i*<=+<=1 in the graph. There must be no possible move from vertex *v**k*. The sequence should be such that Petya wins the game.
If Petya can't win but can draw a tie, print «Draw» in the only line. Otherwise print «Lose».
Sample Input
5 6
2 2 3
2 4 5
1 4
1 5
0
1
3 2
1 3
1 1
0
2
2 2
1 2
1 1
1
Sample Output
Win
1 2 4 5
Lose
Draw
| {"inputs": ["5 6\n2 2 3\n2 4 5\n1 4\n1 5\n0\n1", "3 2\n1 3\n1 1\n0\n2", "2 2\n1 2\n1 1\n1", "92 69\n1 76\n1 14\n1 9\n0\n1 46\n1 80\n0\n0\n1 77\n0\n1 53\n1 81\n1 61\n1 40\n0\n1 20\n1 71\n1 24\n1 54\n1 82\n1 23\n0\n1 63\n1 25\n1 38\n1 68\n0\n1 65\n0\n1 76\n1 55\n1 87\n1 1\n1 37\n1 68\n1 30\n1 17\n1 19\n0\n1 16\n1 69\n0\n1 60\n1 86\n0\n1 44\n1 32\n1 10\n1 8\n0\n0\n0\n0\n0\n1 2\n1 39\n0\n1 74\n1 5\n1 28\n1 79\n1 32\n1 34\n0\n1 81\n1 85\n1 6\n1 18\n0\n0\n1 58\n1 88\n1 7\n1 78\n1 43\n1 5\n1 61\n1 90\n1 31\n1 75\n1 72\n1 80\n1 13\n0\n0\n1 21\n1 70\n1 30\n0\n1 68\n1 3\n1 62\n91", "57 39\n1 57\n1 40\n1 38\n0\n0\n0\n1 20\n0\n0\n1 53\n0\n0\n0\n1 36\n1 40\n1 27\n1 11\n1 7\n1 35\n0\n1 23\n1 44\n1 14\n1 54\n0\n1 21\n1 28\n1 37\n1 38\n1 26\n1 3\n0\n1 14\n0\n1 1\n1 10\n1 52\n1 45\n0\n1 16\n0\n1 22\n1 51\n1 48\n1 30\n1 30\n0\n1 19\n1 33\n0\n1 45\n1 42\n1 49\n0\n1 23\n0\n1 31\n15", "53 38\n0\n1 35\n0\n1 32\n0\n0\n1 49\n1 25\n0\n1 19\n0\n0\n1 25\n1 48\n1 50\n1 2\n1 4\n1 50\n1 34\n1 4\n1 46\n0\n1 4\n1 5\n1 43\n1 8\n1 40\n1 47\n1 21\n1 43\n0\n1 10\n1 27\n1 33\n1 20\n1 26\n0\n0\n0\n1 53\n0\n0\n1 45\n1 23\n1 7\n1 52\n1 51\n0\n1 29\n1 48\n1 36\n1 2\n1 28\n2", "2 1\n0\n1 1\n1", "11 20\n1 2\n2 6 7\n1 7\n4 9 2 10 3\n2 9 2\n1 3\n0\n0\n3 6 1 7\n4 5 7 11 6\n2 2 8\n4", "15 20\n3 4 9 7\n0\n1 1\n3 5 6 1\n1 13\n0\n4 8 15 4 2\n1 7\n1 2\n0\n1 4\n0\n2 3 11\n1 5\n2 1 6\n4", "6 6\n1 2\n2 3 4\n1 5\n1 5\n1 6\n0\n1", "4 4\n2 2 3\n1 4\n1 4\n0\n1", "6 6\n2 2 3\n1 4\n1 5\n0\n1 6\n1 4\n1", "5 5\n2 2 4\n1 3\n1 4\n1 5\n0\n1", "5 5\n1 2\n2 3 4\n0\n1 5\n1 3\n1", "5 5\n2 2 3\n2 4 5\n1 5\n0\n0\n1", "6 6\n1 2\n2 3 6\n1 4\n0\n1 3\n1 5\n2", "5 5\n2 2 3\n1 5\n1 4\n1 5\n0\n1", "6 6\n2 2 4\n1 3\n0\n1 5\n1 6\n1 3\n1", "8 8\n2 2 3\n1 4\n1 4\n1 5\n1 6\n0\n1 8\n1 7\n1", "5 5\n2 2 3\n1 4\n1 5\n1 3\n0\n1", "6 6\n2 2 3\n1 4\n1 4\n1 5\n1 6\n0\n1", "8 8\n2 2 5\n1 3\n1 7\n0\n1 6\n1 8\n1 4\n1 4\n1", "5 5\n1 2\n1 3\n1 4\n2 2 5\n0\n1", "5 5\n1 2\n1 3\n1 4\n2 3 5\n0\n1", "3 2\n1 2\n1 1\n0\n3", "5 5\n1 2\n2 3 5\n1 4\n1 2\n0\n1", "3 3\n1 2\n2 1 3\n0\n1", "5 5\n2 2 3\n1 4\n0\n1 5\n1 4\n2", "5 5\n1 2\n1 3\n2 2 4\n1 5\n0\n1", "5 5\n1 2\n2 4 3\n0\n1 5\n1 2\n1", "5 5\n2 2 4\n1 3\n1 1\n1 5\n0\n1", "6 6\n1 2\n2 3 6\n1 4\n1 5\n1 1\n0\n1", "4 3\n1 2\n1 3\n1 1\n0\n1", "4 4\n2 2 4\n1 3\n1 1\n0\n3", "5 5\n1 2\n1 3\n2 1 4\n1 5\n0\n1"], "outputs": ["Win\n1 2 4 5 ", "Lose", "Draw", "Lose", "Draw", "Draw", "Lose", "Win\n4 10 11 8 ", "Win\n4 6 ", "Lose", "Lose", "Lose", "Lose", "Lose", "Lose", "Lose", "Win\n1 3 4 5 ", "Lose", "Lose", "Lose", "Lose", "Lose", "Win\n1 2 3 4 2 3 4 5 ", "Draw", "Lose", "Win\n1 2 3 4 2 5 ", "Draw", "Draw", "Draw", "Win\n1 2 4 5 2 3 ", "Win\n1 2 3 1 4 5 ", "Win\n1 2 3 4 5 1 2 6 ", "Draw", "Win\n3 1 2 3 1 4 ", "Win\n1 2 3 1 2 3 4 5 "]} | UNKNOWN | [
"PYTHON3"
] | CODEFORCES | 2 | codeforces |
Subsets and Splits
No saved queries yet
Save your SQL queries to embed, download, and access them later. Queries will appear here once saved.