question_title stringlengths 1 66 | question_content stringlengths 455 3.82k | platform stringclasses 2
values | question_id stringlengths 4 8 | contest_id stringlengths 6 20 | contest_date stringdate 2025-01-04 00:00:00 2025-04-06 00:00:00 | starter_code stringlengths 0 124 | difficulty stringclasses 3
values | public_test_cases stringlengths 95 831 | private_test_cases stringlengths 196 15.7M | metadata stringlengths 2 46 | prompt stringlengths 1.03k 4.45k | prompt_ids listlengths 252 1.72k | completions listlengths 128 128 | completions_ids listlengths 128 128 | predictions listlengths 128 128 | scores listlengths 128 128 | hidden_states_files listlengths 128 128 | thoughts_ids_len listlengths 128 128 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
9x9 Sum | "Among the 81 integers that appear in the 9-by-9 multiplication table, find the sum of those that ar(...TRUNCATED) | atcoder | abc387_b | abc387 | 2025-01-04T00:00:00 | easy | "[{\"input\": \"1\", \"output\": \"2024\", \"testtype\": \"stdin\"}, {\"input\": \"11\", \"output\":(...TRUNCATED) | "eJy9lUEKwjAQRRVc6C1K1kUyaZM0nkRQd3bRTS2YLkQED6H31QqCdjbjh9hVG3j8n5k/0+vsPl9MXs96+nzZnFXTdn1Uq0wZp/J(...TRUNCATED) | {} | "<｜begin▁of▁sentence｜><｜User｜>You are an expert Python programmer. You will be given a q(...TRUNCATED) | [151646,151644,2610,525,458,6203,13027,47788,13,1446,686,387,2661,264,3405,320,34586,25128,8,323,686(...TRUNCATED) | ["Okay, I need to solve this problem where I have to find the sum of all the integers in a 9x9 multi(...TRUNCATED) | [[32313,11,358,1184,311,11625,419,3491,1380,358,614,311,1477,279,2629,315,678,279,25780,304,264,220,(...TRUNCATED) | ["X = int(input())\ncount = 0\nfor i in range(1, 10):\n if X % i == 0:\n j = X // i\n (...TRUNCATED) | [0.0,1.0,0.0,0.0,1.0,1.0,1.0,0.0,0.0,1.0,0.0,0.0,0.0,1.0,0.0,1.0,0.0,0.0,0.0,0.0,1.0,0.0,0.0,1.0,0.0(...TRUNCATED) | ["0aa802f7ee2a614282fec9c6becb555f9c81374dffa8f0cbc362d6b9a9241b32.safetensors","307c950ce1e86d09732(...TRUNCATED) | [1279,1350,1487,1521,1505,1621,1616,1635,1669,1782,1744,1822,1822,1855,1955,1999,2003,2323,1799,1815(...TRUNCATED) | |
Count Arrays | "You are given positive integers N, M, and a sequence A = (A_1, A_2, \\dots, A_N) of length N, each (...TRUNCATED) | atcoder | abc387_f | abc387 | 2025-01-04T00:00:00 | hard | "[{\"input\": \"3 3\\n2 1 1\", \"output\": \"6\", \"testtype\": \"stdin\"}, {\"input\": \"4 9\\n1 1 (...TRUNCATED) | "eJyl/UvOLcmSpQeyUQPZiHaCMFNVM1XlSAqoqF6xkZ1LAgw2CIJADaI4Qw6k9PuW2LmRHiTgSGbierif8/97m+lDHkuWLPn//j/(...TRUNCATED) | {} | "<｜begin▁of▁sentence｜><｜User｜>You are an expert Python programmer. You will be given a q(...TRUNCATED) | [151646,151644,2610,525,458,6203,13027,47788,13,1446,686,387,2661,264,3405,320,34586,25128,8,323,686(...TRUNCATED) | ["Okay, so I have this programming problem to solve. Let me try to understand what it's asking for. (...TRUNCATED) | [[32313,11,773,358,614,419,15473,3491,311,11625,13,6771,752,1430,311,3535,1128,432,594,10161,369,13,(...TRUNCATED) | ["MOD = 998244353\n\ndef main():\n import sys\n from collections import defaultdict\n\n N, (...TRUNCATED) | [0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0(...TRUNCATED) | ["022351de96d4557bf151255dacf8527828f82b3868e463ffb168588725a55af1.safetensors","656735a284e67f04092(...TRUNCATED) | [11349,11645,12695,12763,12706,13033,13607,13808,14163,14889,16384,16384,15695,16384,16384,16384,163(...TRUNCATED) | |
Happy New Year 2025 | "You are given two positive integers A and B.\nOutput the square of A + B.\n\nInput\n\nThe input is (...TRUNCATED) | atcoder | abc387_a | abc387 | 2025-01-04T00:00:00 | easy | "[{\"input\": \"20 25\", \"output\": \"2025\", \"testtype\": \"stdin\"}, {\"input\": \"30 25\", \"ou(...TRUNCATED) | "eJydVktqHFEMzCKb3EL02gT9nvReThJwsosX3kwMbi9MCOQQyR298xWiNglkZBMKzzTD8EDVUqmqun+8/fX47s3T5+ND/bn8tl2(...TRUNCATED) | {} | "<｜begin▁of▁sentence｜><｜User｜>You are an expert Python programmer. You will be given a q(...TRUNCATED) | [151646,151644,2610,525,458,6203,13027,47788,13,1446,686,387,2661,264,3405,320,34586,25128,8,323,686(...TRUNCATED) | ["Okay, I need to solve this problem where I'm given two integers A and B, and I have to output the (...TRUNCATED) | [[32313,11,358,1184,311,11625,419,3491,1380,358,2776,2661,1378,25780,362,323,425,11,323,358,614,311,(...TRUNCATED) | ["# Read the input values\nA, B = map(int, input().split())\n\n# Calculate the square of the sum of (...TRUNCATED) | [0.0,1.0,0.0,0.0,1.0,1.0,1.0,0.0,1.0,0.0,0.0,0.0,0.0,1.0,0.0,1.0,1.0,0.0,0.0,0.0,1.0,1.0,1.0,1.0,0.0(...TRUNCATED) | ["98168b3a42763248b8aea079562b61d1710f767a7bffe1b7d805e52fa4a013b0.safetensors","f3331b11bf2fc56f09c(...TRUNCATED) | [494,499,530,576,555,615,627,690,721,785,757,783,991,641,348,651,958,868,590,810,657,476,531,786,929(...TRUNCATED) | |
Snake Numbers | "A positive integer not less than 10 whose top digit (the most significant digit) in decimal represe(...TRUNCATED) | atcoder | abc387_c | abc387 | 2025-01-04T00:00:00 | medium | "[{\"input\": \"97 210\", \"output\": \"6\", \"testtype\": \"stdin\"}, {\"input\": \"1000 9999\", \"(...TRUNCATED) | "eJyNVr2qVGkQ3MBsX+JjYln6/8cnEXSzNTC5KzgGIoKhmYm+r3UuLOxtEXqGgZk5p/t0V1VXf1+e/fj25x+Pr5df8eXVp9vbh3c(...TRUNCATED) | {} | "<｜begin▁of▁sentence｜><｜User｜>You are an expert Python programmer. You will be given a q(...TRUNCATED) | [151646,151644,2610,525,458,6203,13027,47788,13,1446,686,387,2661,264,3405,320,34586,25128,8,323,686(...TRUNCATED) | ["Okay, I need to solve this problem where I have to find the number of Snake numbers between L and (...TRUNCATED) | [[32313,11,358,1184,311,11625,419,3491,1380,358,614,311,1477,279,1372,315,39656,5109,1948,444,323,43(...TRUNCATED) | ["def main():\n import sys\n from functools import lru_cache\n\n L, R = map(int, sys.stdin.(...TRUNCATED) | [0.0,1.0,1.0,1.0,0.0,0.0,0.0,1.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,1.0,1.0,0.0,1.0,0.0,0.0,0.0,1.0,0.0(...TRUNCATED) | ["c53416ff2cd01e9b6ebabc7fa181debf111956f234d7bf6619052eb4d6684943.safetensors","e4ba03c60871faf27f5(...TRUNCATED) | [9289,9987,10041,10546,10996,11666,12023,12306,13235,13265,13372,14161,14684,15119,16384,16384,9985,(...TRUNCATED) | |
Coming of Age Celebration | "On a certain planet, there are N aliens, all of whom are minors.\nThe i-th alien currently has A_i (...TRUNCATED) | atcoder | abc388_d | abc388 | 2025-01-11T00:00:00 | medium | "[{\"input\": \"4\\n5 0 9 3\", \"output\": \"2 0 10 5\", \"testtype\": \"stdin\"}, {\"input\": \"5\\(...TRUNCATED) | "eJyMvc2ubU2znEWDC1mcthuj/qu4EiTcxA13DpZ83EDIEtw2LeJ5cr4G0QLJ5+Pde+25xqxRlZUZGRH5f/z3/9P/+T/8X//d//y(...TRUNCATED) | {} | "<｜begin▁of▁sentence｜><｜User｜>You are an expert Python programmer. You will be given a q(...TRUNCATED) | [151646,151644,2610,525,458,6203,13027,47788,13,1446,686,387,2661,264,3405,320,34586,25128,8,323,686(...TRUNCATED) | ["Okay, I need to solve this problem. Let me read the problem statement carefully.\n\nSo, there are (...TRUNCATED) | [[32313,11,358,1184,311,11625,419,3491,13,6771,752,1349,279,3491,5114,15516,382,4416,11,1052,525,451(...TRUNCATED) | ["def main():\n import sys\n input = sys.stdin.read().split()\n N = int(input[0])\n A = (...TRUNCATED) | [0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,1.0,0.0,0.0,0.0,0.0,0.0,0.0,1.0,0.0,0.0,0.0,0.0,0.0(...TRUNCATED) | ["61328b557c9f1127304e0a7a3b3f47654ab80b95e7351952ac1b3a5e21182f67.safetensors","dcc1f478720f5efa502(...TRUNCATED) | [13531,15022,16384,16384,16384,16384,12433,13655,16384,14369,14851,14886,14910,16384,15567,16384,163(...TRUNCATED) | |
Heavy Snake | "There are N snakes.\nInitially, the thickness of the i-th snake is T_i, and its length is L_i.\nThe(...TRUNCATED) | atcoder | abc388_b | abc388 | 2025-01-11T00:00:00 | easy | "[{\"input\": \"4 3\\n3 3\\n5 1\\n2 4\\n1 10\", \"output\": \"12\\n15\\n20\", \"testtype\": \"stdin\(...TRUNCATED) | "eJztnM3Oo0lShXvBhVi1HqH8j0xuAxZIFDtmMZtipOlZIITERcDFsiPOedJfdbsZcEkIWpoqyZ/LdjrffCMz48Q5Eel//Yt//+F(...TRUNCATED) | {} | "<｜begin▁of▁sentence｜><｜User｜>You are an expert Python programmer. You will be given a q(...TRUNCATED) | [151646,151644,2610,525,458,6203,13027,47788,13,1446,686,387,2661,264,3405,320,34586,25128,8,323,686(...TRUNCATED) | ["Okay, I need to solve this problem where I have N snakes, each with a thickness T_i and length L_i(...TRUNCATED) | [[32313,11,358,1184,311,11625,419,3491,1380,358,614,451,56096,11,1817,448,264,25755,350,5318,323,308(...TRUNCATED) | ["n, d = map(int, input().split())\nsnakes = []\nfor _ in range(n):\n t, l = map(int, input().spl(...TRUNCATED) | [0.0,1.0,0.0,0.0,1.0,1.0,1.0,0.0,1.0,0.0,0.0,0.0,0.0,1.0,1.0,1.0,0.0,0.0,1.0,0.0,0.0,0.0,0.0,0.0,0.0(...TRUNCATED) | ["0d74875787cc1d8e4ef571707dd9c0d0a8a63fa474c7de32647fec75d42f14ec.safetensors","fbec34792cf4016bdd4(...TRUNCATED) | [873,932,924,1009,1038,1073,1193,1202,1196,1239,1236,1301,843,850,816,1296,1070,1004,907,1592,1000,1(...TRUNCATED) | |
Simultaneous Kagamimochi 2 | "There are N mochi (rice cakes), arranged in ascending order of size.\r\nThe size of the i-th mochi (...TRUNCATED) | atcoder | abc388_g | abc388 | 2025-01-11T00:00:00 | hard | "[{\"input\": \"11\\n1 1 2 3 4 4 7 10 11 12 20\\n5\\n2 5\\n3 8\\n7 11\\n1 2\\n1 11\", \"output\": \"(...TRUNCATED) | "eJycnUmObUlyngVBC3HUmAPvG61EgHLIGtQkRYDJAUEQ0Fh71R70f7/5uTciXrysVyomIy3PPY035tY3//u//Y//83//63/5n//(...TRUNCATED) | {} | "<｜begin▁of▁sentence｜><｜User｜>You are an expert Python programmer. You will be given a q(...TRUNCATED) | [151646,151644,2610,525,458,6203,13027,47788,13,1446,686,387,2661,264,3405,320,34586,25128,8,323,686(...TRUNCATED) | ["Okay, so I've got this programming problem to solve. Let's read it carefully.\n\nThe problem is ab(...TRUNCATED) | [[32313,11,773,358,3003,2684,419,15473,3491,311,11625,13,6771,594,1349,432,15516,382,785,3491,374,91(...TRUNCATED) | ["import bisect\n\ndef main():\n import sys\n input = sys.stdin.read().split()\n ptr = 0\n (...TRUNCATED) | [0.0,0.0,0.0,0.0,0.0,1.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0(...TRUNCATED) | ["ef4f4dd84e8b249b49b5ccd945710292f9cf8873ad34b166751f666dc8fbd370.safetensors","31f0523890b7bfe66df(...TRUNCATED) | [10976,12516,11588,13396,16384,15138,15244,15669,16363,12077,13232,13823,11721,14639,15723,13731,145(...TRUNCATED) | |
Various Kagamimochi | "There are N mochi (rice cakes) arranged in ascending order of size.\r\nThe size of the i-th mochi ((...TRUNCATED) | atcoder | abc388_c | abc388 | 2025-01-11T00:00:00 | medium | "[{\"input\": \"6\\n2 3 4 4 7 10\", \"output\": \"8\", \"testtype\": \"stdin\"}, {\"input\": \"3\\n3(...TRUNCATED) | "eJxMvUuuNU22ZUWBTlA7inIW3N5mtASJWyQLWQlSZGQBISS6QI+ZY6wdEr/ujTM/3+7m5vZYtt7r//kf/5f/4//9n/6H//X/+sd(...TRUNCATED) | {} | "<｜begin▁of▁sentence｜><｜User｜>You are an expert Python programmer. You will be given a q(...TRUNCATED) | [151646,151644,2610,525,458,6203,13027,47788,13,1446,686,387,2661,264,3405,320,34586,25128,8,323,686(...TRUNCATED) | ["Okay, I need to solve this problem where I have to count the number of valid kagamimochi pairs. Le(...TRUNCATED) | [[32313,11,358,1184,311,11625,419,3491,1380,358,614,311,1760,279,1372,315,2697,595,351,309,318,4953,(...TRUNCATED) | ["import bisect\n\nn = int(input())\na = list(map(int, input().split()))\ncount = 0\nfor i in range((...TRUNCATED) | [0.0,1.0,0.0,0.0,0.0,1.0,0.0,1.0,0.0,0.0,1.0,0.0,1.0,1.0,1.0,1.0,1.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0(...TRUNCATED) | ["5e735a6a41e33ff3d7a680d67657150c068597a225403196fbb5af23a5084e14.safetensors","3727ff103b1488074d2(...TRUNCATED) | [2850,2892,3694,2892,4013,4129,4050,3000,3491,3320,4567,5163,6479,2468,3077,3770,3577,3713,4051,4333(...TRUNCATED) | |
?UPC | "You are given a string S. Here, the first character of S is an uppercase English letter, and the se(...TRUNCATED) | atcoder | abc388_a | abc388 | 2025-01-11T00:00:00 | easy | "[{\"input\": \"Kyoto\", \"output\": \"KUPC\", \"testtype\": \"stdin\"}, {\"input\": \"Tohoku\", \"o(...TRUNCATED) | "eJy1VsluHkUY5MCVd7D+c8QDcEvsLHIOsU2cxcCh933fGyHxEPC+TJCQmDmgZqT0aaY11V3z6auq7/dv/3z67pu/16cft4effr0(...TRUNCATED) | {} | "<｜begin▁of▁sentence｜><｜User｜>You are an expert Python programmer. You will be given a q(...TRUNCATED) | [151646,151644,2610,525,458,6203,13027,47788,13,1446,686,387,2661,264,3405,320,34586,25128,8,323,686(...TRUNCATED) | ["Okay, I need to solve this Python problem. Let's read the question carefully.\n\nSo, the task is t(...TRUNCATED) | [[32313,11,358,1184,311,11625,419,13027,3491,13,6771,594,1349,279,3405,15516,382,4416,11,279,3383,37(...TRUNCATED) | ["# Read the input string\nS = input().strip()\n\n# Extract the first character\nfirst_char = S[0]\n(...TRUNCATED) | [0.0,1.0,0.0,0.0,0.0,1.0,0.0,1.0,0.0,0.0,1.0,0.0,0.0,1.0,1.0,1.0,1.0,1.0,0.0,0.0,1.0,0.0,0.0,1.0,0.0(...TRUNCATED) | ["f827e8ad203532b874bd2aa28f6c98d7c74ab6098086860361870814baa04728.safetensors","3c92b9676f9b9fe839b(...TRUNCATED) | [335,393,380,405,438,469,428,448,454,468,496,518,638,761,753,541,443,475,530,450,505,410,396,484,564(...TRUNCATED) | |
Dangerous Sugoroku | "There are N squares arranged in a row, labeled 1, 2, \\ldots, N from left to right.\nYou are given (...TRUNCATED) | atcoder | abc388_f | abc388 | 2025-01-11T00:00:00 | hard | "[{\"input\": \"24 2 3 5\\n7 8\\n17 20\", \"output\": \"Yes\", \"testtype\": \"stdin\"}, {\"input\":(...TRUNCATED) | "eJylncvO7s5ylxlwIdaWmEXI7nNzEYxBLGZkkMk/kbIziBASt4AE90s9T9nvYe0dEX0sLbXb/vz60Ifqql/9qvw//+3/+Zv/9W/(...TRUNCATED) | {} | "<｜begin▁of▁sentence｜><｜User｜>You are an expert Python programmer. You will be given a q(...TRUNCATED) | [151646,151644,2610,525,458,6203,13027,47788,13,1446,686,387,2661,264,3405,320,34586,25128,8,323,686(...TRUNCATED) | ["Okay, I need to solve this problem where I have to determine if it's possible to move from square (...TRUNCATED) | [[32313,11,358,1184,311,11625,419,3491,1380,358,614,311,8253,421,432,594,3204,311,3271,504,9334,220,(...TRUNCATED) | ["import sys\nfrom collections import deque\n\ndef subtract_bad_intervals(a, b, bad_intervals):\n (...TRUNCATED) | [0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0(...TRUNCATED) | ["69df8e1cfacd9894bd6186ef6103e4a381804ebe0590376d31b001ef020da270.safetensors","4b7a6e88a77bc1823a4(...TRUNCATED) | [7197,7885,9435,9605,10368,11598,12818,16384,16384,16384,16384,7469,11358,10478,10914,11536,12272,15(...TRUNCATED) |
End of preview. Expand in Data Studio
README.md exists but content is empty.
- Downloads last month
- 34