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 0 159 | ms_id int64 0 9 | reasoning stringlengths 3.09k 85.4k | deepseek_solution stringlengths 0 6.99k | final_reasoning_trace stringlengths 5.05k 91.5k | question_answer_string stringlengths 6.83k 93.4k | _fasttext_score float64 0.17 1 | conversations listlengths 2 2 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
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) | 2 | 0 | "Okay, I need to solve this programming problem. Let's read the problem carefully.\n\nThe problem is(...TRUNCATED) | "To solve this problem, we need to compute the function f(u, v) for each query pair (u, v) in a tree(...TRUNCATED) | "<think>\nOkay, I need to solve this programming problem. Let's read the problem carefully.\n\nThe p(...TRUNCATED) | "Question: Ali is Hamed's little brother and tomorrow is his birthday. Hamed wants his brother to ea(...TRUNCATED) | 0.978281 | [{"from":"human","value":"Ali is Hamed's little brother and tomorrow is his birthday. Hamed wants hi(...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 question asks for a specific computational problem—finding the sum of edge weights o(...TRUNCATED) | 145 | 9 | "Okay, I need to find the sum of the weights of the minimum-cost arborescence with a given root r in(...TRUNCATED) | "To solve this problem, we need to find the sum of the weights of the edges of the Minimum-Cost Arbo(...TRUNCATED) | "<think>\nOkay, I need to find the sum of the weights of the minimum-cost arborescence with a given (...TRUNCATED) | "Question: Find the sum of the weights of edges of the Minimum-Cost Arborescence with the root r for(...TRUNCATED) | 0.588218 | [{"from":"human","value":"Find the sum of the weights of edges of the Minimum-Cost Arborescence with(...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) | 29 | 1 | "Okay, let's tackle this problem. Hmm, the problem is about calculating the noise level in each quar(...TRUNCATED) | "To solve this problem, we need to determine the number of quarters in the Berland capital where the(...TRUNCATED) | "<think>\nOkay, let's tackle this problem. Hmm, the problem is about calculating the noise level in (...TRUNCATED) | "Question: The Berland's capital has the form of a rectangle with sizes n × m quarters. All quarter(...TRUNCATED) | 0.82059 | [{"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 | "This question is similar to the positive examples because it involves a combinatorial problem relat(...TRUNCATED) | 81 | 5 | "Okay, so I have this programming problem to solve, and I need to figure out how to approach it. Let(...TRUNCATED) | "To solve this problem, we need to determine the number of distinct strings that can be generated by(...TRUNCATED) | "<think>\nOkay, so I have this programming problem to solve, and I need to figure out how to approac(...TRUNCATED) | "Question: Hongcow is learning to spell! One day, his teacher gives him a word that he needs to lear(...TRUNCATED) | 0.960505 | [{"from":"human","value":"Hongcow is learning to spell! One day, his teacher gives him a word that h(...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 question asks for a specific computational problem—finding the sum of edge weights o(...TRUNCATED) | 150 | 9 | "Okay, I need to find the sum of the weights of the edges in the minimum-cost arborescence with a gi(...TRUNCATED) | "To solve this problem, we need to find the sum of the weights of the edges in the Minimum-Cost Arbo(...TRUNCATED) | "<think>\nOkay, I need to find the sum of the weights of the edges in the minimum-cost arborescence (...TRUNCATED) | "Question: Find the sum of the weights of edges of the Minimum-Cost Arborescence with the root r for(...TRUNCATED) | 0.505293 | [{"from":"human","value":"Find the sum of the weights of edges of the Minimum-Cost Arborescence with(...TRUNCATED) |
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 question involves a mathematical operation with a defined function and specific conditions, req(...TRUNCATED) | 128 | 8 | "Okay, so I've got this programming problem to solve, and I need to figure out how to approach it. L(...TRUNCATED) | "To solve this problem, we need to determine if we can merge a list of integers such that the final (...TRUNCATED) | "<think>\nOkay, so I've got this programming problem to solve, and I need to figure out how to appro(...TRUNCATED) | "Question: There are n positive integers written on the blackboard. Also, a positive number k ≥ 2 (...TRUNCATED) | 0.928659 | [{"from":"human","value":"There are n positive integers written on the blackboard. Also, a positive (...TRUNCATED) |
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 question involves a mathematical operation with a defined function and specific conditions, req(...TRUNCATED) | 139 | 8 | "Okay, I need to solve this problem. Let's read the problem statement carefully.\n\nSo, the problem (...TRUNCATED) | "To solve this problem, we need to determine if we can combine a list of integers using a specific o(...TRUNCATED) | "<think>\nOkay, I need to solve this problem. Let's read the problem statement carefully.\n\nSo, the(...TRUNCATED) | "Question: There are n positive integers written on the blackboard. Also, a positive number k ≥ 2 (...TRUNCATED) | 0.837991 | [{"from":"human","value":"There are n positive integers written on the blackboard. Also, a positive (...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 question is a problem-solving scenario that involves calculations based on given const(...TRUNCATED) | 124 | 7 | "Okay, let's see. I need to solve this programming problem. Let's read the problem statement careful(...TRUNCATED) | "To solve this problem, we need to determine the maximum number of problems Limak can solve during a(...TRUNCATED) | "<think>\nOkay, let's see. I need to solve this programming problem. Let's read the problem statemen(...TRUNCATED) | "Question: Limak is going to participate in a contest on the last day of the 2016. The contest will (...TRUNCATED) | 0.375764 | [{"from":"human","value":"Limak is going to participate in a contest on the last day of the 2016. Th(...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 question is a problem-solving scenario that involves calculations based on given const(...TRUNCATED) | 125 | 7 | "Okay, let's see. The problem is about Limak trying to solve as many contest problems as possible be(...TRUNCATED) | "To solve this problem, we need to determine the maximum number of problems Limak can solve in a con(...TRUNCATED) | "<think>\nOkay, let's see. The problem is about Limak trying to solve as many contest problems as po(...TRUNCATED) | "Question: Limak is going to participate in a contest on the last day of the 2016. The contest will (...TRUNCATED) | 0.533519 | [{"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 provided question is similar to the positive examples because it involves a complex problem tha(...TRUNCATED) | 25 | 1 | "Okay, let's see. I need to solve this programming problem. Let me read the problem statement carefu(...TRUNCATED) | "To solve this problem, we need to calculate the noise levels in a city grid caused by various noise(...TRUNCATED) | "<think>\nOkay, let's see. I need to solve this programming problem. Let me read the problem stateme(...TRUNCATED) | "Question: The Berland's capital has the form of a rectangle with sizes n × m quarters. All quarter(...TRUNCATED) | 0.945693 | [{"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
- 5