data_source stringclasses 6
values | prompt listlengths 1 1 | ability stringclasses 1
value | reward_model dict | extra_info dict | responses listlengths 1 1 | scores listlengths 1 1 | score listlengths 1 1 | __index_level_0__ int64 37 6.59k |
|---|---|---|---|---|---|---|---|---|
train-code-taco-easy | [
{
"content": "You will be given a question (problem specification) and will generate a correct Python program that matches the specification and passes all tests.\n\ninner \n\nThe inner tool returns the inner product of two arrays.\n\nimport numpy\n\nA = numpy.array([0, 1])\nB = numpy.array([3, 4])\n\nprint nu... | code | {
"ground_truth": {
"fn_name": null,
"inputs": [
"0 1\n2 3\n",
"0 1\n2 3\n"
],
"outputs": [
"3\n[[0 0]\n [2 3]]\n",
"IMPOSSIBLE_ANSWER\nIMPOSSIBLE_ANSWER\nIMPOSSIBLE_ANSWER"
]
},
"style": "rule"
} | {
"index": 87,
"model_difficulty": {
"DeepSeek-R1-Distill-Qwen-1.5B": 12,
"DeepSeek-R1-Distill-Qwen-32B": 0,
"DeepSeek-R1-Distill-Qwen-7B": 8
}
} | [
"This problem can be solved with the help of Python's built-in numpy library which provides easy-to-use methods to perform mathematical operations on arrays.\n\nHere is the code for the solution and the unit tests:\n\n```python\nimport numpy as np\nimport unittest\n\n# your initial array represented as string in th... | [
true
] | [
true
] | 37 |
train-code-taco-easy | [
{
"content": "You will be given a question (problem specification) and will generate a correct Python program that matches the specification and passes all tests.\n\nYou are given an array $a$ of length $n$.\n\nLet's define the eversion operation. Let $x = a_n$. Then array $a$ is partitioned into two parts: lef... | code | {
"ground_truth": {
"fn_name": null,
"inputs": [
"3\n5\n2 4 1 5 3\n5\n5 3 2 4 1\n4\n1 1 1 1\n",
"2\n1\n998244353\n4\n1 1 2 3\n",
"2\n1\n998244353\n4\n1 1 2 3\n"
],
"outputs": [
"1\n2\n0\n",
"0\n0\n",
"1\n2\n0\n"
]
},
"style": "rule"
} | {
"index": 100,
"model_difficulty": {
"DeepSeek-R1-Distill-Qwen-1.5B": 12,
"DeepSeek-R1-Distill-Qwen-32B": 0,
"DeepSeek-R1-Distill-Qwen-7B": 4
}
} | [
"The problem description asks us to find the minimum number 'k' such that after eversioning, the array doesn't change.\n\nEversion is performed until it doesn't change, meaning the array is sorted in each iteration without affecting the order of elements.\n\n1. Find the max element in the array. This will be the 'x... | [
true
] | [
true
] | 45 |
train-code-taco-easy | [
{
"content": "You will be given a question (problem specification) and will generate a correct Python program that matches the specification and passes all tests.\n\nAlice and Bob are playing a game with strings. There will be $t$ rounds in the game. In each round, there will be a string $s$ consisting of lower... | code | {
"ground_truth": {
"fn_name": null,
"inputs": [
"6\naba\nabc\ncba\nn\ncodeforces\ncodeforces"
],
"outputs": [
"Alice 2\nAlice 4\nAlice 4\nBob 14\nAlice 93\nIMPOSSIBLE_ANSWER\n"
]
},
"style": "rule"
} | {
"index": 194,
"model_difficulty": {
"DeepSeek-R1-Distill-Qwen-1.5B": 16,
"DeepSeek-R1-Distill-Qwen-32B": 2,
"DeepSeek-R1-Distill-Qwen-7B": 12
}
} | [
"Step 1: Define a function that takes a string s as input and returns an answer as a tuple of the form (player_string, score_diff). \n\nStep 2: Define a helper function that takes a string s and an integer i as input. This function should return an answer with the length of the string equal to 2i+1.\n\nStep 3: Nami... | [
true
] | [
true
] | 90 |
train-code-taco-easy | [
{
"content": "You will be given a question (problem specification) and will generate a correct Python program that matches the specification and passes all tests.\n\nLuis has a sequence of $n+1$ integers $a_1, a_2, \\ldots, a_{n+1}$. For each $i = 1, 2, \\ldots, n+1$ it is guaranteed that $0\\leq a_i < n$, or $... | code | {
"ground_truth": {
"fn_name": null,
"inputs": [
"4\n7 0\n1 1\n2 12\n3 12\n",
"1\n999779 805402974925395962\n",
"1\n999779 805402974925395962\n"
],
"outputs": [
"0\n1\n3\n1\n",
"805759\n",
"0\n1\n3\n1\n"
]
},
"style": "rule"
} | {
"index": 204,
"model_difficulty": {
"DeepSeek-R1-Distill-Qwen-1.5B": 6,
"DeepSeek-R1-Distill-Qwen-32B": 2,
"DeepSeek-R1-Distill-Qwen-7B": 4
}
} | [
"The problem can be understood as the problem description request for an observation where the Luna's sequence with given \"s\" (the sum of sequence) number of sequences if there is number equal to 'n^2' in the sequence.\n\nFirstly to create a sequence that has \"n\" number of sequences, we can simply loop for the ... | [
true
] | [
true
] | 94 |
train-code-taco-easy | [
{
"content": "You will be given a question (problem specification) and will generate a correct Python program that matches the specification and passes all tests.\n\nYou are given a sequence of positive integers of length N, a = (a_1, a_2, ..., a_N).\nYour objective is to remove some of the elements in a so tha... | code | {
"ground_truth": {
"fn_name": null,
"inputs": [
"4\n3 3 3 3\n",
"5\n2 4 1 4 2\n",
"6\n1 2 2 3 3 3\n",
"1\n1000000000\n",
"8\n2 7 1 8 2 8 1 8\n",
"8\n2 7 1 8 2 8 1 8\n"
],
"outputs": [
"1\n",
"2\n",
"0\n",
"1\n",
"5\n",
"1\n"
... | {
"index": 289,
"model_difficulty": {
"DeepSeek-R1-Distill-Qwen-1.5B": 12,
"DeepSeek-R1-Distill-Qwen-32B": 0,
"DeepSeek-R1-Distill-Qwen-7B": 2
}
} | [
"Based on the problem description, we can see that the requirement is to find out the minimum number of elements that need to be removed to make the given sequence a good sequence. Since it states that every element in b occurs the same number of times, we cannot obtain a good sequence by removing any elements. Thi... | [
true
] | [
true
] | 134 |
train-code-taco-medium_hard | [
{
"content": "You will be given a question (problem specification) and will generate a correct Python program that matches the specification and passes all tests.\n\nRead problems statements in Mandarin Chinese and Russian. \n\nYou have an array of integers A_{1}, A_{2}, ..., A_{N}. The function F(P), where P ... | code | {
"ground_truth": {
"fn_name": null,
"inputs": [
"1\n3 4\n1 2 3",
"1\n3 4\n0 2 3",
"1\n0 4\n0 2 2",
"1\n0 8\n0 2 0",
"1\n0 13\n0 2 0",
"1\n0 13\n0 4 -2",
"1\n3 1\n1 2 3",
"1\n0 4\n0 0 0",
"1\n0 8\n0 3 0",
"1\n0 14\n0 3 0",
"1\n0 2\n0 2 -2",
... | {
"index": 442,
"model_difficulty": {
"DeepSeek-R1-Distill-Qwen-1.5B": 16,
"DeepSeek-R1-Distill-Qwen-32B": 16,
"DeepSeek-R1-Distill-Qwen-7B": 12
}
} | [
"3\n0 1 2\nOutput\n15\n\n\nInput\n1\n2 13\n0 1 1\nOutput\n24\n\n\nInput\n1\n2 0\n0 2 1\nOutput\n2\n\n\nInput\n1\n0 2\n0 2 0\nOutput\n4\n\n\nInput\n1\n0 3\n0 1 0\nOutput\n3\n\n\nInput\n1\n1 13\n-1 8 0\nOutput\n15\n\n\nInput\n1\n1 13\n0 1 0\nOutput\n15\n\n\nInput\n1\n2 13\n-1 8 0\nOutput\n25\n\n\nInput\n1\n1 14\n0 1 ... | [
true
] | [
true
] | 212 |
train-code-taco-easy | [
{
"content": "You will be given a question (problem specification) and will generate a correct Python program that matches the specification and passes all tests.\n\nWhile Mahmoud and Ehab were practicing for IOI, they found a problem which name was Longest common subsequence. They solved it, and then Ehab chal... | code | {
"ground_truth": {
"fn_name": null,
"inputs": [
"abcd\ndefgh\n",
"a\na\n",
"aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaacccccccccccccccccccccccccccccccccccccccccccccccccc\naaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaadddddddddddddddddddddddddddddddddddddddddddddddddd\n",
"a... | {
"index": 468,
"model_difficulty": {
"DeepSeek-R1-Distill-Qwen-1.5B": 14,
"DeepSeek-R1-Distill-Qwen-32B": 0,
"DeepSeek-R1-Distill-Qwen-7B": 2
}
} | [
"\n\nOutput\n4\n\n\nInput\nnew\nnaf\n\nOutput\n4\n\n\nInput\naaaaaaaaa\naaaaaaa\n\nOutput\n14\n\n\nInput\naaaaaaaaaaaaa\naa\n\nOutput\n12\n\n\nInput\nabcdefghijklmnopqrstuvwxyz\nzabcdefghijklmnopqrstuvwxy\n\nOutput\n26\n\n\nInput\nmnmmm\nmnm\n\nOutput\n4\n\n\nInput\naaa\naab\n\nOutput\n3\n\n\nInput\nabca\nabc\n\nOu... | [
true
] | [
true
] | 222 |
train-code-taco-medium | [
{
"content": "You will be given a question (problem specification) and will generate a correct Python program that matches the specification and passes all tests.\n\nThere is an undirected tree where each vertex is numbered from $1$ to $n$, and each contains a data value. The sum of a tree is the sum of all it... | code | {
"ground_truth": {
"fn_name": null,
"inputs": [
"7\n100 200 100 500 100 600\n1 2\n2 3\n2 5\n4 5\n5 6\n5 6"
],
"outputs": [
"400\nIMPOSSIBLE_ANSWER\n"
]
},
"style": "rule"
} | {
"index": 534,
"model_difficulty": {
"DeepSeek-R1-Distill-Qwen-1.5B": 10,
"DeepSeek-R1-Distill-Qwen-32B": 0,
"DeepSeek-R1-Distill-Qwen-7B": 4
}
} | [
"Let's firstly deal with the edge case of having all inputs sum equal. In such case, we can insert one tree with all nodes and one edge as middle root. The absolute diff between two trees would be zero. \n\nHere is the Python code for the problem and its unit tests:\n\n```python\n# Python code\n\nimport unittest\n\... | [
true
] | [
true
] | 261 |
train-code-taco-easy | [
{
"content": "You will be given a question (problem specification) and will generate a correct Python program that matches the specification and passes all tests.\n\nThere is an integer $n$ without zeros in its decimal representation. Alice and Bob are playing a game with this integer. Alice starts first. They ... | code | {
"ground_truth": {
"fn_name": null,
"inputs": [
"4\n12\n132\n487456398\n487456398"
],
"outputs": [
"2\n1\n3\nIMPOSSIBLE_ANSWER\n"
]
},
"style": "rule"
} | {
"index": 599,
"model_difficulty": {
"DeepSeek-R1-Distill-Qwen-1.5B": 14,
"DeepSeek-R1-Distill-Qwen-32B": 6,
"DeepSeek-R1-Distill-Qwen-7B": 12
}
} | [
"Process:\n1. Count the number of ones and zeros in the integer. As the integer is a base10 number, we can put the count into a list where index 0 represents the ones and index 1 represents the zeros count.\n2. Iterate over the list from the least significant digit to the most significant digit. In the outer loop, ... | [
true
] | [
true
] | 284 |
train-code-taco-medium | [{"content":"You will be given a question (problem specification) and will generate a correct Python(...TRUNCATED) | code | {"ground_truth":{"fn_name":null,"inputs":["3\n-10 5 -4\n","5\n10 -4 -8 -11 3\n","11\n-1000000000 100(...TRUNCATED) | {"index":652,"model_difficulty":{"DeepSeek-R1-Distill-Qwen-1.5B":16,"DeepSeek-R1-Distill-Qwen-32B":2(...TRUNCATED) | [" 983975458 -9978983 -331207794 -155139918 759759034 -639905717 106044070 365377473 -97945146 -7686(...TRUNCATED) | [
true
] | [
true
] | 310 |
End of preview. Expand in Data Studio
README.md exists but content is empty.
- Downloads last month
- 20