id stringclasses 10
values | instruction_seed stringclasses 10
values | output stringclasses 10
values | source stringclasses 2
values | license stringclasses 1
value | dataset stringclasses 1
value | split stringclasses 1
value | difficulty stringclasses 6
values | solution stringclasses 10
values | _source stringclasses 1
value | to_be_used float64 95 100 | classifier_reasoning stringclasses 10
values | __original_row_idx int64 1 134 | ms_id int64 0 9 | reasoning sequencelengths 16 16 | deepseek_solution sequencelengths 16 16 | final_reasoning_trace sequencelengths 16 16 | correct sequencelengths 16 16 | _majority_responses sequencelengths 1 16 | verified_final_reasoning_trace stringlengths 5.05k 78.4k | conversations listlengths 2 2 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
a205c1398019fa3572b43bce0fd8d317 | "There are n positive integers written on the blackboard. Also, a positive number k ≥ 2 is chosen,(...TRUNCATED) | "<think>\nOkay, let's see. The problem is about combining numbers on a blackboard through operations(...TRUNCATED) | codeforces | cc-by-4.0 | code_contests | train | VERY_HARD | "import sys\nfrom itertools import combinations\nfrom collections import deque\n\ndef main():\n n(...TRUNCATED) | nvidia/OpenCodeReasoning | 95 | "The provided code correctly implements a solution to the problem by following the outlined approach(...TRUNCATED) | 55 | 8 | ["Okay, let's see. I need to determine if it's possible to combine all the numbers on the blackboard(...TRUNCATED) | ["To solve this problem, we need to determine if we can combine the given numbers on the blackboard (...TRUNCATED) | ["<think>\nOkay, let's see. I need to determine if it's possible to combine all the numbers on the b(...TRUNCATED) | [
true,
true,
false,
true,
true,
false,
true,
true,
true,
true,
false,
true,
true,
false,
true,
false
] | ["<think>\nOkay, let's see. I need to determine if it's possible to combine all the numbers on the b(...TRUNCATED) | "<think>\nOkay, let's tackle this problem. So, the problem is about combining numbers through operat(...TRUNCATED) | [{"from":"human","value":"There are n positive integers written on the blackboard. Also, a positive (...TRUNCATED) |
39ce61e19acbfada59c33b82a74f0838 | "The Berland's capital has the form of a rectangle with sizes n × m quarters. All quarters are divi(...TRUNCATED) | "<think>\nOkay, so I need to solve this programming problem. Let me read the problem statement caref(...TRUNCATED) | codeforces | cc-by-4.0 | code_contests | train | HARD | "n, m, q, p = map(int, input().split())\ngrid = [input().strip() for _ in range(n)]\n\ntotal = [[0]*(...TRUNCATED) | nvidia/OpenCodeReasoning | 100 | "The given code snippet implements an algorithm to calculate noise levels in a grid based on the pro(...TRUNCATED) | 134 | 1 | ["Okay, let's see. I need to solve this programming problem. Let me read the problem statement caref(...TRUNCATED) | ["To solve this problem, we need to calculate the noise levels in a city grid caused by various nois(...TRUNCATED) | ["<think>\nOkay, let's see. I need to solve this programming problem. Let me read the problem statem(...TRUNCATED) | [
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true
] | ["<think>\nOkay, let's see. I need to solve this programming problem. Let me read the problem statem(...TRUNCATED) | "<think>\nOkay, let's tackle this problem. Hmm, I need to find the number of quarters where the tota(...TRUNCATED) | [{"from":"human","value":"The Berland's capital has the form of a rectangle with sizes n × m quarte(...TRUNCATED) |
39ce61e19acbfada59c33b82a74f0838 | "The Berland's capital has the form of a rectangle with sizes n × m quarters. All quarters are divi(...TRUNCATED) | "<think>\nOkay, so I need to solve this programming problem. Let me read the problem statement caref(...TRUNCATED) | codeforces | cc-by-4.0 | code_contests | train | HARD | "n, m, q, p = map(int, input().split())\ngrid = [input().strip() for _ in range(n)]\n\ntotal = [[0]*(...TRUNCATED) | nvidia/OpenCodeReasoning | 100 | "The given code snippet implements an algorithm to calculate noise levels in a grid based on the pro(...TRUNCATED) | 134 | 1 | ["Okay, let's see. I need to solve this programming problem. Let me read the problem statement caref(...TRUNCATED) | ["To solve this problem, we need to calculate the noise levels in a city grid caused by various nois(...TRUNCATED) | ["<think>\nOkay, let's see. I need to solve this programming problem. Let me read the problem statem(...TRUNCATED) | [
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true
] | ["<think>\nOkay, let's see. I need to solve this programming problem. Let me read the problem statem(...TRUNCATED) | "<think>\nOkay, let's see. I need to solve this programming problem. Let me read the problem stateme(...TRUNCATED) | [{"from":"human","value":"The Berland's capital has the form of a rectangle with sizes n × m quarte(...TRUNCATED) |
c3cc2633bfa653699f525a34b26f32dd | "Hongcow is learning to spell! One day, his teacher gives him a word that he needs to learn to spell(...TRUNCATED) | "<think>\nOkay, let's see. The problem is to find out how many distinct cyclic shifts a given string(...TRUNCATED) | codeforces | cc-by-4.0 | code_contests | train | interview | "s = input().strip()\nn = len(s)\nunique_shifts = set()\n\nfor k in range(n):\n rotated = s[-k:] (...TRUNCATED) | nvidia/OpenCodeReasoning | 95 | "The provided code snippet correctly implements the logic needed to generate all possible cyclic shi(...TRUNCATED) | 15 | 5 | ["Okay, let's see. The problem is about cyclic shifts of a string. So Hongcow can take the last char(...TRUNCATED) | ["To solve this problem, we need to determine the number of distinct strings that can be generated b(...TRUNCATED) | ["<think>\nOkay, let's see. The problem is about cyclic shifts of a string. So Hongcow can take the (...TRUNCATED) | [
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true
] | ["<think>\nOkay, let's see. The problem is about cyclic shifts of a string. So Hongcow can take the (...TRUNCATED) | "<think>\nOkay, let's see. The problem is about finding the number of distinct cyclic shifts of a gi(...TRUNCATED) | [{"from":"human","value":"Hongcow is learning to spell! One day, his teacher gives him a word that h(...TRUNCATED) |
e31cb08c940536acecf1962617ababa4 | "There is a forest that we model as a plane and live n rare animals. Animal number i has its lair in(...TRUNCATED) | "<think>\nOkay, let's see. The problem is to find the minimal radius of a circle that contains all g(...TRUNCATED) | codeforces | cc-by-4.0 | code_contests | train | 10 | "n = int(input())\npoints = []\nhas_positive = False\nhas_negative = False\n\nfor _ in range(n):\n (...TRUNCATED) | nvidia/OpenCodeReasoning | 95 | "The provided code snippet logically implements a solution to the problem description. It successful(...TRUNCATED) | 38 | 2 | ["Okay, let's see. I need to find the minimal radius of a circle that contains all given points and (...TRUNCATED) | ["To solve this problem, we need to determine the minimum radius of a circular nature reserve that c(...TRUNCATED) | ["<think>\nOkay, let's see. I need to find the minimal radius of a circle that contains all given po(...TRUNCATED) | [
true,
true,
false,
true,
true,
false,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true
] | ["<think>\nOkay, let's see. I need to find the minimal radius of a circle that contains all given po(...TRUNCATED) | "<think>\nOkay, let's see. So the problem is to find the minimum radius of a circle that contains al(...TRUNCATED) | [{"from":"human","value":"There is a forest that we model as a plane and live n rare animals. Animal(...TRUNCATED) |
c3cc2633bfa653699f525a34b26f32dd | "Hongcow is learning to spell! One day, his teacher gives him a word that he needs to learn to spell(...TRUNCATED) | "<think>\nOkay, let's see. The problem is to find out how many distinct cyclic shifts a given string(...TRUNCATED) | codeforces | cc-by-4.0 | code_contests | train | interview | "s = input().strip()\nn = len(s)\nunique_shifts = set()\n\nfor k in range(n):\n rotated = s[-k:] (...TRUNCATED) | nvidia/OpenCodeReasoning | 95 | "The provided code snippet correctly implements the logic needed to generate all possible cyclic shi(...TRUNCATED) | 15 | 5 | ["Okay, let's see. The problem is about cyclic shifts of a string. So Hongcow can take the last char(...TRUNCATED) | ["To solve this problem, we need to determine the number of distinct strings that can be generated b(...TRUNCATED) | ["<think>\nOkay, let's see. The problem is about cyclic shifts of a string. So Hongcow can take the (...TRUNCATED) | [
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true
] | ["<think>\nOkay, let's see. The problem is about cyclic shifts of a string. So Hongcow can take the (...TRUNCATED) | "<think>\nOkay, so I have this programming problem to solve, and I need to figure out how to approac(...TRUNCATED) | [{"from":"human","value":"Hongcow is learning to spell! One day, his teacher gives him a word that h(...TRUNCATED) |
2dc65fe0f1e2a70138c5198448d18937 | "Limak is going to participate in a contest on the last day of the 2016. The contest will start at 2(...TRUNCATED) | "<think>\nOkay, I need to solve this programming problem. Let's read the problem statement carefully(...TRUNCATED) | codeforces | cc-by-4.0 | code_contests | train | interview | "n, k = map(int, input().split())\navailable = 240 - k\nif available < 0:\n print(0)\nelse:\n (...TRUNCATED) | nvidia/OpenCodeReasoning | 100 | "The provided code correctly implements the solution to the problem as explained. It accurately comp(...TRUNCATED) | 1 | 7 | ["Okay, let's see. I need to solve this programming problem. Let's read the problem statement carefu(...TRUNCATED) | ["To solve this problem, we need to determine the maximum number of problems Limak can solve during (...TRUNCATED) | ["<think>\nOkay, let's see. I need to solve this programming problem. Let's read the problem stateme(...TRUNCATED) | [
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true
] | ["<think>\nOkay, let's see. I need to solve this programming problem. Let's read the problem stateme(...TRUNCATED) | "<think>\nOkay, let's see. The problem is about Limak trying to solve as many contest problems as po(...TRUNCATED) | [{"from":"human","value":"Limak is going to participate in a contest on the last day of the 2016. Th(...TRUNCATED) |
39ce61e19acbfada59c33b82a74f0838 | "The Berland's capital has the form of a rectangle with sizes n × m quarters. All quarters are divi(...TRUNCATED) | "<think>\nOkay, so I need to solve this programming problem. Let me read the problem statement caref(...TRUNCATED) | codeforces | cc-by-4.0 | code_contests | train | HARD | "n, m, q, p = map(int, input().split())\ngrid = [input().strip() for _ in range(n)]\n\ntotal = [[0]*(...TRUNCATED) | nvidia/OpenCodeReasoning | 100 | "The given code snippet implements an algorithm to calculate noise levels in a grid based on the pro(...TRUNCATED) | 134 | 1 | ["Okay, let's see. I need to solve this programming problem. Let me read the problem statement caref(...TRUNCATED) | ["To solve this problem, we need to calculate the noise levels in a city grid caused by various nois(...TRUNCATED) | ["<think>\nOkay, let's see. I need to solve this programming problem. Let me read the problem statem(...TRUNCATED) | [
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true
] | ["<think>\nOkay, let's see. I need to solve this programming problem. Let me read the problem statem(...TRUNCATED) | "<think>\nOkay, so I need to solve this programming problem. Let me read the problem carefully and u(...TRUNCATED) | [{"from":"human","value":"The Berland's capital has the form of a rectangle with sizes n × m quarte(...TRUNCATED) |
5692cf40112cbb8ba3f681b8ceba144c | "A rabbit who came to the fair found that the prize for a game at a store was a carrot cake. The rul(...TRUNCATED) | "<think>\nOkay, let's tackle this programming problem. Hmm, the problem is about a grid where blocks(...TRUNCATED) | aizu | cc-by-4.0 | code_contests | train | UNKNOWN_DIFFICULTY | "h, w, n = map(int, input().split())\noriginal = [list(input().strip()) for _ in range(h)]\n\ndef si(...TRUNCATED) | nvidia/OpenCodeReasoning | 95 | "The provided code correctly implements the algorithm to simulate the game as described in the probl(...TRUNCATED) | 43 | 3 | ["Okay, let's see. The problem is about a grid where blocks can disappear if they form a line of n o(...TRUNCATED) | ["To solve this problem, we need to determine if the rabbit can clear the entire grid by making a si(...TRUNCATED) | ["<think>\nOkay, let's see. The problem is about a grid where blocks can disappear if they form a li(...TRUNCATED) | [
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true
] | ["<think>\nOkay, let's see. The problem is about a grid where blocks can disappear if they form a li(...TRUNCATED) | "<think>\nOkay, so I need to solve this problem where I have to determine if the rabbit can eliminat(...TRUNCATED) | [{"from":"human","value":"A rabbit who came to the fair found that the prize for a game at a store w(...TRUNCATED) |
2dc65fe0f1e2a70138c5198448d18937 | "Limak is going to participate in a contest on the last day of the 2016. The contest will start at 2(...TRUNCATED) | "<think>\nOkay, I need to solve this programming problem. Let's read the problem statement carefully(...TRUNCATED) | codeforces | cc-by-4.0 | code_contests | train | interview | "n, k = map(int, input().split())\navailable = 240 - k\nif available < 0:\n print(0)\nelse:\n (...TRUNCATED) | nvidia/OpenCodeReasoning | 100 | "The provided code correctly implements the solution to the problem as explained. It accurately comp(...TRUNCATED) | 1 | 7 | ["Okay, let's see. I need to solve this programming problem. Let's read the problem statement carefu(...TRUNCATED) | ["To solve this problem, we need to determine the maximum number of problems Limak can solve during (...TRUNCATED) | ["<think>\nOkay, let's see. I need to solve this programming problem. Let's read the problem stateme(...TRUNCATED) | [
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true,
true
] | ["<think>\nOkay, let's see. I need to solve this programming problem. Let's read the problem stateme(...TRUNCATED) | "<think>\nOkay, let's see. I need to solve this programming problem. Let's read the problem statemen(...TRUNCATED) | [{"from":"human","value":"Limak is going to participate in a contest on the last day of the 2016. Th(...TRUNCATED) |
End of preview. Expand in Data Studio
README.md exists but content is empty.
- Downloads last month
- 5