ability stringclasses 1
value | data_source stringclasses 4
values | extra_info dict | prompt listlengths 1 1 | reward_model dict |
|---|---|---|---|---|
code | taco | {
"index": 0,
"split": "dummy"
} | [
{
"content": "One tradition of ACM-ICPC contests is that a team gets a balloon for every solved problem. We assume that the submission time doesn't matter and teams are sorted only by the number of balloons they have. It means that one's place is equal to the number of teams with more balloons, increased by 1. ... | {
"ground_truth": "{\"inputs\": [\"8\\n20 1000\\n32 37\\n40 1000\\n45 50\\n16 16\\n16 16\\n14 1000\\n2 1000\\n\", \"7\\n4 4\\n4 4\\n4 4\\n4 4\\n4 4\\n4 4\\n5 5\\n\", \"7\\n14000000003 1000000000000000000\\n81000000000 88000000000\\n5000000000 7000000000\\n15000000000 39000000000\\n46000000000 51000000000\\n0 10000000... |
code | taco | {
"index": 0,
"split": "dummy"
} | [
{
"content": "Problem\n\nGiven a natural number N less than or equal to 12, find the smallest natural number such that the number of divisors is exactly N.\n\nConstraints\n\n* 1 ≤ N ≤ 12\n\nInput\n\nOne natural number N is given in one line.\n\nOutput\n\nOutput the smallest natural number on a line so that the ... | {
"ground_truth": "{\"inputs\": [\"5\", \"4\", \"6\", \"11\", \"8\", \"7\", \"10\", \"9\", \"12\", \"001\", \"010\", \"011\", \"4\", \"6\", \"9\", \"8\", \"10\", \"5\", \"7\", \"11\", \"12\", \"001\", \"010\", \"011\", \"1\", \"3\", \"2\"], \"outputs\": [\"16\\n\", \"6\\n\", \"12\\n\", \"1024\\n\", \"24\\n\", \"64\\n... |
code | codecontests | {
"index": 0,
"split": "dummy"
} | [
{
"content": "Alexander is learning how to convert numbers from the decimal system to any other, however, he doesn't know English letters, so he writes any number only as a decimal number, it means that instead of the letter A he will write the number 10. Thus, by converting the number 475 from decimal to hexad... | {
"ground_truth": "{\"inputs\": [\"16\\n11311\\n\", \"17\\n2016\\n\", \"13\\n12\\n\", \"20\\n999\\n\", \"7014809\\n73084644\\n\", \"7501\\n2542549323761022905\\n\", \"9\\n78\\n\", \"11\\n1107835458761401923\\n\", \"378135456\\n42831383491941211\\n\", \"3\\n1210020121011022121222022012121212020\\n\", \"23\\n1200762291... |
code | codecontests | {
"index": 0,
"split": "dummy"
} | [
{
"content": "Snuke has an integer sequence A of length N.\n\nHe will make three cuts in A and divide it into four (non-empty) contiguous subsequences B, C, D and E. The positions of the cuts can be freely chosen.\n\nLet P,Q,R,S be the sums of the elements in B,C,D,E, respectively. Snuke is happier when the abs... | {
"ground_truth": "{\"inputs\": [\"10\\n10 71 84 33 6 47 23 25 52 64\", \"7\\n1 2 3 1000000000 4 5 6\", \"5\\n3 2 4 1 2\", \"10\\n10 71 113 33 6 47 23 25 52 64\", \"7\\n1 2 3 1100000000 4 5 6\", \"5\\n3 2 4 2 2\", \"10\\n10 102 113 33 6 47 23 25 52 64\", \"7\\n1 2 3 1100000000 4 5 2\", \"10\\n10 102 113 60 6 47 23 25... |
code | codecontests | {
"index": 0,
"split": "dummy"
} | [
{
"content": "You are given a permutation p_1, p_2, …, p_n.\n\nIn one move you can swap two adjacent values.\n\nYou want to perform a minimum number of moves, such that in the end there will exist a subsegment 1,2,…, k, in other words in the end there should be an integer i, 1 ≤ i ≤ n-k+1 such that p_i = 1, p_{... | {
"ground_truth": "{\"inputs\": [\"3\\n1 2 3\\n\", \"5\\n5 4 3 2 1\\n\", \"1\\n1\\n\", \"100\\n98 52 63 2 18 96 31 58 84 40 41 45 66 100 46 71 26 48 81 20 73 91 68 76 13 93 17 29 64 95 79 21 55 75 19 85 54 51 89 78 15 87 43 59 36 1 90 35 65 56 62 28 86 5 82 49 3 99 33 9 92 32 74 69 27 22 77 16 44 94 34 6 57 70 23 12 ... |
code | taco | {
"index": 0,
"split": "dummy"
} | [
{
"content": "Your task is to determine how many files of the copy queue you will be able to save into your Hard Disk Drive. The files must be saved in the order they appear in the queue. \n\n### Input:\n\n* Array of file sizes `(0 <= s <= 100)`\n* Capacity of the HD `(0 <= c <= 500)`\n\n### Output:\n\n* Number... | {
"ground_truth": "{\"fn_name\": \"save\", \"inputs\": [[[4, 4, 4, 3, 3], 12], [[4, 4, 4, 3, 3], 11], [[4, 8, 15, 16, 23, 42], 108], [[13], 13], [[1, 2, 3, 4], 250], [[100], 500], [[11, 13, 15, 17, 19], 8], [[45], 12]], \"outputs\": [[3], [2], [6], [1], [4], [1], [0], [0]]}",
"style": "rule"
} |
code | codecontests | {
"index": 0,
"split": "dummy"
} | [
{
"content": "You are playing a game with a bag of red and black balls. Initially, you are told that the bag has n balls total. In addition, you are also told that the bag has probability pi / 106 of containing exactly i red balls.\n\nYou now would like to buy balls from this bag. You really like the color red,... | {
"ground_truth": "{\"inputs\": [\"3 200000\\n250000 250000 250000 250000\\n\", \"6 202020\\n100000 10000 100000 10000 670000 10000 100000\\n\", \"5 999999\\n0 0 0 0 1 999999\\n\", \"1 499999\\n500000 500000\\n\", \"20 123123\\n1682 7 254283 3077 0 0 62970 31538 847 13907 136 114786 8896 21735 366 197843 34 5405 8598... |
code | codeforces | {
"index": 0,
"split": "dummy"
} | [
{
"content": "Title: Hot Days\n\nTime Limit: None seconds\n\nMemory Limit: None megabytes\n\nProblem Description:\nThe official capital and the cultural capital of Berland are connected by a single road running through *n* regions. Each region has a unique climate, so the *i*-th (1<=≤<=*i*<=≤<=*n*) region has a... | {
"ground_truth": "{\"inputs\": [\"2 10\\n30 35 1 100\\n20 35 10 10\", \"3 100\\n10 30 1000 1\\n5 10 1000 3\\n10 40 1000 100000\", \"10 1\\n8 6 3 4\\n9 10 7 7\\n1 3 9 5\\n10 9 4 2\\n1 10 2 10\\n1 1 8 5\\n5 5 9 2\\n5 8 4 3\\n4 4 9 7\\n5 7 5 10\", \"5 5\\n100 29 49 77\\n34 74 41 8\\n32 21 24 91\\n45 52 16 51\\n50 87 90... |
code | taco | {
"index": 0,
"split": "dummy"
} | [
{
"content": "You’re playing hopscotch! You start at the origin and your goal is to hop to the lattice point $(N, N)$. A hop consists of going from lattice point $(x_1, y_1)$ to $(x_2, y_2)$, where $x_1 < x_2$ and $y_1 < y_2$.\n\nYou dislike making small hops though. You’ve decided that for every hop you make b... | {
"ground_truth": "{\"inputs\": [\"2 1 1\\n\", \"7 2 3\\n\"], \"outputs\": [\"2\\n\", \"9\\n\"]}",
"style": "rule"
} |
code | codecontests | {
"index": 0,
"split": "dummy"
} | [
{
"content": "Queue is a container of elements that are inserted and deleted according to FIFO (First In First Out).\n\nFor $n$ queues $Q_i$ ($i = 0, 1, ..., n-1$), perform a sequence of the following operations.\n\n* enqueue($t$, $x$): Insert an integer $x$ to $Q_t$.\n* front($t$): Report the value which shoul... | {
"ground_truth": "{\"inputs\": [\"3 9\\n0 0 1\\n0 0 2\\n0 0 3\\n0 2 4\\n0 2 5\\n1 0\\n1 2\\n2 0\\n1 0\", \"3 9\\n0 1 1\\n0 0 2\\n0 0 3\\n0 2 4\\n0 2 5\\n1 0\\n1 2\\n2 0\\n1 0\", \"3 9\\n0 1 1\\n0 0 2\\n0 0 3\\n0 2 6\\n0 2 5\\n1 0\\n1 2\\n2 0\\n1 0\", \"3 9\\n0 1 1\\n0 0 2\\n0 1 3\\n0 2 6\\n0 2 5\\n1 0\\n1 2\\n2 0\\n... |
code | taco | {
"index": 0,
"split": "dummy"
} | [
{
"content": "Garry is looking at the sky. Such a beautiful day! He notices that the clouds are particularly beautiful today, and wishes to record the current state of the sky. He has no camera, so he begins writing down coordinate points. Fortunately for Garry, the current cloud cover can be represented as the... | {
"ground_truth": "{\"inputs\": [\"1\\n10000 0 10000 10000 0 10000\\n3\\n10000 0 10000 10000 5000 5000\\n5000 5000 10000 10000 0 10000\\n0 0 0 1000 1000 0\\n\", \"2\\n9996 0 9997 0 0 1\\n9999 0 10000 0 0 1\\n2\\n9997 0 9998 0 0 1\\n9998 0 9999 0 0 1\\n\", \"1\\n2 0 2 4 4 2\\n2\\n2 0 2 2 4 2\\n2 2 4 2 2 4\\n\"], \"out... |
code | taco | {
"index": 0,
"split": "dummy"
} | [
{
"content": "Kolya is very absent-minded. Today his math teacher asked him to solve a simple problem with the equation $a + 1 = b$ with positive integers $a$ and $b$, but Kolya forgot the numbers $a$ and $b$. He does, however, remember that the first (leftmost) digit of $a$ was $d_a$, and the first (leftmost) ... | {
"ground_truth": "{\"inputs\": [\"1 2\\n\", \"4 4\\n\", \"5 7\\n\", \"6 2\\n\", \"9 1\\n\", \"1 1\\n\", \"8 9\\n\", \"9 8\\n\", \"9 9\\n\", \"2 4\\n\", \"1 9\\n\", \"6 5\\n\", \"9 2\\n\", \"3 3\\n\", \"8 8\\n\", \"8 1\\n\", \"6 7\\n\", \"9 2\\n\", \"3 2\\n\", \"2 1\\n\", \"1 9\\n\", \"7 6\\n\", \"5 4\\n\", \"6 5\\n\... |
code | codecontests | {
"index": 0,
"split": "dummy"
} | [
{
"content": "WARNING Large input/output files. Use faster I/O.\nIt's Galactik Football time! The Galactik Football Assosiation (GFA) has announced a football tournament between all the teams of all the planets in the galaxy (say N). Teams like Snow Kids, Shadows, Xenons, Red Tigers, Wambas, Pirates, etc. are i... | {
"ground_truth": "{\"inputs\": [\"6 6\\n1 2\\n2 3\\n1 3\\n4 5\\n5 6\\n4 6\\n1\\n3\\n5\\n2\\n4\\n6\", \"3 1\\n2 3\\n1\\n-1\\n-1\", \"6 6\\n1 2\\n2 5\\n1 3\\n4 5\\n5 6\\n4 6\\n1\\n3\\n5\\n2\\n4\\n6\", \"3 1\\n3 3\\n1\\n-1\\n-1\", \"6 6\\n1 2\\n2 3\\n1 3\\n4 5\\n5 6\\n4 6\\n1\\n3\\n5\\n2\\n4\\n1\", \"6 6\\n1 2\\n2 3\\n... |
code | taco | {
"index": 0,
"split": "dummy"
} | [
{
"content": "Example\n\nInput\n\n4 5 3\n-10 -10\n10 -10\n10 10\n-10 10\n1 2\n1 3\n1 4\n2 3\n3 4\n-20 0\n1 0\n20 0\n\n\nOutput\n\nNo\nYes\nNo\n\nWrite Python code to solve the problem. Present the code in \n```python\nYour code\n```\nat the end.\nYou need to think first then write the Python code.",
"role":... | {
"ground_truth": "{\"inputs\": [\"4 5 3\\n-10 -10\\n10 -10\\n10 10\\n-10 10\\n1 2\\n1 3\\n1 4\\n2 3\\n3 4\\n-20 0\\n1 0\\n20 0\"], \"outputs\": [\"No\\nYes\\nNo\"]}",
"style": "rule"
} |
code | codeforces | {
"index": 0,
"split": "dummy"
} | [
{
"content": "Title: Willem, Chtholly and Seniorious\n\nTime Limit: None seconds\n\nMemory Limit: None megabytes\n\nProblem Description:\n— Willem...\n\n— What's the matter?\n\n— It seems that there's something wrong with Seniorious...\n\n— I'll have a look...\n\n\n\nSeniorious is made by linking special talism... | {
"ground_truth": "{\"inputs\": [\"10 10 7 9\", \"10 10 9 9\", \"1000 1000 658073485 946088556\", \"1000 1000 663001819 921338426\", \"1000 1000 811605498 961464625\", \"100000 100000 585767874 969488314\", \"100000 100000 456616815 974410294\", \"35293 65394 377702722 965499399\", \"96334 53956 282409557 989731155\"... |
code | codecontests | {
"index": 0,
"split": "dummy"
} | [
{
"content": "There is a board with a grid consisting of n rows and m columns, the rows are numbered from 1 from top to bottom and the columns are numbered from 1 from left to right. In this grid we will denote the cell that lies on row number i and column number j as (i, j).\n\nA group of six numbers (a, b, c,... | {
"ground_truth": "{\"inputs\": [\"2 2 1\\n\", \"3 4 5\\n\", \"2 2 3\\n\", \"2 20 37\\n\", \"500 500 250000\\n\", \"500 500 249995\\n\", \"1 1 1\\n\", \"2 1 1\\n\", \"32 71 297\\n\", \"20 20 8\\n\", \"6 14 23\\n\", \"2 78 117\\n\", \"500 500 9997\\n\", \"500 500 6913\\n\", \"2 1 2\\n\", \"3 3 5\\n\", \"5 1 3\\n\", \"... |
code | taco | {
"index": 0,
"split": "dummy"
} | [
{
"content": "Given the value of n, print the n'th prime number.\n\nInput : A single integer n. \nOutput : A single number which is the n'th prime number.\nConstraints : \n1 ≤ n ≤ 1000\n\nSAMPLE INPUT\n2\n\nSAMPLE OUTPUT\n3\n\nExplanation\n\nThe first few prime numbers are:\n2,3,5,7. So, the answer is 3.\n\nWri... | {
"ground_truth": "{\"inputs\": [\"1000\", \"1\", \"17\", \"100\"], \"outputs\": [\"541\", \"7919\", \"2\", \"59\"]}",
"style": "rule"
} |
End of preview. Expand in Data Studio
README.md exists but content is empty.
- Downloads last month
- 29