problem_id string | prompt string | verification_info string | Qwen/Qwen3-32B_responses int64 | Qwen/Qwen3-4B_responses int64 | deepseek-ai/DeepSeek-R1-0528-Qwen3-8B_responses int64 | Qwen/Qwen3-32B_avg_reward float64 | Qwen/Qwen3-4B_avg_reward float64 | deepseek-ai/DeepSeek-R1-0528-Qwen3-8B_avg_reward float64 | deepseek-ai/DeepSeek-R1-0528_responses list | deepseek-ai/DeepSeek-R1-0528_avg_reward float64 |
|---|---|---|---|---|---|---|---|---|---|---|
prime_rl_code_1 | 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. For example, if there ... | {"test_cases": "{\"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 1000000000\\n... | null | null | 2 | null | null | 0.5 | null | null |
prime_rl_code_100 | Watson gives Sherlock an array $\mbox{A}$ of $N$ elements and two arrays $\mbox{B}$ and $\mbox{C}$, of $\mbox{M}$ elements each. Then he asks Sherlock to perform the following program:
for i = 1 to M do
for j = 1 to N do
if j % B[i] == 0 then
A[j] = A[j] * C[i]
endif
end do
end do
... | {"test_cases": "{\"inputs\": [\"3 3\\n5 10 20\\n1 2 3\\n2 3 5\\n\", \"4 2\\n1 2 3 4\\n1 3\\n10 20\\n\", \"5 2\\n1 2 3 4 5\\n1 5\\n2 3\\n\", \"3 3\\n1 3 5\\n1 2 3\\n2 3 4\\n\", \"2 2\\n100000 200000\\n1 2\\n100000 200000\\n\", \"3 3\\n100000 200000 300000\\n1 2 3\\n100000 200000 300000\\n\"], \"outputs\": [\"10 60 200\"... | 5 | 16 | 2 | 1 | 1 | 1 | null | null |
prime_rl_code_1000 | ##Task:
You have to write a function **pattern** which creates the following pattern upto n number of rows. *If the Argument is 0 or a Negative Integer then it should return "" i.e. empty string.*
##Examples:
pattern(4):
1234
234
34
4
pattern(6):
123456
23456
3456
456
5... | {"test_cases": "{\"fn_name\": \"pattern\", \"inputs\": [[1], [2], [5], [0], [-25]], \"outputs\": [[\"1\"], [\"12\\n2\"], [\"12345\\n2345\\n345\\n45\\n5\"], [\"\"], [\"\"]]}", "style": "rule"} | 2 | 4 | 2 | 0 | 0 | 0 | null | null |
prime_rl_code_10000 | Given the string s, return the size of the longest substring containing each vowel an even number of times. That is, 'a', 'e', 'i', 'o', and 'u' must appear an even number of times.
Example 1:
Input: s = "eleetminicoworoep"
Output: 13
Explanation: The longest substring is "leetminicowor" which contains two each of th... | {"test_cases": "{\"fn_name\": \"findTheLongestSubstring\", \"inputs\": [[\"apple\"], [\"peach\"], [\"banana\"], [\"grapefruit\"], [\"strawberry\"], [\"a\"], [\"eae\"], [\"aeiou\"], [\"aeiouaeiou\"], [\"bananaaa\"]], \"outputs\": [[3], [2], [5], [2], [3], [0], [0], [0], [10], [7]]}", "style": "rule"} | 10 | 15 | 4 | 0 | 0 | 0 | null | null |
prime_rl_code_10001 | Title: Forbidden Indices
Time Limit: None seconds
Memory Limit: None megabytes
Problem Description:
You are given a string *s* consisting of *n* lowercase Latin letters. Some indices in this string are marked as forbidden.
You want to find a string *a* such that the value of |*a*|·*f*(*a*) is maximum possible, wher... | {"test_cases": "{\"inputs\": [\"5\\nababa\\n00100\", \"5\\nababa\\n00000\", \"5\\nababa\\n11111\", \"100\\neebdeddddbecdbddaaecbbaccbecdeacedddcaddcdebedbabbceeeadecadbbeaecdaeabbceacbdbdbbdacebbbccdcbbeedbe\\n1101101101110110001000001101001000100001010111001001111000111011000111111010110100000111001100100000\", \"100\... | 13 | 16 | 5 | 0.769231 | 0.25 | 0.4 | null | null |
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"} | 14 | 31 | 4 | 0.071429 | 0 | 0.5 | null | null |
prime_rl_code_10004 | Margriet A. is in pizza heaven! She has bought a one-day access pass to Pizza World. Pizza World is a food festival, where all stands have their own special type of pizza. Margriet would really like to try many different types of pizza, but she thinks that she can only eat two pizzas in total. Therefore, she has come u... | {"test_cases": "{\"inputs\": [\"5 5\\n1 4 6 2 100\\n0 1\\n1 2\\n0 3\\n2 4\\n3 4\\n\", \"3 2\\n1 0 1\\n0 1\\n1 2\\n\", \"3 2\\n3 2 1\\n0 1\\n1 2\\n\"], \"outputs\": [\"100\\n\", \"1.5\\n\", \"4.25\\n\"]}", "style": "rule"} | 6 | null | 3 | 0.833333 | null | 0 | null | null |
prime_rl_code_10005 | Harsh, like usual, started studying 6 months before for his end semester examinations. He was going to complete his 8th revision of the whole syllabus, when suddenly Pranav showed up in his room with the last year's question paper for their algorithms course. This paper contains a problem which both of them couldn't so... | {"test_cases": "{\"inputs\": [\"5 2\\n14 6 7 21 10\\n\", \"3 3\\n1 2 50000\\n\"], \"outputs\": [\"12\", \"16668\"]}", "style": "rule"} | 5 | 11 | 1 | 0 | 0 | 0 | null | null |
prime_rl_code_10006 | We guessed some integer number x. You are given a list of almost all its divisors. Almost all means that there are all divisors except 1 and x in the list.
Your task is to find the minimum possible integer x that can be the guessed number, or say that the input data is contradictory and it is impossible to find such n... | {"test_cases": "{\"inputs\": [\"2\\n8\\n8 2 12 6 4 24 16 3\\n1\\n2\\n\", \"25\\n1\\n19\\n1\\n2\\n1\\n4\\n2\\n2 4\\n1\\n5\\n2\\n2 5\\n2\\n4 5\\n3\\n5 2 4\\n1\\n10\\n2\\n2 10\\n2\\n10 4\\n3\\n2 10 4\\n2\\n10 5\\n3\\n2 5 10\\n3\\n10 4 5\\n4\\n2 5 10 4\\n1\\n20\\n2\\n20 2\\n2\\n4 20\\n3\\n4 2 20\\n2\\n5 20\\n3\\n2 20 5\\n3... | 12 | 15 | 5 | 1 | 1 | 0.8 | null | null |
prime_rl_code_10007 | In late autumn evening n robots gathered in the cheerful company of friends. Each robot has a unique identifier — an integer from 1 to 109.
At some moment, robots decided to play the game "Snowball". Below there are the rules of this game. First, all robots stand in a row. Then the first robot says his identifier. Aft... | {"test_cases": "{\"inputs\": [\"4 5\\n10 4 18 3\\n\", \"2 2\\n1 2\\n\", \"4 9\\n5 1000000000 999999999 12\\n\", \"4 6\\n5 1000000000 999999999 12\\n\", \"1 1\\n4\\n\", \"3 5\\n4 5 6\\n\", \"3 4\\n4 5 6\\n\", \"3 6\\n4 5 6\\n\", \"4 2\\n5 1000000000 999999999 12\\n\", \"2 3\\n6 7\\n\", \"2 1\\n5 1\\n\", \"4 1\\n5 100000... | 20 | 34 | 4 | 1 | 1 | 0.75 | null | null |
prime_rl_code_10008 | Organising a group trip for the elderly can be a daunting task... Not least because of the fussy participants, each of whom will only make the trip on condition that some other participant also comes.
After some effort, you have taken from each of your participants a number, indicating that this participant will refus... | {"test_cases": "{\"inputs\": [\"4 4\\n1 2 3 4\\n\", \"12 3\\n2 3 4 5 6 7 4 7 8 8 12 12\\n\", \"5 4\\n2 3 1 5 4\\n\"], \"outputs\": [\"4\\n\", \"2\\n\", \"3\\n\"]}", "style": "rule"} | 3 | null | 1 | 1 | null | 0 | null | null |
prime_rl_code_1001 | Given the list of numbers, you are to sort them in non decreasing order.
Input
t – the number of numbers in list, then t lines follow [t <= 10^6].
Each line contains one integer: N [0 <= N <= 10^6]
Output
Output given numbers in non decreasing order.
Example
Input:
5
5
3
6
7
1
Output:
1
3
5
6
7
Write Python c... | {"test_cases": "{\"inputs\": [\"5\\n5\\n3\\n6\\n7\\n1\", \"5\\n5\\n3\\n3\\n7\\n1\", \"5\\n0\\n3\\n3\\n7\\n1\", \"5\\n1\\n3\\n3\\n7\\n1\", \"5\\n1\\n3\\n3\\n7\\n2\", \"5\\n1\\n1\\n3\\n7\\n2\", \"5\\n1\\n1\\n3\\n11\\n2\", \"5\\n1\\n1\\n3\\n11\\n4\", \"5\\n1\\n0\\n3\\n11\\n4\", \"5\\n1\\n0\\n3\\n17\\n4\", \"5\\n1\\n0\\n3\... | 5 | 23 | 3 | 1 | 1 | 0.666667 | null | null |
prime_rl_code_10011 | Mary has just graduated from one well-known University and is now attending celebration party. Students like to dream of a beautiful life, so they used champagne glasses to construct a small pyramid. The height of the pyramid is n. The top level consists of only 1 glass, that stands on 2 glasses on the second level (co... | {"test_cases": "{\n \"inputs\": [\n \"3 5\\n\",\n \"4 8\\n\",\n \"1 1\\n\",\n \"10 10000\\n\",\n \"1 10000\\n\",\n \"10 1\\n\",\n \"1 0\\n\",\n \"10 0\\n\",\n \"10 1022\\n\",\n \"10 1023\\n\",\n \"10 1024\\n\",\n \"1 2\\n\",\n \"1 200\\n\",\n \"7 128\\n\",\n \"8 198\\n\",\n... | 11 | 17 | 3 | 1 | 1 | 0.666667 | null | null |
prime_rl_code_10012 | Cars! Where do they come from? Where do they go? Nobody knows. They appear where roads have been built, as if out of nowhere. Some say that no two cars are alike. Some say that if you look closely, you can see the pale ghosts of miserable humans inside them, trapped forever—particularly in the morning and late afternoo... | {"test_cases": "{\"inputs\": [\"4\\n1 2 3\\n6 2 3\\n10 2 3\\n16 3 4\\n\", \"6\\n4 1 5\\n9 8 7\\n13 3 5\\n21 5 7\\n30 9 1\\n2019 20 0\\n\"], \"outputs\": [\"0.4\\n0\\n0.2\\n0.171428571429\\n0.228571428571\\n\", \"0.166666666667\\n0.466666666667\\n0.150000000000\\n0.108333333333\\n0.091666666667\\n0.016666666667\\n0.0000... | null | null | 1 | null | null | 0 | null | null |
prime_rl_code_10013 | The problem set at CODE FESTIVAL 20XX Finals consists of N problems.
The score allocated to the i-th (1≦i≦N) problem is i points.
Takahashi, a contestant, is trying to score exactly N points. For that, he is deciding which problems to solve.
As problems with higher scores are harder, he wants to minimize the highest... | {"test_cases": "{\"inputs\": [\"4\", \"7\", \"1\", \"14\", \"2\", \"3\", \"8\", \"12\", \"21\", \"5\", \"9\", \"17\", \"31\", \"32\", \"10\", \"41\", \"13\", \"80\", \"101\", \"111\", \"6\", \"11\", \"25\", \"16\", \"30\", \"40\", \"22\", \"57\", \"44\", \"19\", \"33\", \"15\", \"001\", \"38\", \"18\", \"27\", \"26\", ... | 11 | 10 | 5 | 1 | 1 | 0.2 | null | null |
prime_rl_code_10014 | The problem is to check whether the decimal representation of a given binary number is divisible by 5 or not.
Example 1:
Input: bin = "1010"
Output: "Yes"
Explanation: Decimal equivalent is
10 which is divisible by 5.
ââ¬â¹Example 2:
Input: bin = "1110"
Output: "No"
Explanation: Decimal equivalent is
14 which is not... | {"test_cases": "{\"fn_name\": \"isDivisibleBy5\", \"inputs\": [[\"1001\"], [\"1011\"], [\"11100\"], [\"1000\"], [\"10100\"], [\"1\"], [\"0\"], [\"101\"], [\"1111\"], [\"100\"], [\"10000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\"], [\"1111111111111111111111111111111... | 4 | 11 | 2 | 0 | 0 | 0 | null | null |
prime_rl_code_10015 | Title: Did you mean...
Time Limit: None seconds
Memory Limit: None megabytes
Problem Description:
Beroffice text editor has a wide range of features that help working with text. One of the features is an automatic search for typos and suggestions of how to fix them.
Beroffice works only with small English letters (... | {"test_cases": "{\"inputs\": [\"hellno\", \"abacaba\", \"asdfasdf\", \"ooo\", \"moyaoborona\", \"jxegxxx\", \"orfyaenanabckumulsboloyhljhacdgcmnooxvxrtuhcslxgslfpnfnyejbxqisxjyoyvcvuddboxkqgbogkfz\", \"zxdgmhsjotvajkwshjpvzcuwehpeyfhakhtlvuoftkgdmvpafmxcliqvrztloocziqdkexhzcbdgxaoyvte\", \"niblehmwtycadhbfuginpyafszjbu... | 11 | 4 | 2 | 0.636364 | 0.25 | 1 | null | null |
prime_rl_code_10017 | You are given a range of positive integers from l to r.
Find such a pair of integers (x, y) that l ≤ x, y ≤ r, x ≠ y and x divides y.
If there are multiple answers, print any of them.
You are also asked to answer T independent queries.
Input
The first line contains a single integer T (1 ≤ T ≤ 1000) — the number of... | {"test_cases": "{\"inputs\": [\"3\\n1 10\\n3 14\\n1 10\\n\", \"1\\n69696969 998244353\\n\", \"1\\n696969 100000000\\n\", \"3\\n6969 696969\\n6969 696969\\n6969 696969\\n\", \"3\\n1 10\\n3 14\\n1 10\\n\", \"1\\n81363505 998244353\\n\", \"1\\n1163931 100000000\\n\", \"3\\n6969 696969\\n6969 49805\\n6969 696969\\n\", \"3\... | 8 | 8 | 2 | 0.25 | 0.375 | 1 | null | null |
prime_rl_code_10018 | This year $p$ footballers and $q$ cricketers have been invited to participate in IPL (Indian Programming League) as guests. You have to accommodate them in $r$ rooms such that-
- No room may remain empty.
- A room may contain either only footballers or only cricketers, not both.
- No cricketers are allowed to stay alon... | {"test_cases": "{\"inputs\": [[\"4\", \"2 1 4\", \"2 4 4\", \"2 5 4\", \"2 8 4\"]], \"outputs\": [[\"0\", \"3\", \"10\", \"609\"]]}", "style": "rule"} | 5 | 1 | 3 | 0 | 0 | 0 | null | null |
prime_rl_code_10019 | Vasya plays the Plane of Tanks.
Tanks are described with the following attributes:
* the number of hit points;
* the interval between two gun shots (the time required to recharge the gun);
* the probability that the gun shot will not pierce armor of the enemy tank;
* the damage to the enemy's tank.
Th... | {"test_cases": "{\"inputs\": [\"100 3 50 50 0\\n100 2 48 50 0\\n\", \"100 3 50 50 0\\n100 1 50 50 50\\n\", \"100 3 50 50 0\\n100 3 50 50 0\\n\", \"61 14 20 26 37\\n11 1 29 39 79\\n\", \"140 16 46 49 91\\n151 11 26 49 88\\n\", \"37 21 16 33 71\\n191 20 46 50 63\\n\", \"97 14 23 41 97\\n90 19 17 31 9\\n\", \"200 3 31 41 ... | 1 | null | 1 | 0 | null | 0 | null | null |
prime_rl_code_1002 | Title: Power Substring
Time Limit: None seconds
Memory Limit: None megabytes
Problem Description:
You are given *n* positive integers *a*1,<=*a*2,<=...,<=*a**n*.
For every *a**i* you need to find a positive integer *k**i* such that the decimal notation of 2*k**i* contains the decimal notation of *a**i* as a substri... | {"test_cases": "{\"inputs\": [\"2\\n8\\n2\", \"2\\n3\\n4857\", \"7\\n1\\n7\\n9\\n5\\n6\\n10\\n4\", \"10\\n384\\n179\\n982\\n466\\n646\\n226\\n759\\n798\\n291\\n852\", \"10\\n677\\n958\\n20\\n169\\n441\\n752\\n24\\n809\\n41\\n96\", \"10\\n31\\n362\\n396\\n661\\n314\\n803\\n366\\n124\\n748\\n875\", \"50\\n415546\\n649349... | 6 | 9 | 1 | 0 | 0 | 0 | null | null |
prime_rl_code_10021 | One day student Vasya was sitting on a lecture and mentioned a string s_1s_2... s_{n}, consisting of letters "a", "b" and "c" that was written on his desk. As the lecture was boring, Vasya decided to complete the picture by composing a graph G with the following properties: G has exactly n vertices, numbered from 1 t... | {"test_cases": "{\n \"inputs\": [\n \"2 1\\n1 2\\n\",\n \"4 3\\n1 2\\n1 3\\n1 4\\n\",\n \"4 4\\n1 2\\n1 3\\n1 4\\n3 4\\n\",\n \"1 0\\n\",\n \"8 28\\n3 2\\n4 2\\n7 4\\n6 3\\n3 7\\n8 1\\n3 4\\n5 1\\n6 5\\n5 3\\n7 1\\n5 8\\n5 4\\n6 1\\n6 4\\n2 1\\n4 1\\n8 2\\n7 2\\n6 8\\n8 4\\n6 7\\n3 1\\n7 8\\n3 8\\n5 7\\... | 3 | null | 3 | 0 | null | 0 | null | null |
End of preview. Expand in Data Studio
README.md exists but content is empty.
- Downloads last month
- 26