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 2 125 | 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 5 15 | verified_final_reasoning_trace stringlengths 5.05k 91.5k | conversations listlengths 2 2 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
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 provided answer includes long paragraphs; it does not adhere to the guideline of being free of (...TRUNCATED) | 39 | 1 | ["Okay, let's see. I need to solve this programming problem. Let me read the problem carefully.\n\nS(...TRUNCATED) | ["To solve this problem, we need to calculate the noise levels in each quarter of a city grid caused(...TRUNCATED) | ["<think>\nOkay, let's see. I need to solve this programming problem. Let me read the problem carefu(...TRUNCATED) | [
false,
true,
true,
true,
true,
false,
false,
false,
true,
true,
true,
true,
false,
true,
false,
true
] | ["<think>\nOkay, so I've got this programming problem to solve. Let's see what it's about. Hmm. The (...TRUNCATED) | "<think>\nOkay, I need to solve this programming problem. Let's read the problem carefully.\n\nSo, t(...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 answer contains no long paragraphs; it is clearly structured with headings, bullet poi(...TRUNCATED) | 9 | 5 | ["Okay, I need to solve this problem where Hongcow can perform cyclic shifts on a string, and I have(...TRUNCATED) | ["To solve this problem, we need to determine how many distinct strings can be generated by cyclical(...TRUNCATED) | ["<think>\nOkay, I need to solve this problem where Hongcow can perform cyclic shifts on a string, a(...TRUNCATED) | [
true,
true,
false,
false,
true,
true,
true,
true,
false,
true,
true,
false,
true,
true,
true,
true
] | ["<think>\nOkay, I need to solve this problem where Hongcow can perform cyclic shifts on a string, a(...TRUNCATED) | "<think>\nOkay, let's see. The problem is about cyclic shifts of a string. So Hongcow can take the l(...TRUNCATED) | [{"from":"human","value":"Hongcow is learning to spell! One day, his teacher gives him a word that h(...TRUNCATED) |
bc56f8034c81292722d43d9877e74655 | "Ali is Hamed's little brother and tomorrow is his birthday. Hamed wants his brother to earn his gif(...TRUNCATED) | "<think>\nOkay, I need to solve this programming problem for Ali. Let's start by understanding the p(...TRUNCATED) | codeforces | cc-by-4.0 | code_contests | train | VERY_HARD | "import sys\nMOD = 10**9 + 7\nsys.setrecursionlimit(1 << 25)\n\ndef main():\n n = int(sys.stdin.r(...TRUNCATED) | nvidia/OpenCodeReasoning | 97 | "The original answer is broken down into shorter segments, making it free of any long paragraphs. Th(...TRUNCATED) | 61 | 0 | ["Okay, let's see. So the problem is about a rooted tree where each node has a weight, and we need t(...TRUNCATED) | ["","","To solve this problem, we need to compute the function f(u, v) for multiple queries on a roo(...TRUNCATED) | ["<think>\nOkay, let's see. So the problem is about a rooted tree where each node has a weight, and (...TRUNCATED) | [
true,
false,
false,
false,
false,
true,
true,
true,
false,
false,
false,
false,
false,
false,
false,
true
] | ["<think>\nOkay, let's see. So the problem is about a rooted tree where each node has a weight, and (...TRUNCATED) | "<think>\nOkay, so I need to solve this programming problem for Ali. Let's try to understand the pro(...TRUNCATED) | [{"from":"human","value":"Ali is Hamed's little brother and tomorrow is his birthday. Hamed wants hi(...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 answer contains no long paragraphs; it is clearly structured with headings, bullet poi(...TRUNCATED) | 9 | 5 | ["Okay, I need to solve this problem where Hongcow can perform cyclic shifts on a string, and I have(...TRUNCATED) | ["To solve this problem, we need to determine how many distinct strings can be generated by cyclical(...TRUNCATED) | ["<think>\nOkay, I need to solve this problem where Hongcow can perform cyclic shifts on a string, a(...TRUNCATED) | [
true,
true,
false,
false,
true,
true,
true,
true,
false,
true,
true,
false,
true,
true,
true,
true
] | ["<think>\nOkay, I need to solve this problem where Hongcow can perform cyclic shifts on a string, a(...TRUNCATED) | "<think>\nOkay, let's see. The problem is about cyclic shifts of a string and finding out how many d(...TRUNCATED) | [{"from":"human","value":"Hongcow is learning to spell! One day, his teacher gives him a word that h(...TRUNCATED) |
4951486bce2eb180de066a30fcac4c57 | "n students are taking an exam. The highest possible score at this exam is m. Let a_{i} be the score(...TRUNCATED) | "<think>\nOkay, I need to solve this programming problem. Let's read the problem carefully.\n\nSo, t(...TRUNCATED) | codeforces | cc-by-4.0 | code_contests | train | 7 | "import sys\n\nt = int(sys.stdin.readline())\nfor _ in range(t):\n n, m = map(int, sys.stdin.read(...TRUNCATED) | nvidia/OpenCodeReasoning | 95 | "The provided answer contains only short paragraphs without any long paragraphs. Each paragraph is s(...TRUNCATED) | 11 | 6 | ["Okay, let's see. I need to find the maximum possible score that student 1 can have after adjusting(...TRUNCATED) | ["To solve this problem, we need to determine the highest possible score that the first student can (...TRUNCATED) | ["<think>\nOkay, let's see. I need to find the maximum possible score that student 1 can have after (...TRUNCATED) | [
true,
false,
true,
false,
true,
false,
true,
true,
true,
true,
true,
true,
true,
false,
true,
false
] | ["<think>\nOkay, let's see. I need to find the maximum possible score that student 1 can have after (...TRUNCATED) | "<think>\nOkay, I need to solve this programming problem. Let's read the problem statement carefully(...TRUNCATED) | [{"from":"human","value":"n students are taking an exam. The highest possible score at this exam is (...TRUNCATED) |
8be667fb42682957580ebc058aeceb7a | "Find the sum of the weights of edges of the Minimum-Cost Arborescence with the root r for a given w(...TRUNCATED) | "<think>\nOkay, so I need to find the sum of the weights of the minimum-cost arborescence with a giv(...TRUNCATED) | aizu | cc-by-4.0 | code_contests | train | UNKNOWN_DIFFICULTY | "def min_cost_arborescence(root, nodes, edges):\n if not nodes:\n return 0\n\n # Dictio(...TRUNCATED) | nvidia/OpenCodeReasoning | 95 | "The provided answer contains explanations and details broken down into smaller paragraphs or bullet(...TRUNCATED) | 33 | 9 | ["Okay, I need to find the sum of the weights of the minimum-cost arborescence with a given root r i(...TRUNCATED) | ["To solve this problem, we need to find the sum of the weights of the edges of the Minimum-Cost Arb(...TRUNCATED) | ["<think>\nOkay, I need to find the sum of the weights of the minimum-cost arborescence with a given(...TRUNCATED) | [
true,
false,
true,
false,
true,
false,
true,
false,
false,
false,
false,
true,
false,
false,
true,
true
] | ["<think>\nOkay, I need to find the sum of the weights of the minimum-cost arborescence with a given(...TRUNCATED) | "<think>\nOkay, I need to solve this problem where I have to find the minimum-cost arborescence (whi(...TRUNCATED) | [{"from":"human","value":"Find the sum of the weights of edges of the Minimum-Cost Arborescence with(...TRUNCATED) |
bc56f8034c81292722d43d9877e74655 | "Ali is Hamed's little brother and tomorrow is his birthday. Hamed wants his brother to earn his gif(...TRUNCATED) | "<think>\nOkay, I need to solve this programming problem for Ali. Let's start by understanding the p(...TRUNCATED) | codeforces | cc-by-4.0 | code_contests | train | VERY_HARD | "import sys\nMOD = 10**9 + 7\nsys.setrecursionlimit(1 << 25)\n\ndef main():\n n = int(sys.stdin.r(...TRUNCATED) | nvidia/OpenCodeReasoning | 97 | "The original answer is broken down into shorter segments, making it free of any long paragraphs. Th(...TRUNCATED) | 61 | 0 | ["Okay, let's see. So the problem is about a rooted tree where each node has a weight, and we need t(...TRUNCATED) | ["","","To solve this problem, we need to compute the function f(u, v) for multiple queries on a roo(...TRUNCATED) | ["<think>\nOkay, let's see. So the problem is about a rooted tree where each node has a weight, and (...TRUNCATED) | [
true,
false,
false,
false,
false,
true,
true,
true,
false,
false,
false,
false,
false,
false,
false,
true
] | ["<think>\nOkay, let's see. So the problem is about a rooted tree where each node has a weight, and (...TRUNCATED) | "<think>\nOkay, let's try to figure out how to solve this problem. Hmm, the problem statement says w(...TRUNCATED) | [{"from":"human","value":"Ali is Hamed's little brother and tomorrow is his birthday. Hamed wants hi(...TRUNCATED) |
4951486bce2eb180de066a30fcac4c57 | "n students are taking an exam. The highest possible score at this exam is m. Let a_{i} be the score(...TRUNCATED) | "<think>\nOkay, I need to solve this programming problem. Let's read the problem carefully.\n\nSo, t(...TRUNCATED) | codeforces | cc-by-4.0 | code_contests | train | 7 | "import sys\n\nt = int(sys.stdin.readline())\nfor _ in range(t):\n n, m = map(int, sys.stdin.read(...TRUNCATED) | nvidia/OpenCodeReasoning | 95 | "The provided answer contains only short paragraphs without any long paragraphs. Each paragraph is s(...TRUNCATED) | 11 | 6 | ["Okay, let's see. I need to find the maximum possible score that student 1 can have after adjusting(...TRUNCATED) | ["To solve this problem, we need to determine the highest possible score that the first student can (...TRUNCATED) | ["<think>\nOkay, let's see. I need to find the maximum possible score that student 1 can have after (...TRUNCATED) | [
true,
false,
true,
false,
true,
false,
true,
true,
true,
true,
true,
true,
true,
false,
true,
false
] | ["<think>\nOkay, let's see. I need to find the maximum possible score that student 1 can have after (...TRUNCATED) | "<think>\nOkay, let's see. I need to find the maximum possible score that student 1 can have after a(...TRUNCATED) | [{"from":"human","value":"n students are taking an exam. The highest possible score at this exam is (...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 answer provided consists of short, clear explanations and code snippets, with no long paragraph(...TRUNCATED) | 26 | 3 | ["Okay, let's see. The problem is about determining whether there's a possible swap that can make al(...TRUNCATED) | ["To solve this problem, we need to determine if there exists a single swap of adjacent cells in a g(...TRUNCATED) | ["<think>\nOkay, let's see. The problem is about determining whether there's a possible swap that ca(...TRUNCATED) | [
true,
true,
true,
true,
false,
true,
false,
false,
false,
true,
true,
false,
false,
true,
true,
true
] | ["<think>\nOkay, let's see. The problem is about determining whether there's a possible swap that ca(...TRUNCATED) | "<think>\nOkay, let's see. The problem is about determining whether there exists a single swap of ad(...TRUNCATED) | [{"from":"human","value":"A rabbit who came to the fair found that the prize for a game at a store w(...TRUNCATED) |
8be667fb42682957580ebc058aeceb7a | "Find the sum of the weights of edges of the Minimum-Cost Arborescence with the root r for a given w(...TRUNCATED) | "<think>\nOkay, so I need to find the sum of the weights of the minimum-cost arborescence with a giv(...TRUNCATED) | aizu | cc-by-4.0 | code_contests | train | UNKNOWN_DIFFICULTY | "def min_cost_arborescence(root, nodes, edges):\n if not nodes:\n return 0\n\n # Dictio(...TRUNCATED) | nvidia/OpenCodeReasoning | 95 | "The provided answer contains explanations and details broken down into smaller paragraphs or bullet(...TRUNCATED) | 33 | 9 | ["Okay, I need to find the sum of the weights of the minimum-cost arborescence with a given root r i(...TRUNCATED) | ["To solve this problem, we need to find the sum of the weights of the edges of the Minimum-Cost Arb(...TRUNCATED) | ["<think>\nOkay, I need to find the sum of the weights of the minimum-cost arborescence with a given(...TRUNCATED) | [
true,
false,
true,
false,
true,
false,
true,
false,
false,
false,
false,
true,
false,
false,
true,
true
] | ["<think>\nOkay, I need to find the sum of the weights of the minimum-cost arborescence with a given(...TRUNCATED) | "<think>\nOkay, so I need to find the sum of the weights of the edges in the minimum-cost arborescen(...TRUNCATED) | [{"from":"human","value":"Find the sum of the weights of edges of the Minimum-Cost Arborescence with(...TRUNCATED) |
End of preview. Expand in Data Studio
README.md exists but content is empty.
- Downloads last month
- 13