hash string | ability string | data_source string | prompt list | reward_model dict |
|---|---|---|---|---|
7b3a48823cd08358ca1e725ab940354c | code | coder1_longcot | [
{
"content": "Solve the following coding problem using the programming language python:\n\nDreamoon loves summing up something for no reason. One day he obtains two integers a and b occasionally. He wants to calculate the sum of all nice integers. Positive integer x is called nice if $\\operatorname{mod}(x, b) ... | {
"ground_truth": "{\"inputs\": [\"1 1\\n\", \"2 2\\n\", \"4 1\\n\", \"4 2\\n\", \"4 3\\n\", \"4 4\\n\", \"3 4\\n\", \"2 4\\n\", \"1 4\\n\", \"1000 1000\\n\", \"10000000 10000000\\n\", \"10000000 9999999\\n\", \"2 10000000\\n\", \"10000000 2\\n\", \"9999999 2\\n\", \"9999999 9999999\\n\", \"10000000 10000\\n\", \"100... |
3c03186a1602e6b4a3c8645e06f87671 | code | coder1_longcot | [
{
"content": "Solve the following coding problem using the programming language python:\n\n\"QAQ\" is a word to denote an expression of crying. Imagine \"Q\" as eyes with tears and \"A\" as a mouth.\n\nNow Diamond has given Bort a string consisting of only uppercase English letters of length n. There is a great... | {
"ground_truth": "{\"inputs\": [\"QAQAQYSYIOIWIN\\n\", \"QAQQQZZYNOIWIN\\n\", \"QA\\n\", \"IAQVAQZLQBQVQFTQQQADAQJA\\n\", \"QQAAQASGAYAAAAKAKAQIQEAQAIAAIAQQQQQ\\n\", \"AMVFNFJIAVNQJWIVONQOAOOQSNQSONOASONAONQINAONAOIQONANOIQOANOQINAONOQINAONOXJCOIAQOAOQAQAQAQAQWWWAQQAQ\\n\", \"AAQQAXBQQBQQXBNQRJAQKQNAQNQVDQASAGGANQQQ... |
45835978994c3f41e17082bda084cb75 | code | coder1_longcot | [
{
"content": "Solve the following coding problem using the programming language python:\n\nCodefortia is a small island country located somewhere in the West Pacific. It consists of $n$ settlements connected by $m$ bidirectional gravel roads. Curiously enough, the beliefs of the inhabitants require the time nee... | {
"ground_truth": "{\"inputs\": [\"5 5 20 25\\n1 2 25\\n2 3 25\\n3 4 20\\n4 5 20\\n5 1 20\\n\", \"6 7 13 22\\n1 2 13\\n2 3 13\\n1 4 22\\n3 4 13\\n4 5 13\\n5 6 13\\n6 1 13\\n\", \"2 1 1 2\\n2 1 1\\n\", \"2 1 9999999 10000000\\n1 2 10000000\\n\", \"3 3 78422 6789101\\n3 1 6789101\\n2 1 78422\\n2 3 78422\\n\", \"3 3 277... |
e17bd6bd8d9d6fa85a97fc29bf92fa0d | code | coder1_longcot | [
{
"content": "Solve the following coding problem using the programming language python:\n\nVasya and Kolya play a game with a string, using the following rules. Initially, Kolya creates a string s, consisting of small English letters, and uniformly at random chooses an integer k from a segment [0, len(s) - 1]. ... | {
"ground_truth": "{\"inputs\": [\"technocup\\n\", \"tictictactac\\n\", \"bbaabaabbb\\n\", \"cbbbbcaaca\\n\", \"cadbcdddda\\n\", \"bababbdaee\\n\", \"fabbbhgedd\\n\", \"gaejllebhn\\n\", \"bbababaaababaabbbbbabbbbbbaaabbabaaaaabbbbbaaaabbbbabaabaabababbbabbabbabaaababbabbababaaaaabaaaabbb\\n\", \"eaaebccaeacdecaedcaab... |
caeec2e826110f44b8b28a78fb30573f | code | coder1_longcot | [
{
"content": "Solve the following coding problem using the programming language python:\n\nThe Little Elephant has an integer a, written in the binary notation. He wants to write this number on a piece of paper.\n\nTo make sure that the number a fits on the piece of paper, the Little Elephant ought to delete ex... | {
"ground_truth": "{\"inputs\": [\"101\\n\", \"110010\\n\", \"10000\\n\", \"1111111110\\n\", \"10100101011110101\\n\", \"111010010111\\n\", \"11110111011100000000\\n\", \"11110010010100001110110101110011110110100111101\\n\", \"1001011111010010100111111\\n\", \"1111111111\\n\", \"11111111111111111111001111010011101101... |
5d266fe7c18e142f6a9314dba0d03df9 | code | coder1_longcot | [
{
"content": "Solve the following coding problem using the programming language python:\n\nIt is so boring in the summer holiday, isn't it? So Alice and Bob have invented a new game to play. The rules are as follows. First, they get a set of n distinct integers. And then they take turns to make the following mo... | {
"ground_truth": "{\"inputs\": [\"2\\n2 3\\n\", \"2\\n5 3\\n\", \"3\\n5 6 7\\n\", \"10\\n72 96 24 66 6 18 12 30 60 48\\n\", \"10\\n78 66 6 60 18 84 36 96 72 48\\n\", \"10\\n98 63 42 56 14 77 70 35 84 21\\n\", \"2\\n1 1000000000\\n\", \"2\\n1000000000 999999999\\n\", \"3\\n2 4 6\\n\", \"2\\n4 6\\n\", \"2\\n2 6\\n\", ... |
51d7186d50fd1c0dd446e3d3ea8b8d73 | code | coder1_longcot | [
{
"content": "Solve the following coding problem using the programming language python:\n\nMad scientist Mike does not use slow hard disks. His modification of a hard drive has not one, but n different heads that can read data in parallel.\n\nWhen viewed from the side, Mike's hard drive is an endless array of t... | {
"ground_truth": "{\"inputs\": [\"3 4\\n2 5 6\\n1 3 6 8\\n\", \"3 3\\n1 2 3\\n1 2 3\\n\", \"1 2\\n165\\n142 200\\n\", \"1 2\\n5000000000\\n1 10000000000\\n\", \"2 4\\n3 12\\n1 7 8 14\\n\", \"3 3\\n1 2 3\\n2 3 4\\n\", \"2 1\\n1 10\\n9\\n\", \"3 19\\n7 10 13\\n1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19\\n\", \"3 ... |
c34413535a243ca8dabee630fbe76b4e | code | coder1_longcot | [
{
"content": "Solve the following coding problem using the programming language python:\n\nA schoolboy named Vasya loves reading books on programming and mathematics. He has recently read an encyclopedia article that described the method of median smoothing (or median filter) and its many applications in scienc... | {
"ground_truth": "{\"inputs\": [\"4\\n0 0 1 1\\n\", \"5\\n0 1 0 1 0\\n\", \"3\\n1 0 0\\n\", \"4\\n1 0 0 1\\n\", \"7\\n1 0 1 1 1 0 1\\n\", \"14\\n0 1 0 0 0 1 1 0 1 0 1 0 1 0\\n\", \"3\\n1 0 1\\n\", \"3\\n0 0 1\\n\", \"3\\n1 1 0\\n\", \"3\\n1 1 1\\n\", \"4\\n1 1 0 1\\n\", \"4\\n1 0 1 1\\n\", \"10\\n0 1 0 1 0 0 1 0 1 0... |
0ff153c65bcdfa0ff48c248d1e888140 | code | coder1_longcot | [
{
"content": "Solve the following coding problem using the programming language python:\n\nLimak is a little bear who loves to play. Today he is playing by destroying block towers. He built n towers in a row. The i-th tower is made of h_{i} identical blocks. For clarification see picture for the first sample.\n... | {
"ground_truth": "{\"inputs\": [\"6\\n2 1 4 6 2 2\\n\", \"7\\n3 3 3 1 3 3 3\\n\", \"7\\n5128 5672 5805 5452 5882 5567 5032\\n\", \"10\\n1 2 2 3 5 5 5 4 2 1\\n\", \"14\\n20 20 20 20 20 20 3 20 20 20 20 20 20 20\\n\", \"50\\n3 2 4 3 5 3 4 5 3 2 3 3 3 4 5 4 2 2 3 3 4 4 3 2 3 3 2 3 4 4 5 2 5 2 3 5 4 4 2 2 3 5 2 5 2 2 5 ... |
0ecede119f4a93897ddd3f8b9d2322f8 | code | coder1_longcot | [
{
"content": "Solve the following coding problem using the programming language python:\n\nEighth-grader Vova is on duty today in the class. After classes, he went into the office to wash the board, and found on it the number n. He asked what is this number and the teacher of mathematics Inna Petrovna answered ... | {
"ground_truth": "{\"inputs\": [\"21\\n\", \"20\\n\", \"1\\n\", \"2\\n\", \"3\\n\", \"100000001\\n\", \"1000000000\\n\", \"999999979\\n\", \"9\\n\", \"10\\n\", \"11\\n\", \"39\\n\", \"66\\n\", \"75\\n\", \"100\\n\", \"101\\n\", \"2014\\n\", \"999999994\\n\"], \"outputs\": [\"1\\n15\\n\", \"0\\n\", \"0\\n\", \"1\\n1\... |
c3fe68424d5c8380acdd9a13fb2bcd38 | code | coder1_longcot | [
{
"content": "Solve the following coding problem using the programming language python:\n\nYou are given a non-empty string s consisting of lowercase English letters. You have to pick exactly one non-empty substring of s and shift all its letters 'z' $\\rightarrow$ 'y' $\\rightarrow$ 'x' $\\rightarrow \\ldots \... | {
"ground_truth": "{\"inputs\": [\"codeforces\\n\", \"abacaba\\n\", \"babbbabaababbaa\\n\", \"bcbacaabcababaccccaaaabacbbcbbaa\\n\", \"cabaccaacccabaacdbdcbcdbccbccbabbdadbdcdcdbdbcdcdbdadcbcda\\n\", \"a\\n\", \"eeeedddccbceaabdaecaebaeaecccbdeeeaadcecdbeacecdcdcceabaadbcbbadcdaeddbcccaaeebccecaeeeaebcaaccbdaccbdcada... |
811b158b35eac12103a102b12f10da7c | code | coder1_longcot | [
{
"content": "Solve the following coding problem using the programming language python:\n\nAfter a wonderful evening in the restaurant the time to go home came. Leha as a true gentlemen suggested Noora to give her a lift. Certainly the girl agreed with pleasure. Suddenly one problem appeared: Leha cannot find h... | {
"ground_truth": "{\"inputs\": [\"4\\n1 1 1 1 1\\n3 2 5 4 5\\n1 1 5 5 10000\\n1 4 2 5 2\\n\", \"10\\n3 7 4 10 7\\n6 1 7 10 18\\n9 6 10 8 3\\n1 8 3 10 3\\n10 4 10 5 19\\n8 9 9 10 10\\n10 1 10 5 4\\n8 1 9 4 18\\n6 3 9 5 1\\n6 6 9 6 16\\n\", \"10\\n1 1 2 2 8\\n3 4 5 9 4\\n2 10 5 10 6\\n8 5 10 8 8\\n1 2 8 2 20\\n8 6 10 ... |
f5021c47be588c5cb0a7acc990f58cf8 | code | coder1_longcot | [
{
"content": "Solve the following coding problem using the programming language python:\n\nGennady is one of the best child dentists in Berland. Today n children got an appointment with him, they lined up in front of his office.\n\nAll children love to cry loudly at the reception at the dentist. We enumerate th... | {
"ground_truth": "{\"inputs\": [\"5\\n4 2 2\\n4 1 2\\n5 2 4\\n3 3 5\\n5 1 2\\n\", \"5\\n4 5 1\\n5 3 9\\n4 1 2\\n2 1 8\\n4 1 9\\n\", \"10\\n10 7 10\\n3 6 11\\n8 4 10\\n10 1 11\\n7 3 13\\n7 2 13\\n7 6 14\\n3 4 17\\n9 4 20\\n5 2 24\\n\", \"10\\n5 6 3\\n7 4 10\\n9 1 17\\n2 8 23\\n9 10 24\\n6 8 18\\n3 2 35\\n7 6 6\\n1 3 ... |
fad468c4d7507192f445729d3c0cdef0 | code | coder1_longcot | [
{
"content": "Solve the following coding problem using the programming language python:\n\nYaroslav is playing a game called \"Time\". The game has a timer showing the lifespan he's got left. As soon as the timer shows 0, Yaroslav's character dies and the game ends. Also, the game has n clock stations, station ... | {
"ground_truth": "{\"inputs\": [\"3 1000\\n1000\\n0 0\\n0 1\\n0 3\\n\", \"3 1000\\n1000\\n1 0\\n1 1\\n1 2\\n\", \"5 1421\\n896 448 727\\n-19 -40\\n-87 40\\n69 51\\n-55 61\\n-7 67\\n\", \"6 1000\\n142 712 254 869\\n7 0\\n95 38\\n96 -20\\n-7 93\\n75 -45\\n-80 -20\\n\", \"7 1288\\n943 265 649 447 806\\n-4 -51\\n-26 32\... |
70b847f33e91009117e6f69afc3b9d61 | code | coder1_longcot | [
{
"content": "Solve the following coding problem using the programming language python:\n\nSquirrel Liss lived in a forest peacefully, but unexpected trouble happens. Stones fall from a mountain. Initially Squirrel Liss occupies an interval [0, 1]. Next, n stones will fall and Liss will escape from the stones. ... | {
"ground_truth": "{\"inputs\": [\"llrlr\\n\", \"rrlll\\n\", \"lrlrr\\n\", \"lllrlrllrl\\n\", \"llrlrrrlrr\\n\", \"rlrrrllrrr\\n\", \"lrrlrrllrrrrllllllrr\\n\", \"rlrrrlrrrllrrllrlrll\\n\", \"lllrrlrlrllrrrrrllrl\\n\", \"rrrllrrrlllrlllrlrrr\\n\", \"rrlllrrrlrrlrrrlllrlrlrrrlllrllrrllrllrrlrlrrllllrlrrrrlrlllrlrrrlrl... |
06f05ea33743355af9697660fb9f09da | code | coder1_longcot | [
{
"content": "Solve the following coding problem using the programming language python:\n\nDreamoon likes coloring cells very much.\n\nThere is a row of $n$ cells. Initially, all cells are empty (don't contain any color). Cells are numbered from $1$ to $n$.\n\nYou are given an integer $m$ and $m$ integers $l_1,... | {
"ground_truth": "{\"inputs\": [\"5 3\\n3 2 2\\n\", \"10 1\\n1\\n\", \"1 1\\n1\\n\", \"2 2\\n1 2\\n\", \"200 50\\n49 35 42 47 134 118 14 148 58 159 33 33 8 123 99 126 75 94 1 141 61 79 122 31 48 7 66 97 141 43 25 141 7 56 120 55 49 37 154 56 13 59 153 133 18 1 141 24 151 125\\n\", \"3 3\\n3 3 1\\n\", \"100000 1\\n10... |
60983c5a237c58f8c7adfd7090660001 | code | coder1_longcot | [
{
"content": "Solve the following coding problem using the programming language python:\n\nYou work in a big office. It is a 9 floor building with an elevator that can accommodate up to 4 people. It is your responsibility to manage this elevator.\n\nToday you are late, so there are queues on some floors already... | {
"ground_truth": "{\"inputs\": [\"2\\n3 5\\n5 3\\n\", \"2\\n5 3\\n3 5\\n\", \"9\\n1 2\\n2 3\\n3 4\\n4 5\\n5 6\\n6 7\\n7 8\\n8 9\\n9 1\\n\", \"50\\n9 5\\n2 6\\n5 4\\n7 5\\n3 6\\n5 8\\n1 2\\n6 1\\n9 7\\n8 1\\n9 5\\n6 8\\n6 8\\n2 8\\n4 9\\n6 7\\n7 8\\n5 8\\n1 2\\n9 2\\n5 9\\n6 7\\n3 2\\n9 8\\n7 8\\n7 4\\n6 5\\n1 7\\n6 ... |
7e437f40a9c6a1c8cc0450a60244fa24 | code | coder1_longcot | [
{
"content": "Solve the following coding problem using the programming language python:\n\nToad Zitz has an array of integers, each integer is between $0$ and $m-1$ inclusive. The integers are $a_1, a_2, \\ldots, a_n$.\n\nIn one operation Zitz can choose an integer $k$ and $k$ indices $i_1, i_2, \\ldots, i_k$ s... | {
"ground_truth": "{\"inputs\": [\"5 3\\n0 0 0 1 2\\n\", \"5 7\\n0 6 1 3 2\\n\", \"10 10\\n5 0 5 9 4 6 4 5 0 0\\n\", \"4 6\\n0 3 5 1\\n\", \"6 4\\n1 3 0 2 1 0\\n\", \"10 1000\\n981 824 688 537 969 72 39 734 929 718\\n\", \"10 300000\\n111862 91787 271781 182224 260248 142019 30716 102643 141870 19206\\n\", \"100 10\\... |
4331e6a5fd972d9e49d9a6cbeb31dd95 | code | coder1_longcot | [
{
"content": "Solve the following coding problem using the programming language python:\n\nThe life goes up and down, just like nice sequences. Sequence t_1, t_2, ..., t_{n} is called nice if the following two conditions are satisfied: t_{i} < t_{i} + 1 for each odd i < n; t_{i} > t_{i} + 1 for each even i <... | {
"ground_truth": "{\"inputs\": [\"5\\n2 8 4 7 7\\n\", \"4\\n200 150 100 50\\n\", \"10\\n3 2 1 4 1 4 1 4 1 4\\n\", \"9\\n1 2 3 4 5 6 7 8 9\\n\", \"5\\n1 1 1 4 3\\n\", \"10\\n7 7 8 10 5 10 1 5 2 6\\n\", \"50\\n11836 28308 72527 92281 139289 93797 134555 148444 40866 111317 21564 87813 65466 20541 99238 2287 74647 1280... |
168294c0edec72a1057446a83d8e34c8 | code | coder1_longcot | [
{
"content": "Solve the following coding problem using the programming language python:\n\nVasya's telephone contains n photos. Photo number 1 is currently opened on the phone. It is allowed to move left and right to the adjacent photo by swiping finger over the screen. If you swipe left from the first photo, y... | {
"ground_truth": "{\"inputs\": [\"4 2 3 10\\nwwhw\\n\", \"5 2 4 13\\nhhwhh\\n\", \"5 2 4 1000\\nhhwhh\\n\", \"3 1 100 10\\nwhw\\n\", \"10 2 3 32\\nhhwwhwhwwh\\n\", \"1 2 3 3\\nw\\n\", \"100 20 100 10202\\nwwwwhhwhhwhhwhhhhhwwwhhhwwwhwwhwhhwwhhwwwhwwhwwwhwhwhwwhhhwhwhhwhwwhhwhwhwwwhwwwwhwhwwwwhwhhhwhwhwww\\n\", \"20 ... |
7073b9e4a70b147bfa32fae21323bd44 | code | coder1_longcot | [
{
"content": "Solve the following coding problem using the programming language python:\n\nDoubly linked list is one of the fundamental data structures. A doubly linked list is a sequence of elements, each containing information about the previous and the next elements of the list. In this problem all lists hav... | {
"ground_truth": "{\"inputs\": [\"7\\n4 7\\n5 0\\n0 0\\n6 1\\n0 2\\n0 4\\n1 0\\n\", \"2\\n2 0\\n0 1\\n\", \"1\\n0 0\\n\", \"4\\n0 2\\n1 0\\n0 4\\n3 0\\n\", \"5\\n0 0\\n0 0\\n0 0\\n0 0\\n0 0\\n\", \"2\\n0 0\\n0 0\\n\", \"2\\n0 2\\n1 0\\n\", \"5\\n5 3\\n4 0\\n1 4\\n3 2\\n0 1\\n\", \"5\\n2 0\\n0 1\\n0 4\\n3 5\\n4 0\\n\... |
ac13aba5a034cdeedc18218906a991eb | code | coder1_longcot | [
{
"content": "Solve the following coding problem using the programming language python:\n\nHooray! Berl II, the king of Berland is making a knight tournament. The king has already sent the message to all knights in the kingdom and they in turn agreed to participate in this grand event.\n\nAs for you, you're jus... | {
"ground_truth": "{\"inputs\": [\"4 3\\n1 2 1\\n1 3 3\\n1 4 4\\n\", \"8 4\\n3 5 4\\n3 7 6\\n2 8 8\\n1 8 1\\n\", \"2 1\\n1 2 1\\n\", \"2 1\\n1 2 2\\n\", \"3 1\\n1 3 1\\n\", \"3 1\\n1 3 2\\n\", \"3 1\\n1 3 3\\n\", \"3 2\\n1 2 1\\n1 3 3\\n\", \"3 2\\n1 2 2\\n1 3 2\\n\", \"3 2\\n2 3 3\\n1 3 3\\n\", \"11 6\\n1 2 2\\n7 8 ... |
814ceb45da90093109cab93ae473ea9d | code | coder1_longcot | [
{
"content": "Solve the following coding problem using the programming language python:\n\nWe all know the impressive story of Robin Hood. Robin Hood uses his archery skills and his wits to steal the money from rich, and return it to the poor.\n\nThere are n citizens in Kekoland, each person has c_{i} coins. Ea... | {
"ground_truth": "{\"inputs\": [\"4 1\\n1 1 4 2\\n\", \"3 1\\n2 2 2\\n\", \"10 20\\n6 4 7 10 4 5 5 3 7 10\\n\", \"30 7\\n3 3 2 2 2 2 3 4 4 5 2 1 1 5 5 3 4 3 2 1 3 4 3 2 2 5 2 5 1 2\\n\", \"2 0\\n182 2\\n\", \"123 54564\\n38 44 41 42 59 3 95 15 45 32 44 69 35 83 94 57 65 85 64 47 24 20 34 86 26 91 98 12 36 96 80 4 70... |
7020d70dd984ee91d79435196e77e78b | code | coder1_longcot | [
{
"content": "Solve the following coding problem using the programming language python:\n\nBob recently read about bitwise operations used in computers: AND, OR and XOR. He have studied their properties and invented a new game.\n\nInitially, Bob chooses integer m, bit depth of the game, which means that all num... | {
"ground_truth": "{\"inputs\": [\"3 3\\na := 101\\nb := 011\\nc := ? XOR b\\n\", \"5 1\\na := 1\\nbb := 0\\ncx := ? OR a\\nd := ? XOR ?\\ne := d AND bb\\n\", \"2 10\\nb := 0100101101\\na := ? XOR b\\n\", \"1 10\\na := 0110110011\\n\", \"1 6\\na := ? OR ?\\n\", \"13 6\\na := 111010\\nb := 100100\\nc := 001110\\nd := ... |
aca032762cc90a0e85fffc932f55e7e4 | code | coder1_longcot | [
{
"content": "Solve the following coding problem using the programming language python:\n\nVasya is an active Internet user. One day he came across an Internet resource he liked, so he wrote its address in the notebook. We know that the address of the written resource has format: <protocol>://<domain>.ru[/<cont... | {
"ground_truth": "{\"inputs\": [\"httpsunrux\\n\", \"ftphttprururu\\n\", \"httpuururrururruruurururrrrrurrurrurruruuruuu\\n\", \"httpabuaruauabbaruru\\n\", \"httpuurrruurruuruuruuurrrurururuurruuuuuuruurr\\n\", \"httpruhhphhhpuhruruhhpruhhphruhhru\\n\", \"httpftprftprutprururftruruftptp\\n\", \"httpfttpftpfttftpftpf... |
a6311c56ccadd21148ddbaea83d3d968 | code | coder1_longcot | [
{
"content": "Solve the following coding problem using the programming language python:\n\nAs technologies develop, manufacturers are making the process of unlocking a phone as user-friendly as possible. To unlock its new phone, Arkady's pet dog Mu-mu has to bark the password once. The phone represents a passwo... | {
"ground_truth": "{\"inputs\": [\"ya\\n4\\nah\\noy\\nto\\nha\\n\", \"hp\\n2\\nht\\ntp\\n\", \"ah\\n1\\nha\\n\", \"bb\\n4\\nba\\nab\\naa\\nbb\\n\", \"bc\\n4\\nca\\nba\\nbb\\ncc\\n\", \"ba\\n4\\ncd\\nad\\ncc\\ncb\\n\", \"pg\\n4\\nzl\\nxs\\ndi\\nxn\\n\", \"bn\\n100\\ndf\\nyb\\nze\\nml\\nyr\\nof\\nnw\\nfm\\ndw\\nlv\\nzr... |
Dataset Summary
This dataset is a high-quality subset of the Klear-Reasoner Code RL dataset, derived from the RL data used in the rllm project. Part of this data contributed to training Klear-Reasoner’s code reasoning models. The dataset is carefully cleaned and filtered to include only reliable samples suitable for reinforcement learning. Models trained with this dataset have shown substantial performance improvements across various code reasoning benchmarks. You can load the dataset via the Hugging Face datasets library:
from datasets import load_dataset
dataset = load_dataset("Kwai-Klear/KlearReasoner-CodeSub-15K")
| Resource | Link |
|---|---|
| 📝 Preprints | Paper |
| 🤗 Daily Paper | Paper |
| 🤗 Model Hub | Klear-Reasoner-8B |
| 🤗 Dataset Hub | Math RL |
| 🤗 Dataset Hub | Code RL |
| 🐛 Issues & Discussions | GitHub Issues |
| 📧 Contact | [email protected] |
Data Fields
- data_source (string) — The source identifier for the sample.
- prompt (list of dict) — The input prompt, stored as a list of message objects in chat format.
- ability (string) — The skill or task category associated with the sample.
- reward_model (dict) — Information about the ground truth or reward signal.
- ground_truth (string) — The expected correct answer (may include LaTeX formatting).
- style (string) — The method or type of evaluation, e.g., "rule".
- index_level_0 (int) — An internal index or unique identifier for the sample.
Demonstration of Data Quality
This dataset contains exclusively high-quality, filtered samples.
All samples have been selected to ensure accurate reward signals for reinforcement learning, following the gradient-preserving clipping policy optimization (GPPO) method introduced in our paper. Models trained using this dataset achieve strong generalization and reliable performance on a range of math reasoning tasks.
Citation
If you find this work helpful, please cite our paper:
@misc{su2025cegppocontrollingentropygradientpreserving,
title={CE-GPPO: Controlling Entropy via Gradient-Preserving Clipping Policy Optimization in Reinforcement Learning},
author={Zhenpeng Su and Leiyu Pan and Minxuan Lv and Yuntao Li and Wenping Hu and Fuzheng Zhang and Kun Gai and Guorui Zhou},
year={2025},
eprint={2509.20712},
archivePrefix={arXiv},
primaryClass={cs.LG},
url={https://arxiv.org/abs/2509.20712},
}
@article{DBLP:journals/corr/abs-2508-07629,
author = {Zhenpeng Su and
Leiyu Pan and
Xue Bai and
Dening Liu and
Guanting Dong and
Jiaming Huang and
Wenping Hu and
Fuzheng Zhang and
Kun Gai and
Guorui Zhou},
title = {Klear-Reasoner: Advancing Reasoning Capability via Gradient-Preserving
Clipping Policy Optimization},
journal = {CoRR},
volume = {abs/2508.07629},
year = {2025},
url = {https://doi.org/10.48550/arXiv.2508.07629},
doi = {10.48550/ARXIV.2508.07629},
eprinttype = {arXiv},
eprint = {2508.07629},
timestamp = {Sat, 13 Sep 2025 14:46:27 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2508-07629.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
- Downloads last month
- 47