question_title stringlengths 1 36 | question_content stringlengths 566 3.58k | platform stringclasses 1
value | question_id stringlengths 8 8 | contest_id stringlengths 6 6 | contest_date stringdate 2023-05-13 00:00:00 2024-12-28 00:00:00 | starter_code stringclasses 1
value | difficulty stringclasses 3
values | public_test_cases stringlengths 175 1.14k | private_test_cases stringlengths 156 92M | metadata stringclasses 1
value | all_tests stringlengths 175 1.14k |
|---|---|---|---|---|---|---|---|---|---|---|---|
Pentagon | A regular pentagon P is shown in the figure below.
Determine 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.
Input
The input is given from Standard Input in the following format:
S_1S_2
T_1T_2
Output
If the length of th... | atcoder | abc333_b | abc333 | 2023-12-16T00:00:00 | easy | [{"input": "AC\nEC\n", "output": "Yes\n", "testtype": "stdin"}, {"input": "DA\nEA\n", "output": "No\n", "testtype": "stdin"}, {"input": "BD\nBD\n", "output": "Yes\n", "testtype": "stdin"}] | eJxrYJn6mYkBDCLeABnR1UqZeQWlJUpWCkouTjF5jkCspKOglF9aAhX1y4eIlKQWl5RUFqSCxIpLUjLzlGp1FJB0O7kCdbuSrdsxJs/JhWzdzpTodgXqdiZbN8jPIBPI1+1EdqiBYot8f7uAXI6hOzK1mIRgcyRbO9jnGOFGtHYXZ2zJDZ/22Cl6ALBV7H4= | {} | [{"input": "AC\nEC\n", "output": "Yes\n", "testtype": "stdin"}, {"input": "DA\nEA\n", "output": "No\n", "testtype": "stdin"}, {"input": "BD\nBD\n", "output": "Yes\n", "testtype": "stdin"}] | |
Subscribers | You are given an integer N.
Print an approximation of N according to the following instructions.
- If N is less than or equal to 10^3-1, print N as it is.
- If N is between 10^3 and 10^4-1, inclusive, truncate the ones digit of N and print the result.
- If N is between 10^4 and 10^5-1, inclusive, truncate the tens di... | atcoder | abc304_b | abc304 | 2023-06-03T00:00:00 | easy | [{"input": "20230603\n", "output": "20200000\n", "testtype": "stdin"}, {"input": "0\n", "output": "0\n", "testtype": "stdin"}, {"input": "304\n", "output": "304\n", "testtype": "stdin"}, {"input": "500600\n", "output": "500000\n", "testtype": "stdin"}] | eJyVkksKwjAQhoOPe4Ssi4zRThJPIqg7u+gmFpouRAQPodcVayE1JsLEWX7k++dBbrPHfMqG2j4njO0uorZN58SGC9xbUXBx6tw3cFXr3Lmp3qh1x9qKa8EDT0MsekKZRsemJ5QpIWk6IspVehm7I6LcEtLGH0bZK5AytnuWey340TyA5N4GDUqVTNBzyE8xvpJJzDBLbo4GCJ+Hnwf+yVGIWpVrSNdCJHIO98ULbLHimA== | {} | [{"input": "20230603\n", "output": "20200000\n", "testtype": "stdin"}, {"input": "0\n", "output": "0\n", "testtype": "stdin"}, {"input": "304\n", "output": "304\n", "testtype": "stdin"}, {"input": "500600\n", "output": "500000\n", "testtype": "stdin"}] | |
Yay! | You are given a string S consisting of lowercase English letters. The length of S is between 3 and 100, inclusive.
All characters but one of S are the same.
Find x such that the x-th character of S differs from all other characters.
Input
The input is given from Standard Input in the following format:
S
Output
Prin... | atcoder | abc342_a | abc342 | 2024-02-24T00:00:00 | easy | [{"input": "yay\n", "output": "2\n", "testtype": "stdin"}, {"input": "egg\n", "output": "1\n", "testtype": "stdin"}, {"input": "zzzzzwz\n", "output": "6\n", "testtype": "stdin"}] | eJxrYJl6n4UBDCJuABnR1UqZeQWlJUpWCkqJiUkxeUo6Ckr5pSVQIWOIQElqcUlJZUEqSKi4JCUzT6lWRwFJZzocVCCY6eiGGRoSZ1oGJsjGFEI33ciAONMrSADZCCa6dSamxFlXSgRIxCOHESPmRAZiAe0BRgQT57RsEEjNpilAd5oZcU6jQqDkkBpqZhbEuS2NIpBFlCoMtxFZANA2MsEgEyO1GeDO8bFT9ABRxNFe | {} | [{"input": "yay\n", "output": "2\n", "testtype": "stdin"}, {"input": "egg\n", "output": "1\n", "testtype": "stdin"}, {"input": "zzzzzwz\n", "output": "6\n", "testtype": "stdin"}] | |
Buy One Carton of Milk | A supermarket sells egg packs.
A pack of 6 eggs costs S yen, a pack of 8 eggs costs M yen, and a pack of 12 eggs costs L yen.
When you can buy any number of each pack, find the minimum amount of money required to purchase at least N eggs.
Input
The input is given from Standard Input in the following format:
N S M L
... | atcoder | abc331_b | abc331 | 2023-12-02T00:00:00 | easy | [{"input": "16 120 150 200\n", "output": "300\n", "testtype": "stdin"}, {"input": "10 100 50 10\n", "output": "10\n", "testtype": "stdin"}, {"input": "99 600 800 1200\n", "output": "10000\n", "testtype": "stdin"}] | eJydkksKwjAQQAU9yJB1kclMPo0nEdSdXXRTC00XIoKH0Ps6rQW1cRFMYAgD782H3FYPv1yMZ4vy2F1U3bR9VBtQDhgM0L5RBahTH6f0lIhVF+O5rYZUF491o64FfNBaWP6b9kNl4D/pMFQGM6dNLk1D73Oac+ce75zWubTTUApPicHlKhBBIxACY9KFxzyJEQFZ2WIIsgwTUpMJLtNlPWhmCV4GI+fKxEUBM7drrWhMCcRGvqclm7gcc2Zfr0Xhd5z7wjv5w3e4r5/7rekM | {} | [{"input": "16 120 150 200\n", "output": "300\n", "testtype": "stdin"}, {"input": "10 100 50 10\n", "output": "10\n", "testtype": "stdin"}, {"input": "99 600 800 1200\n", "output": "10000\n", "testtype": "stdin"}] | |
Rotate | You are given a grid with N rows and N columns. An integer A_{i, j} is written on the square at the i-th row from the top and j-th column from the left. Here, it is guaranteed that A_{i,j} is either 0 or 1.
Shift the integers written on the outer squares clockwise by one square each, and print the resulting grid.
Her... | atcoder | abc309_b | abc309 | 2023-07-08T00:00:00 | easy | [{"input": "4\n0101\n1101\n1111\n0000\n", "output": "1010\n1101\n0111\n0001\n", "testtype": "stdin"}, {"input": "2\n11\n11\n", "output": "11\n11\n", "testtype": "stdin"}, {"input": "5\n01010\n01001\n10110\n00110\n01010\n", "output": "00101\n11000\n00111\n00110\n10100\n", "testtype": "stdin"}] | eJztvUuuLEuWnicBGkgh24RgRrAoQCMRoKue2GAnRYDJhiAI4CA0RTU1B/HsiPV93/J9WMi8txQqHOR5xMPdbT3+h+0IDwvf//m/+5/+n//7v/1v/uf/40///s//4T/95U//4z/86V//9ud7/sv/+9uf//Sv/uFP/9t/+st7x48tP/b82PqXf/cf//KX//0//Lsf2//jX/7Xf//nP/2f/+ofEuQffwS4P0acc74G3vNj7HnfnTORjH9eA+5rwI8jbwb8l81/Xep//Yr/9eerhvt19wpy3xvP+++rsq9yXru+/r/yHo/62nnePX1tua8D... | {} | [{"input": "4\n0101\n1101\n1111\n0000\n", "output": "1010\n1101\n0111\n0001\n", "testtype": "stdin"}, {"input": "2\n11\n11\n", "output": "11\n11\n", "testtype": "stdin"}, {"input": "5\n01010\n01001\n10110\n00110\n01010\n", "output": "00101\n11000\n00111\n00110\n10100\n", "testtype": "stdin"}] | |
Japanese Cursed Doll | There are N people, and the current hair length of the i-th person (1 \leq i \leq N) is L_i.
Each person's hair grows by 1 per day.
Print the number of days after which the number of people whose hair length is at least T becomes P or more for the first time.
If there are already P or more people whose hair length is a... | atcoder | abc363_b | abc363 | 2024-07-20T00:00:00 | easy | [{"input": "5 10 3\n3 11 1 6 2\n", "output": "7\n", "testtype": "stdin"}, {"input": "2 5 2\n10 10\n", "output": "0\n", "testtype": "stdin"}, {"input": "3 10 1\n1 2 3\n", "output": "7\n", "testtype": "stdin"}] | eJztmLuONccNhBX4HZQSGwvC9PTd72HAgNeZFShZCdAqEAQDfgj7fV31sfeH/Z/kSEoEw3s7OzN9YRfJYnH+8Yd/vX75BV9//pP++cvPL9++ff/j+8sf4+WOcl1xv775o7y+vXwVL9/9+H6e7p133r/54f39p++/8b0f3v/27dvL37+K/1jFk1ePW+ssrbZirOgj+hV1RNNPzM1GS4/uGCNKi91j37FXLE2MdkXr0XfUK0aP2jQ+Ro12x7pjjrh7rBq1R9NqbFdq7BIl6oypf2fcoYkarM8Sc8YaMXbsK2YM3WjRW9wtmmxZ0bTtiLqi... | {} | [{"input": "5 10 3\n3 11 1 6 2\n", "output": "7\n", "testtype": "stdin"}, {"input": "2 5 2\n10 10\n", "output": "0\n", "testtype": "stdin"}, {"input": "3 10 1\n1 2 3\n", "output": "7\n", "testtype": "stdin"}] | |
Piano 2 | You are given a sequence A=(A_1,A_2,\dots,A_N) of length N and a sequence B=(B_1,B_2,\dots,B_M) of length M. Here, all elements of A and B are pairwise distinct. Determine whether the sequence C=(C_1,C_2,\dots,C_{N+M}) formed by sorting all elements of A and B in ascending order contains two consecutive elements appear... | atcoder | abc355_b | abc355 | 2024-05-25T00:00:00 | easy | [{"input": "3 2\n3 2 5\n4 1\n", "output": "Yes\n", "testtype": "stdin"}, {"input": "3 2\n3 1 5\n4 2\n", "output": "No\n", "testtype": "stdin"}, {"input": "1 1\n1\n2\n", "output": "No\n", "testtype": "stdin"}] | eJylWsuOZUcRZMGHlHptoarKevIRrEEMO2bhTdvStBcIIfkjzI+w4++IR962TW/aPUjt6Xv63HOqMiMiI7P48ff//m/5nf735//gl7/+8+nb5+9/eHn6Y3lqtfT+6blFK63hZ5U2bhn4bZYx8HmUgWsxPz2fVubB9VvuLa1v/JTB32aZs6yJ3/C1vUvssvGplY4HtMC1VfoqB1/uvVw86umb8vTdDy+5hr98/uJLL5+/vLz84/vPvPjl5e/fPj/965vyi8XejVdjsbX6uR1PrHhHxyZaueVgNQ3XsDRspOMT175xd/BO/D75ewms7nhz... | {} | [{"input": "3 2\n3 2 5\n4 1\n", "output": "Yes\n", "testtype": "stdin"}, {"input": "3 2\n3 1 5\n4 2\n", "output": "No\n", "testtype": "stdin"}, {"input": "1 1\n1\n2\n", "output": "No\n", "testtype": "stdin"}] | |
Binary Alchemy | There are N types of elements numbered 1, 2, \ldots, N.
Elements can be combined with each other. When elements i and j are combined, they transform into element A_{i, j} if i \geq j, and into element A_{j, i} if i < j.
Starting with element 1, combine it with elements 1, 2, \ldots, N in this order. Find the final elem... | atcoder | abc370_b | abc370 | 2024-09-07T00:00:00 | easy | [{"input": "4\n3\n2 4\n3 1 2\n2 1 2 4\n", "output": "2\n", "testtype": "stdin"}, {"input": "5\n5\n5 5\n5 5 5\n5 5 5 5\n5 5 5 5 5\n", "output": "5\n", "testtype": "stdin"}, {"input": "6\n2\n1 5\n1 6 3\n2 6 1 4\n2 1 1 1 6\n5 6 1 2 2 5\n", "output": "5\n", "testtype": "stdin"}] | eJyUnU2uZMlynCVAC0n0mIMTER5/WokA9VAccFIiwOZAEAhoGdqo5jpun3neIjl5BB76dVfdm3l+Ijzczc3M/89/+W//9//95//03//3H//w6x//+a8//uvnjzv//NXOn7/6/aznz1/3M/bnxp+/3v8b4zPap+0/f534nPuZ8zPHZ+d/3/zv9+/P89mf9w/ev9rxWZG/cN8f3p/zfm7c97fzT9cndv5hxGe+37WfT3R94vis91/ic/PX86/G/Az9dOuf99/X+zP9c99vXZ/+fuJpn90+ea15lfnp437y81tey3snkb+yWn7m+wn57e0z... | {} | [{"input": "4\n3\n2 4\n3 1 2\n2 1 2 4\n", "output": "2\n", "testtype": "stdin"}, {"input": "5\n5\n5 5\n5 5 5\n5 5 5 5\n5 5 5 5 5\n", "output": "5\n", "testtype": "stdin"}, {"input": "6\n2\n1 5\n1 6 3\n2 6 1 4\n2 1 1 1 6\n5 6 1 2 2 5\n", "output": "5\n", "testtype": "stdin"}] | |
Not Too Hard | 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.
Print the total score for all problems with a score of X or less.
Input
The input is given from Standard Input in the following format:
N X
S_1 S_2 \ldots S_N
Output
Print the answer.
Constraints
... | atcoder | abc328_a | abc328 | 2023-11-11T00:00:00 | easy | [{"input": "6 200\n100 675 201 200 199 328\n", "output": "499\n", "testtype": "stdin"}, {"input": "8 675\n675 675 675 675 675 675 675 675\n", "output": "5400\n", "testtype": "stdin"}, {"input": "8 674\n675 675 675 675 675 675 675 675\n", "output": "0\n", "testtype": "stdin"}] | eJydkt1KAzEUhAV9kMNeF8n5TeKTCK539qIIsdjthYjgQ+j7OilUShfp4kKWMGS/zM6Zz5vv1+urw3P/jM3D+7Bp2/003NFgxCmNDS86WWMbVjS87KfjqaM0rXfT9LZdd3E3PW3a8LGiE5wTi43NVciikkkmMybzeo5cDlQfm+SCTRDXQuFGYvn/wBpjM+mQQqbWBXKJc+Dh3BIkvlbBT5cKZJBypeBEEUwqco4tJS/FckZsXpGjJjJW0gr7iMJzmbk9SpewmIgyAjChnmp4gctKXJTcjNxnjnNdmG0hie7YMX0WBADnHoT2kFTFdU6S... | {} | [{"input": "6 200\n100 675 201 200 199 328\n", "output": "499\n", "testtype": "stdin"}, {"input": "8 675\n675 675 675 675 675 675 675 675\n", "output": "5400\n", "testtype": "stdin"}, {"input": "8 674\n675 675 675 675 675 675 675 675\n", "output": "0\n", "testtype": "stdin"}] | |
Strictly Superior | AtCoder Shop has N products.
The price of the i-th product (1\leq i\leq N) is P _ i.
The i-th product (1\leq i\leq N) has C_i functions. The j-th function (1\leq j\leq C _ i) of the i-th product (1\leq i\leq N) is represented as an integer F _ {i,j} between 1 and M, inclusive.
Takahashi wonders whether there is a pro... | atcoder | abc310_b | abc310 | 2023-07-15T00:00:00 | easy | [{"input": "5 6\n10000 2 1 3\n15000 3 1 2 4\n30000 3 1 3 5\n35000 2 1 5\n100000 6 1 2 3 4 5 6\n", "output": "Yes\n", "testtype": "stdin"}, {"input": "4 4\n3 1 1\n3 1 2\n3 1 2\n4 2 2 3\n", "output": "No\n", "testtype": "stdin"}, {"input": "20 10\n72036 3 3 4 9\n7716 4 1 2 3 6\n54093 5 1 6 7 8 10\n25517 7 3 4 5 6 7 9 10\... | eJztXcvOrclNBYkH2epxhOp+4SEypkUzoweZdCL1yQAhJB6Ch+Qx+OrmWrbr+09oGCAoBqiT9L93bZfLl+Vl+9/+5u9//I+//qt/+Jcf/vDLn/787Ye/+/zgPvanX5JP4fmH9o8+BDv+6YfffX7445+/zX/vx59/Hf/Vt59//fbtn//0c/svf/32T3/45Yd//d1HfqA17f/G5+A/88/8/R//wo80n5p++iWaYsMnhOej3Cd+0qd87POp/mPjx6aPzR9bP+75H93H+Y+LH5c+Ln9c+bj68e7j48eXj6+fYD7Pj3w+KMRPKJ8YPjF9Yv4k... | {} | [{"input": "5 6\n10000 2 1 3\n15000 3 1 2 4\n30000 3 1 3 5\n35000 2 1 5\n100000 6 1 2 3 4 5 6\n", "output": "Yes\n", "testtype": "stdin"}, {"input": "4 4\n3 1 1\n3 1 2\n3 1 2\n4 2 2 3\n", "output": "No\n", "testtype": "stdin"}, {"input": "20 10\n72036 3 3 4 9\n7716 4 1 2 3 6\n54093 5 1 6 7 8 10\n25517 7 3 4 5 6 7 9 10\... | |
Counting Passes | N people labeled 1,2,\dots,N took an exam, and person i scored A_i points.
Only those who scored at least L points pass this exam.
Determine how many people out of the N have passed the exam.
Input
The input is given from Standard Input in the following format:
N L
A_1 A_2 \dots A_N
Output
Print the answer as an... | atcoder | abc330_a | abc330 | 2023-11-25T00:00:00 | easy | [{"input": "5 60\n60 20 100 90 40\n", "output": "3\n", "testtype": "stdin"}, {"input": "4 80\n79 78 77 76\n", "output": "0\n", "testtype": "stdin"}, {"input": "10 50\n31 41 59 26 53 58 97 93 23 84\n", "output": "6\n", "testtype": "stdin"}] | eJyVmEuOZUkRRBmwAlYQynELxcfjx4B1IFHM6EFPkpa6eoAQEouA/XKO38egO4VUWVLWe3k/Ee5u5uYW+a/f/uePv/tN/vvT5suf//H2w/uPP399+0N5a6V9ea9f3t++K29/+/nr6+rrwtfvf/r69e8/fu+ln77+9Yf3t39+V375cq08+/z/yyXaNy5Ra1n1fHk/UctZUc5ZZbZbWvQSp7Qzy91R1unl+gQfnQd26fuWvnZZq5YxdpmzlXluuafwW59lskLvXFwlVivnjhK8N1xilMZHj1n2IIDWyuhRInZpN3iklnt9cz9x8CiXorJu... | {} | [{"input": "5 60\n60 20 100 90 40\n", "output": "3\n", "testtype": "stdin"}, {"input": "4 80\n79 78 77 76\n", "output": "0\n", "testtype": "stdin"}, {"input": "10 50\n31 41 59 26 53 58 97 93 23 84\n", "output": "6\n", "testtype": "stdin"}] | |
Cutoff | There is an exam structured as follows.
- The exam consists of N rounds called round 1 to N.
- In each round, you are given an integer score between 0 and 100, inclusive.
- Your final grade is the sum of the N-2 of the scores earned in the rounds excluding the highest and lowest.
- Formally, let S=(S_1,S_2,\dots,S_N) ... | atcoder | abc321_b | abc321 | 2023-09-23T00:00:00 | easy | [{"input": "5 180\n40 60 80 50\n", "output": "70\n", "testtype": "stdin"}, {"input": "3 100\n100 100\n", "output": "0\n", "testtype": "stdin"}, {"input": "5 200\n0 0 99 99\n", "output": "-1\n", "testtype": "stdin"}, {"input": "10 480\n59 98 88 54 70 24 8 94 46\n", "output": "45\n", "testtype": "stdin"}] | eJztVE1LBDEM9SD4Nx49r9Kkadr6SwTXm3tYD+PKdg8igj9C/6/psIgfK5bZg5cpr6GE5uUlzczL6dvD2cm4ru7scP3k1sNmV90lXIBfDr4Zt4C739W9f++oq22tj5tVc23r7Xpwzwt8CaeD4efUGz+mJz9dQPyNIfbX0ILNHKVjjD1I8eH6iySCxK4mRRCIonxn0k4iNh3seTmIhxprRrKDgAjqkc0ySJEEMUAJFOFRCiggWPIfeXufkxkll9ZLpJZJFVEaOCOYDg9OrUMIAWKwyWkiUkS0agMSI9LU5I1XPGWrmjCjAxNnvTU6C9s7... | {} | [{"input": "5 180\n40 60 80 50\n", "output": "70\n", "testtype": "stdin"}, {"input": "3 100\n100 100\n", "output": "0\n", "testtype": "stdin"}, {"input": "5 200\n0 0 99 99\n", "output": "-1\n", "testtype": "stdin"}, {"input": "10 480\n59 98 88 54 70 24 8 94 46\n", "output": "45\n", "testtype": "stdin"}] | |
delete . | You are given a string S consisting of lowercase English letters and ..
Find the string obtained by removing all . from S.
Input
The input is given from Standard Input in the following format:
S
Output
Print the string obtained by removing all . from S.
Constraints
- S is a string of length between 1 and 100, i... | atcoder | abc372_a | abc372 | 2024-09-21T00:00:00 | easy | [{"input": ".v.\n", "output": "v\n", "testtype": "stdin"}, {"input": "chokudai\n", "output": "chokudai\n", "testtype": "stdin"}, {"input": "...\n", "output": "\n", "testtype": "stdin"}] | eJy9VEuO3DYQzcKLHGPQa6MO4E12OYMBJwuRFEWK//8nMOBDJPdNqT1GxppB1IABq8EGWcV671WRrC/v/vn911/u38ffcPLpr5u0vuTbh6fb6v6wt/dPN1fyyZLXlPPw62FLmUl7+/z+6UVkKa233RFqROgi80aq3X2ZfJPFLSCYghyYmExEvebucJeUzcJcxmRyLpIYajPNtsAaYbdLcoNv3JHd1rOm/+dCqreYXhOt8S2aq0SXTB07JPqzrGfPN8cVEKglMwEgM+FQgXnOAGJwING2cgBRQY0QdmgJE4FdAQkkBEBPBOBLGgFc46wz... | {} | [{"input": ".v.\n", "output": "v\n", "testtype": "stdin"}, {"input": "chokudai\n", "output": "chokudai\n", "testtype": "stdin"}, {"input": "...\n", "output": "\n", "testtype": "stdin"}] | |
123233 | You are given a 6-digit positive integer N.
Determine whether N satisfies all of the following conditions.
- Among the digits of N, the digit 1 appears exactly once.
- Among the digits of N, the digit 2 appears exactly twice.
- Among the digits of N, the digit 3 appears exactly three times.
Input
The input is given... | atcoder | abc380_a | abc380 | 2024-11-16T00:00:00 | easy | [{"input": "123233", "output": "Yes", "testtype": "stdin"}, {"input": "123234", "output": "No", "testtype": "stdin"}, {"input": "323132", "output": "Yes", "testtype": "stdin"}, {"input": "500000", "output": "No", "testtype": "stdin"}] | eJydVbtOA0EMpKDhL6KrI7Qenx/LR1CDgAquCEUS6S5FhJD4CPhfNicKFFEc42plaTTe0Yz9cfn1enUx191zezy8dZvt/jB1N6sOc3XrVbc7TD+9293j9tSZhnGajvvh1Bunl822e1+vfmFF02AcVqGiZ7z3w7gMjOzTnCOG9gVBfjiqiXDYULiRQsMhheSVciqSF6GpHLbORc5cNZ2cWebisI6CZHlTtJBaiRQX0hsqgCoZpJrhwQbJUJUUK0ox1hwZxVhDC5QXq+kcTg6N3sPYBKebsUmCa00W27Ysy9sirOR/Lasnq5VHBplCoK9K... | {} | [{"input": "123233", "output": "Yes", "testtype": "stdin"}, {"input": "123234", "output": "No", "testtype": "stdin"}, {"input": "323132", "output": "Yes", "testtype": "stdin"}, {"input": "500000", "output": "No", "testtype": "stdin"}] | |
tcdr | You are given a string S consisting of lowercase English letters.
Remove all occurrences of a, e, i, o, u from S and print the resulting string.
S contains at least one character other than a, e, i, o, u.
Input
The input is given from Standard Input in the following format:
S
Output
Print the answer.
Constraints
... | atcoder | abc315_a | abc315 | 2023-08-19T00:00:00 | easy | [{"input": "atcoder\n", "output": "tcdr\n", "testtype": "stdin"}, {"input": "xyz\n", "output": "xyz\n", "testtype": "stdin"}, {"input": "aaaabbbbcccc\n", "output": "bbbbcccc\n", "testtype": "stdin"}] | eJy9lFmO1DAURflArKNV34gFsBGQGCTP8xjPCIlFwH55SVdTRXVLxRdWpDjPvve8G0f58frX1zevjvHxA0w+fTspH2s5vX84pc/+9PbhFGr5u1DYVsqMbC9thSp/+v724Uo3hpJB5uhsaMjN2ovzcWtL5kR90spZUgoqt+5jyEPU3LxRHILyb3A82uAsNsJRR9YbmZWMTfSAehZYD6RSLF2I0rNH0nulVr/t5PDYLfphcOgf1RctSJ+E91pCKlSlAlMooMoQYxUhpiqDaq0KbkghBDv2haAwzEDAEJRr2EsIrhAQrMM+BiPATpDtwgAL... | {} | [{"input": "atcoder\n", "output": "tcdr\n", "testtype": "stdin"}, {"input": "xyz\n", "output": "xyz\n", "testtype": "stdin"}, {"input": "aaaabbbbcccc\n", "output": "bbbbcccc\n", "testtype": "stdin"}] | |
Overall Winner | Takahashi and Aoki played N games.
You are given a string S of length N, representing the results of these games.
Takahashi won the i-th game if the i-th character of S is T, and Aoki won that game if it is A.
The overall winner between Takahashi and Aoki is the one who won more games than the other.
If they had the... | atcoder | abc301_a | abc301 | 2023-05-13T00:00:00 | easy | [{"input": "5\nTTAAT\n", "output": "T\n", "testtype": "stdin"}, {"input": "6\nATTATA\n", "output": "T\n", "testtype": "stdin"}, {"input": "1\nA\n", "output": "A\n", "testtype": "stdin"}] | eJy1VE1PwzAM5YDE36hyZULdkPi6+T/4gES5scMuYdKyA0JI/Aj4v7SJ/exUQoJU86rMddzkxe85n+ffm4uzbI+Xo/P0HnZxf0zhoQv3/RCJR6P8y4+6+oqBMT+ZpLtA+ZOpyYYYVl14PSbZjUogbQ8pve23U+iQXnYxfKw6D2o9gjqdtaLaTKj0jAzPx8hF57Pmcj3IYktgsVDEjA3E9yOx5gjhwqkKAAlFDYXhOSz+HyzRSCUWhqrYJIZ5YkshEyVV3y6D5ZaHprUUFVxyA1lVhDWpGRuXzYq/HqIyxbKLacYXyAKVxoDZqFXOF4kr... | {} | [{"input": "5\nTTAAT\n", "output": "T\n", "testtype": "stdin"}, {"input": "6\nATTATA\n", "output": "T\n", "testtype": "stdin"}, {"input": "1\nA\n", "output": "A\n", "testtype": "stdin"}] | |
Zero Sum Game | There are N people labeled 1 to N, who have played several one-on-one games without draws. Initially, each person started with 0 points. In each game, the winner's score increased by 1 and the loser's score decreased by 1 (scores can become negative). Determine the final score of person N if the final score of person i... | atcoder | abc349_a | abc349 | 2024-04-13T00:00:00 | easy | [{"input": "4\n1 -2 -1\n", "output": "2\n", "testtype": "stdin"}, {"input": "3\n0 0\n", "output": "0\n", "testtype": "stdin"}, {"input": "6\n10 20 30 40 50\n", "output": "-150\n", "testtype": "stdin"}] | eJztVUtuFEEMZcGGW1i9TqEu18dVnASJYUcW2TSRMllECIlDwAXYcUves3skNCORWSKRqKfT5Sr/nu1X317/+PXmlf+9/4mPD1+Wu+3+8bi8k2W2w1anTElNbJWUDV9FcpOOlRVJlXtDUscpo3RU0SwJW61JydJnqKh0SarQMLEKBUlDhsmsYsNtwOKYAt2ZZargnXqVpmL8atBcfa/TEJYqNWIoWPQiWqUjPmzDLcymTJ0heY0woYpA4J5ymE0NwlKkDHeUMkxNbE2aTtlzgs3UMh2pjBHueAa5NQgRJrSwAXM1LDKfzpBzP2zLjSyf... | {} | [{"input": "4\n1 -2 -1\n", "output": "2\n", "testtype": "stdin"}, {"input": "3\n0 0\n", "output": "0\n", "testtype": "stdin"}, {"input": "6\n10 20 30 40 50\n", "output": "-150\n", "testtype": "stdin"}] | |
aaaadaa | You are given a string S of length N consisting of lowercase English letters, along with lowercase English letters c_1 and c_2.
Find the string obtained by replacing every character of S that is not c_1 with c_2.
Input
The input is given in the following format from Standard Input:
N c_1 c_2
S
Output
Print the answ... | atcoder | abc384_a | abc384 | 2024-12-14T00:00:00 | easy | [{"input": "3 b g\nabc", "output": "gbg", "testtype": "stdin"}, {"input": "1 s h\ns", "output": "s", "testtype": "stdin"}, {"input": "7 d a\natcoder", "output": "aaaadaa", "testtype": "stdin"}, {"input": "10 b a\nacaabcabba", "output": "aaaabaabba", "testtype": "stdin"}] | eJytV1mO5TQU5YMFsASrvlvQ9FC0WAkSjw/b8TzPdhASi4D94lT1Ryf1aNyoj0opy3m5sX3PPffkz2//fvzumyf88sMc/Pr7g7C+5IefwcNPAAF7s0EIEaJ8eAUeXMkf79ln3OwxnUnKeXhy3Eh5E/bhj1fgk0CPwIB6s/UJ5zjPc2th3n4ACoyblThHlnNxRGw9x1xSG02xMTCvkiqN8egynd8z7kFdB2vr+AkIwG/WIBj3rs7v4c9YDYQAvNmteIqxPQeCz1g8GRCAmStS4hzEGLMW4B3AoN2sc5acI7SJtRA/gnqEGJfnVzdAgZqZ... | {} | [{"input": "3 b g\nabc", "output": "gbg", "testtype": "stdin"}, {"input": "1 s h\ns", "output": "s", "testtype": "stdin"}, {"input": "7 d a\natcoder", "output": "aaaadaa", "testtype": "stdin"}, {"input": "10 b a\nacaabcabba", "output": "aaaabaabba", "testtype": "stdin"}] | |
Uppercase and Lowercase | You are given a string S consisting of lowercase and uppercase English letters. The length of S is odd.
If the number of uppercase letters in S is greater than the number of lowercase letters, convert all lowercase letters in S to uppercase.
Otherwise, convert all uppercase letters in S to lowercase.
Input
The inpu... | atcoder | abc357_b | abc357 | 2024-06-08T00:00:00 | easy | [{"input": "AtCoder\n", "output": "atcoder\n", "testtype": "stdin"}, {"input": "SunTORY\n", "output": "SUNTORY\n", "testtype": "stdin"}, {"input": "a\n", "output": "a\n", "testtype": "stdin"}] | eJyNlMvOozYYhruoeh2/sh71ArpLCBBO4ZhwaLsAjB1jAzbGnEaVehHt/ZYk02qUUTVhhYTf53k/Sx9//vg3+emHx5OA7eXXzzvcMjnsfvnYaaUc00XomWGt9iJ6FWtuVOtomNelnjVo/dbuPn3sOjl8CcAtsCwCrZisdAtUGHZDjb4EICTPwFCJYVhYdY+IAeB298enj6+8Mb6taEjNqukUTbdKfa9WYXs9RtGVKg6riqUDthONtjnWt0k/n207IRoIh6EPpLsHjcaH22u32DhlepSaquPeocoGVcPzA2orjqceUve4Qa+2eTVP8RNq... | {} | [{"input": "AtCoder\n", "output": "atcoder\n", "testtype": "stdin"}, {"input": "SunTORY\n", "output": "SUNTORY\n", "testtype": "stdin"}, {"input": "a\n", "output": "a\n", "testtype": "stdin"}] | |
Rearranging ABC | You are given a string S of length 3 consisting of uppercase English letters.
Determine whether it is possible to rearrange the characters in S to make it match the string ABC.
Input
The input is given from Standard Input in the following format:
S
Output
Print Yes if it is possible to rearrange the characters in S... | atcoder | abc377_a | abc377 | 2024-10-26T00:00:00 | easy | [{"input": "BAC\n", "output": "Yes\n", "testtype": "stdin"}, {"input": "AAC\n", "output": "No\n", "testtype": "stdin"}, {"input": "ABC\n", "output": "Yes\n", "testtype": "stdin"}, {"input": "ARC\n", "output": "No\n", "testtype": "stdin"}] | eJxrYJnqyswABhF2QEZ0tVJmXkFpiZKVgpKjs1NMnpKOglJ+aQlUKDK1GCJUklpcUlJZkAoSLC5JycxTqtVRQNLr7Ei+XidnR7L1emHq9csnTqu3H9lanZwwfEu0VkeybY10J1urI/nB5OjoQq5WZyfyI9Y3imwXR/mHku1ZN3cStMZO0QMAR1MDQg== | {} | [{"input": "BAC\n", "output": "Yes\n", "testtype": "stdin"}, {"input": "AAC\n", "output": "No\n", "testtype": "stdin"}, {"input": "ABC\n", "output": "Yes\n", "testtype": "stdin"}, {"input": "ARC\n", "output": "No\n", "testtype": "stdin"}] |
End of preview. Expand in Data Studio
About Dataset
Why?
Used for RosettaBench (A contamination-free benchmark for measuring learning, not memorization).
Preparation
Source: LiveCodeBench (release_v5, AtCoder platform only), accessed via sam-paech/livecodebench-code_generation_lite on Hugging Face.
AtCoder problems were selected for platform consistency and STDIN/STDOUT format compatibility. Problems with fewer than 3 test cases were excluded, leaving a pool of 342 problems.
Sampling: 150 problems sampled with random_state=42 using stratified sampling across difficulty tiers.
| Difficulty | Count | Pool available |
|---|---|---|
| Easy | 40 | 117 |
| Medium | 50 | 113 |
| Hard | 60 | 112 |
Avg test cases per problem: 3.2 (min: 3, max: 6).
Columns
| Column | Type | Description |
|---|---|---|
question_id |
string | Unique problem ID (e.g. abc333_b) |
question_title |
string | Problem title |
question_content |
string | Full problem statement |
difficulty |
string | easy / medium / hard |
platform |
string | Always atcoder |
all_tests |
list | Combined public + private test cases |
lang_seed |
int | Seed for deterministic language generation |
- Downloads last month
- 48