id stringlengths 0 64 | source_dataset stringclasses 6
values | source_split stringclasses 5
values | source_kind stringclasses 8
values | messages listlengths 2 54 | metadata_json stringlengths 16 26.8k |
|---|---|---|---|---|---|
b60fb32e65fed3ec2eb895cbe43479cf064ac5bfd48d09ddedbf6eec95ae7997 | nvidia/OpenCodeReasoning-2 | python | ocr2::python | [
{
"role": "user",
"content": "Incinerate\n\nTo destroy humanity, The Monster Association sent $$$n$$$ monsters to Earth's surface. The $$$i$$$-th monster has health $$$h_i$$$ and power $$$p_i$$$.\n\nWith his last resort attack, True Spiral Incineration Cannon, Genos can deal $$$k$$$ damage to all monsters a... | {"difficulty": "1200", "judgement": "right", "license": "apache-2.0", "ocr_repo": "nvidia/OpenCodeReasoning-2", "ocr_split": "python", "pass_rate": -1.0, "question_direct": false, "question_id": "4a1f32dbb150279176b57183fb92596f", "question_index": 1084, "question_source_dataset": "open-r1/codeforces", "question_source... |
e0ed5a3e86a938085febf7b7692fab86d9ca91167270e2b18ce26cb47802bf35 | nvidia/OpenCodeReasoning-2 | python | ocr2::python | [
{
"role": "user",
"content": "Three Friends\n\nThree friends are going to meet each other. Initially, the first friend stays at the position $$$x = a$$$, the second friend stays at the position $$$x = b$$$ and the third friend stays at the position $$$x = c$$$ on the coordinate axis $$$Ox$$$.\n\nIn one minu... | {"difficulty": "900", "judgement": "right", "license": "apache-2.0", "ocr_repo": "nvidia/OpenCodeReasoning-2", "ocr_split": "python", "pass_rate": -1.0, "question_direct": false, "question_id": "c6faadc27596d9acecdc1977a050fb1b", "question_index": 7475, "question_source_dataset": "open-r1/codeforces", "question_source_... |
043930802d28d4331d754c5b94ac6d30c16c8628c5e4a93b94c329411c0bb1d5 | nvidia/OpenCodeReasoning-2 | python | ocr2::python | [
{
"role": "user",
"content": "Toad Ivan has $m$ pairs of integers, each integer is between $1$ and $n$, inclusive. The pairs are $(a_1, b_1), (a_2, b_2), \\ldots, (a_m, b_m)$. \n\nHe asks you to check if there exist two integers $x$ and $y$ ($1 \\leq x < y \\leq n$) such that in each given pair at least one... | {"difficulty": "interview", "judgement": "right", "license": "apache-2.0", "ocr_repo": "nvidia/OpenCodeReasoning-2", "ocr_split": "python", "pass_rate": 1.0, "question_direct": false, "question_id": "515db510fcd82a26994eb112cdee45fb", "question_index": 907, "question_source_dataset": "apps", "question_source_split": "t... |
303da083a10826d7e5109b3bcc1edf28ff3d26d13f445dc59e1718698b493498 | nvidia/OpenCodeReasoning-2 | python | ocr2::python | [
{
"role": "user",
"content": "Long Inversions\n\nA binary string $$$s$$$ of length $$$n$$$ is given. A binary string is a string consisting only of the characters '1' and '0'.\n\nYou can choose an integer $$$k$$$ ($$$1 \\le k \\le n$$$) and then apply the following operation any number of times: choose $$$k... | {"difficulty": "1700", "judgement": "right", "license": "apache-2.0", "ocr_repo": "nvidia/OpenCodeReasoning-2", "ocr_split": "python", "pass_rate": -1.0, "question_direct": false, "question_id": "a1c677d6d73a5116cf0a168affb8626c", "question_index": 3295, "question_source_dataset": "open-r1/codeforces", "question_source... |
f2da8ff16fb4abbcf5ffc5c4ab6f09210a1d4d621528eefc61847c9ad8f385d5 | nvidia/OpenCodeReasoning-2 | python | ocr2::python | [
{
"role": "user",
"content": "On a random day, Neko found $n$ treasure chests and $m$ keys. The $i$-th chest has an integer $a_i$ written on it and the $j$-th key has an integer $b_j$ on it. Neko knows those chests contain the powerful mysterious green Grapes, thus Neko wants to open as many treasure chests... | {"difficulty": "interview", "judgement": "right", "license": "apache-2.0", "ocr_repo": "nvidia/OpenCodeReasoning-2", "ocr_split": "python", "pass_rate": 1.0, "question_direct": false, "question_id": "b652719cac8f76f257fcd8edc6c4287f", "question_index": 1279, "question_source_dataset": "apps", "question_source_split": "... |
2cf6a46be09e1ee6f04600a985dd1217e5585d6247389fec989b2699d22c791f | nvidia/OpenCodeReasoning-2 | python | ocr2::python | [
{
"role": "user",
"content": "Consider a linear function f(x) = Ax + B. Let's define g^{(0)}(x) = x and g^{(}n)(x) = f(g^{(}n - 1)(x)) for n > 0. For the given integer values A, B, n and x find the value of g^{(}n)(x) modulo 10^9 + 7.\n\n\n-----Input-----\n\nThe only line contains four integers A, B, n and ... | {"difficulty": "interview", "judgement": "right", "license": "apache-2.0", "ocr_repo": "nvidia/OpenCodeReasoning-2", "ocr_split": "python", "pass_rate": 1.0, "question_direct": false, "question_id": "b728fe5dd3c05de0a5aab0eb8a5c487b", "question_index": 706, "question_source_dataset": "apps", "question_source_split": "t... |
49b22567fbdeb2757b621d85af1c9a5cb62b427b82a136dee59c67fd9e5f9be1 | nvidia/OpenCodeReasoning-2 | python | ocr2::python | [
{
"role": "user",
"content": "Decreasing Heights\n\nYou are playing one famous sandbox game with the three-dimensional world. The map of the world can be represented as a matrix of size $$$n \\times m$$$, where the height of the cell $$$(i, j)$$$ is $$$a_{i, j}$$$.\n\nYou are in the cell $$$(1, 1)$$$ right ... | {"difficulty": "2200", "judgement": "right", "license": "apache-2.0", "ocr_repo": "nvidia/OpenCodeReasoning-2", "ocr_split": "python", "pass_rate": -1.0, "question_direct": false, "question_id": "4d2007746f59ee282b62215d9e1fdd96", "question_index": 2015, "question_source_dataset": "open-r1/codeforces", "question_source... |
9086b67f738229101cea87e497e46f7ff7a0d555985fcf1fb152a0371186ed35 | nvidia/OpenCodeReasoning-2 | python | ocr2::python | [
{
"role": "user",
"content": "Kefa decided to make some money doing business on the Internet for exactly n days. He knows that on the i-th day (1 ≤ i ≤ n) he makes a_{i} money. Kefa loves progress, that's why he wants to know the length of the maximum non-decreasing subsegment in sequence a_{i}. Let us remi... | {"difficulty": "interview", "judgement": "right", "license": "apache-2.0", "ocr_repo": "nvidia/OpenCodeReasoning-2", "ocr_split": "python", "pass_rate": 1.0, "question_direct": false, "question_id": "c010585aa3a0ede58ded26432752e867", "question_index": 1639, "question_source_dataset": "apps", "question_source_split": "... |
24fad4d479a756554f6420821125d03e5d0d25b0577b710395fa2a9845daaea6 | nvidia/OpenCodeReasoning-2 | python | ocr2::python | [
{
"role": "user",
"content": "Pasha got a very beautiful string s for his birthday, the string consists of lowercase Latin letters. The letters in the string are numbered from 1 to |s| from left to right, where |s| is the length of the given string.\n\nPasha didn't like his present very much so he decided t... | {"difficulty": "interview", "judgement": "right", "license": "apache-2.0", "ocr_repo": "nvidia/OpenCodeReasoning-2", "ocr_split": "python", "pass_rate": 1.0, "question_direct": false, "question_id": "f5967a0a56310ab095d9293d12583155", "question_index": 2140, "question_source_dataset": "apps", "question_source_split": "... |
6f3ba4c86a9bfb1a94148bc38c92324772574de8f712b5eafb9956444d516b11 | nvidia/OpenCodeReasoning-2 | python | ocr2::python | [
{
"role": "user",
"content": "Greetings\n\nThere are $$$n$$$ people on the number line; the $$$i$$$-th person is at point $$$a_i$$$ and wants to go to point $$$b_i$$$. For each person, $$$a_i < b_i$$$, and the starting and ending points of all people are distinct. (That is, all of the $$$2n$$$ numbers $$$a_... | {"difficulty": "1500", "judgement": "right", "license": "apache-2.0", "ocr_repo": "nvidia/OpenCodeReasoning-2", "ocr_split": "python", "pass_rate": -1.0, "question_direct": false, "question_id": "de8d5c86d3865d7d279b81e3f650645e", "question_index": 7914, "question_source_dataset": "open-r1/codeforces", "question_source... |
f0bed218e4dc9f467131f94110a880febf8e5babbb452d06f9ad2cb7f564d526 | nvidia/OpenCodeReasoning-2 | python | ocr2::python | [
{
"role": "user",
"content": "Petya is preparing for IQ test and he has noticed that there many problems like: you are given a sequence, find the next number. Now Petya can solve only problems with arithmetic or geometric progressions.\n\nArithmetic progression is a sequence a_1, a_1 + d, a_1 + 2d, ..., a_1... | {"difficulty": "interview", "judgement": "right", "license": "apache-2.0", "ocr_repo": "nvidia/OpenCodeReasoning-2", "ocr_split": "python", "pass_rate": 1.0, "question_direct": false, "question_id": "037d5d4eb4c302388076e8e5930668de", "question_index": 496, "question_source_dataset": "apps", "question_source_split": "t... |
738ba0b1199e7f8237e5d34ff8d66da089e00aee463d1700c00fa7162155c2e2 | nvidia/OpenCodeReasoning-2 | python | ocr2::python | [
{
"role": "user",
"content": "Tetris\n\nYou are given a following process.\n\nThere is a platform with $$$n$$$ columns. $$$1 \\times 1$$$ squares are appearing one after another in some columns on this platform. If there are no squares in the column, a square will occupy the bottom row. Otherwise a square w... | {"difficulty": "900", "judgement": "right", "license": "apache-2.0", "ocr_repo": "nvidia/OpenCodeReasoning-2", "ocr_split": "python", "pass_rate": -1.0, "question_direct": false, "question_id": "f3245a9a5f511d4f825695e6ad9b971e", "question_index": 1089, "question_source_dataset": "open-r1/codeforces", "question_source_... |
9408c5e91fce84502120c61d93290b631bae36c55a66fb294fd3ac9ff474ac6c | nvidia/OpenCodeReasoning-2 | python | ocr2::python | [
{
"role": "user",
"content": "Rudolf and Subway\n\nBuilding bridges did not help Bernard, and he continued to be late everywhere. Then Rudolf decided to teach him how to use the subway.\n\nRudolf depicted the subway map as an undirected connected graph, without self-loops, where the vertices represent stati... | {"difficulty": "2000", "judgement": "right", "license": "apache-2.0", "ocr_repo": "nvidia/OpenCodeReasoning-2", "ocr_split": "python", "pass_rate": -1.0, "question_direct": false, "question_id": "60eb0c992e6db84bc0b1f7063951255e", "question_index": 4086, "question_source_dataset": "open-r1/codeforces", "question_source... |
a8c29d84f26538e21c89f60339976b8356c7cfac9488599b11019b052f20955c | nvidia/OpenCodeReasoning-2 | python | ocr2::python | [
{
"role": "user",
"content": "Fibonacci-ish II\n\nYash is finally tired of computing the length of the longest Fibonacci-ish sequence. He now plays around with more complex things such as Fibonacci-ish potentials.\n\nFibonacci-ish potential of an array ai is computed as follows:\n\n1. Remove all elements j ... | {"difficulty": "3100", "judgement": "right", "license": "apache-2.0", "ocr_repo": "nvidia/OpenCodeReasoning-2", "ocr_split": "python", "pass_rate": -1.0, "question_direct": false, "question_id": "e700450a538ee6ddbe236012c0af85d2", "question_index": 3360, "question_source_dataset": "open-r1/codeforces", "question_source... |
6dbd21d576637c0c5c8add8b5d0c4967c1b0e5a46b2e84fe5a83af09dfa6e12a | nvidia/OpenCodeReasoning-2 | python | ocr2::python | [
{
"role": "user",
"content": "Permutation Cycle\n\nFor a permutation P[1... N] of integers from 1 to N, function f is defined as follows:\n\n$$$$\n\nLet g(i) be the minimum positive integer j such that f(i, j) = i. We can show such j always exists.\n\nFor given N, A, B, find a permutation P of integers from... | {"difficulty": "1600", "judgement": "right", "license": "apache-2.0", "ocr_repo": "nvidia/OpenCodeReasoning-2", "ocr_split": "python", "pass_rate": 1.0, "question_direct": false, "question_id": "74ebf505449a285b578ce693d1c0cbc1", "question_index": 730, "question_source_dataset": "open-r1/codeforces", "question_source_s... |
55ba2e022ae9ae862de689019ddae79ebbdc4a5d34aab58d0c11b76f9b5cfaeb | nvidia/OpenCodeReasoning-2 | python | ocr2::python | [
{
"role": "user",
"content": "Replace by MEX\n\nYou're given an array of $$$n$$$ integers between $$$0$$$ and $$$n$$$ inclusive.\n\nIn one operation, you can choose any element of the array and replace it by the MEX of the elements of the array (which may change after the operation).\n\nFor example, if the ... | {"difficulty": "1900", "judgement": "right", "license": "apache-2.0", "ocr_repo": "nvidia/OpenCodeReasoning-2", "ocr_split": "python", "pass_rate": -1.0, "question_direct": false, "question_id": "06db34454e63b5b534f9ef0d35b2e021", "question_index": 6149, "question_source_dataset": "open-r1/codeforces", "question_source... |
9f19089511856052125a2fd287d357f3a5fba754b85ebae166a14cac769cd8ee | nvidia/OpenCodeReasoning-2 | python | ocr2::python | [
{
"role": "user",
"content": "Split Plus K\n\nThere are $$$n$$$ positive integers $$$a_1, a_2, \\dots, a_n$$$ on a blackboard. You are also given a positive integer $$$k$$$. You can perform the following operation some (possibly $$$0$$$) times:\n\n- choose a number $$$x$$$ on the blackboard;\n- erase one oc... | {"difficulty": "1900", "judgement": "right", "license": "apache-2.0", "ocr_repo": "nvidia/OpenCodeReasoning-2", "ocr_split": "python", "pass_rate": -1.0, "question_direct": false, "question_id": "80a9d5b2dd59c23d1607b1e8b305bcae", "question_index": 7618, "question_source_dataset": "open-r1/codeforces", "question_source... |
769a54ae50d9a8a9dbfb0f71984c4391afd01d83f0e00a6a8f1ac3603df5f466 | nvidia/OpenCodeReasoning-2 | python | ocr2::python | [
{
"role": "user",
"content": "Contrast Value\n\nFor an array of integers $$$[a_1, a_2, \\dots, a_n]$$$, let's call the value $$$|a_1-a_2|+|a_2-a_3|+\\cdots+|a_{n-1}-a_n|$$$ the contrast of the array. Note that the contrast of an array of size $$$1$$$ is equal to $$$0$$$.\n\nYou are given an array of integer... | {"difficulty": "1200", "judgement": "right", "license": "apache-2.0", "ocr_repo": "nvidia/OpenCodeReasoning-2", "ocr_split": "python", "pass_rate": -1.0, "question_direct": false, "question_id": "1dd52b6ac808db115ddfd6f0dbca4689", "question_index": 9342, "question_source_dataset": "open-r1/codeforces", "question_source... |
97812ea919aa41f9207eaabaecc72ff3d8c2a808c570ea3adb217e7c35f72e20 | nvidia/OpenCodeReasoning-2 | python | ocr2::python | [
{
"role": "user",
"content": "Array Coloring\n\nYou are given an array consisting of $$$n$$$ integers. Your task is to determine whether it is possible to color all its elements in two colors in such a way that the sums of the elements of both colors have the same parity and each color has at least one elem... | {"difficulty": "800", "judgement": "right", "license": "apache-2.0", "ocr_repo": "nvidia/OpenCodeReasoning-2", "ocr_split": "python", "pass_rate": -1.0, "question_direct": false, "question_id": "abfcb52d61fdd303306f7704914a6803", "question_index": 2410, "question_source_dataset": "open-r1/codeforces", "question_source_... |
698e7e44320586cddb09ea9481e5bdf37aa47bd7b7491f0acdc73782fdab11d6 | nvidia/OpenCodeReasoning-2 | python | ocr2::python | [
{
"role": "user",
"content": "Petya was late for the lesson too. The teacher gave him an additional task. For some array a Petya should find the number of different ways to select non-empty subset of elements from it in such a way that their product is equal to a square of some integer.\n\nTwo ways are cons... | {"difficulty": "interview", "judgement": "right", "license": "apache-2.0", "ocr_repo": "nvidia/OpenCodeReasoning-2", "ocr_split": "python", "pass_rate": 1.0, "question_direct": false, "question_id": "99db5933fac972d6e1e5cf5f1543a931", "question_index": 1082, "question_source_dataset": "apps", "question_source_split": "... |
f73bbb85c284afd55d5588dfafd5e812c3684d9bbf26b09c363cc123e3b7cf17 | nvidia/OpenCodeReasoning-2 | python | ocr2::python | [
{
"role": "user",
"content": "There is a sequence of colorful stones. The color of each stone is one of red, green, or blue. You are given a string s. The i-th (1-based) character of s represents the color of the i-th stone. If the character is \"R\", \"G\", or \"B\", the color of the corresponding stone is... | {"difficulty": "interview", "judgement": "right", "license": "apache-2.0", "ocr_repo": "nvidia/OpenCodeReasoning-2", "ocr_split": "python", "pass_rate": 1.0, "question_direct": false, "question_id": "dccedf1a95699912a857b59d48c30989", "question_index": 1341, "question_source_dataset": "apps", "question_source_split": "... |
3c92721a3c8d224d5937cd5dfd6a33ae54cda77b2f731a58219e66af765a200a | nvidia/OpenCodeReasoning-2 | python | ocr2::python | [
{
"role": "user",
"content": "Sean is trying to save a large file to a USB flash drive. He has n USB flash drives with capacities equal to a_1, a_2, ..., a_{n} megabytes. The file size is equal to m megabytes. \n\nFind the minimum number of USB flash drives needed to write Sean's file, if he can split the f... | {"difficulty": "interview", "judgement": "right", "license": "apache-2.0", "ocr_repo": "nvidia/OpenCodeReasoning-2", "ocr_split": "python", "pass_rate": -1.0, "question_direct": false, "question_id": "69bddd9f01d2764d1738caacc1aec43b", "question_index": 820, "question_source_dataset": "apps", "question_source_split": "... |
1477a889aae9b2769d915801deccd8946bc098feef77b1cdd0389f9df9b779da | nvidia/OpenCodeReasoning-2 | python | ocr2::python | [
{
"role": "user",
"content": "Inna and Binary Logic\n\nInna is fed up with jokes about female logic. So she started using binary logic instead.\n\nInna has an array of n elements a1[1], a1[2], ..., a1[n]. Girl likes to train in her binary logic, so she does an exercise consisting of n stages: on the first s... | {"difficulty": "2100", "judgement": "right", "license": "apache-2.0", "ocr_repo": "nvidia/OpenCodeReasoning-2", "ocr_split": "python", "pass_rate": -1.0, "question_direct": false, "question_id": "b59229ed74e1415992ae5602a216bf7d", "question_index": 6992, "question_source_dataset": "open-r1/codeforces", "question_source... |
c34fe42a2f7c255dfd08ebb1885f2b109c8280e1e78e23478ba27e562e108700 | nvidia/OpenCodeReasoning-2 | python | ocr2::python | [
{
"role": "user",
"content": "Heidi's friend Jenny is asking Heidi to deliver an important letter to one of their common friends. Since Jenny is Irish, Heidi thinks that this might be a prank. More precisely, she suspects that the message she is asked to deliver states: \"Send the fool further!\", and upon ... | {"difficulty": "interview", "judgement": "right", "license": "apache-2.0", "ocr_repo": "nvidia/OpenCodeReasoning-2", "ocr_split": "python", "pass_rate": 1.0, "question_direct": false, "question_id": "8e0dcadd28c8c545284e43846ee52189", "question_index": 2158, "question_source_dataset": "apps", "question_source_split": "... |
3ebfac4c196e8f2ad0741a65991e704defc3ba8e7b3f19e410177f9c83b9a8ab | nvidia/OpenCodeReasoning-2 | python | ocr2::python | [
{
"role": "user",
"content": "Sets and Union\n\nYou have $$$n$$$ sets of integers $$$S_{1}, S_{2}, \\ldots, S_{n}$$$. We call a set $$$S$$$ attainable, if it is possible to choose some (possibly, none) of the sets $$$S_{1}, S_{2}, \\ldots, S_{n}$$$ so that $$$S$$$ is equal to their union$$$^{\\dagger}$$$. I... | {"difficulty": "1300", "judgement": "right", "license": "apache-2.0", "ocr_repo": "nvidia/OpenCodeReasoning-2", "ocr_split": "python", "pass_rate": -1.0, "question_direct": false, "question_id": "de6426474ded0a84d69847876ac648d6", "question_index": 869, "question_source_dataset": "open-r1/codeforces", "question_source_... |
52c116f38483b2a743cad60e1c8142d8a460f15b357a75a09a74263b7eb9f270 | nvidia/OpenCodeReasoning-2 | python | ocr2::python | [
{
"role": "user",
"content": "Gambling\n\nMarian is at a casino. The game at the casino works like this.\n\nBefore each round, the player selects a number between $$$1$$$ and $$$10^9$$$. After that, a dice with $$$10^9$$$ faces is rolled so that a random number between $$$1$$$ and $$$10^9$$$ appears. If the... | {"difficulty": "1700", "judgement": "right", "license": "apache-2.0", "ocr_repo": "nvidia/OpenCodeReasoning-2", "ocr_split": "python", "pass_rate": -1.0, "question_direct": false, "question_id": "fa274784054d97c0f7140ddf36a53af9", "question_index": 7667, "question_source_dataset": "open-r1/codeforces", "question_source... |
d9249a9975289d9222e7c246c234e78c4acb6ef0350e84d043698b53f0893cc2 | nvidia/OpenCodeReasoning-2 | python | ocr2::python | [
{
"role": "user",
"content": "Underfail\n\nYou have recently fallen through a hole and, after several hours of unconsciousness, have realized you are in an underground city. On one of your regular, daily walks through the unknown, you have encountered two unusually looking skeletons called Sanz and P’pairus... | {"difficulty": "2400", "judgement": "right", "license": "apache-2.0", "ocr_repo": "nvidia/OpenCodeReasoning-2", "ocr_split": "python", "pass_rate": -1.0, "question_direct": false, "question_id": "3f5840697e95318d491276da9f37b8d0", "question_index": 7874, "question_source_dataset": "open-r1/codeforces", "question_source... |
2f92d59432da1d0b4288103b4f58d12ec64aabff497661890899f7ad24123185 | nvidia/OpenCodeReasoning-2 | python | ocr2::python | [
{
"role": "user",
"content": "Differentiating Games\n\nThis is an interactive problem\n\nGinny is taking an exam on game theory. The professor is tired of hearing the same answers over and over again, so he offered Ginny to play a game instead of a standard exam.\n\nAs known from the course, a combinatorial... | {"difficulty": "3400", "judgement": "right", "license": "apache-2.0", "ocr_repo": "nvidia/OpenCodeReasoning-2", "ocr_split": "python", "pass_rate": -1.0, "question_direct": false, "question_id": "53c7d96b600784e8d58201424740ff0d", "question_index": 3797, "question_source_dataset": "open-r1/codeforces", "question_source... |
0c4bafeddf79c474fece3faa145929f80cab74c246ce47970188565ca3e463ee | nvidia/OpenCodeReasoning-2 | python | ocr2::python | [
{
"role": "user",
"content": "Satanic Panic\n\nYou are given a set of $$$n$$$ points in a 2D plane. No three points are collinear.\n\nA pentagram is a set of $$$5$$$ points $$$A,B,C,D,E$$$ that can be arranged as follows. Note the length of the line segments don't matter, only that those particular interse... | {"difficulty": "2900", "judgement": "right", "license": "apache-2.0", "ocr_repo": "nvidia/OpenCodeReasoning-2", "ocr_split": "python", "pass_rate": 1.0, "question_direct": false, "question_id": "6605a376d9c19727f4be4c2bb1ed53ca", "question_index": 2602, "question_source_dataset": "open-r1/codeforces", "question_source_... |
8a004b23c6a4bba05de5cac936ffe571a62bc61bac13bf8503bf26ec3ec5c48b | nvidia/OpenCodeReasoning-2 | python | ocr2::python | [
{
"role": "user",
"content": "Vasya has got $n$ books, numbered from $1$ to $n$, arranged in a stack. The topmost book has number $a_1$, the next one — $a_2$, and so on. The book at the bottom of the stack has number $a_n$. All numbers are distinct.\n\nVasya wants to move all the books to his backpack in $n... | {"difficulty": "interview", "judgement": "right", "license": "apache-2.0", "ocr_repo": "nvidia/OpenCodeReasoning-2", "ocr_split": "python", "pass_rate": 1.0, "question_direct": false, "question_id": "6106a084cedc9f7ba6484cac82defc00", "question_index": 2178, "question_source_dataset": "apps", "question_source_split": "... |
212bd2d9dae9c94220672ad59cc6509d52f95e23a5c1748c9c0bb622af07d426 | nvidia/OpenCodeReasoning-2 | python | ocr2::python | [
{
"role": "user",
"content": "White-Black Balanced Subtrees\n\nYou are given a rooted tree consisting of $$$n$$$ vertices numbered from $$$1$$$ to $$$n$$$. The root is vertex $$$1$$$. There is also a string $$$s$$$ denoting the color of each vertex: if $$$s_i = \\texttt{B}$$$, then vertex $$$i$$$ is black, ... | {"difficulty": "1300", "judgement": "right", "license": "apache-2.0", "ocr_repo": "nvidia/OpenCodeReasoning-2", "ocr_split": "python", "pass_rate": -1.0, "question_direct": false, "question_id": "5bf9518290d3b37a68ae0cdf9d14eb7b", "question_index": 5516, "question_source_dataset": "open-r1/codeforces", "question_source... |
55d80951a46fdd0266ea74c7109e35e802d4a096ef67ef61585dd5711560e219 | nvidia/OpenCodeReasoning-2 | python | ocr2::python | [
{
"role": "user",
"content": "Magical Sticks\n\nA penguin Rocher has $$$n$$$ sticks. He has exactly one stick with length $$$i$$$ for all $$$1 \\le i \\le n$$$.\n\nHe can connect some sticks. If he connects two sticks that have lengths $$$a$$$ and $$$b$$$, he gets one stick with length $$$a + b$$$. Two stic... | {"difficulty": "800", "judgement": "right", "license": "apache-2.0", "ocr_repo": "nvidia/OpenCodeReasoning-2", "ocr_split": "python", "pass_rate": -1.0, "question_direct": false, "question_id": "654e6187cf73e0b132cc537413808db0", "question_index": 6563, "question_source_dataset": "open-r1/codeforces", "question_source_... |
f6db488c6071dab1b8ad6181447c3ac9ebf5bb8c77ebeda037fdabdb41ad220e | nvidia/OpenCodeReasoning-2 | python | ocr2::python | [
{
"role": "user",
"content": "Districts Connection\n\nThere are $$$n$$$ districts in the town, the $$$i$$$-th district belongs to the $$$a_i$$$-th bandit gang. Initially, no districts are connected to each other.\n\nYou are the mayor of the city and want to build $$$n-1$$$ two-way roads to connect all distr... | {"difficulty": "1200", "judgement": "right", "license": "apache-2.0", "ocr_repo": "nvidia/OpenCodeReasoning-2", "ocr_split": "python", "pass_rate": -1.0, "question_direct": false, "question_id": "e7c70ed36fd4986f524e19958caa491a", "question_index": 2768, "question_source_dataset": "open-r1/codeforces", "question_source... |
ac6f9f90ec1fe40ef7247ec7796a7ec93f8ce7397161e62d90df9228bcc3ce42 | nvidia/OpenCodeReasoning-2 | python | ocr2::python | [
{
"role": "user",
"content": "Earning on Bets\n\nYou have been offered to play a game. In this game, there are $$$n$$$ possible outcomes, and for each of them, you must bet a certain integer amount of coins. In the event that the $$$i$$$-th outcome turns out to be winning, you will receive back the amount o... | {"difficulty": "1200", "judgement": "right", "license": "apache-2.0", "ocr_repo": "nvidia/OpenCodeReasoning-2", "ocr_split": "python", "pass_rate": -1.0, "question_direct": false, "question_id": "b5a9d5adfc08bd3548280846214077f4", "question_index": 1164, "question_source_dataset": "open-r1/codeforces", "question_source... |
25554ff151daacaa71b4aca6e4a3c5c9adb77b884ed1003e828eef9dc2fcc425 | nvidia/OpenCodeReasoning-2 | python | ocr2::python | [
{
"role": "user",
"content": "Good String\n\nYou have a string $$$s$$$ of length $$$n$$$ consisting of only characters > and <. You may do some operations with this string, for each operation you have to choose some character that still remains in the string. If you choose a character >, the character that ... | {"difficulty": "1200", "judgement": "right", "license": "apache-2.0", "ocr_repo": "nvidia/OpenCodeReasoning-2", "ocr_split": "python", "pass_rate": -1.0, "question_direct": false, "question_id": "4402a168fd188d0602b59c938f758663", "question_index": 5419, "question_source_dataset": "open-r1/codeforces", "question_source... |
248469e00a850d9cc4544f75d31072b3882bf9f53f39f71cb2ba8fbd1a5697c0 | nvidia/OpenCodeReasoning-2 | python | ocr2::python | [
{
"role": "user",
"content": "The winter in Berland lasts n days. For each day we know the forecast for the average air temperature that day. \n\nVasya has a new set of winter tires which allows him to drive safely no more than k days at any average air temperature. After k days of using it (regardless of t... | {"difficulty": "interview", "judgement": "right", "license": "apache-2.0", "ocr_repo": "nvidia/OpenCodeReasoning-2", "ocr_split": "python", "pass_rate": 1.0, "question_direct": false, "question_id": "72e8fdd88168d79760d42a5db15f8531", "question_index": 656, "question_source_dataset": "apps", "question_source_split": "t... |
79dbb620dbdf6a13d17e3a0846de64f121d378e8f9d00eca217384944d2ba474 | nvidia/OpenCodeReasoning-2 | python | ocr2::python | [
{
"role": "user",
"content": "Each evening after the dinner the SIS's students gather together to play the game of Sport Mafia. \n\nFor the tournament, Alya puts candies into the box, which will serve as a prize for a winner. To do that, she performs $n$ actions. The first action performed is to put a singl... | {"difficulty": "interview", "judgement": "right", "license": "apache-2.0", "ocr_repo": "nvidia/OpenCodeReasoning-2", "ocr_split": "python", "pass_rate": 1.0, "question_direct": false, "question_id": "567f56e059155a8ab4eb621697cc0a0b", "question_index": 397, "question_source_dataset": "apps", "question_source_split": "t... |
b6a029fcb05c15de80bcc1dbc4c1f2cf22ecf5d1a1e1d6befcdfdf142584fe06 | nvidia/OpenCodeReasoning-2 | python | ocr2::python | [
{
"role": "user",
"content": "Innokentiy likes tea very much and today he wants to drink exactly n cups of tea. He would be happy to drink more but he had exactly n tea bags, a of them are green and b are black.\n\nInnokentiy doesn't like to drink the same tea (green or black) more than k times in a row. Yo... | {"difficulty": "interview", "judgement": "right", "license": "apache-2.0", "ocr_repo": "nvidia/OpenCodeReasoning-2", "ocr_split": "python", "pass_rate": -1.0, "question_direct": false, "question_id": "23bdb8d3c96f2be3a89649365bdf3840", "question_index": 809, "question_source_dataset": "apps", "question_source_split": "... |
8dec1f52b4fabefe8952927d07a343a3e615c0079d467e6bd41ac0d89543e2c8 | nvidia/OpenCodeReasoning-2 | python | ocr2::python | [
{
"role": "user",
"content": "You are given an array $d_1, d_2, \\dots, d_n$ consisting of $n$ integer numbers.\n\nYour task is to split this array into three parts (some of which may be empty) in such a way that each element of the array belongs to exactly one of the three parts, and each of the parts form... | {"difficulty": "introductory", "judgement": "right", "license": "apache-2.0", "ocr_repo": "nvidia/OpenCodeReasoning-2", "ocr_split": "python", "pass_rate": 1.0, "question_direct": false, "question_id": "54fd82920e1be26716952df8c13d021e", "question_index": 4428, "question_source_dataset": "apps", "question_source_split"... |
f922cfd7389bfedf87e29ff0f0f95f7458bc3aaea5daeb08b62ee6f48025f4d9 | nvidia/OpenCodeReasoning-2 | python | ocr2::python | [
{
"role": "user",
"content": "Perfect Square\n\nKristina has a matrix of size $$$n$$$ by $$$n$$$, filled with lowercase Latin letters. The value of $$$n$$$ is even.\n\nShe wants to change some characters so that her matrix becomes a perfect square. A matrix is called a perfect square if it remains unchanged... | {"difficulty": "1200", "judgement": "right", "license": "apache-2.0", "ocr_repo": "nvidia/OpenCodeReasoning-2", "ocr_split": "python", "pass_rate": -1.0, "question_direct": false, "question_id": "0654c0423df733471c9bcf5e169efec5", "question_index": 6954, "question_source_dataset": "open-r1/codeforces", "question_source... |
9ced025022e01358a113f7ba122b211a5eaad74f20241df4a6f84c529dcc81a1 | nvidia/OpenCodeReasoning-2 | python | ocr2::python | [
{
"role": "user",
"content": "The Doctor Meets Vader (Easy)\n\nHeidi and Doctor Who hopped out of the TARDIS and found themselves at EPFL in 2018. They were surrounded by stormtroopers and Darth Vader was approaching. Miraculously, they managed to escape to a nearby rebel base but the Doctor was very confus... | {"difficulty": "1400", "judgement": "right", "license": "apache-2.0", "ocr_repo": "nvidia/OpenCodeReasoning-2", "ocr_split": "python", "pass_rate": 1.0, "question_direct": false, "question_id": "2961544bb252e0f26049db481b751549", "question_index": 5186, "question_source_dataset": "open-r1/codeforces", "question_source_... |
fcc68acc8b0a8e936af3ea010b14a80f410db1202ce0451e820b5a2e2fe86c95 | nvidia/OpenCodeReasoning-2 | python | ocr2::python | [
{
"role": "user",
"content": "Water Buying\n\nPolycarp wants to cook a soup. To do it, he needs to buy exactly $$$n$$$ liters of water.\n\nThere are only two types of water bottles in the nearby shop — $$$1$$$-liter bottles and $$$2$$$-liter bottles. There are infinitely many bottles of these two types in t... | {"difficulty": "800", "judgement": "right", "license": "apache-2.0", "ocr_repo": "nvidia/OpenCodeReasoning-2", "ocr_split": "python", "pass_rate": 0.9411764705882353, "question_direct": false, "question_id": "4754cd4c3de6ccff80981755441f8019", "question_index": 610, "question_source_dataset": "open-r1/codeforces", "que... |
ffdb0b2e3c6b353eb4c4fde22e444bc6c0427a9378584042b4e9c2b3c6616995 | nvidia/OpenCodeReasoning-2 | python | ocr2::python | [
{
"role": "user",
"content": "Nastya and Bees\n\nUnfortunately, a mistake was found in the proof of the author's solution to this problem. Currently, we don't know the absolutely correct solution. However, you can solve this task, but if your solution passes all the tests, it is not guaranteed to be correct... | {"difficulty": "3000", "judgement": "right", "license": "apache-2.0", "ocr_repo": "nvidia/OpenCodeReasoning-2", "ocr_split": "python", "pass_rate": -1.0, "question_direct": false, "question_id": "c1d1dc09d8e3352432f58bdea34b97ef", "question_index": 6807, "question_source_dataset": "open-r1/codeforces", "question_source... |
3c497ca9225c09ab3fba00a572cc81675db5da3a4ec985481b8562573fa21245 | nvidia/OpenCodeReasoning-2 | python | ocr2::python | [
{
"role": "user",
"content": "Keep talking and nobody explodes – medium\n\nThis is an unusual problem in an unusual contest, here is the announcement: http://codeforces.com/blog/entry/73543\n\nYou have the safe lock which consists of 5 decimal digits. If you rotate some digit, it increases by one, except 9 ... | {"difficulty": "None", "judgement": "right", "license": "apache-2.0", "ocr_repo": "nvidia/OpenCodeReasoning-2", "ocr_split": "python", "pass_rate": -1.0, "question_direct": false, "question_id": "97fcd0bc9b0465e061a578105ff4d291", "question_index": 9512, "question_source_dataset": "open-r1/codeforces", "question_source... |
239a5aee743c0848b6a1528c214e0d1cb359e1ba669d7f5a4f6f210df5982082 | nvidia/OpenCodeReasoning-2 | python | ocr2::python | [
{
"role": "user",
"content": "Setting up Camp\n\nThe organizing committee plans to take the participants of the Olympiad on a hike after the tour. Currently, the number of tents needed to be taken is being calculated. It is known that each tent can accommodate up to $$$3$$$ people.\n\nAmong the participants... | {"difficulty": "800", "judgement": "right", "license": "apache-2.0", "ocr_repo": "nvidia/OpenCodeReasoning-2", "ocr_split": "python", "pass_rate": -1.0, "question_direct": false, "question_id": "d60edb5171130246187540120f21fc8a", "question_index": 4532, "question_source_dataset": "open-r1/codeforces", "question_source_... |
86ba25489e381b3507dc36c0de8b07b12cd8d8d3b57af5a3f93942ac90235b67 | nvidia/OpenCodeReasoning-2 | python | ocr2::python | [
{
"role": "user",
"content": "The flag of Berland is such rectangular field n × m that satisfies following conditions:\n\n Flag consists of three colors which correspond to letters 'R', 'G' and 'B'. Flag consists of three equal in width and height stripes, parralel to each other and to sides of the flag. ... | {"difficulty": "interview", "judgement": "right", "license": "apache-2.0", "ocr_repo": "nvidia/OpenCodeReasoning-2", "ocr_split": "python", "pass_rate": 1.0, "question_direct": false, "question_id": "8f4e0c600b6ec9c8560e0537480dac22", "question_index": 35, "question_source_dataset": "apps", "question_source_split": "te... |
37e656e428042260cf034712e3877c309054c5d4ada94e31946b7c442ee28fa9 | nvidia/OpenCodeReasoning-2 | python | ocr2::python | [
{
"role": "user",
"content": "Allowed Letters\n\nPolycarp has just launched his new startup idea. The niche is pretty free and the key vector of development sounds really promising, so he easily found himself some investors ready to sponsor the company. However, he is yet to name the startup!\n\nActually, P... | {"difficulty": "2400", "judgement": "right", "license": "apache-2.0", "ocr_repo": "nvidia/OpenCodeReasoning-2", "ocr_split": "python", "pass_rate": 0.8888888888888888, "question_direct": false, "question_id": "5c2da0a66650253dacbb541c045e6441", "question_index": 5051, "question_source_dataset": "open-r1/codeforces", "q... |
3500a470b8df5e1b9f32d7813ef9ce073f4a0e492e462a60c957e5ade2b9c13c | nvidia/OpenCodeReasoning-2 | python | ocr2::python | [
{
"role": "user",
"content": "Charming Meals\n\nThe Czech cuisine features $$$n$$$ appetizers and $$$n$$$ main dishes. The $$$i$$$-th appetizer has spiciness $$$a_i$$$, and the $$$i$$$-th main dish has spiciness $$$b_i$$$.\n\nA typical Czech meal consists of exactly one appetizer and one main dish. You want... | {"difficulty": "1500", "judgement": "right", "license": "apache-2.0", "ocr_repo": "nvidia/OpenCodeReasoning-2", "ocr_split": "python", "pass_rate": -1.0, "question_direct": false, "question_id": "a91d6a171cc02a7db62cbd5d0d31d245", "question_index": 2638, "question_source_dataset": "open-r1/codeforces", "question_source... |
b59bc6b67d7ac077f2a7075f1ab09d8c097c8307493f9f9797b206589de8dcd9 | nvidia/OpenCodeReasoning-2 | python | ocr2::python | [
{
"role": "user",
"content": "Consider a football tournament where n teams participate. Each team has two football kits: for home games, and for away games. The kit for home games of the i-th team has color x_{i} and the kit for away games of this team has color y_{i} (x_{i} ≠ y_{i}).\n\nIn the tournament, ... | {"difficulty": "interview", "judgement": "right", "license": "apache-2.0", "ocr_repo": "nvidia/OpenCodeReasoning-2", "ocr_split": "python", "pass_rate": 1.0, "question_direct": false, "question_id": "9e9b2b81f972aa6c55c9fa6aef5195b2", "question_index": 1675, "question_source_dataset": "apps", "question_source_split": "... |
4f58822b36d35af7e113f04387e967cd8165983368a6d8b144f6903a90496b6d | nvidia/OpenCodeReasoning-2 | python | ocr2::python | [
{
"role": "user",
"content": "A dragon symbolizes wisdom, power and wealth. On Lunar New Year's Day, people model a dragon with bamboo strips and clothes, raise them with rods, and hold the rods high and low to resemble a flying dragon.\n\nA performer holding the rod low is represented by a 1, while one hol... | {"difficulty": "competition", "judgement": "right", "license": "apache-2.0", "ocr_repo": "nvidia/OpenCodeReasoning-2", "ocr_split": "python", "pass_rate": 1.0, "question_direct": false, "question_id": "4b46b325b7287dc458e0a75890228878", "question_index": 3987, "question_source_dataset": "apps", "question_source_split":... |
End of preview. Expand in Data Studio
YAML Metadata Warning:empty or missing yaml metadata in repo card
Check out the documentation for more information.
MiniCPM5-1B ChatML Mix
Merged ChatML dataset for supervised fine-tuning.
Sources:
- Modotte/CodeX-2M-Thinking
- nvidia/OpenCodeReasoning-2 or nvidia/OpenCodeReasoning
- lambda/hermes-agent-reasoning-traces
- Roman1111111/gpt5.5-terminal
- ansulev/GPT-5.5-Thinking-Max-Distill-25k
- ansulev/Opus-4.7-Reasoning-CoT-4800x
Each row contains:
- id
- source_dataset
- source_split
- source_kind
- messages
- metadata_json
- Downloads last month
- 11