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 255 1.73k | 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) | {} | "<|im_start|>user\nYou are an expert Python programmer. You will be given a question (problem specif(...TRUNCATED) | [151644,872,198,2610,525,458,6203,13027,47788,13,1446,686,387,2661,264,3405,320,34586,25128,8,323,68(...TRUNCATED) | ["<think>\nOkay, let's see. I need to solve this problem where I have to calculate the sum of all nu(...TRUNCATED) | [[151667,198,32313,11,1077,594,1490,13,358,1184,311,11625,419,3491,1380,358,614,311,11047,279,2629,3(...TRUNCATED) | ["# Read input\nX = int(input())\n\n# Calculate the count of X in the 9x9 multiplication table\ncoun(...TRUNCATED) | [1.0,0.0,0.0,0.0,0.0,1.0,0.0,1.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,1.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0(...TRUNCATED) | ["43f6a950dc7f0e6c49d422c47958853f1e77d98616956b1a3f5c773fc35ddcd9.safetensors","30b06f497f1cbbb18f4(...TRUNCATED) | [1957,1984,2110,2191,2225,2192,2322,2308,2504,2583,2600,2133,2726,2155,2414,2440,2245,2534,1920,1857(...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) | {} | "<|im_start|>user\nYou are an expert Python programmer. You will be given a question (problem specif(...TRUNCATED) | [151644,872,198,2610,525,458,6203,13027,47788,13,1446,686,387,2661,264,3405,320,34586,25128,8,323,68(...TRUNCATED) | ["<think>\nOkay, let's see. I need to find the number of sequences x that satisfy x_i ≤ x_{A_i} fo(...TRUNCATED) | [[151667,198,32313,11,1077,594,1490,13,358,1184,311,1477,279,1372,315,23700,856,429,26553,856,5318,3(...TRUNCATED) | ["","","","","","","","","","","import sys\nfrom collections import defaultdict\n\nMOD = 998244353\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) | ["45a382e197455e2dd30e31db67573f3d85830ec0636c86e4e140c81b3a2c53d4.safetensors","79b1f2e2ff1c463c3f7(...TRUNCATED) | [16384,16384,16384,16384,16384,16384,16384,16384,16384,16384,13002,16384,16384,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) | {} | "<|im_start|>user\nYou are an expert Python programmer. You will be given a question (problem specif(...TRUNCATED) | [151644,872,198,2610,525,458,6203,13027,47788,13,1446,686,387,2661,264,3405,320,34586,25128,8,323,68(...TRUNCATED) | ["<think>\nOkay, let's see. The problem is to take two integers A and B, add them together, and then(...TRUNCATED) | [[151667,198,32313,11,1077,594,1490,13,576,3491,374,311,1896,1378,25780,362,323,425,11,912,1105,3786(...TRUNCATED) | ["# Read the input values\nA, B = map(int, input().split())\n\n# Calculate the square of the sum\nre(...TRUNCATED) | [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,1.0,0.0,0.0,0.0,1.0,0.0,0.0,0.0,0.0,0.0(...TRUNCATED) | ["b85f63f74a103ab65a35f78c5551bcd1c62de7c93659a0605930baeb57883f97.safetensors","b28ed71a03264adfc3c(...TRUNCATED) | [418,483,567,595,603,607,612,622,627,647,646,649,652,683,691,708,703,781,530,770,532,681,781,686,594(...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) | {} | "<|im_start|>user\nYou are an expert Python programmer. You will be given a question (problem specif(...TRUNCATED) | [151644,872,198,2610,525,458,6203,13027,47788,13,1446,686,387,2661,264,3405,320,34586,25128,8,323,68(...TRUNCATED) | ["<think>\nOkay, I need to solve this problem where I have to count the number of Snake numbers betw(...TRUNCATED) | [[151667,198,32313,11,358,1184,311,11625,419,3491,1380,358,614,311,1760,279,1372,315,39656,5109,1948(...TRUNCATED) | ["import sys\nfrom functools import lru_cache\n\ndef count_less_or_equal(target, m):\n digits = l(...TRUNCATED) | [0.0,0.0,1.0,0.0,0.0,1.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,1.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0(...TRUNCATED) | ["59d782d4378f72723a14ab590d4494224c183a2a5058e692e0562f00d416886e.safetensors","521d0aff48e47870721(...TRUNCATED) | [12160,13071,13098,13319,13730,13856,13915,16384,15533,16384,16240,16384,16384,13019,11327,12308,149(...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) | {} | "<|im_start|>user\nYou are an expert Python programmer. You will be given a question (problem specif(...TRUNCATED) | [151644,872,198,2610,525,458,6203,13027,47788,13,1446,686,387,2661,264,3405,320,34586,25128,8,323,68(...TRUNCATED) | ["<think>\nOkay, let's try to understand this problem. So, there are N aliens, each starting with so(...TRUNCATED) | [[151667,198,32313,11,1077,594,1430,311,3535,419,3491,13,2055,11,1052,525,451,36119,11,1817,5916,448(...TRUNCATED) | ["import sys\n\nclass FenwickTree:\n def __init__(self, size):\n self.size = size\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) | ["65a542f98c0351a2b106de3ef75ca28d4498a796d4a6c303f7347cf52306aa9b.safetensors","f4338988831b76eded9(...TRUNCATED) | [12669,13590,13801,13860,13960,15188,16384,16279,16364,16384,16384,16000,16384,16384,12638,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) | {} | "<|im_start|>user\nYou are an expert Python programmer. You will be given a question (problem specif(...TRUNCATED) | [151644,872,198,2610,525,458,6203,13027,47788,13,1446,686,387,2661,264,3405,320,34586,25128,8,323,68(...TRUNCATED) | ["<think>\nOkay, let's see. I need to solve this problem where for each k from 1 to D, I have to cal(...TRUNCATED) | [[151667,198,32313,11,1077,594,1490,13,358,1184,311,11625,419,3491,1380,369,1817,595,504,220,16,311,(...TRUNCATED) | ["n, d = map(int, input().split())\nsnakes = []\nfor _ in range(n):\n t, l = map(int, input().spl(...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) | ["f90f3c844cb210c65b4bd7e984db3f4aade84edbf0cc26d27b758b2419bdd949.safetensors","8f6a5e5c9af4e1b401b(...TRUNCATED) | [807,933,954,980,1056,1151,1241,1245,1287,1288,1322,1413,973,1129,1551,1129,1052,1296,1284,1283,1039(...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) | {} | "<|im_start|>user\nYou are an expert Python programmer. You will be given a question (problem specif(...TRUNCATED) | [151644,872,198,2610,525,458,6203,13027,47788,13,1446,686,387,2661,264,3405,320,34586,25128,8,323,68(...TRUNCATED) | ["<think>\nOkay, I need to solve this programming problem. Let's read the problem statement carefull(...TRUNCATED) | [[151667,198,32313,11,358,1184,311,11625,419,15473,3491,13,6771,594,1349,279,3491,5114,15516,382,441(...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) | ["259597e8a94f1cd1b2d6999d6734d068f6f62207c74d97310208e59af0d928b3.safetensors","99534400cb93934ffdc(...TRUNCATED) | [16384,16384,16384,16384,16384,16384,16384,16384,16384,16384,16384,16384,16384,16384,16384,16384,163(...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) | {} | "<|im_start|>user\nYou are an expert Python programmer. You will be given a question (problem specif(...TRUNCATED) | [151644,872,198,2610,525,458,6203,13027,47788,13,1446,686,387,2661,264,3405,320,34586,25128,8,323,68(...TRUNCATED) | ["<think>\nOkay, let's see. I need to find the number of different kagamimochi that can be made. The(...TRUNCATED) | [[151667,198,32313,11,1077,594,1490,13,358,1184,311,1477,279,1372,315,2155,595,351,309,318,4953,72,4(...TRUNCATED) | ["import bisect\n\ndef main():\n import sys\n input = sys.stdin.read().split()\n n = int(in(...TRUNCATED) | [1.0,1.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,1.0,1.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0(...TRUNCATED) | ["5e955762ee3f7cd93678bb4573d41e920ca39c01dbda62620d5cdd81da259361.safetensors","ddbc132a4da655c93a0(...TRUNCATED) | [3732,4451,4750,4719,4813,5093,5204,5575,6017,5962,5970,6922,6958,7555,8114,3684,3175,3508,3872,4478(...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) | {} | "<|im_start|>user\nYou are an expert Python programmer. You will be given a question (problem specif(...TRUNCATED) | [151644,872,198,2610,525,458,6203,13027,47788,13,1446,686,387,2661,264,3405,320,34586,25128,8,323,68(...TRUNCATED) | ["<think>\nOkay, let's see. The problem is to take a string S and create a new string by concatenati(...TRUNCATED) | [[151667,198,32313,11,1077,594,1490,13,576,3491,374,311,1896,264,914,328,323,1855,264,501,914,553,39(...TRUNCATED) | ["# Read the input string\nS = input().strip()\n\n# Take the first character and concatenate with \"(...TRUNCATED) | [1.0,1.0,0.0,0.0,0.0,0.0,0.0,1.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,1.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0(...TRUNCATED) | ["f4d886b2abe33bd1da56401fda1bf2297e8bedbb678fdd78c7d101a36139fc1d.safetensors","3fd77c046498db6e8e4(...TRUNCATED) | [308,401,427,437,448,454,459,458,491,525,532,723,552,320,447,1014,1088,743,361,969,420,577,826,419,4(...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) | {} | "<|im_start|>user\nYou are an expert Python programmer. You will be given a question (problem specif(...TRUNCATED) | [151644,872,198,2610,525,458,6203,13027,47788,13,1446,686,387,2661,264,3405,320,34586,25128,8,323,68(...TRUNCATED) | ["<think>\nOkay, let's see. I need to solve this problem where I have to determine if it's possible (...TRUNCATED) | [[151667,198,32313,11,1077,594,1490,13,358,1184,311,11625,419,3491,1380,358,614,311,8253,421,432,594(...TRUNCATED) | ["import sys\n\ndef main():\n N, M, A, B = map(int, sys.stdin.readline().split())\n L = []\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) | ["da831b6a59214fa2d6ce1a30786ebde51fd636681d5a024305281ab7e8e29710.safetensors","b7a6d69f788e6cdd409(...TRUNCATED) | [9985,14966,16384,16384,16384,16384,16384,16384,16384,16384,16384,16384,16384,14232,12223,12678,1385(...TRUNCATED) |
End of preview. Expand in Data Studio
README.md exists but content is empty.
- Downloads last month
- 25