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 3 146 | ms_id int64 0 9 | reasoning sequencelengths 16 16 | deepseek_solution sequencelengths 16 16 | final_reasoning_trace sequencelengths 16 16 | _majority_responses sequencelengths 10 10 | verified_final_reasoning_trace stringlengths 5.05k 67.8k | conversations listlengths 2 2 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
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 question presented is a complex mathematical problem involving geometry and optimization, simil(...TRUNCATED) | 44 | 2 | ["Okay, I need to solve this programming problem. Let's read the problem carefully.\n\nSo, the task (...TRUNCATED) | ["To solve this problem, we need to determine the minimum radius of a circle that can enclose all gi(...TRUNCATED) | ["<think>\nOkay, I need to solve this programming problem. Let's read the problem carefully.\n\nSo, (...TRUNCATED) | ["<think>\nOkay, let's see. The problem is about finding the minimum radius circle that contains all(...TRUNCATED) | "<think>\nOkay, let's see. I need to find the minimal radius of a circle that contains all the given(...TRUNCATED) | [{"from":"human","value":"There is a forest that we model as a plane and live n rare animals. Animal(...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 question involves a mathematical problem that requires logical reasoning and constraints simila(...TRUNCATED) | 104 | 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) | ["<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. The problem is that we need to maximize the first student's score while k(...TRUNCATED) | [{"from":"human","value":"n students are taking an exam. The highest possible score at this exam is (...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 question presented is a complex mathematical problem involving geometry and optimization, simil(...TRUNCATED) | 44 | 2 | ["Okay, I need to solve this programming problem. Let's read the problem carefully.\n\nSo, the task (...TRUNCATED) | ["To solve this problem, we need to determine the minimum radius of a circle that can enclose all gi(...TRUNCATED) | ["<think>\nOkay, I need to solve this programming problem. Let's read the problem carefully.\n\nSo, (...TRUNCATED) | ["<think>\nOkay, let's see. The problem is about finding the minimum radius circle that contains all(...TRUNCATED) | "<think>\nOkay, I need to solve this programming problem. Let's read the problem statement carefully(...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 | "This question is similar to the positive examples because it involves a combinatorial problem relat(...TRUNCATED) | 93 | 5 | ["Okay, let's see. The problem is about finding the number of distinct cyclic shifts of a given stri(...TRUNCATED) | ["To solve this problem, we need to determine the number of distinct cyclic shifts that can be gener(...TRUNCATED) | ["<think>\nOkay, let's see. The problem is about finding the number of distinct cyclic shifts of a g(...TRUNCATED) | ["<think>\nOkay, let's see. The problem is about finding the number of distinct cyclic shifts of a g(...TRUNCATED) | "<think>\nOkay, let's see. The problem is to find the number of distinct strings that can be formed (...TRUNCATED) | [{"from":"human","value":"Hongcow is learning to spell! One day, his teacher gives him a word that h(...TRUNCATED) |
5a91c652cac7f0c376bc583bfa2050f1 | "Some positive integers can be represented by a sum of one or more consecutive prime numbers. How ma(...TRUNCATED) | "<think>\nOkay, let's tackle this problem. Hmm, the task is to find the number of ways a given numbe(...TRUNCATED) | aizu | cc-by-4.0 | code_contests | train | UNKNOWN_DIFFICULTY | "import bisect\n\ndef sieve(n):\n sieve = [True] * (n + 1)\n sieve[0] = sieve[1] = False\n (...TRUNCATED) | nvidia/OpenCodeReasoning | 95 | "The question provided is similar to the positive examples as it involves a mathematical problem con(...TRUNCATED) | 75 | 4 | ["Okay, I need to solve this problem where I have to find the number of ways a given number can be e(...TRUNCATED) | ["To solve this problem, we need to determine how many ways a given positive integer can be expresse(...TRUNCATED) | ["<think>\nOkay, I need to solve this problem where I have to find the number of ways a given number(...TRUNCATED) | ["<think>\nOkay, let's see. The problem is to find the number of ways a given number can be expresse(...TRUNCATED) | "<think>\nOkay, let's see. I need to find the number of ways a given number can be expressed as the (...TRUNCATED) | [{"from":"human","value":"Some positive integers can be represented by a sum of one or more consecut(...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 question is a problem-solving question that requires reasoning about a specific scenar(...TRUNCATED) | 61 | 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) | ["<think>\nOkay, let's see. The problem is about determining whether there's a possible swap that ca(...TRUNCATED) | "<think>\nOkay, let's tackle this problem. So the task is to determine if there's a way to swap two (...TRUNCATED) | [{"from":"human","value":"A rabbit who came to the fair found that the prize for a game at a store w(...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 question presented is a complex mathematical problem involving geometry and optimization, simil(...TRUNCATED) | 44 | 2 | ["Okay, I need to solve this programming problem. Let's read the problem carefully.\n\nSo, the task (...TRUNCATED) | ["To solve this problem, we need to determine the minimum radius of a circle that can enclose all gi(...TRUNCATED) | ["<think>\nOkay, I need to solve this programming problem. Let's read the problem carefully.\n\nSo, (...TRUNCATED) | ["<think>\nOkay, let's see. The problem is about finding the minimum radius circle that contains all(...TRUNCATED) | "<think>\nOkay, let's see. The problem is about finding the minimum radius circle that contains all (...TRUNCATED) | [{"from":"human","value":"There is a forest that we model as a plane and live n rare animals. Animal(...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 question involves a mathematical problem that requires logical reasoning and constraints simila(...TRUNCATED) | 104 | 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) | ["<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. So the problem is that we have n students, each with a score a_i. The max(...TRUNCATED) | [{"from":"human","value":"n students are taking an exam. The highest possible score at this exam is (...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 provided question involves a specific algorithmic problem related to tree structures, weighted (...TRUNCATED) | 3 | 0 | ["Okay, let's try to figure out this problem. So, the problem is about a rooted tree where each edge(...TRUNCATED) | ["To solve this problem, we need to compute the function \\( f(u, v) \\) for multiple queries on a t(...TRUNCATED) | ["<think>\nOkay, let's try to figure out this problem. So, the problem is about a rooted tree where (...TRUNCATED) | ["<think>\nOkay, let's tackle this problem. Hmm. So, the problem is about a rooted tree where each e(...TRUNCATED) | "<think>\nOkay, let's see. So the problem is about a tree where each edge has a weight, and we need (...TRUNCATED) | [{"from":"human","value":"Ali is Hamed's little brother and tomorrow is his birthday. Hamed wants hi(...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 provided question is similar to the positive examples because it involves a complex problem tha(...TRUNCATED) | 31 | 1 | ["Okay, so I've got this programming problem to solve. Let's see what it's about. Hmm. The problem i(...TRUNCATED) | ["To solve this problem, we need to determine the number of city quarters where the noise level exce(...TRUNCATED) | ["<think>\nOkay, so I've got this programming problem to solve. Let's see what it's about. Hmm. The (...TRUNCATED) | ["<think>\nOkay, let's see. So the problem is about calculating the noise levels in each quarter of (...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) |
End of preview. Expand in Data Studio
README.md exists but content is empty.
- Downloads last month
- 6