problem_id stringlengths 6 9 | task_type stringclasses 1
value | prompt stringlengths 29 7.23k | verification_info stringlengths 160 78.7M |
|---|---|---|---|
taco_0 | deepcoder | There are $n$ candy boxes in front of Tania. The boxes are arranged in a row from left to right, numbered from $1$ to $n$. The $i$-th box contains $r_i$ candies, candies have the color $c_i$ (the color can take one of three values — red, green, or blue). All candies inside a single box have the same color (and it is ... | {"ground_truth": "{\"inputs\": [\"5 3 10\\n1 2 3 4 5\\nRGBRR\\n\", \"2 1 15\\n5 6\\nRG\\n\", \"6 1 21\\n4 2 3 5 1 6\\nRGBGRB\\n\", \"6 1 21\\n6 5 4 3 2 1\\nRGBRGB\\n\", \"1 1 10\\n10\\nR\\n\", \"2 1 10\\n5 5\\nRG\\n\", \"2 1 10\\n5 6\\nRR\\n\", \"5 3 10\\n1 2 3 4 5\\nRGBRG\\n\", \"9 1 6\\n1 1 1 3 3 3 2 2 2\\nRGGBRRGBB\... |
taco_1 | deepcoder | If you visit Aizu Akabeko shrine, you will find a unique paper fortune on which a number with more than one digit is written.
Each digit ranges from 1 to 9 (zero is avoided because it is considered a bad omen in this shrine). Using this string of numeric values, you can predict how many years it will take before your ... | {"ground_truth": "{\"inputs\": [\"9714431\", \"16612328\", \"23422731\", \"754526\", \"955577\", \"75547\", \"2112\", \"799\", \"88\", \"32523857\", \"4787\", \"1859551\", \"135661\", \"3675\", \"156692\", \"167918384\", \"83994\", \"4837847\", \"14513597\", \"15282598\", \"12659326\", \"1468417\", \"6280\", \"115464\"... |
taco_2 | deepcoder | An **anagram** is the result of rearranging the letters of a word to produce a new word.
**Note:** anagrams are case insensitive
Complete the function to return `true` if the two arguments given are anagrams of each other; return `false` otherwise.
## Examples
* `"foefet"` is an anagram of `"toffee"`
* `"Buckethe... | {"ground_truth": "{\"fn_name\": \"is_anagram\", \"inputs\": [[\"foefet\", \"toffee\"], [\"Buckethead\", \"DeathCubeK\"], [\"Twoo\", \"WooT\"], [\"dumble\", \"bumble\"], [\"ound\", \"round\"], [\"apple\", \"pale\"]], \"outputs\": [[true], [true], [true], [false], [false], [false]]}", "dataset_type": "taco"} |
taco_3 | deepcoder | Arkady decides to observe a river for n consecutive days. The river's water level on each day is equal to some real value.
Arkady goes to the riverside each day and makes a mark on the side of the channel at the height of the water level, but if it coincides with a mark made before, no new mark is created. The water d... | {"ground_truth": "{\"inputs\": [\"3\\n0 1 1\\n\", \"4\\n0 0 1 2\\n\", \"2\\n0 0\\n\", \"4\\n0 1 1 0\\n\", \"3\\n0 1 0\\n\", \"2\\n0 1\\n\", \"8\\n0 0 2 0 3 0 3 2\\n\", \"3\\n0 1 2\\n\", \"10\\n0 0 2 2 3 2 3 3 1 3\\n\", \"6\\n0 0 0 2 0 1\\n\", \"10\\n0 1 2 0 4 5 3 6 0 5\\n\", \"4\\n0 0 1 1\\n\", \"3\\n0 0 0\\n\", \"9\\n... |
taco_4 | deepcoder | You are given an array $a_1, a_2, \dots, a_n$. You can perform the following operation any number of times: Choose a pair of two neighboring equal elements $a_i = a_{i + 1}$ (if there is at least one such pair). Replace them by one element with value $a_i + 1$.
After each such operation, the length of the array wil... | {"ground_truth": "{\"inputs\": [\"5\\n4 3 2 2 3\\n\", \"7\\n3 3 4 4 4 3 3\\n\", \"3\\n1 3 5\\n\", \"1\\n1000\\n\", \"15\\n67 67 65 65 66 66 66 68 67 67 67 65 65 66 70\\n\", \"15\\n17 17 18 17 16 16 17 17 15 15 13 12 12 14 15\\n\", \"20\\n10 6 25 38 8 4 22 40 28 45 23 33 18 39 28 26 40 4 14 47\\n\", \"20\\n6 5 5 7 12 12... |
taco_5 | deepcoder | There are X+Y+Z people, conveniently numbered 1 through X+Y+Z. Person i has A_i gold coins, B_i silver coins and C_i bronze coins.
Snuke is thinking of getting gold coins from X of those people, silver coins from Y of the people and bronze coins from Z of the people. It is not possible to get two or more different col... | {"ground_truth": "{\"inputs\": [\"1 2 1\\n2 4 4\\n0 2 1\\n7 6 7\\n5 2 3\", \"6 2 4\\n33189 87907 277349742\\n71616 46764 575306520\\n8801 53151 327161251\\n58589 4337 796697686\\n66854 17565 289910583\\n50598 35195 478112689\\n13919 88414 103962455\\n7953 69657 699253752\\n42489 98144 468443709\\n2332 42580 752437097\\... |
taco_6 | deepcoder | Implement a function called makeAcronym that returns the first letters of each word in a passed in string.
Make sure the letters returned are uppercase.
If the value passed in is not a string return 'Not a string'.
If the value passed in is a string which contains characters other than spaces and alphabet letters, r... | {"ground_truth": "{\"fn_name\": \"make_acronym\", \"inputs\": [[\"My aunt sally\"], [\"Please excuse my dear aunt Sally\"], [\"How much wood would a woodchuck chuck if a woodchuck could chuck wood\"], [\"Unique New York\"], [\"a42\"], [\"1111\"], [64], [[]], [{}], [\"\"]], \"outputs\": [[\"MAS\"], [\"PEMDAS\"], [\"HMWW... |
taco_7 | deepcoder | When little Petya grew up and entered the university, he started to take part in АСМ contests. Later he realized that he doesn't like how the АСМ contests are organised: the team could only have three members (and he couldn't take all his friends to the competitions and distribute the tasks between the team members eff... | {"ground_truth": "{\"inputs\": [\"7 6\\nAlena\\nOlya\\nVanya\\nBrus\\nJohn\\nAlice\\nMariana\\nAlena John\\nAlena Alice\\nOlya John\\nOlya Alice\\nVanya John\\nVanya Alice\\n\", \"7 6\\nj\\nZ\\nPZNeTyY\\nm\\na\\nUj\\nsuaaSiKcK\\nUj PZNeTyY\\na j\\nPZNeTyY Z\\nPZNeTyY j\\nm PZNeTyY\\nm j\\n\", \"15 3\\na\\nYclKFJoaIA\\n... |
taco_8 | deepcoder | # Solve For X
You will be given an equation as a string and you will need to [solve for X](https://www.mathplacementreview.com/algebra/basic-algebra.php#solve-for-a-variable) and return x's value. For example:
```python
solve_for_x('x - 5 = 20') # should return 25
solve_for_x('20 = 5 * x - 5') # should return 5
solv... | {"ground_truth": "{\"fn_name\": \"solve_for_x\", \"inputs\": [[\"x - 5 = 20\"], [\"5 * x + 5 = 30\"], [\"20 = 5 * x - 5\"], [\"24 = 4 + 5 * x\"], [\"x = 5\"], [\"x * 100 = 700\"], [\"2 * x + 5 = 105\"], [\"2 * x = 198\"], [\"x - 100 + 2 - 50 = 52\"], [\"x / 3 = 33\"], [\"x + 80 = 20\"], [\"x + 20 = -60\"], [\"5 * x + 2... |
taco_9 | deepcoder | Write a function that takes an array/list of numbers and returns a number such that
Explanation
total([1,2,3,4,5]) => 48
1+2=3--\ 3+5 => 8 \
2+3=5--/ \ == 8+12=>20\
==>5+7=> 12 / \ 20+28 => 48
3+4=7--\ / == 12+16=>28/
4+5=9--/ 7+9 => 16 /
if total([1,2,3]) =... | {"ground_truth": "{\"fn_name\": \"total\", \"inputs\": [[[1, 2, 3, 4, 5]], [[1, 2, 3, 4]], [[1, 2, 3]], [[4, 4, 52, 23, 32, 1, -1]], [[4, 4, 5, -1]], [[-1, -1, -1]], [[-1, -1, -10, 42, 92, 1, 23, 6, -3]], [[-1, 1, -1, 1]], [[42]]], \"outputs\": [[48], [20], [8], [1753], [30], [-4], [9248], [0], [42]]}", "dataset_type":... |
taco_10 | deepcoder | Consider sequences \{A_1,...,A_N\} of length N consisting of integers between 1 and K (inclusive).
There are K^N such sequences. Find the sum of \gcd(A_1, ..., A_N) over all of them.
Since this sum can be enormous, print the value modulo (10^9+7).
Here \gcd(A_1, ..., A_N) denotes the greatest common divisor of A_1, ...... | {"ground_truth": "{\"inputs\": [\"3 2\\n\", \"3 200\\n\", \"100000 100000\\n\", \"2 1000\\n\", \"2 100000\\n\", \"2 1\\n\", \"100000 1\\n\", \"100000 2\\n\", \"99991 99989\\n\", \"36 99291\\n\", \"37 99737\\n\", \"59 64993\\n\", \"26 92227\\n\", \"8 56588\\n\", \"7775 25\\n\", \"63982 84\\n\", \"68417 56\\n\", \"31932 ... |
taco_11 | deepcoder | We have a tree with N vertices numbered 1 to N. The i-th edge in this tree connects Vertex a_i and b_i.
For each k=1, ..., N, solve the problem below:
- Consider writing a number on each vertex in the tree in the following manner:
- First, write 1 on Vertex k.
- Then, for each of the numbers 2, ..., N in this order,... | {"ground_truth": "{\"inputs\": [\"3\\n1 2\\n1 3\\n\", \"2\\n1 2\\n\", \"5\\n1 2\\n2 3\\n3 4\\n3 5\\n\", \"8\\n1 2\\n2 3\\n3 4\\n3 5\\n3 6\\n6 7\\n6 8\\n\", \"5\\n1 2\\n1 3\\n3 4\\n3 5\", \"5\\n1 2\\n1 4\\n3 4\\n3 5\", \"5\\n1 2\\n1 4\\n5 4\\n3 5\", \"3\\n2 3\\n1 3\", \"5\\n1 2\\n2 3\\n2 4\\n3 5\", \"5\\n1 2\\n1 5\\n3 4... |
taco_12 | deepcoder | Every summer Vitya comes to visit his grandmother in the countryside. This summer, he got a huge wart. Every grandma knows that one should treat warts when the moon goes down. Thus, Vitya has to catch the moment when the moon is down.
Moon cycle lasts 30 days. The size of the visible part of the moon (in Vitya's units... | {"ground_truth": "{\"inputs\": [\"5\\n3 4 5 6 7\\n\", \"7\\n12 13 14 15 14 13 12\\n\", \"1\\n8\\n\", \"44\\n7 8 9 10 11 12 13 14 15 14 13 12 11 10 9 8 7 6 5 4 3 2 1 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 14 13 12 11 10\\n\", \"92\\n3 4 5 6 7 8 9 10 11 12 13 14 15 14 13 12 11 10 9 8 7 6 5 4 3 2 1 0 1 2 3 4 5 6 7 8 9 10 1... |
taco_13 | deepcoder | Two polar bears Menshykov and Uslada from the St.Petersburg zoo and elephant Horace from the Kiev zoo got six sticks to play with and assess the animals' creativity. Menshykov, Uslada and Horace decided to make either an elephant or a bear from those sticks. They can make an animal from sticks in the following way:
... | {"ground_truth": "{\"inputs\": [\"5 5 5 5 5 5\\n\", \"4 4 4 4 2 2\\n\", \"1 1 2 2 3 4\\n\", \"1 3 3 3 4 5\\n\", \"4 4 5 6 7 8\\n\", \"4 4 4 4 4 5\\n\", \"5 5 5 6 6 6\\n\", \"4 4 2 2 2 2\\n\", \"1 1 3 3 3 5\\n\", \"1 8 9 1 1 1\\n\", \"9 9 9 1 9 9\\n\", \"4 4 4 4 4 2\\n\", \"1 1 2 2 2 2\\n\", \"1 1 1 1 1 2\\n\", \"4 4 4 ... |
taco_14 | deepcoder | The Cybermen and the Daleks have long been the Doctor's main enemies. Everyone knows that both these species enjoy destroying everything they encounter. However, a little-known fact about them is that they both also love taking Turing tests!
Heidi designed a series of increasingly difficult tasks for them to spend the... | {"ground_truth": "{\"inputs\": [\"2\\n0 0\\n0 1\\n0 2\\n1 0\\n1 1\\n1 2\\n2 0\\n2 1\\n2 2\\n\", \"2\\n0 0\\n0 1\\n0 2\\n0 3\\n1 0\\n1 2\\n2 0\\n2 1\\n2 2\\n\", \"2\\n5 14\\n5 17\\n25 43\\n26 43\\n32 41\\n33 0\\n38 0\\n48 17\\n48 30\\n\", \"2\\n17 44\\n19 14\\n19 25\\n24 27\\n32 1\\n34 27\\n38 1\\n45 5\\n45 12\\n\", \"2... |
taco_15 | deepcoder | Jerry is a little mouse. He is trying to survive from the cat Tom. Jerry is carrying a parallelepiped-like piece of cheese of size A × B × C. It is necessary to trail this cheese to the Jerry's house. There are several entrances in the Jerry's house. Each entrance is a rounded hole having its own radius R. Could you he... | {"ground_truth": "{\"inputs\": [\"10 6 8\\n5\\n4\\n1\\n6\\n2\\n5\\n0 0 0\", \"10 6 8\\n5\\n4\\n0\\n0\\n2\\n5\\n0 0 0\", \"10 6 8\\n5\\n4\\n0\\n0\\n2\\n7\\n0 0 0\", \"10 6 8\\n5\\n1\\n8\\n6\\n2\\n5\\n0 0 0\", \"10 6 4\\n5\\n4\\n0\\n-1\\n2\\n7\\n0 0 0\", \"10 6 4\\n5\\n4\\n0\\n-1\\n4\\n7\\n0 0 0\", \"10 3 8\\n5\\n4\\n0\\... |
End of preview. Expand in Data Studio
README.md exists but content is empty.
- Downloads last month
- 4