problem_id stringlengths 8 30 ⌀ | prompt stringlengths 26 52.3k | verification_info stringlengths 18 49.4M | deepseek-ai/DeepSeek-R1-0528_avg_reward float64 0 1 ⌀ |
|---|---|---|---|
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"} | 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"} | 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"} | 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... | 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"} | 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... | null |
prime_rl_code_10022 | "You are given two arrays A and B which are permutation of first n numbers.\n\nYou need to make both(...TRUNCATED) | "{\"test_cases\": \"{\\\"inputs\\\": [\\\"20\\\\n100\\\\n1 1\\\\n88 10 8 62 86 73 91 58 40 74 57 81 (...TRUNCATED) | null |
prime_rl_code_10024 | "PROBLEM SPECIFICATION:\nYou are given three positive integers 'n' , 'a' and 'b' . In the given ran(...TRUNCATED) | "{\"test_cases\": \"{\\\"inputs\\\": [\\\"1\\\\n24 5 3\\\\n\\\\nSAMPLE\\\", \\\"11\\\\n24 5 3\\\\n10(...TRUNCATED) | null |
prime_rl_code_1003 | "# Task\nWe know that some numbers can be split into two primes. ie. `5 = 2 + 3, 10 = 3 + 7`. But so(...TRUNCATED) | "{\"test_cases\": \"{\\\"fn_name\\\": \\\"prime_product\\\", \\\"inputs\\\": [[1], [3], [4], [5], [6(...TRUNCATED) | null |
prime_rl_code_10038 | "In this Kata, you will be given a number in form of a string and an integer `k` and your task is to(...TRUNCATED) | "{\"test_cases\": \"{\\\"fn_name\\\": \\\"solve\\\", \\\"inputs\\\": [[\\\"1234\\\", 1], [\\\"1234\\(...TRUNCATED) | null |
End of preview. Expand in Data Studio
README.md exists but content is empty.
- Downloads last month
- 6