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 | metadata stringlengths 2 46 | prompt stringlengths 1.03k 4.45k | completions listlengths 128 128 | prompt_ids listlengths 255 1.73k | completions_ids listlengths 128 128 | thoughts_ids_len listlengths 128 128 | private_test_cases stringlengths 196 15.7M | predictions listlengths 128 128 | scores listlengths 128 128 | hidden_states_files 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) | {} | "<|im_start|>user\nYou are an expert Python programmer. You will be given a question (problem specif(...TRUNCATED) | ["<think>\nOkay, I need to solve this problem. Let's read it carefully. The task is to find the sum (...TRUNCATED) | [151644,872,198,2610,525,458,6203,13027,47788,13,1446,686,387,2661,264,3405,320,34586,25128,8,323,68(...TRUNCATED) | [[151667,198,32313,11,358,1184,311,11625,419,3491,13,6771,594,1349,432,15516,13,576,3383,374,311,147(...TRUNCATED) | [1983,2176,2558,2136,1585,2148,2448,1650,2388,1769,2054,2426,2613,2944,2282,2500,1912,2578,1676,2151(...TRUNCATED) | "eJy9lUEKwjAQRRVc6C1K1kUyaZM0nkRQd3bRTS2YLkQED6H31QqCdjbjh9hVG3j8n5k/0+vsPl9MXs96+nzZnFXTdn1Uq0wZp/J(...TRUNCATED) | ["# Read the input value X\nX = int(input())\n\n# Initialize the count of X in the multiplication ta(...TRUNCATED) | [0.0,0.0,1.0,0.0,1.0,0.0,0.0,0.0,0.0,1.0,1.0,0.0,0.0,1.0,0.0,1.0,1.0,1.0,1.0,1.0,1.0,0.0,1.0,1.0,0.0(...TRUNCATED) | ["f5b39fcfd3af99aa4cd8c334446086428b572e1ce2ea183e270a5e9b3b55b62c.safetensors","345cb0494abd3e2ef75(...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) | {} | "<|im_start|>user\nYou are an expert Python programmer. You will be given a question (problem specif(...TRUNCATED) | ["<think>\nOkay, let's try to figure out how to solve this problem. The problem is about counting th(...TRUNCATED) | [151644,872,198,2610,525,458,6203,13027,47788,13,1446,686,387,2661,264,3405,320,34586,25128,8,323,68(...TRUNCATED) | [[151667,198,32313,11,1077,594,1430,311,7071,700,1246,311,11625,419,3491,13,576,3491,374,911,25009,2(...TRUNCATED) | [16384,16384,16384,16384,16384,16384,16384,16384,16384,16384,16384,16384,16384,16384,16384,16384,163(...TRUNCATED) | "eJyl/UvOLcmSpQeyUQPZiHaCMFNVM1XlSAqoqF6xkZ1LAgw2CIJADaI4Qw6k9PuW2LmRHiTgSGbierif8/97m+lDHkuWLPn//j/(...TRUNCATED) | ["","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","impor(...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) | ["a5d05b0365b835a248c22bc32649f9c9227212ae12c81524293a1443f3818ded.safetensors","869099f5167caaeae93(...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) | {} | "<|im_start|>user\nYou are an expert Python programmer. You will be given a question (problem specif(...TRUNCATED) | ["<think>\nOkay, I need to solve this problem where I have to take two integers A and B, add them to(...TRUNCATED) | [151644,872,198,2610,525,458,6203,13027,47788,13,1446,686,387,2661,264,3405,320,34586,25128,8,323,68(...TRUNCATED) | [[151667,198,32313,11,358,1184,311,11625,419,3491,1380,358,614,311,1896,1378,25780,362,323,425,11,91(...TRUNCATED) | [483,502,560,585,434,605,637,592,586,741,480,642,771,629,598,718,586,590,581,616,663,636,738,544,781(...TRUNCATED) | "eJydVktqHFEMzCKb3EL02gT9nvReThJwsosX3kwMbi9MCOQQyR298xWiNglkZBMKzzTD8EDVUqmqun+8/fX47s3T5+ND/bn8tl2(...TRUNCATED) | ["# Read the input values\nA, B = map(int, input().split())\n\n# Calculate the square of the sum\nre(...TRUNCATED) | [0.0,0.0,1.0,0.0,1.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,1.0,1.0,1.0,0.0(...TRUNCATED) | ["14b59aa3d7409c4d53d12ddc840dfe0c93786e683e4605f1a27f8240d9983a4f.safetensors","010c725749eccd3e3bc(...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) | {} | "<|im_start|>user\nYou are an expert Python programmer. You will be given a question (problem specif(...TRUNCATED) | ["<think>\nOkay, I need to solve this problem where I have to count the number of Snake numbers betw(...TRUNCATED) | [151644,872,198,2610,525,458,6203,13027,47788,13,1446,686,387,2661,264,3405,320,34586,25128,8,323,68(...TRUNCATED) | [[151667,198,32313,11,358,1184,311,11625,419,3491,1380,358,614,311,1760,279,1372,315,39656,5109,1948(...TRUNCATED) | [16384,16384,14850,16384,16384,16384,16384,15199,16384,16384,16384,16384,16384,12256,16384,16384,163(...TRUNCATED) | "eJyNVr2qVGkQ3MBsX+JjYln6/8cnEXSzNTC5KzgGIoKhmYm+r3UuLOxtEXqGgZk5p/t0V1VXf1+e/fj25x+Pr5df8eXVp9vbh3c(...TRUNCATED) | ["","","import sys\n\ndef count_snake_numbers(X):\n if X < 10:\n return 0\n X_str = str(...TRUNCATED) | [0.0,0.0,1.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,1.0,0.0,1.0,0.0,0.0,1.0(...TRUNCATED) | ["3cc3f28152abeebef16911dbc6cebd6f7a5acf3c2e75607feae646e4a7f10f9f.safetensors","4ced26be88ae688a392(...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) | {} | "<|im_start|>user\nYou are an expert Python programmer. You will be given a question (problem specif(...TRUNCATED) | ["<think>\nOkay, let's try to figure out how to solve this problem. So, the problem is about aliens (...TRUNCATED) | [151644,872,198,2610,525,458,6203,13027,47788,13,1446,686,387,2661,264,3405,320,34586,25128,8,323,68(...TRUNCATED) | [[151667,198,32313,11,1077,594,1430,311,7071,700,1246,311,11625,419,3491,13,2055,11,279,3491,374,911(...TRUNCATED) | [16384,16384,16384,16384,16384,16384,16384,16384,16384,16384,16384,16384,16384,16384,16384,16384,163(...TRUNCATED) | "eJyMvc2ubU2znEWDC1mcthuj/qu4EiTcxA13DpZ83EDIEtw2LeJ5cr4G0QLJ5+Pde+25xqxRlZUZGRH5f/z3/9P/+T/8X//d//y(...TRUNCATED) | ["","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","",(...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) | ["1548b0b1a4b478109bc5c5a40ce5186fa8bdc1c4749cfc1be4a91bc987bc2cea.safetensors","2f5ed04ab027c791a88(...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) | {} | "<|im_start|>user\nYou are an expert Python programmer. You will be given a question (problem specif(...TRUNCATED) | ["<think>\nOkay, let's see. The problem is about snakes and their weights. So, each snake has a thic(...TRUNCATED) | [151644,872,198,2610,525,458,6203,13027,47788,13,1446,686,387,2661,264,3405,320,34586,25128,8,323,68(...TRUNCATED) | [[151667,198,32313,11,1077,594,1490,13,576,3491,374,911,56096,323,862,14324,13,2055,11,1817,25265,70(...TRUNCATED) | [1533,2034,1513,1461,1371,1235,1253,1406,1472,1488,1562,1676,1539,1252,1261,1290,1450,1115,1504,1198(...TRUNCATED) | "eJztnM3Oo0lShXvBhVi1HqH8j0xuAxZIFDtmMZtipOlZIITERcDFsiPOedJfdbsZcEkIWpoqyZ/LdjrffCMz48Q5Eel//Yt//+F(...TRUNCATED) | ["n, d = map(int, input().split())\nsnakes = [tuple(map(int, input().split())) for _ in range(n)]\n\(...TRUNCATED) | [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,0.0,1.0,1.0,0.0,0.0,1.0,1.0,0.0,0.0,0.0(...TRUNCATED) | ["24ffb366c4d8c67001ddfa7d197d2e4f498f191cf83e7c542c6613730271e86d.safetensors","7de31f0194dd928b348(...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) | {} | "<|im_start|>user\nYou are an expert Python programmer. You will be given a question (problem specif(...TRUNCATED) | ["<think>\nOkay, let's see. I need to solve this problem where for each query, I have to find the ma(...TRUNCATED) | [151644,872,198,2610,525,458,6203,13027,47788,13,1446,686,387,2661,264,3405,320,34586,25128,8,323,68(...TRUNCATED) | [[151667,198,32313,11,1077,594,1490,13,358,1184,311,11625,419,3491,1380,369,1817,3239,11,358,614,311(...TRUNCATED) | [16384,16384,16384,16384,16384,16384,16384,16384,16384,16384,16384,16384,16384,16384,16384,16384,163(...TRUNCATED) | "eJycnUmObUlyngVBC3HUmAPvG61EgHLIGtQkRYDJAUEQ0Fh71R70f7/5uTciXrysVyomIy3PPY035tY3//u//Y//83//63/5n//(...TRUNCATED) | ["","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","",(...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) | ["c5eec2db4b06a66a9a517b5335ae73be4e2b790481e9db2ad4e459abdf562b40.safetensors","01c8c41378fe68689c9(...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) | {} | "<|im_start|>user\nYou are an expert Python programmer. You will be given a question (problem specif(...TRUNCATED) | ["<think>\nOkay, let's see. The problem is about counting the number of different kagamimochi that c(...TRUNCATED) | [151644,872,198,2610,525,458,6203,13027,47788,13,1446,686,387,2661,264,3405,320,34586,25128,8,323,68(...TRUNCATED) | [[151667,198,32313,11,1077,594,1490,13,576,3491,374,911,25009,279,1372,315,2155,595,351,309,318,4953(...TRUNCATED) | [5827,7052,4940,5781,5506,7294,5794,7853,5704,4487,5580,6783,6953,4547,6917,6396,6540,6465,6887,4755(...TRUNCATED) | "eJxMvUuuNU22ZUWBTlA7inIW3N5mtASJWyQLWQlSZGQBISS6QI+ZY6wdEr/ujTM/3+7m5vZYtt7r//kf/5f/4//9n/6H//X/+sd(...TRUNCATED) | ["import bisect\n\ndef main():\n import sys\n input = sys.stdin.read().split()\n n = int(in(...TRUNCATED) | [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,1.0,0.0,0.0,1.0,0.0,0.0,0.0,0.0,0.0,1.0,0.0(...TRUNCATED) | ["f31ee0b5ceb1649dea17dc48ebe40369524d5feebcda96d2ba095f0b6d593690.safetensors","6c4a9b4f9358fbfa816(...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) | {} | "<|im_start|>user\nYou are an expert Python programmer. You will be given a question (problem specif(...TRUNCATED) | ["<think>\nOkay, let's see. The problem says that we are given a string S. The first character is up(...TRUNCATED) | [151644,872,198,2610,525,458,6203,13027,47788,13,1446,686,387,2661,264,3405,320,34586,25128,8,323,68(...TRUNCATED) | [[151667,198,32313,11,1077,594,1490,13,576,3491,2727,429,582,525,2661,264,914,328,13,576,1156,3668,3(...TRUNCATED) | [293,303,339,316,334,598,861,354,394,290,310,335,329,411,643,421,289,345,307,340,780,312,302,323,615(...TRUNCATED) | "eJy1VsluHkUY5MCVd7D+c8QDcEvsLHIOsU2cxcCh933fGyHxEPC+TJCQmDmgZqT0aaY11V3z6auq7/dv/3z67pu/16cft4effr0(...TRUNCATED) | ["# Read the input string\nS = input().strip()\n\n# Concatenate the first character of S with \"UPC\(...TRUNCATED) | [0.0,0.0,1.0,0.0,0.0,0.0,0.0,0.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,0.0,1.0(...TRUNCATED) | ["4aa0e8243f0420c41e1c4899edc8f62a9296be65e7c33cb150b26d18e186638e.safetensors","aa900a6089418b91d3c(...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) | {} | "<|im_start|>user\nYou are an expert Python programmer. You will be given a question (problem specif(...TRUNCATED) | ["<think>\nOkay, let's see. I need to solve this problem where I have to determine if it's possible (...TRUNCATED) | [151644,872,198,2610,525,458,6203,13027,47788,13,1446,686,387,2661,264,3405,320,34586,25128,8,323,68(...TRUNCATED) | [[151667,198,32313,11,1077,594,1490,13,358,1184,311,11625,419,3491,1380,358,614,311,8253,421,432,594(...TRUNCATED) | [14987,15719,16384,16384,15307,16384,16384,16384,14721,15998,16384,16384,15613,16047,16384,15302,163(...TRUNCATED) | "eJylncvO7s5ylxlwIdaWmEXI7nNzEYxBLGZkkMk/kbIziBASt4AE90s9T9nvYe0dEX0sLbXb/vz60Ifqql/9qvw//+3/+Zv/9W/(...TRUNCATED) | ["import sys\n\ndef main():\n input = sys.stdin.read().split()\n idx = 0\n N = int(input[id(...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) | ["0a3292b010a1290dc875f217366b82f312bd7ccdc75759552d3339e06222f3ad.safetensors","2d7660796975071108f(...TRUNCATED) |
End of preview. Expand in Data Studio
README.md exists but content is empty.
- Downloads last month
- 26