problem_id stringlengths 9 127 ⌀ | prompt stringlengths 22 45.7k | verification_info stringlengths 18 19.2M | Qwen/Qwen3-32B_avg_reward float64 0 1 | Qwen/Qwen3-4B_avg_reward float64 0 0 | deepseek-ai/DeepSeek-R1-0528-Qwen3-8B_avg_reward float64 0 1 | deepseek-ai/DeepSeek-R1-0528_avg_reward float64 0 1 ⌀ |
|---|---|---|---|---|---|---|
prime_rl_code_10002 | You are looking for a particular family photo with you and your favorite relatives Alice and Bob. Each family photo contains a line-up of $n$ people. On the photo you’re looking for, you remember that Alice, who is taller than you, was somewhere on your left from the perspective of the photographer. Also, Bob who is ta... | {"test_cases": "{\"inputs\": [\"1\\n3\\n2 1 3\\n\", \"4\\n4\\n140 157 160 193\\n5\\n15 24 38 9 30\\n6\\n36 12 24 29 23 15\\n6\\n170 230 320 180 250 210\\n\"], \"outputs\": [\"1\\n1\\n\", \"2\\n2\\n4\\n\"]}", "style": "rule"} | 0.071429 | 0 | 0.5 | null |
prime_rl_code_10050 | There is a board of m × n squares. The squares of i rows and j columns are represented by (i, j) (0 ≤ i <m, 0 ≤ j <n).
When the rabbit is at (x, y), it can jump to ((x + a) mod m, (y + b) mod n) or ((x + c) mod m, (y + d) mod n) it can.
Now the rabbit is at (0, 0). If you can't go back to the square that once jumped,... | {"test_cases": "{\"inputs\": [\"2 6 2 2 2 4\", \"3 6 2 2 2 4\", \"4 6 2 2 2 8\", \"4 2 2 2 2 8\", \"4 2 1 2 2 8\", \"1 2 1 2 3 8\", \"1 5 2 0 4 2\", \"3 6 2 2 2 7\", \"3 7 2 2 2 4\", \"4 3 0 2 1 8\", \"2 5 1 2 0 2\", \"2 8 0 2 3 15\", \"2 14 0 2 2 4\", \"2 27 0 2 2 4\", \"2 13 0 4 3 15\", \"2 27 0 1 1 3\", \"2 16 0 6 1... | 0.5 | 0 | 0 | null |
prime_rl_code_10057 | Thor is getting used to the Earth. As a gift Loki gave him a smartphone. There are n applications on this phone. Thor is fascinated by this phone. He has only one minor issue: he can't count the number of unread notifications generated by those applications (maybe Loki put a curse on it so he can't).
q events are abou... | {"test_cases": "{\"inputs\": [\"4 6\\n1 2\\n1 4\\n1 2\\n3 3\\n1 3\\n1 3\\n\", \"3 4\\n1 3\\n1 1\\n1 2\\n2 3\\n\", \"300000 1\\n1 300000\\n\", \"10 85\\n2 2\\n1 10\\n1 1\\n2 6\\n1 2\\n1 4\\n1 7\\n2 1\\n1 1\\n3 3\\n1 9\\n1 6\\n1 8\\n1 10\\n3 8\\n2 8\\n1 6\\n1 3\\n1 9\\n1 6\\n1 3\\n1 8\\n1 1\\n1 6\\n1 10\\n2 1\\n2 10\\n1 ... | 0.6 | 0 | 0.25 | null |
prime_rl_code_1007 | "After solving Reese's first problem Harold thought he had proven himself. But Reese wasn't convince(...TRUNCATED) | "{\"test_cases\": \"{\\\"inputs\\\": [\\\"1\\\\n3\\\\n\\\\n\\\\nSAMPLE\\\", \\\"400\\\\n44\\\\n18470(...TRUNCATED) | 0 | 0 | 0.25 | null |
prime_rl_code_1009 | "Some chefs go for a tour lasting N days. They take packages of bread for food. Each package has K p(...TRUNCATED) | "{\"test_cases\": \"{\\\"inputs\\\": [\\\"3\\\\n3 4\\\\n3 1 2\\\\n1 1\\\\n1\\\\n2 4\\\\n8 8\\\", \\\(...TRUNCATED) | 0.25 | 0 | 0.333333 | null |
prime_rl_code_1012 | "Digital collectible card games have become very popular recently. So Vova decided to try one of the(...TRUNCATED) | "{\"test_cases\": \"{\\\"inputs\\\": [\\\"5 8\\\\n5 5 1\\\\n1 5 4\\\\n4 6 3\\\\n1 12 4\\\\n3 12 1\\\(...TRUNCATED) | 0.5 | 0 | 0 | null |
prime_rl_code_10166 | "Oliver and Nova are true lovers. Inspite of knowing that Nova will die Oliver married her at the la(...TRUNCATED) | "{\"test_cases\": \"{\\\"inputs\\\": [\\\"5\\\\n1\\\\n2\\\\n3\\\\n4\\\\n5\\\\n\\\", \\\"5\\\\n6\\\\n(...TRUNCATED) | 0.1 | 0 | 0 | null |
prime_rl_code_10168 | "You are given two positive integer numbers x and y. An array F is called an y-factorization of x if(...TRUNCATED) | "{\"test_cases\": \"{\\\"inputs\\\": [\\\"2\\\\n6 3\\\\n4 2\\\\n\\\", \\\"1\\\\n65536 1000000\\\\n\\(...TRUNCATED) | 0.142857 | 0 | 1 | null |
prime_rl_code_10203 | "Snuke, who loves animals, built a zoo.\n\nThere are N animals in this zoo. They are conveniently nu(...TRUNCATED) | "{\"test_cases\": \"{\\\"inputs\\\": [\\\"10\\\\noxooxoxoox\\\", \\\"6\\\\nooxoox\\\", \\\"3\\\\noox(...TRUNCATED) | 0.8 | 0 | 0.5 | null |
prime_rl_code_10206 | "You are given an integer N. Let A be an N \\times N grid such that A_{i, j} = i + N\\cdot(j-1) for (...TRUNCATED) | "{\"test_cases\": \"{\\\"inputs\\\": [\\\"5\\\\n5 0\\\\n6 1\\\\n7 0\\\\n8 1\\\\n9 0\\\\n\\\", \\\"5\(...TRUNCATED) | 0 | 0 | 1 | null |
End of preview. Expand in Data Studio
README.md exists but content is empty.
- Downloads last month
- 32