messages listlengths 1 1 | ground_truth stringlengths 116 15.7M | dataset stringclasses 1 value | id stringlengths 6 8 |
|---|---|---|---|
[
{
"content": "Takahashi eats three plates for breakfast: rice, miso soup, and salad.\nHis table is long and narrow, so he arranged the three plates in a row. The arrangement is given by a string S, where the i-th plate from the left is rice if S_i is R, miso soup if S_i is M, and salad if S_i is S.\nDetermine w... | eJxrYJn6mgECep5HVytl5hWUlihZKSgFBfvG5CnpKCjll5ZAhSJTi4FCtToKSMqCfYPQlfnlY6jyDQomRlUwMWYFBxHlsCBfDCuhymKn6AEAxfNK0g== | code_stdio | abc360_a |
[
{
"content": "There is an ultramarathon course totaling 100\\;\\mathrm{km}.\r\nWater stations are set up every 5\\;\\mathrm{km} along the course, including the start and goal, for a total of 21.\nTakahashi is at the N\\;\\mathrm{km} point of this course.\r\nFind the position of the nearest water station to him.... | eJxrYJlazMgABhE5QEZ0tVJmXkFpiZKVgpKpcUyeko6CUn5pCUzEFChSq6OApMjIEF2RkQGGIkMDA3RVECFUZeYY9mEowTAHi2WElWB6DNMtRuhqzDHNMTUhJoRMMUIIrCh2ih4AL+dsGg== | code_stdio | abc305_a |
[
{
"content": "Takahashi's cake has been eaten by someone. There are three suspects: person 1, person 2, and person 3.\nThere are two witnesses, Ringo and Snuke. Ringo remembers that person A is not the culprit, and Snuke remembers that person B is not the culprit.\nDetermine if the culprit can be uniquely ident... | eJxrYJl6nJEBDCIOABnR1UqZeQWlJUpWCkqGCkYxeUo6Ckr5pSVQIWOgQK2OAooiQ3RFuoYYqowxVRlhKDJSMEZXhM0kDEVY7DPCdDpWV2GoItPpVAwqI0xV2IzCCAWwo2Kn6AEA46SCyw== | code_stdio | abc355_a |
[
{
"content": "You are given an integer N between 1 and 9, inclusive, as input.\nConcatenate N copies of the digit N and print the resulting string.\n\nInput\n\nThe input is given from Standard Input in the following format:\nN\n\nOutput\n\nPrint the answer.\n\nConstraints\n\n\n- N is an integer between 1 and 9,... | eJxrYJmaxsgABhHxQEZ0tVJmXkFpiZKVgpJxTJ6SjoJSfmkJTMAYJFSro4CkyBJdkSUMYCg1RFdqiKHECF2JkRGGGhN0NSZAgKHKFF2VKQhgKDNDV2YGBhjqzNHVmUMAhkILdIUWUABSGTtFDwAkeWbi | code_stdio | abc333_a |
[
{
"content": "You are given a string S of length 6. It is guaranteed that the first three characters of S are ABC and the last three characters are digits.\nDetermine if S is the abbreviation of a contest held and concluded on AtCoder before the start of this contest.\nHere, a string T is \"the abbreviation of ... | eJxrYJm6lJEBDCLmARnR1UqZeQWlJUpWCkqOTs7GJpYxeUo6Ckr5pSVQ0cjUYqBQrY4CmkpTA3SVfvlYFRqaEafQyBxDIQ67LS0xXIndSENjIyKNNLM0Ic5ICyMiFRoYEBlABga4HBk7RQ8AzCp8wg== | code_stdio | abc350_a |
[
{
"content": "We have the following 3 \\times 3 board with integers from 1 through 9 written on it.\n\nYou are given two integers A and B between 1 and 9, where A < B.\nDetermine if the two squares with A and B written on them are adjacent horizontally.\n\nInput\n\nThe input is given from Standard Input in the ... | eJxrYJn6k5EBDCI+ARnR1UqZeQWlJUpWCkrmChYxeUo6Ckr5pSVQocjUYqBQrY4CkjJDBUt0ZX75GKqMFUyIUGWmYE6EKkOizDJWMCNKFTGuN8IMCqzuMiVClQmRZhkRE/hGCsbEKDPBdBlUWewUPQDrnJYf | code_stdio | abc309_a |
[
{
"content": "You are given two integers A and B, each between 0 and 9, inclusive.\nPrint any integer between 0 and 9, inclusive, that is not equal to A + B.\n\nInput\n\nThe input is given from Standard Input in the following format:\nA B\n\nOutput\n\nPrint any integer between 0 and 9, inclusive, that is not eq... | eJxrYJl6mJEBDCL2ABnR1UqZeQWlJUpWCkpGCqYxeUo6Ckr5pSUwIaBArY4CkiIDBQN0RZYYiswVDNEVmWAoMsQ0CdM6I0xFxlgUEWWdMboiUywmYSgywxIEZuiKzDEUGSuYoCuywGKSBeHANMU0CRQmtbFT9ABVmoJE | code_stdio | abc343_a |
[
{
"content": "You are given an integer Y between 1583 and 2023.\nFind the number of days in the year Y of the Gregorian calendar.\nWithin the given range, the year Y has the following number of days:\n\n- \r\nif Y is not a multiple of 4, then 365 days;\n\n- \r\nif Y is a multiple of 4 but not a multiple of 100,... | eJxrYJlqzsQABhEGQEZ0tVJmXkFpiZKVgpKRgZFxTJ6SjoJSfmkJVMzYzBQoVKujgKTO0NLSCFOdGaY6CwMDoswzw6YOi3mmFsS5z8LSjCjzzCzMiTHPyIA49xkZGBJlL9HhbGppSlx8mFgSFy6GFsSZhzPeYqfoAQALTZ/2 | code_stdio | abc365_a |
[
{
"content": "In AtCoder, a user's rating is given as a positive integer, and based on this value, a certain number of ^ is displayed.\r\nSpecifically, when the rating is between 1 and 399, inclusive, the display rules are as follows:\n\n- When the rating is between 1 and 99, inclusive, ^ is displayed once.\n- ... | eJxrYJkqycQABhFCQEZ0tVJmXkFpiZKVgpKhkXFMnpKOglJ+aQlUyNwcKFKro4CkysjUAF0VWARVlaUluiJDDDWG6ErAmtDUmJugqzIyw3STkSmGy00xVRHlKAMM70GEyFJmRFVlxhi+NMP0paEFpi8xvYkzFmOn6AEAypSZTg== | code_stdio | abc363_a |
[
{
"content": "Given a length-3 string S consisting of uppercase English letters, print Yes if S equals one of ACE, BDF, CEG, DFA, EGB, FAC, and GBD; print No otherwise.\n\nInput\n\nThe input is given from Standard Input in the following format:\nS\n\nOutput\n\nPrint Yes if S equals one of ACE, BDF, CEG, DFA, EG... | eJxrYJmqxMQABhHSQEZ0tVJmXkFpiZKVgpKjk3NMnpKOglJ+aQlUyC8fKFKro4Ckys0RQ1VkajGGsojICCIMc3HzIEKVu6c3MQ5zcSJClbMzMZ4MCPcjQpWjsysxQeHk4kaMMmdXd2KUubg5EqPM1R0jNLApc3dywaEsdooeABVwpPs= | code_stdio | abc312_a |
[
{
"content": "There are three cards with letters $\\texttt{a}$, $\\texttt{b}$, $\\texttt{c}$ placed in a row in some order. You can do the following operation at most once: \n\n \n- Pick two cards, and swap them. Is it possible that the row becomes $\\texttt{abc}$ after the operation? Output \"YES\" if it is ... | eJxrYJlaysgABhF5QEZ0tVJmXkFpiZKVgpJZTF5iUjKQSE6KyUtKBLKSkhNj8pITgdzkJCBLSUdBKb+0BKo80jU4Jg9B+PlDMJijVKujgGSyIdRkLAagqTSGuQFO4LUUTbcp1LVgH4CdjPAGqjlwl6J6AM08MwzXkOI4DLfGTtEDAL+afTw= | code_stdio | 1873_A |
[
{
"content": "A positive integer x is called a 321-like Number when it satisfies the following condition.\n\n- The digits of x are strictly decreasing from top to bottom.\n- In other words, if x has d digits, it satisfies the following for every integer i such that 1 \\le i < d:\n- (the i-th digit from the top ... | eJxrYJmaz8QABhEZQEZ0tVJmXkFpiZKVgpKxkWFMnpKOglJ+aQlUKDK1GChUq6OApMzQyBhdmV8+pipijLIwMzHEUIjFMCNiDDMmxlnmRJlEVDCYEmGdBTEmWRLlKEsTEyIstASGqAExxpmZmhgTFUeW5mZEKrQwN8MIE6jC2Cl6APEgug0= | code_stdio | abc321_a |
[
{
"content": "Given a positive integer N, print a string of N zeros and N+1 ones where 0 and 1 alternate.\n\nInput\n\nThe input is given from Standard Input in the following format:\nN\n\nOutput\n\nPrint the answer.\n\nConstraints\n\n\n- N is an integer.\n- 1 \\leq N \\leq 100\n\nSample Input 1\n\n4\n\nSample O... | eJxrYJn6i5UBDCI+AxnR1UqZeQWlJUpWCkomMXlKOgpK+aUlUAFDAygEStTqKCApNcSiFFORAU4DkSGGPiOs2jCUGeMwHUOhiRlR7qAWxLTfkq7243CFKbY4owfEcImF6QC5hCa+sTQfwr4h3pcDkYYHxKeGBsQVW0MRgjwbO0UPAAX6T+k= | code_stdio | abc341_a |
[
{
"content": "Takahashi will have N penalty kicks in a soccer match.\nFor the i-th penalty kick, he will fail if i is a multiple of 3, and succeed otherwise.\nPrint the results of his penalty kicks.\n\nInput\n\nThe input is given from Standard Input in the following format:\nN\n\nOutput\n\nPrint a string of len... | eJxrYJlazcIABhElQEZ0tVJmXkFpiZKVgpJ5TJ6SjoJSfmkJVCA/vwKEgMK1OgpICi1xKMyvwFSKWy3tEIYrjCxIcQWmdkOitGPoszCjj+cxHYwrKolyNqZvB2m0GhL2JqYeA9x6MBSbGlPFm1gcgccVtEOY/qNmNGKmQkzDQWpip+gBABo5rv8= | code_stdio | abc348_a |
[
{
"content": "There are 7 points A, B, C, D, E, F, and G on a straight line, in this order. (See also the figure below.)\r\nThe distances between adjacent points are as follows.\n\n- Between A and B: 3\n- Between B and C: 1\n- Between C and D: 4\n- Between D and E: 1\n- Between E and F: 5\n- Between F and G: 9\... | eJxrYJkqzMQABhE8QEZ0tVJmXkFpiZKVgpKjgnNMnpKOglJ+aQlUyAQoUKujgKTIXcEJXZGRAYYqZwU3dFWGmKpcFFwxVGFR5IiuyAJDkSumIkssijD8Z4rFOgyXm2FRhBEImCa5YpqEqcgd0+FGxhiqHBXciVDlhukqQ2zhiWGWIdhdsVP0AEHZmPE= | code_stdio | abc305_b |
[
{
"content": "You are given positive integers A and B.\r\nPrint the value A^B+B^A.\n\nInput\n\nThe input is given from Standard Input in the following format:\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nConstraints\n\n\n- 2 \\leq A \\leq B \\leq 9\n- All input values are integers.\n\nSample Input 1\n\n... | eJxt0EEKg0AMBdAKPUjIWspMkjEznqTQ9gDdqAt1UwQP0d63VrqQyWQVfh6BZD1/5uq017XfmtsLn90wjdgCEsR7hzVgP43/iMlt0VLDgSVIOVOVKC5pNDhAk2Nicd5AAsqh3UbAOfJqFFsVpKDMteqUjYuFr3AIIkwFa17jVakRkd9gebwvXyYGaUI= | code_stdio | abc320_a |
[
{
"content": "We define Extended A strings, Extended B strings, Extended C strings, and Extended ABC strings as follows:\n\n- A string S is an Extended A string if all characters in S are A.\n- A string S is an Extended B string if all characters in S are B.\n- A string S is an Extended C string if all characte... | eJxrYJm6mZkBDCLWABnR1UqZeQWlJUpWCkqOjo5OTk7OEBCTp6SjoJRfWgKVjEwtBgrV6igga3B2dHJ0cnbCUOyXj6mWKAOdkAHxDiFKkRNRLiDKJCJDhzgvE6cKw2HYwphIhzk6AsMVGMDEGIkLOOEDziQBIt1MCsDrOlwuptQdJFuKA+BwR+wUPQBv4RDK | code_stdio | abc337_b |
[
{
"content": "You are given a string S of length 16 consisting of 0 and 1.\nIf the i-th character of S is 0 for every even number i from 2 through 16, print Yes; otherwise, print No.\n\nInput\n\nThe input is given from Standard Input in the following format:\nS\n\nOutput\n\nIf the i-th character of S is 0 for e... | eJxrYJnKycwABhFMQEZ0tVJmXkFpiZKVgpKhgQEQQYAhEMbkKekoKOWXlkDl/fKBIrU6CihaDKF6IDS6lsjUYkw9aIAIaxDuggDitKBAYjxDhsNQAVG2wAIYShHpfUOgH4CAaC0GMI+DNREZyBDjwbqIC2SUMCYy+hGhhdUz2PQYINlBvB5kXTj1xE7RAwAy8NAu | code_stdio | abc323_a |
[
{
"content": "A regular pentagon P is shown in the figure below.\n\nDetermine whether the length of the line segment connecting points S_1 and S_2 of P equals the length of the line segment connecting points T_1 and T_2.\n\nInput\n\nThe input is given from Standard Input in the following format:\nS_1S_2\r\nT_1T... | eJxrYJlawsQABhG5QEZ0tVJmXkFpiZKVgpKjc0yeKxAr6Sgo5ZeWQEUjU4uBQrU6CkgqXRyBKh3RVfrlYyh0conJA2EijHSKyXN0IsZIV6BCV2IUOmKzG5tCZyIVggLHmRiFIPdhhiQOhU7EeAYUNES50QVkNVEhDvYNRiRiUwl2JXEJwxlb5EBVxk7RAwAaUL+j | code_stdio | abc333_b |
[
{
"content": "Takahashi is in a building with 100 floors.\nHe uses the stairs for moving up two floors or less or moving down three floors or less, and uses the elevator otherwise.\nDoes he use the stairs to move from floor X to floor Y?\n\nInput\n\nThe input is given from Standard Input in the following format... | eJxrYJmazMQABhExQEZ0tVJmXkFpiZKVgpKhgklMnpKOglJ+aQlUyC8fKFKro4CkytJSwdIMXV1kajGGQkMDAwVDIgw0VzAlxjhzYwVzDHuxGGdsqGCMYSAWdUZGCoYWRKgzVAB6hDjzzImx1xDoX2L8YWqCRR22gCE6QiyMFCwwYhibQmNTBWOiFIKi2NIch8rYKXoAQdWx7Q== | code_stdio | abc326_a |
[
{
"content": "A 326-like number is a three-digit positive integer where the product of the hundreds and tens digits equals the ones digit.\nFor example, 326,400,144 are 326-like numbers, while 623,777,429 are not.\nGiven an integer N, find the smallest 326-like number greater than or equal to N. It always exist... | eJxrYJmqycQABhFKQEZ0tVJmXkFpiZKVgpKxkUFMnpKOglJ+aQlcyAwoVKujgKTM0MQEXRlECFWZqaEZujIzAwMMZZaGlujKIEKoyiwMMCy1MLTAdJuxMYbbwEJoygwwfGqIxW3GFoboykywKDMyxHCbkRFmgBgZmGIoMzTC4gWigpfIWDAHBxJquGHxgqElRixAhGpjp+gBABZdnMA= | code_stdio | abc326_b |
[
{
"content": "A repunit is an integer whose digits are all 1 in decimal representation. The repunits in ascending order are 1, 11, 111, \\ldots.\nFind the N-th smallest integer that can be expressed as the sum of exactly three repunits.\n\nInput\n\nThe input is given from Standard Input in the following format:... | eJxrYJlay8QABhFlQEZ0tVJmXkFpiZKVgpJpTJ6SjoJSfmkJVMDQ0BgoVKujgKTI0BJdlZGxMaYyiBiaaUZQgEW9IbpqTCVGGAZisRbTcRhqTDCswqLGHMMyHO42tMCwEhQg2MLEEHvYYVdrguldaPhhCRkDjOADRh0uo41MMZwMjxpsMWmEEWCG+NQbWWAxHgYgjo+dogcAIISw/w== | code_stdio | abc333_c |
[
{
"content": "A positive integer x is called a 321-like Number when it satisfies the following condition. This definition is the same as the one in Problem A.\n\n- The digits of x are strictly decreasing from top to bottom.\n- In other words, if x has d digits, it satisfies the following for every integer i suc... | eJxt0E0KwjAQBWARDxJmXSQz+ZnEY7hS1AO4qS7alRQ8hN7XUItIXrIK4Uvy5j037+N6Na/DvmxOD7r293GgnSEO5546Q7dxWE6clJOpM3/ICdcqR7bgVBVcKpdR+tp5IPAlA5GaNKLDeECggQAkwzPqcCiOWJM2UifInVTQ5Qhtagy+2SdbsVj9lzc1Jl005igaAv/0/Pjltf0AYiWqIg== | code_stdio | abc321_c |
[
{
"content": "Takahashi, a young baseball enthusiast, has been a very good boy this year, so Santa has decided to give him a bat or a glove, whichever is more expensive.\nIf a bat costs B yen and a glove costs G yen (B\\neq G), which one will Santa give to Takahashi?\n\nInput\n\nThe input is given from Standard... | eJxrYJkqzMQABhE8QEZ0tVJmXkFpiZKVgpKxgYGCoYFBTJ6SjoJSfmkJVNgpsQQoVKujgKzU2ETB2MQYXal7Tn5ZKoZioJlAg4kx1tzUQMHcghiVJiamCiZGZsQoNTWzALqVKG+ZmZsomJiZE6PUEBRUGIZiDwBjoGIjIgPL1MhIwdTclDjFJibmCmZGlkQqBjrD1AK3k2On6AEAuKiZzA== | code_stdio | abc334_a |
[
{
"content": "Takahashi is heading to AtCoder Land.\r\nThere is a signboard in front of him, and he wants to determine whether it says AtCoder Land.\n\nYou are given two strings S and T separated by a space.\r\nDetermine whether S= AtCoder and T= Land.\n\nInput\n\nThe input is given from Standard Input in the f... | eJxrYJnKysQABhH/GBkYoquVMvMKSkuUrBSUHEuc81NSixR8EvNSYvKUdBSU8ktLoHKRqcVAoVodBST1INWBoa6uflh1+OVjaEgMSQZqCVLIcfQjRrljSTJO92BRHhGg4EuEMpBpClCvEuNm3wCXkKCqTJ9ShdAgvwg3Z6fQ9CyiHA8JzCgi1GZHZRdkeBMdjDkKaSQ4AE9sxk7RAwB99KJ6 | code_stdio | abc358_a |
[
{
"content": "For a positive integer X, let \\text{ctz}(X) be the (maximal) number of consecutive zeros at the end of the binary notation of X.\r\nIf the binary notation of X ends with a 1, then \\text{ctz}(X)=0.\nYou are given a positive integer N. Print \\text{ctz}(N).\n\nInput\n\nThe input is given from Stan... | eJyN0UsKAjEMBmARD1K6HiRJX4knEdQDCDIKzqxkwEPofa0ygjRI21UJH3+T9L56XpeLz9me8mV3s8f+Mg52YywB+X1vO2PP4zDXXC5MnflRyKVBZUJJQMfUSQICjqqlqJ9zkRMINmTK99Spn2XDvOhYmBigpF6npkgAKFRS/juWoiQ6lmNwQnpbpFtwgRxhTm+wPsq7Ya+WQPobKvbwWL8AEEKwBg== | code_stdio | abc336_b |
[
{
"content": "The AtCoder railway line has N stations, numbered 1, 2, \\ldots, N.\nOn this line, there are inbound trains that start at station 1 and stop at the stations 2, 3, \\ldots, N in order, and outbound trains that start at station N and stop at the stations N - 1, N - 2, \\ldots, 1 in order.\nTakahashi... | eJyNkUEKAjEMRUU8yKfuZJA2adOph3CtqEsXbmYEZ1YieAi9r9FxIeoiJZQSHp/X5Dq5z8aj11lN9bE5u0Nz7Du3gMsQBPC2cRVc23fv9np/0talwgcaPBiE8s0u2z+oBzEkIyZLNNcgTbeFEyEjBIRogFNSBVBG8kbvWFA03IIXghRQhIjllxJVnLVM42Z+jlD3Y/QWRL1qIx0G/MdkwHe3+QNySJkP | code_stdio | abc352_a |
[
{
"content": "You are given a positive integer N.\r\nIf there are integers x and y such that N=2^x3^y, print Yes; otherwise, print No.\n\nInput\n\nThe input is given from Standard Input in the following format:\nN\n\nOutput\n\nPrint a single line containing Yes if there are integers x and y that satisfy the con... | eJyNkbEKwlAMRUX8kPLmIi95L0njRzgr6ujg0gq2kwh+hP6Gm/9nqQ5iHe5dEsIhudxcZ/fndDJo9eibzTkc6mPXhkUREudtHcoiNF37Ga33p350KYsvTH6hZTNiEiObklmuLCnCEgJhVxEISsIhT+KQLWVTJnKmClqbzbMTsWPxSVT2WCkx9ht/S2kopmLA23tSIidKIsykUaEYKY70/9buNn8BYkDJRQ== | code_stdio | abc324_b |
[
{
"content": "For a positive integer X, the Dragon String of level X is a string of length (X+3) formed by one L, X occurrences of o, one n, and one g arranged in this order.\nYou are given a positive integer N. Print the Dragon String of level N.\r\nNote that uppercase and lowercase letters are distinguished.\... | eJzt2b0KwjAUhmEHLyRkDpL+GFqvwQsQ1FlcEod2EsGtm5Per0UdBL/BrUXfZwrhkAyBfAfOeXq7uMnDqusX66Pdx0Pb2IWxxSZaZ2xqm9fGMqUUd/3uyZm3uuyzTlTl4jRRVlSVuhYDU+9eZp63AoDRUD/1vBYhDQDA91S8hEC8AABGQIVU7QMhBQDAINRk0Ody1AgAAH6TbgdK2gEAAP7Isx/YXmd3oRIduQ== | code_stdio | abc336_a |
[
{
"content": "You are given a string S consisting of lowercase English letters. The length of S is between 3 and 100, inclusive.\nAll characters but one of S are the same.\nFind x such that the x-th character of S differs from all other characters.\n\nInput\n\nThe input is given from Standard Input in the follo... | eJxrYJnawMIABhGVQEZ0tVJmXkFpiZKVglJlYmVMnpKOglJ+aQlUyAgoUKujgKQoNT0dXZEhhqIqECivQldohqEwMTEJXZExhqJ0OKhAMDFdgemMDEyQjSmE4WcDDIMqSADZCCa6ySamGCaXEgES8chhhJ45ZigU0B4QThLZIJCaTVNAOL1Rwas5pIaFmQWGM9IoAllEqcJwBmbGom1sgEEmRsowAGev2Cl6ALAnsDk= | code_stdio | abc342_a |
[
{
"content": "The number pi to the 100-th decimal place is\n3.1415926535897932384626433832795028841971693993751058209749445923078164062862089986280348253421170679.\nYou are given an integer N between 1 and 100, inclusive.\nPrint the value of pi to the N-th decimal place.\nMore precisely, truncate the value of p... | eJzFkT0KAkEMhUU8yDL1suR3kngSQT2AjVrsViJ4CG3svKmrWAiziIpgmhkeb16+SQ6T02U8utfs3F/mu7Rab7s2TatEi3Wqq7Tp2ofADUqv7evqycWDNtSgrKweFkzskikLszNZKBQhCPB5CrkLhmEOjmBTBHWCMAmR/iGDOWaBTJ4JPKI/HFiclIUQDbJFSTLAMYD7irawq/7sc0W2fTH+dwdXNIv4y5ZuHMtjcwUpAqSd | code_stdio | abc314_a |
[
{
"content": "You are given a string S of length N consisting of digits.\nFind the number of square numbers that can be obtained by interpreting a permutation of S as a decimal integer.\nMore formally, solve the following.\nLet s _ i be the number corresponding to the i-th digit (1\\leq i\\leq N) from the begin... | eJylkLsKAjEQRUX8kJB6kXnl5ZcIrh9gEy12K1mwthP0f42LhWymCDjVMJwzXO5t83qsV/Ps72U5XO0pX8bB7oyVPgsT9Nl2xp7H4Xumcpg68wNynwEbOCxg9EmAQkR0wEslCtRSSbHkUKOqACqFTRQtKTVXlf+P9K7pl2+g5pKBPXICklA9Lt2rEoYiRE8CLlVdBnGq5BJHwkDgUapwgXUJgWIASCCOFelT63R8bt9M/Ltn | code_stdio | abc324_d |
[
{
"content": "You are given a positive integer N.\nFind the maximum value of a palindromic cube number not greater than N.\nHere, a positive integer K is defined to be a palindromic cube number if and only if it satisfies the following two conditions:\n\n- There is a positive integer x such that x^3 = K.\n- The... | eJyNkUEKAjEMRUU8SOl6kCZpMxNPIqgHcDO6mFmJ4CH0NO48mZ1RRJuqDQRC8vP4TU+zy206GWN5jcXqYLftvu/swljyYd3aythd371aFFvHyrzJOBWBkgBGFteNuLFSC0RehEU8UWb5P79JJY2SUIFLwgKOV6TcUQCCFOkeL07Poc0FEhRXJAXnHD1Tw5OhtkMiNOQ3a8n8E4DoWTA4roEDgmQ/+zdicJhECWNznt8BMUO/pA== | code_stdio | abc343_c |
[
{
"content": "There is an infinitely long piano keyboard.\nIs there a continuous segment within this keyboard that consists of W white keys and B black keys?\n\nLet S be the string formed by infinitely repeating the string wbwbwwbwbwbw.\nIs there a substring of S that consists of W occurrences of w and B occurr... | eJydkk0KwjAQhQU9yCPrIvlpJo2HcK2oSxduWtF2ISJ4CL2vUbrRZPEwEAjDx5c3ydxnz8t08lmrUzpsrurQHodeLaAc7LZVFVQ39GNpvT+n0q3CF6Z/sWWXUdFChNEZrZE2oXyTIQOLzgiTXV4KKZDACG2ENWw3wTFk8PCZspBR0ETmcfJfKeYL6bEJXSNwTDqdz8z/4cSg9hTYwFPGNFoMVhuuW8v1YevC+I3g7jF/AervAys= | code_stdio | abc346_b |
[
{
"content": "You are given an integer N.\r\nPrint an approximation of N according to the following instructions.\n\n- If N is less than or equal to 10^3-1, print N as it is.\n- If N is between 10^3 and 10^4-1, inclusive, truncate the ones digit of N and print the result.\n- If N is between 10^4 and 10^5-1, inc... | eJx1kDEOwjAMRRHiIFHmChmndRxOggQcgKUwtBNC4hBwCTZuSEgFpbbxFP08f9v/urg/57NSm0d+bM/+0J76zq+dR8AABGHX+sr5Y9+NOrwr65fK/TSAJDUSoJbQIE2xBvJgZdfYY0lypBBWXqx9EkuoKFMI9Vpo7BR5JbFBUneaVxq5Ierg0DgCDMtk5hYTJcKofLNuB50+pfxTmWC0MMD3R+QPf1oiEcemBr0X0diyvy1fplq/LQ== | code_stdio | abc304_b |
[
{
"content": "You are given a positive integer D.\nFind the minimum value of |x^2+y^2-D| for non-negative integers x and y.\n\nInput\n\nThe input is given from Standard Input in the following format:\nD\n\nOutput\n\nPrint the answer.\n\nConstraints\n\n\n- 1\\leq D \\leq 2\\times 10^{12}\n- All input values are... | eJyNkU0KwjAQhUU8SMm6SGYyv55EUA/gprpoVyp4CL2vsbiQTkGzCGH4eHnvzX31vC4X49kO9bG7pGN3Hvq0aRLCvkttk05D/5m8B7e2+WLcDYkKlymaA4pChCagU7RgYMPPM3K/kWAq+qffKvyHF86m6kCsgeYYDiUDW70ZQ4qZLgBEMlIRQgndRTxz7VnEspdQdSwA3FWKEjpw9E4zvBEAqlnxUJ7M6BsoWa4RhMI+ZEx7eKxfBiyxkA== | code_stdio | abc330_c |
[
{
"content": "You are given an integer B.\nIf there exists a positive integer A such that A^A = B, print its value; otherwise, output -1.\n\nInput\n\nThe input is given from Standard Input in the following format:\nB\n\nOutput\n\nIf there exists a positive integer A such that A^A = B, print its value; otherwise... | eJyN0UsKAjEMBmARDzJ0rZLHpEk8iaAewM3oQlcieAbRhbe1vkCaWUwXpYQvffy9TO6P8eg9lteyWJ3SttsfD2nRJNJ1l6ZN2h0P3wqXwnna/BkEqNEM+9Rv1Boh6mACaWtCgfCAe9kAw0hSM4nKtCVozWvqkQKZCkIWJ5JwTYwhu5gLojIroFvmYZlnMibJrSJwZgqZ9QXCbuis4gJq4Bie3tOUCzNkLhO4sXr4wJ4mLZsrGxpQfp3lIblP0+Y2fwKZ1bdi | code_stdio | abc327_b |
[
{
"content": "AtCoder Inc. sells glasses and mugs.\nTakahashi has a glass with a capacity of G milliliters and a mug with a capacity of M milliliters.\nHere, G<M.\nInitially, both the glass and the mug are empty.\nAfter performing the following operation K times, determine how many milliliters of water are in t... | eJyNkk0KwkAMhUU8yGPWRTI/mWY8iaAewE11UVciiDv3el/TKkKbLjrMYki+DO8lua/ez+WiP9uHPnZXd2zOl9Zt4BiRCEy0b1wFd7q0v0T4h28VBgVeM8EWECzs4REsGAxYIhiZx6iqY8PWAs8IYugpBSUjFLBYto8NYUkI3Z3lTfTnDE55DpwVFqQ0oWNCc4RapDRmBZwtLIgetY9jWqOZveXVoNe21mbgOiyy3S7U9SSJXZCEKMmOXLejlNJtiS3hr9vDa/0BiACtqw== | code_stdio | abc332_b |
[
{
"content": "Takahashi is growing a plant. Its height at the time of germination is 0\\,\\mathrm{cm}. Considering the day of germination as day 0, its height increases by 2^i\\,\\mathrm{cm} day i's night (0 \\le i).\nTakahashi's height is H\\,\\mathrm{cm}.\nEvery morning, Takahashi measures his height against ... | eJyNUksKwjAQFfQgJesimUkyk/EkgnoAN9VFuxLBQ+jCnUe1VgvSF9BZheHx5n1yWdwe89kw63v/2Jzcvjl2rVtVLsVt4+rKHbr2s5F+ca6rL4xOIREgLEwRqMgQOMUwnpPkQzRgYwVoSmpwNCDMOGeKGRjRaw45ixdAIukbCdkwhkO/PUclT2TpD4XRYzSEjIFVwAYlFMd9iJAMYdY2zhQbfEkjWCn0YloopXAauJBKFJog1EV+nD9MpCBZvRHUVzLch80BPwMKffWCUoead9flE9H0BhQ= | code_stdio | abc354_a |
[
{
"content": "In the calendar of AtCoder Kingdom, a year consists of M months from month 1 to month M, and each month consists of D days from day 1 to day D.\nWhat day follows year y, month m, day d in this calendar?\n\nInput\n\nThe input is given from Standard Input in the following format:\nM D\r\ny m d\n\nOu... | eJx1kU0KwjAQhUU8yJB1kWTyO55EsB7ATXXRupGCh9D7OolpsU3M6pE3H+8l89y9x+0mneOdxekhLt1t6MUBhELQsu1QooasRQPiOvR5gB0DChTfjw38kNqBx7ZzPhAwbOyanB1XsHMqCwdYCf0aZWpq4ijo3GmZSKHe1YMhxhRKtqNccdHA2hvTsNIhsF1g+V7JgiMC4nG0PvahgkxGLdCA9W0XnOealaLZsH8TtVYGsl6i7Njq30xkCC6SxadOBpa7sIC8dUu856yXqCWSU+b5tf8AkyulrQ== | code_stdio | abc331_a |
[
{
"content": "A supermarket sells egg packs.\nA pack of 6 eggs costs S yen, a pack of 8 eggs costs M yen, and a pack of 12 eggs costs L yen.\nWhen you can buy any number of each pack, find the minimum amount of money required to purchase at least N eggs.\n\nInput\n\nThe input is given from Standard Input in the... | eJyNkk+qAjEMxh/yDvLRtUibtJmJJxHUA7jxvYWuRPAQeil33sh0UNBJQTs0M0x/X/41p9/LbfIzrMXVPpaHsNn+73dhjpAEiSJSiaAYV9swRfjb7x6nPPw6TvGqMDpGlPoa88njqhDDe9upEcFcNWIIGBk0hsknYxh/A3bVH/gzqNUf8hjMDZBqcNeyRo7D4ypvgJLQG0oOlgZdO1pvDey72vmeZmOpWHGqlnhWL8oqXlY6JGYznWVGIr2TkUZfdCmmyD2Is11moeJkwtwarmG63u1Yqs+ZWZ9nd+lJvwM= | code_stdio | abc331_b |
[
{
"content": "You are given an integer N and strings R and C of length N consisting of A, B, and C. Solve the following problem.\nThere is a N \\times N grid. All cells are initially empty.\r\nYou can write at most one character from A, B, and C in each cell. (You can also leave the cell empty.)\nDetermine if i... | eJyNkr0KwlAMhQV9kHLnkkVdxCXJ7qxYRweXW8E6ieBD6Pt6EhV/2ko6NPc2Jx+nSS6jmw4H/iznOKxPaZf3xybNijStMouKIiizVDmVRaqPzTO92h4sQ4QMCRN0arHKdkEgUmFUncvigzpGEeOzSIu4qLvUsOBGYmpmtRIOqp3NQbaoRtUTt+xWQl6ghxBmNObd9cbXMJ+97TbKYG988u2+P+Yurza7659q2xwW9m51/I8TCBlyENnK4M22Mg62y18qoL2+DIdycoPEvog+Z1vV9j5+UXu8vqna73VzpTuFIPib | code_stdio | abc326_d |
[
{
"content": "A non-negative integer n is called a good integer when it satisfies the following condition:\n\n- All digits in the decimal notation of n are even numbers (0, 2, 4, 6, and 8).\n\nFor example, 0, 68, and 2024 are good integers.\nYou are given an integer N. Find the N-th smallest good integer.\n\nIn... | eJxtkT1OA1EMhBHiIKutI+S/N57lJEjAAWgCRVIhJA4RajrOiQMUq3hdPT3N+BvbHzef39dXv3X/VY+Ht/l5/3o8zHfTzMf9vJvml+Ph/8Oift5300qj7k0lGzrX0LEYho+uF8BI0CLM2BmXDmkSaItBRo8xoNL4IDeohNqlNACG9YCRNYLSLVpWUsIYjFII0aOncYENT5O28NpJCAV/PbCxV2RU01xKg+YOCVpxIRCJ6GyFu6sil5EbZyxu+apzlfWxMz01w6tzY9dRz/by1dT1tg24rKr5rbjCVZ39T6fbH6BHtFY= | code_stdio | abc336_c |
[
{
"content": "In a coordinate space, we want to place three cubes with a side length of 7 so that the volumes of the regions contained in exactly one, two, three cube(s) are V_1, V_2, V_3, respectively.\n\nFor three integers a, b, c, let C(a,b,c) denote the cubic region represented by (a\\leq x\\leq a+7) \\land... | eJyNUstOAzEMrEQ/ghujnAuKEzub8BGcQS1HDly2ldqeqkr9CPhfnLBUVS22G+dhReNRxpPT/PvhbtbG670my4P77Df7nXuGy+yRGd2qdwu49X433L99bFe9x2+kYXlFHRe4KI8cERnxuvxlbaB+ILiFK0IgYXCRCeiOGSkQCk3hzimBuoyY0wQ0+VBw3iZK1I6M9vIcVjgJVDuPlkc1otlhyqVUbQlh3MugFFzDehkLAnkU08kLgkeqkzVTlyyFKAUL0g2K+oh2iJXBqb0i0DhFbYW09J9PGe1vMzq6v7NyvH89/QDFWtBU | code_stdio | abc343_e |
[
{
"content": "Takahashi came to a store to buy a pen. Here, a red pen costs R yen, a green pen costs G yen, and a blue pen costs B yen.\nTakahashi dislikes the color C. If C is Red, he cannot buy a red pen; if C is Green, he cannot buy a green pen; and if C is Blue, he cannot buy a blue pen.\nDetermine the mini... | eJx1Uj2LAjEQPfAaO3/CI7VIssnkw9LG3urg9rrbQpAoslvJgj9C/6/JFiI7STKBMHkv8+bj/v1cLb6m9bNMl9+bOMbL0IstRCOhJZRs4+40dG0Ua4jz0L9fk2dc44OgZIZPp42H7n9OmfwzjnbQAUGXg2jHgyDt8vcMazyshG/j/tp1cY73DE9m0u9MWQ0ZxnBJvoFzlRCO628UyCHYYgrE8RmcrJZEiWGRrNY3sjwJn0OosiTF8VrBZiviLW9DniJCqFRVESNYA1udCa7HoPEgXakQb1oSTwGNLurPbjH+PTYvd6jghA== | code_stdio | abc362_a |
[
{
"content": "There are N people numbered from 1 to N standing in a circle. Person 1 is to the right of person 2, person 2 is to the right of person 3, ..., and person N is to the right of person 1.\nWe will give each of the N people an integer between 0 and M-1, inclusive.\nAmong the M^N ways to distribute int... | eJyNkE1KQ0EQhEU8yDDrID393zmJoB7ATXSRrETwEHpMdx4gzZCAvs6DzGpo6uuqrs+779/bm/kefvLz+N5fdm+Hfd+2To2edn3T+uthfxppDj427Y+IGy5FWEThpsKNRc1jKTdzJaYRBcNrdg+Y7xopi5tQk0imxIAL9qfdJbEoAypbRcZwaEKqXrpz0VBwr7FybI1ETKxAgxTVSApFkISkF/nc+Q+LyFaDqB51risFUCNmbGSe2RduhGK+VkhkHZLtVu5sN4ZISPGLvMLYeZUTz8ZKTnTgwDx93e9yUITBNswm+Px1fwThRclq | code_stdio | abc307_e |
[
{
"content": "Keyence has a culture of addressing everyone with the honorific \"san,\" regardless of their role, age, or position.\nEven a new employee would call the president \"Nakata-san.\" [Translator's note: this is a bit unusual in Japan.]\n\nYou are given a person's surname and first name as strings S an... | eJyNj8FKAzEQhqX4IEPOxQforSylh0URLIvF9pA22U022yRmd2KzRfAh9H2tInbJRnBOw/zfN8O8XX+IydV3PdJz83QiUlvsyAzIiioqaCskZMIoZFRuNJkCMdiNiJbqc/g6hYGfwyJwveexlSfpApYxWCTBpUWYx+jXMAWvIZda8d42PlbWfwgZ33F0la/D/4xbdVRtL9TOwn1sDLKUOn8+GGuY6SB3de9i+xIn7zYeD0gd17A47svR6Uucsh8sEx5DCUXntWOhQRpv+EVSfuYdDVX1oi3c9bJmsgx89MAA+tmxfb/5BNeozP8= | code_stdio | abc325_a |
[
{
"content": "Takahashi likes full moons.\nLet today be day 1. The first day on or after today on which he can see a full moon is day M. After that, he can see a full moon every P days, that is, on day M+P, day M+2P, and so on.\nFind the number of days between day 1 and day N, inclusive, on which he can see a f... | eJyFkk1OAzEMhVHFQZ6yrlBsJ/7hJEi0B+imsGhXCIlDwNHYcRjS6SxgPFIT5UfO+xK/JB/3Xz+bu6k8fY/J81s5HF/Pp/KIQgJB3x3LFuXlfJqjMgLvW/zRdSh0KatJxvVSINRG86Ve2RNBGHUppCyL6N7B4LC0rfGK3ppVsIJbsudVM+DVguAEmbb7BzTPwGx1JfvrSj5BQ93BHCOnbMItE1Z1OCDrEE4u+hRaEE3VA+I8WkvP6isXJaF2IXrVa3/7M5B6IxsvHMKgytQTlA9yDXIQBxPNw+3/RDxSMpBUk5iHVWr/+fAL+RXDYw== | code_stdio | abc318_a |
[
{
"content": "There is a single integer N written on a blackboard.\r\nTakahashi will repeat the following series of operations until all integers not less than 2 are removed from the blackboard:\n\n- Choose one integer x not less than 2 written on the blackboard.\n- Erase one occurrence of x from the blackboard... | eJyFkU1KBEEMhUU8SNPrQZKXf08iqAdwM7qYWYngIcaVlzUjLqQjTFEURZL68l7q4+bz6/rqZ92f+vLwtj7vX4+H9W5Z5XG/7pb15Xj4DVgH3nfL3xKlbREyc9Qxbddgu1mmJnNBWZUxKRi9ZiNIVnolhwT5eOHgMINA3JUrfBBK4USqxUYuUjWUClAeyl4VCUbQVKrUaTPStgTkGCULZYE8zctJJfMfSLYMFHmfEm1rQExUjTWKLKU3JkS4FToTypg5eNjpGGf0tMooUGdvAxIgCyulrkKU2BbSGQMM7v0B5SpWFyF+CdITPkOeTrffXrKr8Q== | code_stdio | abc340_c |
[
{
"content": "You are given three positive integers N, M, and K. Here, N and M are different.\nPrint the K-th smallest positive integer divisible by exactly one of N and M.\n\nInput\n\nThe input is given from Standard Input in the following format:\nN M K\n\nOutput\n\nPrint the K-th smallest positive integer di... | eJyNkktOAzEMhpHgINasKxS/ErsnQQIOwKawaFeoEmLHHu5bT8n0Ma4KXkXO9//xIx93P1+3N/t4+IzD4/vwsnrbrIclDAQM+rQaFjC8btY96ZHYLuAEQwhwjmnGSg/wHnBIlZL0PU96QpwbEiDgXIcXy6M5xgmLVqElN7tod6Vu9EPkgs1cmBQYvbIbgczlkabmVZJWhRu1WsEUVdUs9zTdJK0Xq9oknnOtjEx5q2jYGMXywxKdVMffrbFRyWIJphF6XlFITK0YjC7kRYCJxchqSbMeb7i6xmxIsKpSsqs9/vWDJviMyOUZEe3LE0S85tfhWPD4JWPOecHTXz3a/GHYQ4/E9vn7fgfYNeXX | code_stdio | abc341_d |
[
{
"content": "You are given a string S of length N consisting of A, B, and C.\nFind the position where ABC first appears as a (contiguous) substring in S. In other words, find the smallest integer n that satisfies all of the following conditions.\n\n- 1 \\leq n \\leq N - 2.\n- The string obtained by extracting ... | eJzNUjEKwkAQFPQh4WqVJDbRbnc/IRgfYBMttBLBR+gP7fyEO3MnSC6WgpcQLpvZmdm5XCf353jEtX74ZnMOu+5wOoZVEZq2ExU1v9suTIuwPx3Tp4UXLtPiA+wVMe3jZlUGrMu2UxURf5gI2BUy/dZqWCP3MiBR08xbxZcZx8h7l7kImoGVdBn8GXjUSZhIn6bOWJoaUypmY6sYe0mFvZIZexSEMIEEK7DuvZAGlFH5a55RkwlXpedrcE82kFCA7xxLWeUc9EEjKikt1eQXfuiDSEA1UqVI+16+WBEycxCQcrg463vLFJiycVEjYRGJSbRHqzEMcqZ4JT/Vgb8ueokx//T+Gy8Dv+mSZ7S9zV/7jRPD | code_stdio | abc322_a |
[
{
"content": "Given an integer X between -10^{18} and 10^{18}, inclusive, print \\left\\lceil \\dfrac{X}{10} \\right\\rceil.\r\nHere, \\left\\lceil a \\right\\rceil denotes the smallest integer not less than a.\n\nInput\n\nThe input is given from Standard Input in the following format:\nX\n\nOutput\n\nPrint \\l... | eJydlE1KBDEQhV3MQYZeT0ul/suTCOoB3IwuZlYieIjxWO48kFFENC+gmFUIX72uvFfpp83z6+bsY12+9M3Vw3K7vz8elovtwnG9X3bb5e54+DyRfvC4235j1iYjtDaglEZIUYkBWhmoxqLmkfW1GYtGoiY9jzWEjGE3ht0QLGhnRvxUEfAZ3QFdlOlXVi9xaSKqmaRjzUhgUMEZRK24tJJdHawaiZhoeHpTZ6rmptkgopHAmNc/ODthMCCIAxBnsWSTkCwP54APAQEaBesfY7D2kRXzFhRsylkEKohMVFqpcqWrevYn4GgcIKjy+40QmfXS3VL3/gqtz4vjfwCRiQold3k2ZvUwYkgVkXeVm9P5G16nQeQ= | code_stdio | abc345_b |
[
{
"content": "You are given a non-empty string S consisting of uppercase and lowercase English letters. Determine whether the following condition is satisfied:\n\n- The first character of S is uppercase, and all other characters are lowercase.\n\nInput\n\nThe input is given from Standard Input in the following ... | eJy1UjtOAzEQRYKDRFtHHIAuioCKpApK+BSOPON4bO8EexPzERKHgGvS0TNZUSB2UdxkCns+z/NGb/x28vF1fNTa/FOc25fK1utNU50NqrFa20Z5+wz6rq6Gg4o3zU9pAUlSr8PBL/ioGbOG+Bc64Q7yqX29DzUqIcWCRrnTqQd0U8I2mRZ0sucFoDa1l2/RFap3rODwooT1KoNlRRCcj2AdG4JomQzLlcjYSJdJELs0J0OcIEpWqpTMlKIFTm3cnmSVy6ADOp9B1XIRqM5P6Zli/nhwK1Fttjm4zQrUuCbM4FXYonbRiPrWiN75wWODkJCSVgEZ8g6mZGeETOLtIufDVmNQW+dRL2WpSaNbrrDd8gp0wprNSnb7jxz376ffxQdtog== | code_stdio | abc338_a |
[
{
"content": "There are N+2 cells arranged in a row. Let cell i denote the i-th cell from the left.\nThere is one stone placed in each of the cells from cell 1 to cell N.\r\nFor each 1 \\leq i \\leq N, the stone in cell i is white if S_i is W, and black if S_i is B.\r\nCells N+1 and N+2 are empty.\nYou can perf... | eJyVVDsOwjAMZYB7VJkB0VK+oyU2diNRDsBSGGBCSBwC7ktjO/05QcGJqqTy8/M3r+FnPxqQHHbV4fgw5/J6v5ltYpZFCWhXUSIiABSlGSfmcr+JQl79eI6THoSEIJX0IZNUYdKcQBWPJUHmAz5bes270jZmQkxW7JnYPdiAAwjt5bxHcNF0jaz9QSA5IJttQC1/2GhhOteIAthQiNxmoK8+15QZ51oSDa58/uJpl+dEJJ+u8iwUH5fZFZpSRPSIKr5NkBCjKptZQqscrxsVSNY0TDtrnLe4QmNH9D0qmbUHbuR+NctC2djUYTQeeIDLcJfxsMRNGDWZbOSRDwfsGXGZUukWImYbkgZlQ3dP7uYCPf3jmY7cvYBu6bunTqf39AtFuJY3 | code_stdio | abc361_d |
[
{
"content": "There is an exam structured as follows.\n\n- The exam consists of N rounds called round 1 to N.\n- In each round, you are given an integer score between 0 and 100, inclusive.\n- Your final grade is the sum of the N-2 of the scores earned in the rounds excluding the highest and lowest.\n- Formally,... | eJztVDtOxDAQpUDiGk+uF+QZz9gOR6CjQwIOQLNQ7FYIiUPAfZlJUiyJpbVEQZNobDnWm+97yefl9/3Vxfg83Nnh8T287N+Oh3CLoKAan/YSkSNqhNpL2CG8Hg8zovjNxw4nTgkU7da26fDbYY1XsMMiIobBbOlxTSsXihAvTA1fUStUUCJYUDEIJC9jiDbKnJKeL9AaaiIbhc1Bu/pO4zibYP37VGd8Ez1dLVkgsduSkXyAWNGQ1z5s0TnyJBDXipOQBUSjXmxnUEYRaEImkE4cU0KyPD1MMxvDg/eN4kFzdq7NuCJZSiO9eItICWLmKrJ8RaHWQ0JhKHUpyiQVqVovhM067LwEfaZV2NirGZt1WKdQh3ryK9jW/6/mt/D8dfMDSx6UlQ== | code_stdio | abc321_b |
[
{
"content": "Given eight integers S_1,S_2,\\dots, and S_8,\r\nprint Yes if they satisfy all of the following three conditions, and No otherwise.\n\n- The sequence (S_1,S_2,\\dots,S_8) is monotonically non-decreasing. In other words, S_1 \\leq S_2 \\leq \\dots \\leq S_8.\n- S_1,S_2,\\dots, and S_8 are all betw... | eJyNU0FOwzAQRIKHjHKukNe763V4BGcQcOTApUWiPVVIPAJexo3XMG5TqdAgnGjjyPKMZ8brt4uPr/Oz3XPzyZ+77fC0fN6shysMkh0SjuwJmhKM5ZwrHIun++WwwLDarKflt48vnHpd4JiCS4/hSriTsjSa8N8U16sTBuIV2SDmZBGYKIoKK3ehf7wdiOZ3Etrq2HPtEhwCGQvBBo0KV4LFUMaMsB7NUityBHQkmua9kEHTvroYdolTdKYZayZib0A435d6ODVw/8K08xgILWwFg7nAx9rB4PSrHvDEJqoBs2CwhftnaooOhkrFkXaKUam8ucjTsehp+80lmfeINrYO9MNhtupmaKnJtHdLNk9pziQ5dwUOnfRHdd4iSvj3M+/n4f3yGxz39fQ= | code_stdio | abc308_a |
[
{
"content": "You are given a positive integer N. Print a string of length (N+1), s_0s_1\\ldots s_N, defined as follows.\n\nFor each i = 0, 1, 2, \\ldots, N,\n\n- if there is a divisor j of N that is between 1 and 9, inclusive, and i is a multiple of N/j, then s_i is the digit corresponding to the smallest such... | eJztlk1qwzAQRrvovnTTtdE6KvGMJEs5SSDtAbJJskhWodBDtPetcAgk/caqXDs2BD9s8M8zo9FYYj4fv1+eH2qWT/FidVTrze6wV4tClfS2UbNCbQ/78xPtDGvSbJwu48uPWXHhV6BXNWiWYKKDwQklBokZLQOWIYOaBc1G0HPgOSZ2KHoQvfEUT1QDqCFwfQizN8e6WG0pnkJVvBH0gfDXt5WguMTnNjuQSb6V4krw34qXHjaNMzeuBHX4timuOE4xo2sy5iUZ90S6Rpek6i79L7/iZmTUD8IyJtwEhxlLuKswuX9cR6ZJ+wf3NWnCGg5jreGJiYmxkBrt+Xi9s0SPnU1+b30mv3+7AY2Zt8+jPV168Vwa8xism5VoX/Me6zFq5vVu8P71+gPT60Ki | code_stdio | abc319_b |
[
{
"content": "You are given a string $s$ of length $n$, consisting of lowercase Latin letters, and an integer $k$.\n\nYou need to check if it is possible to remove exactly $k$ characters from the string $s$ in such a way that the remaining characters can be rearranged to form a palindrome. Note that you can reo... | eJyNkMtOwzAQRRHiQyyvKxSnCWm7ZwsLNiDMYvzIo5EcFLlCKkLiI+Ab2fENzLiuSEhAZOHcOX7Mnft69v55ehK+2w8U98+8cY87zzeMi0w6wRLpQLo0/BUJIZ1CsiQBSpFKSWnpLkgp0KBNLEqo1B5isX8CKLEoqPAAFUCLLTK2xNL3PZat913X99LlBI1VRpFGJ1aD0d9cQ9SgAJDzBePdzkfrd5c30l1dSxfEj4X4X3tB8JcFG2SRo88ktAOcWWlNEyIRkWBtDiSZkHVIx9iyqpttIJRXPGLtrPfJALN+8qMfMjQm+kiyYa+yRCYOc4xYwlbDt35zNFpmLOWsGEZEz9uAV4NUqGVV1ciLkM34ONlJBRPJ2CNeqJtmi/mlMePpXtv+0/fD2/kXQJb9wA== | code_stdio | 1883_B |
[
{
"content": "A polyomino is a puzzle piece in the shape of a connected polygon made by connecting several squares by their edges.\nThere is a grid with four rows and four columns, and three polyominoes that fit within the grid.\r\nThe shape of the i-th polyomino is represented by 16 characters P_{i,j,k} (1 \\l... | eJy1VLtuwzAMzFAgv2Ho1oAf0I/I3KDNmCGLE6D2VBTIRzT/G1WSrZMoxfIQDweCknni8XF7u1+3G/d9nK3x+WPO/XUczHtnxH5fPQCLgn/bewLaA4fk9zdzNLvOXMYhRD2cvq3rd9cRk+eA+x+aSZB54Lj9TUjEFqZwG1OUNK5IlhPKmDLtL4qo9vS1/kaioAhpwX5x+VqgfL2N2V4kAhd2KjULyBSzHwqb2oGj4IlSvnFCOyBLvrlIsfbg9CR0eHwAzwLZDUQxILfdRJpnByjqld2gA0pJorTtIjZ0QxyG0sgKC5jfxPoaqd/19CaoBFwmUmVlaqnlm5yuka70choh5COkatredTU6nh20Slea2Goy01ry67q4dOuDtMzEi/qlTEETYqrsHP2yItPxTx41l/BH | code_stdio | abc322_d |
[
{
"content": "You are given N strings.\nThe i-th string S_i (1 \\leq i \\leq N) is either Takahashi or Aoki.\nHow many i are there such that S_i is equal to Takahashi?\n\nInput\n\nThe input is given from Standard Input in the following format:\nN\r\nS_1\r\nS_2\r\n\\vdots\r\nS_N\n\nOutput\n\nPrint the count of i... | eJxrYJmaLsYABhEJQEZ0tVJmXkFpiZKVgpJxTJ5jfnZmTF5IYnZiRmJxBipTSUdBKb+0BKrYCChQq6OApN0Iph1Coio3wFRugN86ZLOQSbxK8BlFmtmozjfHcL45TmPxCeC0wATDAkMDA1xaR5mjzFHmKJM0JmqBAy5e0IscYstu9LKJ2CKYsDqSCnAq6COj2iCtuiKiqqGcSY3QJbqSpCzsKaynaRBs1JUjNlyJVYeaFU0x2wnGJqQnvsFMElX2DAaHjpLDjySU+EzMB9qFg5kkM+sSUedQseIiwgqylJPWLCCpXiS2RqSS14jQRJnzKWxkEI4AMiKKPm1C1BxibIytCY67yY6hGtQcoEYLi9YtOKq1nchNd8ODiSMw0RKVBUndtVFylCS6EMavEMsAcewUPQBjr4d0 | code_stdio | abc359_a |
[
{
"content": "There is a programming contest with N problems. For each i = 1, 2, \\ldots, N, the score for the i-th problem is S_i.\nPrint the total score for all problems with a score of X or less.\n\nInput\n\nThe input is given from Standard Input in the following format:\nN X\r\nS_1 S_2 \\ldots S_N\n\nOutput... | eJyVU0tKxUAQFPQgTdYPSX9n2pMIxgO4iS5eViJ4iOd9rYkKz0zwExiYabqqq7o7r1dvy+XF+t3OuNw9Dw/z03IcbmgIknGcZh5HiuJ4cAsQZ5JKnebhQMPjcvzMtkyEXg50xlAbcJob+oezZXJrZXeo7N9UPY8Rf5k6O52ZHQVOLFDgKmSRZFLIjMk8f68KrEKclIpLoIWw40Zi5U/YjGk2afmVTK0FyCW22DVvg0aiClTXBDpIOSkYAw3GEGXLUGvZYeACi46xm45krKQJUfDipVsDXkPfGdAoZTgwodaB8IraSVyV3IzcOx0l9zZAoulw9J8FDqDHgzAqklQwtxXt+vkR2jJpm69H0+LQAmQFExsOyozotHY7UWR3Kw1+2WGxQAPmovhNFPN1xm4o+hTaaSpqjer+dP0OX1rczg== | code_stdio | abc328_a |
[
{
"content": "You are given N strings S_1,S_2,\\dots,S_N, each of length M, consisting of lowercase English letter. Here, S_i are pairwise distinct.\nDetermine if one can rearrange these strings to obtain a new sequence of strings T_1,T_2,\\dots,T_N such that:\n\n- for all integers i such that 1 \\le i \\le N-... | eJyVkt1KwzAUx70Y3vkOoddDcO1k+BBeK9aLNP0w25p0rmnWieBD6Pt6zj8VhAmLgf7+pyfniyQfs6+r2QXWwyUZT2+JNp3rkzuRZCLLTVFUZW5koUC2azCZi8S6fgp9rPbkep+LX+kLsQyJFeQ06d6e5Ky4ZS33PVNRooL9Cps8bGu2jZ52q7hRFrlxnj4TE56Km9ysc0MJMiY+4/hjbjSyiujD8eWupa2u29U24nBSPpzx6KhTBTrwfLOlSGks2TBKBh0jLrGUMZdyy30rWiBVacAN6OE/gOcnQSlFC+QJwDVo4ffgf0vxVOALqOF3kaVWfBnbwfQHlnESQ9IOtYWMLDb8UaQPTg6JLC/t2NLLqIN0VkEGVbLoIBZST3taNVFPCeWLXqqBpAnSbyHejnC64Pz5g3jIn+WfP6+/AYdpZNQ= | code_stdio | abc302_c |
[
{
"content": "You are given an integer N and a string S consisting of 0, 1, and ?.\nLet T be the set of values that can be obtained by replacing each ? in S with 0 or 1 and interpreting the result as a binary integer.\nFor instance, if S= ?0?, we have T=\\lbrace 000_{(2)},001_{(2)},100_{(2)},101_{(2)}\\rbrace=\... | eJydU0tOAzEMZdGDVLMuyHbiH5tcA4lyADaFRcsGVeIQcF+cdKpWk4EWrCjJ2C/Os1/mY/H1trhp9vASm8f34XnzutsO98uhQFlvaL0ZVsvhZbcdvRiO/Wp5hkMIX57ibntgS4jQ2fQodycDglMU9ERmUDMsrkPVouQys1KuxGGpA2KqOyijAdYpOEkiSJxSogQgxKjTpITJI0Iwx+KCRf4sQkKGKHGBQ+5IG5t7yuwzElfVQmds00HC9jFadeEhFN3NppIV1CVTMrGuElEnIkcBZuvFPiYrhyuiWbVLAGP/oAbqaE/HgMkyRiZCMcqeOjESK1iUjEL599Y1NY6Gx2UUC9oKp2C8eiaJfmZXBgUn9enlgWAVVkMFZIOG+KN4Jy69rMjSeumMouKiXfnnCHRQ/B+Dn+yqP3oesn/6vPsGtnsmZQ== | code_stdio | abc301_d |
[
{
"content": "Team Takahashi and Team Aoki are playing a baseball game, with Team Takahashi batting first.\nCurrently, the game has finished through the top of the ninth inning, and the bottom of the ninth is about to begin.\nTeam Takahashi scored A_i runs in the top of the i-th inning (1\\leq i\\leq 9), and Te... | eJyVk0FOxDAMRZHgIF9dj1BsJ3HCSZAoB2BTWMysEBKHgHOx4zx8F1jMhFFF40ppojzb/6evV++flxfrc/vByd3z9LA8HfbTDaYEQbzKkWI2L7IufQ/O5mXaYXo87H9OFC687HDEOBnzMiwcM2RgVJQCd3hFdfSGJsgJymzVUBsp3SOqQjJEB6TYAO0dZ2Jezm6cYFMasM1gDZ31ZpZVHLlF3cbD6jBHYYFsSGEa3ZQ6UH2kqgRPC3KGC1pCrlDmqWFJbOUQhcllFctkoOqoK5vSHsJ2VBpLRwukoTA/PwjrKC22ukUbY6X/EnXD9tZ1FBO+RmVpBlVkW2l0k/0Ly5Pw3C20YL36h0V5oFoJDelDa0HztF4aasAGqV3W6LcwUw1lLZG/3Tl150H67SXOmkTwqiqh1sNpBvWNOROwlbYN/RVr436e/43u366/AFPT5yQ= | code_stdio | abc351_a |
[
{
"content": "There is a 3\\times3 grid with numbers between 1 and 9, inclusive, written in each square. The square at the i-th row from the top and j-th column from the left (1\\leq i\\leq3,1\\leq j\\leq3) contains the number c _ {i,j}.\nThe same number may be written in different squares, but not in three con... | eJylk0tOAzEMhln0INasq8qvODEnQWI4AJuBRcsGIXEIuC/2TEFApkWoWcSZaPz5t2O/bt5fNlfzunmKw+3zcD89HvbDNQwCBD5ODAUsTQUap2ELw8Nhf/wFd3Zu1fj/ZQvfmDUoAWtg0Mbp+PWbiajeWEyEirmZOrJ/3ljHlIBFpBCbpgSz9Ezt3AgYZJx0Sa9Cy2R/ulHnZFETHieJWJSxfE1/H6st2iLpdLMl8t9uqU0z2mwUZC0zNGSsLISKxVSqNK/1eNNnIKAZPEs/oyWFXcikoFAK1DTJ1BVmEbfGJ/aOyVEkz05pWXBfe55kumhVZWtYqyEp4ddNr7OEMk6mZAmysVeYrNXI8cS+8rS8MDlbIZ+q9Uxip39MiUa7lOzoWW4J9Eo9i5xbHdOXXo1RyaRjRhJ9IZOW3DmGglIurzGRTEpDVnPqD8m8e9t9AHyTHok= | code_stdio | abc319_c |
[
{
"content": "Takahashi and Aoki played N games.\r\nYou are given a string S of length N, representing the results of these games.\r\nTakahashi won the i-th game if the i-th character of S is T, and Aoki won that game if it is A.\nThe overall winner between Takahashi and Aoki is the one who won more games than ... | eJy1VDtOxDAUpECcI0q9QgHEAtvNHaZAIhyAJlDsVghpDwGXoNsbEtvv5wBaN+vCtp4nL/PejL0//zpcnOXx+D1vnt77l+ltt+03XX87TiTAcepXXf+620o8BT5WXUCuxwkzlDgOvZqhSxR+oR6GnDHnZE6diEDWsthEO09D4CFQFjlKo+H/iebpRgOB60RAmdN2MYYQXZ76lvUkyRoZUHpMWi7ZxxlUjCgmoqiCBihyFomOW0UZiJ6VsDQH0O1g56BD4AZC9W0zg5DJrKYFVswQJnit0nbpBF2MFiPelEvovQxuRizbA5UfjJ5ro6K1GiFT0CZaxd7v0H3/odEKdgBjwFI16LDOFE46GljcBRZaVSiXwYmoctdAYHkQ0A007uVdht0ndRQ1ou+haeB2VJ9YPAoKFbHlJR+G/x9J2svghjdK7mA6QbsqijHGf1r0+fPyB7Cq+FQ= | code_stdio | abc301_a |
[
{
"content": "You are given a string S consisting of A, B, and C. S is guaranteed to contain all of A, B, and C.\nIf the characters of S are checked one by one from the left, how many characters will have been checked when the following condition is satisfied for the first time?\n\n- All of A, B, and C have app... | eJyNU0FuwkAM7IGHRHtGFYhCUW9rf6JS6QN6SXuAU4XKqS9o/9vx2KZRlkhZINl1JuPx2FwWv9+LO67nL2xePstb/3E6lqeubA991Spy6MuyK++nY8QfEDgvuwESEQB1DNw0wM0KnFVAKrzaBW8iDe64aR1zrB9bEmSTBngjmelv1N/EIfUM3N7Em2rIVQpmDdhpjY9asOFqa9jBXGCNg4SgwBcEpLOtMImdyS+M0q9wSmekWa9gOCUaHc1W855JsZjGcgulKKNMzeoMbWHHGdKeVhZePcJOzqk4pUjmj1XjHGNxjf0PSGKo2HVHlEawNKVFlDaWsl9NaaGV5jXv9IBW8BctkTgnOO0nlCb41x1St/DaurGW3YSWnB++FxuNA2vzyODMEKfDj5wh/pd8IDVbFY6207Kd7FFMtbst2Rrf5T5RgfFHCYg1YMhGeucbLUxczq8/939Yvz20 | code_stdio | abc311_a |
[
{
"content": "For a positive integer N, let V_N be the integer formed by concatenating N exactly N times.\r\nMore precisely, consider N as a string, concatenate N copies of it, and treat the result as an integer to get V_N.\r\nFor example, V_3=333 and V_{10}=10101010101010101010.\nFind the remainder when V_N is... | eJyNkztu3GAMhFPsQRaqFwEfw5dPYiDxAdysU6yrIEAOkRwrnQ9kahMbhijYoRrhxz8iOfPp5+H30+HTtW7/9MuX78v9+dvjZbk5Lvb1vJyOy8Pj5eVgrT78cTq+uVbbaxxmDh8XmV5rK4EnpXvp/Ho5iiNTyjXTKbdamhquhEG8nyBFxVbjmSppsaP91y+kkgEx/7gfW4qTiWyvhgYXo2pILFJEDUTS4xUwzGYOMTWSnRFTADX9DydGzTbWp66YWyEJRauJmQWVMaKLFijmhDy6vAfD3xoaFNwsaQckZWEjGJUneKQr1Pg5Yw7WjrfbHNru93aR2GrVIoRyJ7IX20fK03bvVNUbwPF1EmokK4cknIKV2BHOq+sjqQpqqpvJudUKUq7UeuszYozYIIWVXq36IIf5c0q14WCae2ZTgZQM5Uao/Rl90S4gZA/izX899p3txKQjJ+sUtFSBneSprHm98nb36/MzMORFdg== | code_stdio | abc357_d |
[
{
"content": "There are N - 1 white balls and one black ball. These N balls are arranged in a row, with the black ball initially at the leftmost position.\nTakahashi will perform the following operation exactly K times.\n\n- Choose an integer uniformly at random between 1 and N, inclusive, twice. Let a and b th... | eJx1kztOXUEQRB2wkNaNEer/h5UgYS/ACXYAEUJiESZ15n3SDxGgV88TXd2pMz3dVfN69fbv6tvHuvu7H/fPx8+H30+Pxy0dSvL94bim49fT4+cvnxFVqd6Nl2v6IjbSc3GER7MMip0cxKPFFV0g3g11b6UusXPMpqRLhbGGTii5VjFA7SmOyExvJVtM+LTOOZ2MiewBsquzaY+NgZHlVHlaACQ4XwFR7WB74CoV5aGSCLRXjxuTlHvBmEtcMg2bN3Vr2yOp1jfwx2dtH2H0RyTXaRHKcoUQDLObWiIW0+u4JiVn9DmXndOrQXCopyPQ1Cy+cL0OslHDdGYOJ+uFhv5jP87am5WpxhLmJXM6xFjR0Yni0FQy23RC4+7buGMfamuqMSukRjnYJRJrTVArN4QyeWuzO7Yk6aw51rTWOIA2bKfHg0/ANiEdRqGBsTPf8JTZhXqTukdGU9pWhZxvkr00PsAff27eAV6dOa0= | code_stdio | abc360_e |
[
{
"content": "There is an enemy with stamina A. Every time you attack the enemy, its stamina reduces by B.\nAt least how many times do you need to attack the enemy to make its stamina 0 or less?\n\nInput\n\nThe input is given from Standard Input in the following format:\nA B\n\nOutput\n\nPrint the answer.\n\nC... | eJxtU0tuFFEMRAoHeer1CPlT/nESJMgBsplkMbOKInGIcDp2nAT3CCFoz+vNk/VcrnJVf//449fDh9v58rMvX1+3p/PL9bJ9Xlss/XbeTmt7vl7+lPbC22n984hFYR5Zfy+rMtygwsduFtTtDJQ6nlxy7MZ4NGBCghazH1t98raqCDik4BqL08URQ68IUdOestlUW2YqIcUJKznA1VUrGsLBTBODNDUpe2dAhBAvHDvFqj/hCnUuJR4oKiDWgpgpVZBjhYcUAcMAiEhqU55cmrWlh0aysVfRSjVlu6emsVusTy6iGQrPdAc5i7eN1YiOm1n/oSSxcw+UgdKtEVFa1FRQHDHDIKSaWV5GYQHLGQYX7WU0m4gEZTu27E4im2aWhpk3T5lBSepZpobes2c7TaukR6Isac9HS8iBO20qarquqP4JQgBZ6p7ouHhHEL10Hjuau8lU9ECmNJFog2jZTp9ba5fco0aGeJf99vj+6Td7PPt1 | code_stdio | abc302_a |
[
{
"content": "You are given a string S of length N consisting of lowercase English letters.\nWe denote the i-th character of S by S_i.\nPrint the string of length 2N obtained by concatenating S_1,S_1,S_2,S_2,\\dots,S_N, and S_N in this order.\nFor example, if S is beginner, print bbeeggiinnnneerr.\n\nInput\n\nT... | eJy1UsuK1jAUFvRBfroeREcGxIW7eQfBzuIkObnnNE3TNKkM+BD6vqaDC2nduPBbFb4r6fn+5ufj61cv+PK5f3z9NhiKax4+3YaPIzFUhgjTSMPdbZjW/JtiDFEp07nOYjr457vbH94PIwHA2QYvuIjfj7Sdpdt2lT2M5IEFt09eaW2J2tnlPQBjITi379Pkveq6rrTHztYuife92TnlLS2a0VpEkzZUDvqc6zqU8v5IWhatGSNa11KEaE1Ka0OolXMAra8v0Tu4MNoZm5xsszdxR45FYcxRCYNQz22cC2GM1s4ZY21KzknZ2jx7b0yM+47IOWIpSiHGmHOMSh0ORIBaLwse3vUF/4zrqP+Pv06fHAuJZ7S+ZIa0rauCbZ90inIxanYi6FlIv1SqvETTwJ6nT5Nzx1WkxHnOiNZ6X0rOxxUTbT2xZyqAbTuuRuuUYpRyWYxRap6dEyIEredZCCm9X5ZaiY7/XUqMxrQGYI/O56cfb38BtHA3TA== | code_stdio | abc306_a |
[
{
"content": "Print an arithmetic sequence with first term A, last term B, and common difference D.\nYou are only given inputs for which such an arithmetic sequence exists.\n\nInput\n\nThe input is given from Standard Input in the following format:\nA B D\n\nOutput\n\nPrint the terms of the arithmetic sequence ... | eJytkzFOBTEMRCk4yGjrL+Q4juPQ0HEGJOAANB8KqBASh4D74gwCITYSDatfrPwte9549vX0/fL0hM/VRb5cP293x4enx+0cW8WA3hy3A7b7p8fvYkPHyPLLAT+ai2D+frcX2XeiLPrWbSJ/N9bAMDTfKZ31xdhRYG03Fub5zwJrcslSiezZtLK7/+7NehXUDkulBS3gaaOiD0TurVgOc3TfXyDLGhynqIbqSFITmM7piWGBJmiKNm3hMoEr3OAOD3Thbsvx+6Wpqy2WZq1DB2pBTZg2YeqApXE1/YQl2yBbJqShdbQBL/A6Ub3DB3pBrzl+cRRfRC03fYYNJaOQHjWUjpKdBWnof0hapU5WMUZ6jbQTeRPElCRUpRRm1OaUF1QoFKnUaZTqVBsULNSslG1U7hQf1C9EUFIYQZwsQRwhkRLKyOVEC9IJAZWMRkwnadB/4QmUV7B558xX7+jBIAqiIBRREYZoM5qRtIEYGDI/nKEzrPm5jYaRwc3jpBnjK763b2cfHNLz9Q== | code_stdio | abc340_a |
[
{
"content": "A non-negative integer X is called a palindrome number if its decimal representation (without leading zeros) is a palindrome.\r\nFor example, 363, 12344321, and 0 are all palindrome numbers. \nFind the N-th smallest palindrome number.\n\nInput\n\nThe input is given from Standard Input in the foll... | eJxtU0tuFUEMZBHu8TTrCPnT7U8OkR0SUsIB2AQWyQpF4hBwX2oGnpR0jaWZ7rar3XbZ/nXz5/PHD4d8ucfm4ef27enHy/N2d9lGPD5tt5ft+8vzf42HQ/V6e3mD0hUkDBGS9VIzZJEmt2U+hkeMrHJJpXBzBWiKV+WI2A2W5DLM3VSNXM2rYf9hOzmatvQ5tKXb09WawiGEKdbGWcf0tOaA1DVDD8P7SvxTZ2uknhRFHVmvlw4lsnc9KVFYIS0AVFBmG1ShFWD4i8IduCkLro8q1IL4pGVElxAjBGipjoEj0tsjOgk0SkcJSqsuotR9i1nRe9haSg2tOOHXGs1RlhPkjBDKmwBD9tVngo9C1Zl9ozz53Z4FMonkQwtGazKfTbJeL4YsUhysdk2fXhT01YBvVutZEujjmE1Xr/rqGXuD87BISmMGbaBINCdvjSJYhzd0PB2FR9CDOjHllWbt5IsQbZaF+Z9oDd/jY56RLazpngIO0OXEMyHgvVV2Bd4CbwfPX39/+gvShVX2 | code_stdio | abc363_d |
[
{
"content": "There is a bottle of disinfectant that can disinfect exactly M hands.\nN aliens come one by one to disinfect their hands.\nThe i-th alien (1 \\leq i \\leq N) has H_i hands and wants to disinfect all of their hands once.\nDetermine how many aliens can disinfect all of their hands.\nHere, even if th... | eJztVktOw0AMZcGCY1hZV2js+XMSJMoB2AQW7QohcYhyN3ZchTdOQkqcqltUUWsyk4ztiZ+f3bxff3zdXOnv/hOLh9fuqX/Z77o76iKx2/ZCnoQi+W3fbah73u/G7fbgbUMnDDzFpUEwBtyUeKnHVs85qrW5vggxwNQVZFq8iHup64xqATYKO0Om6zDPT+adaV9OPGPjZx7WOx/tyZGW/PLNNuZk2RBBMm5BU6ZCASOBd7B2JLrIkIA54K4NbLBuyHj1sBCqkKwrgQ8QEXNoykHdNgXc+On9cNx5puLAOGEMWRpEYyBjUsJSVVZyDX8GIJtoDurTIwx4R3QJ8UTEjPAzRYTElJhKpFJs9a1XlTKM6SLEROwshj4CuW2fwQEZGeSAYh2JgEUZGJdAkDrRD4hCss4y0K4ql4Jti2wTnMmLNi+wMbdceTAQ55g3XuHGT46Gxf/4G+N8dSUl2lFnNR1wNdk+Xmw9etslUXAtXlREUWRLak0a3w8GYFsalYKbPwmmU00f1f/Wx8PtN3Kk19w= | code_stdio | abc357_a |
[
{
"content": "You are given positive integers N and K, and a sequence of length N, A=(A_1,A_2,\\ldots,A_N).\nExtract all elements of A that are multiples of K, divide them by K, and print the quotients.\n\nInput\n\nThe input is given from Standard Input in the following format:\nN K\r\nA_1 A_2 \\ldots A_N\n\nOu... | eJzt1j1Ow0AQBeAU0MIVnlxHaH9md2Y5CRLhADSGIlQIiUPAdRHjRyJBTGEhIyWSU6Sw1+v3vkwSv569n1+u+Lr5uFitbp+7+/7xadtdoytImz6hoEIRw6bv1ugenra70xEZxQ++rPHtooy46TMEerh+f/Dn+sKdS0CJKIIaUMvhlZ5gfF0c0vnbkMLzNcSI6Hf3DT1tQ/JzGclLKFJD9rgZuSArcoNEiAcqEIU03tz3KSiK0lAjavYgqIraoBGaoX4bhTZYhGVYgSmsoUW0jFbQPEUbKY2SN/M8++iy47WhQGCHxBrCJpVljH0CKyW2Ehar7GasF9gwsaSwZ2VVY9vAwomdhbUrmxvLf+EnEggV6h4i0CKRQyhSiWJ0CaRJ1BECVRoZmQKlErGEXhVmJAtUS4QT2lXyOcPgMJ61kaIvGibtBBTtfyD1z5YL2QSy8bTZMm7zfHV9dSpHZTkX5DyKE3/8BuojMjzdeYw7y6l/O3Jcw3sy8MMD2y+cmhbOuebYJSfOsC7oM87wMsKn/iQ6fKx3b1ef1VHxEQ== | code_stdio | abc347_a |
[
{
"content": "In the xy-plane, there are three points A(x_A, y_A), B(x_B, y_B), and C(x_C, y_C) that are not collinear. Determine whether the triangle ABC is a right triangle.\n\nInput\n\nThe input is given from Standard Input in the following format:\nx_A y_A\r\nx_B y_B\r\nx_C y_C\n\nOutput\n\nPrint Yes if the... | eJyNU7GO1UAMpID/sFLforXXXtt8AgUSHYhHSUHzDom7Cp10HwH/yzg8JERSbIpolXh27Jnx88tf71+92J8Pb3H49GP7ev32+LC9oa1Tv1y1Xp3G5brd0Xb/+HD7+fHLd3x6uqN/AE2rTogv10G6gpAqa4PkcmVq8j/k3f0B0av21lSLta6CydFYyynU3IGaM6mZ+xJe1IgnapvjJjPgWSd5XxKF//QKTdp+XCAMGdTSIY32pEwrjQaNeZj3VKC/fKt02Q1S7ixpYLYoUzQHma4weirwAoFsdkoFOoRJ54H+BGwSMF5RagZHZaIN9vL2oO4JOgQ+OCAjHZJJ9Q3wGGvOsjKJz7ImlHj3qIaZNhfIG8MU34ORHfFNy8oIxrBY0S214hjoXqXSz4CPkiMmr9CrTWoqNTQso+TKuDGu4r5ygQSWAFrDrqTJFbfaFF7c3D1mlZRYy1l4UJa94U4hwCSkijxs/ekWdWhlFZOBAbPXRnCSZC4ZXUqFQxQY3kbtPU+cgg86nZJbBVxtF7riWhJJhdTkEJTbBZ9/vv4Nqc9ziA== | code_stdio | abc362_b |
[
{
"content": "You are given a string S of length N consisting only of lowercase English letters.\nFind the number of strings obtained by permuting the characters of S (including the string S itself) that do not contain a palindrome of length K as a substring.\nHere, a string T of length N is said to \"contain a... | eJyVVNtOhDAQ9cH4HYTn1QALBPwSE9eHtlyWywJLy9JiTPwI/V+n7CWGllhPeSDNHGbmzGE+77/9h7sZL4/w8vpuF003MPvZsreWt2sQwrvG3lh2O7DLvQsXHxvrV2RgbXfNNAnBldhQCXYdK4DvYjJyMQk+Lim+74S+o6NBksMNS5rKiCVhAAh5/o6HDC7c1lW5z7OEomlJ2YZeFDm6RCAU6TrekQMhigSRVgOglBK45FyRWFucv2uqSlJOcJaMwPP0dbG2ZYjhtjWsa85yhYnIkGPKc1qUaFIUcx1Po1ckkxwvMGodBlnPSI51Yjj5KzpTcfs+61GGsqxXXeyq6p5neBzTnomhaJU0a2652AzdYFSfdFieMzJOI6uXjDj0ozUW/MCYkCRJU6XAeIUF4tEbDC1QC4FpQunezALnLFekjakLEK0yVNKsVKzp+ytbA4pL0yQhBGNV61UNwA8iz+GRWLLWzPDPmUI/Rc/rgve1+nvq+5mdjYduf+JdqmgdxJ6mm0hyToQxeqLqdnK2usUhVy0f8YEfRmU5eU4QScrb19MP2wbrMw== | code_stdio | abc363_c |
[
{
"content": "You are given a string S of length N consisting of lowercase English letters.\r\nIf there are any adjacent occurrences of a and b in S, print Yes; otherwise, print No. (The order of a and b does not matter.)\n\nInput\n\nThe input is given from Standard Input in the following format:\nN\r\nS\n\nOut... | eJy9lMFuFDEMhjnAe6z2XKEuPSDxEJxBLIfEcRw7GSczmXRmt6rEQ8ALcuMtSIEDoqo0HLrOJbIc+9Mf219efvvx6sUv+/C9Xz7d7VlLm/fvdvuboxoLR91f7fa5zX+8H7F21/3V7q/IN0e1Zkvg255yhuxw+jf6fX4UfOhpEznDhGqMkS1PDr0AgLHWOIt2C9JNZxqRV98GQzzfzrkEi8VjWa2nOkKjRqXRvKH8Q65U2wJ81poGt4BvE7fQIDXvEtQyiBYYt+Q6XF93MOsDBh9HP1CaxDCqH3k04IuXYJyjVLo0UMcsnKuvYCKHVBNrLIw2jxlVxQW2BORd9JKcaiouSYTqs0S3lWVd6jBplBAXvB0UdJEh51PWKbU0qzQWPwdbVl3UDENdzqfJpS7iNJ7LGppNnhyts8/nSrowsu3Cn8yKXZpxmgzFRx/2FIu5gG1lsRewrSzegQgbNC4KhuCIIwqJIwvI3Hupux0AAQTLbHtfiAWSGGIEooepQSAOwQqFPngoHkME9JEiRDKEaDYthEsJs2np/O6YC9D8B8zznydgPn99/RMCdiA6 | code_stdio | abc327_a |
[
{
"content": "There is a grid of H rows and W columns, each cell having a side length of 1, and we have N tiles.\nThe i-th tile (1\\leq i\\leq N) is a rectangle of size A_i\\times B_i.\nDetermine whether it is possible to place the tiles on the grid so that all of the following conditions are satisfied:\n\n- Ev... | eJyVVL1Ow0AMZmDgMU5ZWFDV+H5yx0MwgwgjA0uKRDshJB4C3pezfXGSpiROIznW1ffls/3Z39e/u5sr+j3eZuf5s3rr3k/H6t5U3uSn7WpTt501tu2ccW0H6AH+Ud2Z6nA6luin14989HVnRgj5qoFyZRr9cLgQDBhMn1sN9oYYUTDwNyZmFSBkagkBepTBgHjrGTaG7+1Nvd/yUvCzFNgImSi5Wj5rdAQj5mlNGJuAaQ+GzhSUEkIBBkfmEZBH9jwyalAeqpJxDRwLy6MXEIP6EaQBSrRYwAjCF+PEeMTxerB5sRJmeFYxDVYysfCy4kVGcOUsbOIFXJzeBOYFCG2L2VD+/jUV/5nR4LFQgRkmqVJdjGWpzIbyv6J5GcNBCv3yqUUyq2qlPFNRWXZJBaFwIpzEXlJJP0qJAQfPCorjAYrq2nvZpo1wwAKWSYBiFPsyyvzpqsFtGqznfS5uDoEyNbq+U0eitHiyOx0v8w0roUDMcPpld6FVywJfVPbFRby4FOLYkJaohcPSUS8FQEOVa1AJUdIOrEvVrDjGSqO0aKMoi7S8UQJ3dNY9ltbLz+4Pj49CGQ== | code_stdio | abc345_d |
[
{
"content": "You are given a string S consisting of uppercase English letters. Separate each character of S with a space and print them one by one in order.\n\nInput\n\nThe input is given from Standard Input in the following format:\nS\n\nOutput\n\nSeparate each character of S with a space and print them one b... | eJxtUk1u1jAQRYKDjLKuOAA7/8Sx49/PSRwnpQfopmXRskGVOATclxcjpCrBlpWJZ968NzP++en3948f2qrPMO5/dI9P315fui/UMS6+PnV31D2/vvy7Ik7H5dsdvQvc/65z8E7v9gUUY60xnjGRIlVsfC8IYfSoqmLsDBJkSNNICkBFjNgFavNNlLgNwSVfz3BLmW4kqIB1o4ECOUrkqV7SmBo9E2xI2s9ej9WdU5km3UODwBmQRuNvxjn0VXLXlGqJRWpt11S0ZnIxOW7VMptWPSu5cD7IRdgrkaIFVIUkUmuytIKsNJvhbkFLcqunwsdwEiI0pKjm5dhDswTZiyi3Dkn2q1Z5VNabSXHmFs9zcmMQYQ9Fhqom3uuYsl8vDXWgOmqX1DdSBSnHdCz6YGiCxSHJgdzDyoh08AdICXgqoRUV2iwn+HtkiIjJiF7/MxSf1S43Ns6DuRVXwsbLFIXeZTRMqb1feNAyT1nMfothNzeRslrncFbtwaDAL9E0Bj0zajB4GAXqCvRs0FKgKEKnbnERfgbMgepbUwM8EnkmHNHmviHqqMq0J5YaxwrPQf/28OvzH8/A6cA= | code_stdio | abc329_a |
[
{
"content": "Takahashi is planning to eat N dishes.\nThe i-th dish he plans to eat is sweet if S_i = sweet, and salty if S_i = salty.\nIf he eats two sweet dishes consecutively, he will feel sick and be unable to eat any more dishes.\nDetermine whether he can eat all the dishes.\n\nInput\n\nThe input is given ... | eJzFWctKw0AUdeFvCCHrIk18UT/CtaIuXGQhSCs0pYgIfoR+jjs/zCAFTTuZnHPn3Gk36UznPufccy/p++Hn99HB7+f6q/ty+1o+zp9XbXlZlGd38+XDU/vSPdZN0/6tepvlpCgXq3Yjc9Msu623SfFPz+mOgs0KVXA+IAmou1rsaKsIy/V20OMi1XQ65CCwogUSlVnNauQSlWlcsuqkN3OngEYIWhUsxOlkRso7fIRWTeu03gxgwdG6FcZ4kun48AvAreMlBfaIels3WhR0cft3AStLanBlNWRl12ztZr99W0O+EYgHimJWWfyOkYC0P9BERnOIlefxzUT2xsmYdkLqvNHe+GgfGEys9ODBUYkEm6jMat3DkEfmEweo3L6ETo6PGbOx0ZuOW5o2a0rptFmh5ohwTdCaMUhDfr0H9GIFhXEd1x5E/oXvvflfkeORxCr0X2UrRmmXM/oJgPlkyCvc1dgwRScjcUYFfKHlgDAB52MnaXE6IjyDiYlUAnbghQgLcXBS8SBAaSvINiBZXZIOZFKC11wjC429/EmjiVGTdilYEtEl4SczEUrLNNu40v8t1BJChH3/cfwD8689EQ== | code_stdio | abc364_a |
[
{
"content": "You are given a sequence A=(A_0,A_1,\\dots,A_{63}) of length 64 consisting of 0 and 1.\nFind A_0 2^0 + A_1 2^1 + \\dots + A_{63} 2^{63}.\n\nInput\n\nThe input is given from Standard Input in the following format:\nA_0 A_1 \\dots A_{63}\n\nOutput\n\nPrint the answer as an integer.\n\nConstraints\n\... | eJzFlU1u3DAMhbPoJrcwvA4KkuKPlJMUaHuAbiZZJKuiQA+RXqK73rBM0MxYJNXtjAFDY9nyp8f36J8ffv25vXn7ffrtg8/f92+nx+en/X7bcYMNt9fzVY4vp/1u2x+en95xml/5cbclQjgw4r/zO/uF/zIzX7+sEJ9Z37MgNFVQ69KRAdDQMvGVtFwRQyFp3urRAkf5VuN451FcSGtN4wjYcbiiXbs1BgGmJqWm8/KxihEkVhe2eSOzW2b/QLgzIbfRm3ZlVWYEMiReGDfaK740ahfVhICEE2gMxWELEVmIZAiKmYBxpz4q50YF59REVauiZ+QIfKzA9HTqBsPEUKEJN/akcddS5WyBCrAq/Wo2Ojxue62ygLTusIoCQD6wRfxinHKfyz5fdb0SLTj6vF5EHs2jx8rSmxgA6MDSGFmxI2Qsb5yr4li5PtagjB/ZUG8XMJjU48cy6vjF0OX/UbNqPn8ZVtE+WCh/2QiEB5E7g5DVW10tczRoFLuSOlu0ahuFsPM7ErObAgHJjdEaKRBK/481Kl2zUbIFMDBiIs2j82pZ56He6qgpmsN30U5lAq94JObOrMYM1tzTIujN45X568vHv50N1LY= | code_stdio | abc306_b |
[
{
"content": "You are given N integers A _ 1,A _ 2,\\ldots,A _ N.\nIf their values are all equal, print Yes; otherwise, print No.\n\nInput\n\nThe input is given from Standard Input in the following format:\nN\r\nA _ 1 A _ 2 \\ldots A _ N\n\nOutput\n\nPrint a single line containing Yes if the values of the given... | eJztVbtOxDAQpKDhL0ZpaE4otuMXH0EN4igpaHJIQIWQ+Aj4X2ZjMD4nAYviKu72rPFmdjzrJL7X4/ezk6Ppc3lKcP3c3Y33T4/dOTqzHQ00hu3YbdDtnh4/8xc7Zl42KKiDUKdvTb66fZixVb8dvUGAtdAO0WMIMBw9jGWyYUE9eWsj6jlx0VXcjiriT9GirxWtKHwH9ma/R0u3jj30PQ7wa2nZ0I4ZcKhosqRWdijuwbiQWEIz3gw23DXL54cvgbwHvUTCaVqN82QVubbiVKCk/RBzza9oaMuz96DAUBYJJBz155gyBAknWr6U8pyWJZmZyCmflTPOtaVUVkuZXF6Jl2qlzwk39D3ddJZ6OL7jcD20QYzgkcfH1FtwXx0CZQfoiEHBaBgFqwWQbmnMyoGo4MJ0NlItpBnPS80LSg5LH0TTDpKJSogsN6LgvawTehH3cbIgHVDYRhi6cdKWI4tGIqxYGaLMuATLqJJYWsNreZqtk2py6VhbOFqUNNeX/TFiwX7dPupq6YDhJEuHMciMixN76bB1HyOdsNZ8B6cpk8dyWoEqucapYk1kbqPkrzmpOIugUl7senEsCK1b6vhA/EdTrPyj3LydfQCU5vCt | code_stdio | abc324_a |
[
{
"content": "There are N sports players.\nAmong them, there are M incompatible pairs. The i-th incompatible pair (1\\leq i\\leq M) is the A_i-th and B_i-th players.\nYou will divide the players into T teams.\r\nEvery player must belong to exactly one team, and every team must have one or more players.\r\nAddit... | eJytVDtOxDAQpUCcY5R6hWJ7PLY5Ah0dEuEANIECKoTEIeC+ZD52vJsVpGC1sizPx/M+zufl993Vhfzub5fNw/vwNL+8vQ43METw4KfZQZjmADjNwwGG57dXC/PBxwGOCtxvBeOmgABhPE2juMlzIxDkaY5QuD1y+8w7mmYEN3Ik8UIcSacd8zi6M3e77d3btLCQsEkL2wn3dfN7085cem62/4QQIOzptmhRAKvMHiIviyKkCiQTyHEgskpFBBLBkqrmq2pODwtXL7vMO88tsKktPkrWQpUWkSOnaw8pIu4h7kgcJj6TvpzjeVTkiOfGXg6R49gs46y726P2uDCPoQ7m1fDZ2kc75JVsTUaGDFEZkauLMSCEOZusWRq1azR0WTPJcK4MobJQEQmJuWMNVQ5qGpQGO7QnFU0Hrxf4vx/wQkQGjFYsJcXQx5V8qkThOotrxkEdo8IhBZH7Ny4QveaVCkzQxOYgp/QWE0HAUWdH1SEb76jFqfERmv2KCdrLGGwtuyhZ/sxJas4MTUr7ZBVDh6uPY2fPcHwvmdE7u2Ml0wyk22jzC5wVvDFVDLsCK9Yu9c8yd4Yi4ytqNJtmpAPE9qA2n1v5Zjx+Xf8AIAyx3g== | code_stdio | abc310_d |
[
{
"content": "This problem is an easier version of Problem G.\n\nThere is a slot machine with three reels.\r\nThe arrangement of symbols on the i-th reel is represented by the string S_i. Here, S_i is a string of length M consisting of digits.\nEach reel has a corresponding button. For each non-negative integer... | eJy9VEuOFDEMZYHENVq1HpBjJ07CSZAoDsCmYDGzQkgcAg7GjuPwnpPphu4eUSx6XB7Hn/fslLunv7388evVi5B3P+G8/7J83D4/3C9vD0uSdUvdai5NXNetJc3exUpdN7VWqkvKfd2Wu8Py6eF+shyJr3eHP/oo+khSy8Vr6yfv/7J/T2HPszEFt6XgcpR1M8o58XW6ICJTHvVsyjVsDr3AXmlscSMablLk3+1t4gaD3P2Mx0F7GMcL7Z5xvNDu9ziCd90qkAViHWJ0rMMUBEwZPPqohyIKQCEcGQuuzQYlaLCj0PtUM3x3U/PUUnJ33LGFaUNZgON0EguOAMDG7AgaWHDa8AYWHoM0QKRiStYsKhkiWcKqCMyUrAFQiUdHLU9LNODk8AGAITHhEwfVerHW3q8vVqQI9uBS3AWKyItA4xRqGdbnOQL3E4t5J9dHN2cZV8LJIj5tLF6VWnut+KPHgHnEymecilp4lWVEZFYmEZCoTJM3MHX6iiktN8s0rWWzbAx5GhJM4mQERI4SzISRQYE/vBY1I2t0jc6WL/8nnlpsu6FUL6b4iY3F3kxOU57nXc4X+8RPQb6h1GZSOr9LfkM5TXmed7m62A/f3/wGRfbf+Q== | code_stdio | abc320_c |
[
{
"content": "How many integers x between 1 and N, inclusive, can be expressed as x = a^b using some positive integer a and a positive integer b not less than 2?\n\nInput\n\nThe input is given from Standard Input in the following format:\nN\n\nOutput\n\nPrint the answer as an integer.\n\nConstraints\n\n\n- All ... | eJxtVEluFEEQ5IB4hzVnC+W+8BIk4AG+GB/sE0LiEfBfoscGgaNrRq1WV0VlZkRk/nj76+Hdm+v6eIeXT98ud/cPT4+XDzeX3c/3l9uby9enx5cvavjy/fbmn0MqtAglgr+7M3oNP2/faDWzln4N3ort3nLC+szrw9Z0aion88igfDbnJIJr1FYmYRPQyKmQcZsQxnaMTnYpV6ae2hY44ccFTOZmNa73E+x1TceVTt9iIZ4ptevOq4K7YsZ9otKzx4ILbq0dYeyqbGb2bqPcOEs5Q3UI2EFRvPj6XO1FUoL7U8qSAox4IW9WezdEA/vHE++ihD02A0JxduCkrMd7IOg+y/UfdmbCxZs9oPDORnkaZNhVI6xPL1hZ4bgmYHpkbGbHJ43ioqKElCwFjNNZiI5inXyuoLKY4LLFzklxpxYT7ZZQ89HIOrGYHHXNmRYvDv3T8cTJ35Znc4dSqBPJUjKiBV231wnRFKJVQVEEU2cGcgwmMk03eIKyg/cE9HJyWt1tnGH4Saeh76Ok0+CcMI/h8VAigy5kW0WiNl/JWSjcXqRxtY6o1Yl2IMUFUs+gnWRO+nQ9kI+yQ/zINAFMU6P5maMOuhlFDLL1JAKT0ko1D2cx640GPAbSNakvP9//Btt+rs4= | code_stdio | abc361_f |
[
{
"content": "This is an interactive problem (a type of problem where your program interacts with the judge program through Standard Input and Output).\nThere are N bottles of juice, numbered 1 to N. It has been discovered that exactly one of these bottles has gone bad. Even a small sip of the spoiled juice wil... | eJztmE1uE0EQhVlwAW7wNOsIdfV/5SSRcA6QjWGRrKJIHCIchx0Ho/r1gBrPjCBZhrY0I4/dr+vrV/W88Nf33358eMfXzXd78+lxuTt/ebhfrrEEyOm8XGH5/HC/fuRPZ4FHuwe72+PydIVB47ca+aXZW+0PV8tm9Wt4AsJfNNs6cbeOsSK2GqaKu7Xi9jQ7ur16e4z/oouv0olzCO5SWk7n5KjNqBAHsV6aFRlS4e0b29hOmOGrqRFsfwPPCBXRIZrQeDJihW2TPFJEykgV2SF7ZNs3I1cUh+JRIkpGqagO1aNGVCtboQ7qoRGaoQ3DgVztLKVxCbkSuZRcgVyFXEKuRC4lVyBXIZeQK5FLyRXIVcgl5ErkUnIFchVyCbkSuXTlanuaW+QKNItcXmhW51Ka1blKM2vlSjSrcwWaRa4sNKtzKc3qXKWZtXIlmtW5As0iF4GUresujUyJraNLI1MUtq67NDKV1rrVpYGpBLauuzQyKVvXXbpkktJmaG3XaM4RlHKGersGc46gqnCGersGc46h2nwEDnCflbEzB468FEpLG+Dfs2JVcmIEOG1/9PbI0xce66LifvB181szgz+DP4P/5oNfdQZ/Bn8G/78Lvl0z+TP5M/lvOPn8M+L2+eNPTmZ63A== | code_stdio | abc337_e |
[
{
"content": "You are given a string S consisting of lowercase English letters and |. S is guaranteed to contain exactly two |s.\nRemove the characters between the two |s, including the |s themselves, and print the resulting string.\n\nInput\n\nThe input is given from Standard Input in the following format:\nS\... | eJy9lEmO1TAQhlnAPZ7eusUB+iSIYVGe59mObYLEIeC+mEFqktfS6w1kZZW/v/4aknx9/R3evPr1vHu/Dh8+X6ULtVwfL1co2BOadkS5dG4dsHeF5vLRXR8uV1/LkXu6/fJw+SvNnoOXZsnPulty72Oeqd+hI9i8z1l5KGl0i7aONtodcAuDz8HcDJEVjwr4UmERW5vG6KokEVXPbWJTeHScV7buBZitqS06rLOcfILSYqj9ptp/7/nMPO6PrCqjM80T2FSWlIyGIWIYzPVwvFnhaByKVO6ZNrJ08EMzH/XM06kBSdeQaJJNVBSo6NYPAlobRBwTrINd3bygCJ3UTNLuplV7pv/EjgrHoxKbxrRTbIm2EzSaSa+RkFE7uW38juCZ0SUyTAXc0loQ31xwUyoi2aCpKfBgzg4v4I8WPFSwuus8d6FRCGJo6TSdweyNKYjWB0/OLk+iA3MqXtmXfCyImtmQnwoSUGaNL6y4mJRfIwcLwhGqGckRs2Yj8hh5q3qKmWVNG+tB4LjeBLTCeNS0meREEri4Ms0wbasGnYv4L47HNhN1tGM2MEW0Jt7U8Pv6oxDR6mCttJs13vJH+pi++2ZIZBN8AkEkH15p1yTMErDta5O+ARMqiJbFYDLGElG/Wc6dLD9dP317+wMnJxI/ | code_stdio | abc344_a |
[
{
"content": "You are given N integers A_1, A_2, \\ldots, A_N. Find the largest among those integers that are not the largest.\nThe constraints of this problem guarantee that the answer exists.\n\nInput\n\nThe input is given from Standard Input in the following format:\nN\r\nA_1 A_2 \\ldots A_N\n\nOutput\n\nPri... | eJyNVEuOFTEMZDGC3Zyh1OsR6nycDydBmp4DsGlYzKwQEoeA+1KO+4VW+0nwnhVVOy7Hv+Tnw+/H9+/G7/MHgufvy5f929vr8gmLbHtEQOI/bvvyhOXr2+uxp4ofTzhZ523PaolwtU3OttFzBCU0hHIDjeDKDc2RGVbLyBVco3C9cnJ1nL7tdUUkR1RSQqvoGZ0nO373yYV122WwO2pFTugEAaWjRCTnool3wTKEBMlgJK1rMLGgFZQ8MikQBiOozTkr3hlPTEwoITCPhlJQs3qKyCt4RNfURCDpf7JjwXh+Hc0IN2CaiacmFhM3EnfCZN011SFCUh4SNX82oA0lgemngWq6q4LvamKV6+hACRzUnDXILGwpyqqrjA43JG6zWdq0orbCDmgTA4cwoJHatG7sZlhXSB/1I60jFaTVlbD7UKgih7elaQQaRFHcj5C40zGc2q56H9KSWpjegDnhah4oN3M5OXO3bGguN4WRV06UwG4bZX5O5eXzbHNXf5GLk39uDexGx8+kDi7nOY2SlDHbBG2U0ERnqB96W7VKRZXatfIXTxuTSTT/ZmY2Z/qZMrdOkbgB9VOhSfR0PDp8P4j5aBBwJeao26fZENiW2VM5bQybsW2Z0uzt1pgTo0y6uTqu1TjCHBpL6v2H6+XXxz+xgFoy | code_stdio | abc329_b |
[
{
"content": "There is a road that stretches infinitely to the east and west, and the coordinate of a point located x meters to the east from a certain reference point on this road is defined as x.\nIn particular, the coordinate of a point located x meters to the west from the reference point is -x.\nSnuke will... | eJylVEtuVEEMZAH3sN46D/n/4SRIwB42CYtkhZA4BNyXeiMCw+sIhOiRZlrdble5XJ4vz7/dvXh2Wa/fY/Pm0/bh9uPD/faKtiCjXSjf3m43tN093P84Nxx8vqGryF1JSUjOkbxGShVLl0274NubSd3SNWlvlvAow0cng52iwyxKTUXYS6bPEFomrizcMQsak/DjAr95XH/n+dvL/efDq+2/5nh6f84iS5ZQbVdpnxLnqlJK7R43DRITFQgVPAlBgzQnutxxzca4szMClI5Wr1qQ8CjDwc0LCGZCnoNeeQV645nT7RxprWpjlJbiiUC0KtKLa3GKJLh5SC5giUanavS0psnokCQcEcMKgWAF9Y4WGTRewcAcohvIjRoXfOELmlZlRWcvaD1iIdoKknBTh5P0GBIZemqGp5zJMkjAhdo6MstTILmHDdKe0SBRMLfparvdIAcyooADoCNAv70tZ4T2avxCaQVQNprkgGOIpChAwM1y8YXqhR7kXA3iZnP0TKyRF1ahwIjNMGZrB0sJPZiywUich7ocR6l9tLfQVl9MYugLA3NF2yMsHA7QFlYMpyUFKMBzhtTqc8BYJqo5ksMmBTPlsYWymNbQxfS4QxGd6z/Lr0m5HuT9yeP1bFFxiVjn7c+p/x/6gvju68vvVdxFKw== | code_stdio | abc334_b |
[
{
"content": "You are given an integer N. Print a string S that satisfies all of the following conditions. If no such string exists, print -1.\n\n- S is a string of length between 1 and 1000, inclusive, consisting of the characters 1, 2, 3, 4, 5, 6, 7, 8, 9, and * (multiplication symbol).\n- S is a palindrome.\... | eJydVUuOE0EMZcGCY0RZWgMq/23YcQok4ABsBhYzqxESh4D74u6ET1LuJNClSJ1u9yvb7/nVt+c/3r54tl7v3tTN+6f9p/svjw/717s9G3+439/t9p8fH46PEIEBsR5/vdv9FYoDz0NfzlGMKkaKY5wHE6gDhkgguALNG4iZJiNF9zGDAhJYBYkBYf3lBoQk0nAEWgdyWHxcCpVQIfmKdVjHmAk3jd0QM2QrOUoTcAexpI3kki3qsipRb+hlbRlErsRs3Z6VvYBRJhnIUka3p0q6aiDXxlsNubTihpiOhpEyKrWGhq5ZE4AIabp43+8/a4vJS8khDpPiokvuH5Bn7ac6BnqJeKr55NXpZ15vimM0s05ay1SU9EG1lN8xbMM1QjclvySNCRoFAaGQ+KuOORUTTCcKDumgxN2Iydyl78AyfhnDK+gSaxj1U0WgMoNLVPFwrp5VZdeo0hOq9ApVlMwYZVSbEsDqufjSMq/ZUtwCcgn3HJbSduzakv8aLxk6NIdKMx1LKwwjgBmiRNGOV5Sblx5HNF77G8DsAgCxhmkpoRMtrUcIaEZRAh6psB4rXS1aHJuPssY5lcYUJSMFvYbC/ZZwXw6EstGmU53llu0MF+t1sToXQ1r5WgJv2TwTkrJzf5Ct1lfJ68H8ms8nQuaqlKow9ToYJtXxofdiZShYW62NnyHKLYwsylM2HPqszgXg4/dXPwGNtgNR | code_stdio | abc363_f |
[
{
"content": "Your refrigerator has N kinds of ingredients. Let us call them ingredient 1, \\dots, ingredient N. You have Q_i grams of ingredient i.\nYou can make two types of dishes. To make one serving of dish A, you need A_i grams of each ingredient i (1 \\leq i \\leq N). To make one serving of dish B, you n... | eJy9VcuOE0EM5IDEb1g5r1Db7VfzJUiED+ASOOyeEBKnvXGD/6XcOwkiPdoFiaUnST/G9pRd5cnXlz++vXoxx9t7LN59Pnw4fbq7PbyhgxxP2Rr11o4nxoJrIXNxPB1u6PDx7nYzNRx8uaFHnDHtOfZ81DMbnxd1wtfubfHmh+fVoH80T+Qk1EnJyCkoaRxPA1NgazjuuM20ZCdzrBgB8fz53YF3bc8w4njyxcNr7BVxyYI3EhaUZ4OrGH2tZG6WvQpSU5ItlM6xRNMCMK8nCfoDg6dkAH6MxWLQsG6h5BIthSx4NMC2rkMoukQwZYoxiBweBlZ5RI5KbmMVv9Bv4e6XjcxbK394iI0Fjf+1Jn85XC5k9HDy9LQwvNsmI4dzo8jIjjphakJDDJ/amSc5xxDIvGU3R2VaiJA3VAutgEIm2leh/zaZ1dkiW6VgNzclFa/vTq1M1/Z/lgbWgcoADg9Sp54kAAeCAU4qA6AP4mpuxlJpEOPWAtnVeO21Z0EMpD5BlNYgTkHDGYmSoLWAGxkhASSDvLZ8kAsSvMasJvKfMAPTpbTAomd4fcLCSeHu02DyUWyUhy6FlmTfl0Y0HqgJxFctO5ITjI3GziXMHojvJpFQ69AR6Pi01qHycFOmUFXJqmDvDsrTzTCxhgNP9ACaRANAJC3TQYFD+qWJeo2Qh49ioaMBKiP1QH540XT8T8lAANKGVw3cvOIq4lptFGc9zUaC1GywQzjXvtup77+//gmeNLWM | code_stdio | abc338_c |
[
{
"content": "Takahashi has two sheets A and B, each composed of black squares and transparent squares, and an infinitely large sheet C composed of transparent squares.\nThere is also an ideal sheet X for Takahashi composed of black squares and transparent squares.\nThe sizes of sheets A, B, and X are H_A rows ... | eJy9Vktu2zAQ7aLLHoLQ2waEbdWW3EN03aLOMotulAJNVkWBHCI5YnY9RMX5kMNPbCVoJdjkaDhDvvmKD++f/nx4R8+X55n49qv7Pv24v+s+ua53+9MED+9Pkw/PPIGmnduFlfB+mvaup3WSJREdAq+7ct3t/Z1s+fXm58z6feXMMdlmjRfwP9/o8221z9ZtZ8nTtFUtZVzU7IMFCCreK27msVU69GwpZEANq2VfwpXPb9HctXyxXHVRPHpR8fTbu0GiH9MgJkJO6NLgPvJbNcKMkX8Z0OgOuj15PiUkvyc+LD+fxxfsaBOoCF2iww/uyKYAVkfN9LFmYMsnO6g2vZGYB7fdGA1/lkZhQSUzMGpUOurVEt9FchQ/2CVrMc4Yf4ZkT14u+I0bk3JIxeBuSFIgUrrq46pBpnCRJTTifpQBQ6gebm5BqZ5nKMcMvGIxYAwaA8fgMYAUETJIBtOy7Bk5smnvCKNIjzZ1DDWDgi8GlRxY11YcGOFjmTSATUNEbpXDcdvKawV3mX9M0BoHidPL4rZJlMumHRoCSo4SE3lF1kfhi0iYpES9Gqkha5CUWDLH9LPrKQkWfks21IbQsmgFWo5f80il6BYh1mO52j+jXxMeq7QawPXCgxfoc9b/J0/Y45eHh/s9tQbt7HyJzKqc6hx6CAnSRdNHPivwpRQqFTsPpSy4tmH8A/muyOUVqT2rsB6p3YM/NEgfJb1ewXQUkSIoiJcdMSirHn3WpZvhuX70fwHyxwd9 | code_stdio | abc307_c |
[
{
"content": "You are given positive integers N, L, and R.\r\nFor a sequence A = (1, 2, \\dots, N) of length N, an operation of reversing the L-th through R-th elements was performed once.\r\nPrint the sequence after this operation.\n\nInput\n\nThe input is given from Standard Input in the following format:\nN ... | eJztl01uFEEMhWcBW7jC06yjqMoul6s4CRJwADaBRbJCkTgEXBfl2RqJn26GySjJTCRmN93lcvl7z+7ury++v3y9yd/bH682m3dfth+vPt9cb99gaxDo+6vtBbafbq53FyuUlxuMN24v8MtyR0VdLucesRwdvgipJWLKIqhgYsAZY4yNhHUllsEOlb0puc1EpGEe7qKoDdVQOwOhLKZAJmRAHNIhrLlBmFEg3IiBDB+ZSKE8i0EZy78DOtEKWkUjEGZsaDxuR3O0gTZhBVZhAlMYD2QwVuSwAZvoBb2iC7qiN3Set6Oz6IE+4QVe4QJXeIMbnOU4nFwIp2BUDMFQjIZhGB2D1Q6MiUl+FVMwFbNhGmbHdEzCCBplATOWcO2K2gexJJ6ANANYYJNE2BJnT7QjMBN2IJdnzXLBjoURgfRj2O23XP3Jbmn/1W5b7RLS7vZEygb5lipIKlJCndDIUy9L7TR1rKEplQ19PbW21F3TAzX8QFeENzx9YukZPWGX8KQsXedDslwtcc9s+nuXLJuauVd6OsqVLL0EhoDhCcYSkiawGvCIMEB6QrUErAm7BnjiDxE8BXl82e87rwO4JXxNIeJBc8BjRQOaLDrrqM0PGYRLk/W8t/9JeoJRvD5awj8nO+l5Wveo0WJhO1v06vPomXCCrHXNqT17hq8P/3RC3xX6yCzTFk/Ocv0tvt17iJxn5z9gAx5lnYS5u/PHB1WJmIj03MVyx/8vAr8PtQ/fLu8APmXzQg== | code_stdio | abc356_a |
[
{
"content": "You are given a string S consisting of lowercase English letters and digits.\nS is guaranteed to end with 2023.\r\nChange the last character of S to 4 and print the modified string.\n\nInput\n\nThe input is given from Standard Input in the following format:\nS\n\nOutput\n\nPrint the answer.\n\nCon... | eJy9VMmO1DAQ5cCBzxj1eYQcuzoLX4IEHJzY2eysjjuxERInbtzgf4ndaYQmYS4wHSXlsqvqvXqWna+vf35/88o/77+tzofPp6rt9XR693AquZQdRph8bE+PD6dOT08CsAa+PD78UTJ3o2RTp8e8aqlUR8X7lD3MUd1fE/+STO6MrGIDscHRmQyyyWayIGN0Wg4wHME8m32wr1aB6LFDiqpB07jgKI/8nB1u8vP5e4KI6LnHIUG64SW9WJqcEYRBzzIkFGOyE6wgC1vOKE/twCEjcWakilRwRP9PaPvmznQI56XmlDW2NpWGOT4nNg9loBMhLiON216oWradLNfFMiiEFTJKZFUXlgaGlSw5avM/4e4bzhnWDBUBEyhkMTe1yuukSPOaB0M3q7JTcRCky2yKlIpotGlP2zhWQ5ehjFb9IhoaXjiUKazbWGqZmuKo/5eh2cshYhSxawBCZzMYqwtKL03nLzizQSVjCYgrkVuwVdZGyPgQUVUZzs5bXw4ojXo3SVhIxWUSR5pekGsvLAinLDeTvxfabrUdWZaxk5G/PLxcT/HU+1POtO/YZbuRZ+06OGZuFpm3Pkb8T6P1WGQ8EngHzgOhLMrCukmudKuZ+qKm6aI33Ns3DRhHyY3RL4nr2cMwJs225hFMbRfOin5KKmUOhb48516og15xAPsivKF6u83WCTjjExG47VsdQD6ANib/EASA/Ig84g3wqdA7cO6FgouCg/a82Gcj4oj8AoAzCKEbxOYAwr9dZ4njh2uj1x7JLbYTegdOL/TTj7e/ACjxcf0= | code_stdio | abc335_a |
[
{
"content": "You are given a string S consisting of lowercase English letters. How many different non-empty substrings does S have?\nA substring is a contiguous subsequence. For example, xxx is a substring of yxxxy but not of xxyxx.\n\nInput\n\nThe input is given from Standard Input in the following format:\nS... | eJy9VMuuXScM7SD9j6szjqo0uU1y+yWV2gw4+8nLNgYM7KhSP6L93/pEHVQh0xa2gG0trOXFgj9e/VW//+5L+wV08evnmwWq5fbz022Y8RvcXj/dsJZ/Qj9p4PfXT/8CGXM39+Vr3I8fZuCdzWLWxzRlfZ7QtXIgQKoJS4qUIXoPngNDdpHQM4VcmZwH5FqDc6ESO08ekYMPpXqoVKv+B4/kQgYKmKqPmFJhziVy/prG88u7txORa/z3fVLv5WXiIdwj1xJi00kLw55HrrkAaY2QVY8ImCRmEo6JWk1VWi2t5c4+oaAP2QsHkUYExbcYpKDGcm/R6wRRZkGe382C9CaP1qR30fUYIqNfWodcGngU9IBc7dJPLgWOrovReh8KbH10jere8cgwpF9tKLYrRPdqoqu1icjH5/ezoSbZZtGOflA10Xefr9Pfic7hLfjtoiC7Myki4YrFs7vYqiI1VsMbbH3Zx7Ldt8qHuIGZ1lPq2KUI8DpCNYuwGcfRgGbRPswuosTCzuVcIxBaxqiOtDHF4iRZaE5PL+SA0mxqWCWDdwV1TNVRbY1Da4UAnDgdJdrGTfRWSNGjo5xadP4bp/dxIrK3DQMIWU2PEl1Vp6yl+SBOesD9OLZ4HrjbDVbcgTY647CHXq1982X1WjyOIolBMu794LjjFqB1AbBrXQ/2bibyfrbR+B/aZJA3byYecFm32n1sLM6gCcvRUcKa9ssgm3O1x0B9ZcSaq9ASexAUs5+OTsnn2K0+J+nenYsJjuTO5petb0tcfbyMv18qR0vfsMgXIp/+/OFv4kwk6w== | code_stdio | abc347_b |
[
{
"content": "You are given an integer N. You can perform the following two types of operations:\n\n- Pay X yen to replace N with \\displaystyle\\left\\lfloor\\frac{N}{A}\\right\\rfloor.\n- Pay Y yen to roll a die (dice) that shows an integer between 1 and 6, inclusive, with equal probability. Let b be the outc... | eJydVUluFDEUZYHENaxeR9afB06CBByATWCRrBASh4DTsONkPEcokHaHLlErt9p+9etN/vry+89XLx6eNz+wePv59OH20/3d6fU46ZDBNITe3Z5uxunj/d3vP4QmPX2w48vNODsrl86qXD/Lxt4Srl6draLDhogGRXYOThVyqg06jMuYwnOmUWnxBs20PcNHZBm1WQ8LEdYMP8fmdDblUM3ZRe15CNsGt3Fm9mB8TovYObIXRxpGmPg+tTY5hLykefzxZ7nRXapVQsk1TYziGHo8Qd9Bp5kxQ5MMvCHi6MhKUQoiYIxICGRxjp0lbGTYObWlgo4RjYH/wYLYVdOVqVhJpXKHdskycFIwfAQdpZg5Hth76gsXpRLt1BkcrL4hRwaTe/oyl5i3wnLNwuKVI/C51tLbyIpBAJs+rTGG1UGOVdXJwmK4pHdwbtjcHYSZtXxiTxw0M2KYlCGmgaB0pWO5BwUKgkmATxWO7gv5XkRUsxNXN5IM+fCNa/ca28FRim62EzJNEvGoWXiD71w/a43/cAQvB+wnecrVkxemsGEEYeChGlCWw2pvMBaqRDTaa+bScU+rg6JCLFCRrmmtAIbSnUXlOYwb3ci55YodgUPP4P0TVWQX/JQIG3KH0eDYpUfDqGhfRwLQjbL4R0C2Bivp7orGtcDU1bFLfr1j/mbzTKnHv+YzfLcid+GE9pSo8EUxrglwQ520VkTStQ2OZIIJcNkY3MC8Hhwc9Y+bxsWHF6hi0trGxkWyChfdOyPILxUDo/uxD2bAneZNAinBtQMUUkIJCCl7RaJ4YQEUhDughflByvff5i8ZXNJJ | code_stdio | abc350_e |
[
{
"content": "You are trying to implement collision detection in a 3D game.\n\nIn a 3-dimensional space, let C(a,b,c,d,e,f) denote the cuboid with a diagonal connecting (a,b,c) and (d,e,f), and with all faces parallel to the xy-plane, yz-plane, or zx-plane.\r\n(This definition uniquely determines C(a,b,c,d,e,f)... | eJyNlU2O00AQhVkgzlHKeoRcP13dzSFYgzBLFmw8SMysEBKHgHOx4zx85YxGo0kQjtOJnaTL79V7r/Lj5a8/r17sj3e/Ofnw7fR5+3J/d3ojp0XqCGmS62bi51Pp63a6kdPt/d3D795/+spH32/kYq/VsW6PpxLP9769/cdWXZYnL+umdXJ+Pq4jQNz4aUsJtuQSMlqX1opQhGg0iT6ksYZPmYsdqRlNpUEp683F3aTZWLcnFzK7ybSUOfUA5+4priGdDebgCJkDfmAMvlIfEKD9E8zpBwruEL2JzpScJj2AsyCdW4hDt/P9HJLc1PohSa25qIJzpIxQ6XR0GCDrwnSgSJOZoO9TwvIASkUM6Ia6pCsLoI1Gli70F3y+UDuAeUH6GsSeHcYSrUAgLXrMmOuWuwEcpiVMmQAb2wXrKwhLSsBodLRR8dmkKZyNO3mbWIk1nIbQjHHhnisVnW6xQR0YSTebyehwDphqYcwFPzaxhTvPY8oY2YJzAm7i4mpYYruGpauMGg08E8h2PIF1rNusig/reSj/TxYuEAxcoZMukd9eEBT72eQC9wU8ByvnEV93yaDQqLzQuUpa0L2EKjlBnhEoghv90tXXgodu7jQ8dwn7AlFlSuUgjEhs7exzPDDyiLyd4CnIlKhO6FtVblZi6H5h5XHSw3vmkR4azQua54vt8iaWG8V5cKeijZkHA6Ii2NuRCauEPmlTsJu8UYGclGEU1qPEZdT4srfS2xGMwIpZg3a3SVpFrHKMyZ3JU4EMJKsxl8emTSSjTyu2/OfQgU4kZsM6zAsS4sy0MRClL2foVyt+/Pn6L6Akq4E= | code_stdio | abc361_b |
[
{
"content": "In AtCoder Land, there are N popcorn stands numbered 1 to N. They have M different flavors of popcorn, labeled 1, 2, \\dots, M, but not every stand sells all flavors of popcorn.\nTakahashi has obtained information about which flavors of popcorn are sold at each stand. This information is represent... | eJy9VstuGzEM9KE5tR+x2HNQrPNoi35JgbofkIsnhwQgEAToR7S/W3QlckhKazvrIIjhQIpMUUNqhtTvD38vPm3q58e/j5vNz6fxbn//+DB+H8br4Xa3ByCy20sZ56GMu/14OYx4fDC7q3nh+XJodl6VnfNf3dpv2C42fBu+VOdSjOtYN4qOdcEOr7+XBf29jLB97SHXi0O207Cdirk6NNfzVEMsSzVazh1OMaAN4HAKGvNTDAjH7C0E87oengjP9nlkxeA5OjhshgDdw6zlTILwxDNIrAt4N0ezx4/oXNJc/3MbhQExI2YMAmYVhGT59nCYVXMjL1NuO8ysWsG0nOWUBV4q+IPzLojimUW2gTQ2DbHyXr2JDt50HB/8PHQ4cPi8sMn4EGf3+Bizk2aB7+txDVEhdoTdtgnC0mRuyQIjMlVjJNWToT6dNS6uqi0V5hkSJ2/ULchxGBn9aGTS2RwmX50LyQtJIVB+Ho6K4EWS2uUCnjFLY+gjqovdnV9orFs4dgnZTxTGXB5MW+dkD8hSfpf5GulWjZ/4rpW/F3jlJrkMkXwzwiJrpRSpWkVLauTFeeoTdHNGD6Dk0VUk8kPS5Xfqd64sVL5QfwpZ11t4tyeKZ+qCCV7KWIbNmkCoqYDlbppgoylyzPDaFpWzYV7j4lwiiJZjCvaCBLj6PRyrWtGigI48K1rUdD7jJ9aFTjDyRsITlsjXCXKKitk/A5glVlVNYf9UkFOhia83NiufBE05k6iw7CvmKo7w3hO9zXITjy6rvPA3oXdq72HrHsm5FGVBHHhBtK8SuCCyjg/Mccxm2Uprp//15/N/vBbBIA== | code_stdio | abc358_c |
[
{
"content": "You are given two strings S and T consisting of lowercase English letters. The lengths of S and T are N and M, respectively. (The constraints guarantee that N \\leq M.)\nS is said to be a prefix of T when the first N characters of T coincide S.\nS is said to be a suffix of T when the last N charac... | eJy9VEluVDEQZYE4x1evEcpAOmlOgkSz8DzPsxESh4ADseNYfJo0IijoIyTwoly2Xw0uP9eHp5++PHtyGq8/r8qbdzthfcm7V8vuerk9WgDRSWBC2dHuni87V/I94HLdeP98eWDy8mxykg/xV4/gr+/xfcxf4de/gQNwLx7CLx6B33zzDk4C/oHB7XL58qfb8u/K9zXfTu9uudofLSHZFDHtD007FfwQjqaQfpxt+bpdbtZUoOGEYHRWfB/YeOJkoj2zAERG2TagOm4cC9ILDdWGXFgmfIQWtsNc7ZfrtUgK1TkUkawjqYEVPCnKug6jHG22ITAdJR7ETk6oQsEgBgNrxOqEFBduO85+uTkcLVMWMXeeE7euMpxFBjVr5Ez3nVhYh+NYBxNyrRpJWKmc3LZxNt56xP2yX4mGXYK5nufiALCYG0Z5gLlz31PxoGXqVDPBjcljShoaEE3EAcgWZ6phtD9g/MVytxbQACZyzc5zSDwlvkPKUkCFFeYL2zq3NIgAUKuFelqr5ABjpn0FW263anF1WA4rJXFDtERReEG6UKxR8kZaj0JWFR8tmnMEYgNWkvSe2/DfqCAzi6kMYSztZK4sRI6hxKEYMfchYWLTKN+VT8y36CLIJDXReZyW9QxGkZVw4xQi2/S42S+3624h0AVHrJWYV9EhQ4xiRUuXXWPbbdMea6kySnQ4qbBStmUg2t9bzhGxXqsaw/SdF6i3X3zN9W79mtTNxGwTREAbyACdrIUNMQKmYJfEA+aTCpNGkdssE7DgTNM0r59NKpYYjqO1lfVIa+uwD6QUb9zfe91qtYfDcnlxceqc/3r8lyCPt/O3H198BRJBf3s= | code_stdio | abc322_b |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.