id stringlengths 32 32 ⌀ | instruction_seed stringlengths 80 16k | output stringlengths 2.45k 70.6k ⌀ | source stringclasses 10
values | license stringclasses 4
values | dataset stringclasses 4
values | split stringclasses 3
values | difficulty int64 6 10 | solution stringlengths 36 9.07k ⌀ | index stringclasses 72
values | _source stringclasses 2
values | difficulty_reasoning stringlengths 288 823 | __original_row_idx int64 12 31.6k | ms_id int64 0 1.97k | reasoning stringlengths 1.56k 95.2k | deepseek_solution stringlengths 86 14.7k | final_reasoning_trace stringlengths 1.71k 102k | conversations listlengths 2 2 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
9c38099d65f8fdd8420868ca61d4dab4 | "F: If you want to hide the trees, in the forest\n\nstory\n\n\"Wood is good\" Chico, who runs the co(...TRUNCATED) | "<think>\nOkay, let's see. I need to find the number of connected components in G1 that are isomorph(...TRUNCATED) | aizu | cc-by-4.0 | code_contests | train | 8 | "import sys\nfrom collections import deque\n\ndef main():\n input = sys.stdin.read().split()\n (...TRUNCATED) | null | nvidia/OpenCodeReasoning | "The problem involves finding connected components in a forest graph that are isomorphic to a given (...TRUNCATED) | 3,071 | 191 | "Okay, let's see. I need to solve this problem where I have to find the number of connected componen(...TRUNCATED) | "To solve this problem, we need to determine how many connected components in a forest (G1) are isom(...TRUNCATED) | "<think>\nOkay, let's see. I need to solve this problem where I have to find the number of connected(...TRUNCATED) | [{"from":"human","value":"F: If you want to hide the trees, in the forest\n\nstory\n\n\"Wood is good(...TRUNCATED) |
0fc6dccd76a9a755aeaa2bbc7ed278b9 | "Examples\nInput\n\n4 5 2\n0 1 2 1\n0 2 1 2\n1 2 1 1\n1 3 1 3\n2 3 2 1\n\n\nOutput\n\n6\n\n\nInput\n(...TRUNCATED) | "<think>\nOkay, let's see. The problem is to find the maximum number of items that can be transporte(...TRUNCATED) | aizu | cc-by-4.0 | code_contests | train | 8 | "import sys\nfrom heapq import heappush, heappop\n\ndef main():\n input = sys.stdin.read().split((...TRUNCATED) | null | nvidia/OpenCodeReasoning | "The problem requires understanding of advanced data structures and algorithms, possibly involving c(...TRUNCATED) | 27,504 | 1,719 | "Okay, let's try to figure out this problem. So, the input is about some roads between cities and we(...TRUNCATED) | "To solve this problem, we need to determine the maximum number of souvenirs that can be collected w(...TRUNCATED) | "<think>\nOkay, let's try to figure out this problem. So, the input is about some roads between citi(...TRUNCATED) | [{"from":"human","value":"Examples\nInput\n\n4 5 2\n0 1 2 1\n0 2 1 2\n1 2 1 1\n1 3 1 3\n2 3 2 1\n\n\(...TRUNCATED) |
c9c267f3f722e044bb50dc466239d794 | "Given a number N. Find the last two digits of the Nth fibonacci number.\nNote: If the last two digi(...TRUNCATED) | "<think>\nOkay, I need to find the last two digits of the Nth Fibonacci number. Hmm, Fibonacci numbe(...TRUNCATED) | geeksforgeeks | apache-2.0 | taco | train | 9 | "def fibonacciDigits(N):\n period = 300\n m = N % period\n if m == 0:\n return 0\n (...TRUNCATED) | 1978 | nvidia/OpenCodeReasoning | "The problem requires finding the last two digits of the Nth Fibonacci number, which poses challenge(...TRUNCATED) | 25,227 | 1,576 | "Okay, let's see. The problem is to find the last two digits of the Nth Fibonacci number. Hmm, right(...TRUNCATED) | "To solve this problem, we need to find the last two digits of the Nth Fibonacci number efficiently,(...TRUNCATED) | "<think>\nOkay, let's see. The problem is to find the last two digits of the Nth Fibonacci number. H(...TRUNCATED) | [{"from":"human","value":"Given a number N. Find the last two digits of the Nth fibonacci number.\nN(...TRUNCATED) |
null | "The task\nIn this challenge, your task is to write a program in a programming language L that takes(...TRUNCATED) | null | null | null | null | null | 7 | null | null | stackexchange_codegolf | "This problem requires a solid understanding of number theory (calculating proper divisors) and codi(...TRUNCATED) | 22,229 | 1,389 | "Okay, so I need to create a fake polyglot program that correctly calculates the sum of proper divis(...TRUNCATED) | "To solve this problem, we need to create a fake polyglot program that correctly calculates the sum (...TRUNCATED) | "<think>\nOkay, so I need to create a fake polyglot program that correctly calculates the sum of pro(...TRUNCATED) | [{"from":"human","value":"The task\nIn this challenge, your task is to write a program in a programm(...TRUNCATED) |
2bbc8723ba987e2591771be81ceb9229 | "Please pay attention to the unusual memory limit in this problem.\n\nIn a parallel universe, Satan (...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 | 8 | "from collections import defaultdict\n\nn, a, b = map(int, input().split())\ns = input()\n\ngroups =(...TRUNCATED) | null | nvidia/OpenCodeReasoning | "This problem involves understanding the operation based on calculated indices and the ratio of work(...TRUNCATED) | 20,033 | 1,252 | "Okay, so I have this programming problem to solve. Let's try to understand what's going on here.\n\(...TRUNCATED) | "To solve this problem, we need to determine which job categories can be made the same for all worke(...TRUNCATED) | "<think>\nOkay, so I have this programming problem to solve. Let's try to understand what's going on(...TRUNCATED) | [{"from":"human","value":"Please pay attention to the unusual memory limit in this problem.\n\nIn a (...TRUNCATED) |
a214499f0d4803957cd4987b00484137 | "BerDonalds, a well-known fast food restaurant, is going to open a cafe in Bertown. The important th(...TRUNCATED) | "<think>\nOkay, let's tackle this problem. So, the task is to find the optimal location for the BerD(...TRUNCATED) | codeforces | cc-by-4.0 | code_contests | train | 8 | "import heapq\n\nn, m = map(int, input().split())\nadj = [[] for _ in range(n)]\nedges = []\n\nfor _(...TRUNCATED) | null | nvidia/OpenCodeReasoning | "This problem requires a deep understanding of graph theory to determine optimal placement for minim(...TRUNCATED) | 18,425 | 1,151 | "Okay, let's see. The problem is about finding the optimal location for a cafe in Bertown such that (...TRUNCATED) | "To solve this problem, we need to find the optimal location for a cafe in Bertown such that the max(...TRUNCATED) | "<think>\nOkay, let's see. The problem is about finding the optimal location for a cafe in Bertown s(...TRUNCATED) | [{"from":"human","value":"BerDonalds, a well-known fast food restaurant, is going to open a cafe in (...TRUNCATED) |
44d7ca1db3b44f5e4a906d70e69dfd30 | "Consider a sequence [a1, a2, ... , an]. Define its prefix product sequence <image>.\n\nNow given n,(...TRUNCATED) | "<think>\nOkay, I need to solve this problem where I have to find a permutation of numbers from 1 to(...TRUNCATED) | codeforces | cc-by-4.0 | code_contests | train | 8 | "def is_prime(n):\n if n <= 1:\n return False\n if n <= 3:\n return True\n if(...TRUNCATED) | null | nvidia/OpenCodeReasoning | "This problem requires understanding of permutations and products. It involves checking whether it i(...TRUNCATED) | 15,170 | 948 | "Okay, let's tackle this problem. So the task is to find a permutation of numbers from 1 to n such t(...TRUNCATED) | "To solve this problem, we need to determine if there exists a permutation of the numbers [1, 2, ...(...TRUNCATED) | "<think>\nOkay, let's tackle this problem. So the task is to find a permutation of numbers from 1 to(...TRUNCATED) | [{"from":"human","value":"Consider a sequence [a1, a2, ... , an]. Define its prefix product sequence(...TRUNCATED) |
null | "Two or more positive integers are said to be \"friendly\" if they have the same \"abundancy\". The (...TRUNCATED) | null | null | null | null | null | 9 | null | null | stackexchange_codegolf | "The problem involves advanced mathematical concepts such as the concept of abundancy, which require(...TRUNCATED) | 11,367 | 710 | "Okay, I need to solve this programming problem where, given a number n and k, I have to output k nu(...TRUNCATED) | "To solve this problem, we need to find k numbers that belong to the same \"club\" as a given number(...TRUNCATED) | "<think>\nOkay, I need to solve this programming problem where, given a number n and k, I have to ou(...TRUNCATED) | [{"from":"human","value":"Two or more positive integers are said to be \"friendly\" if they have the(...TRUNCATED) |
null | "Background\nYou awake on the ground. Above you is a giant stepped pyramid-like structure. Based on (...TRUNCATED) | null | null | null | null | null | 7 | null | null | stackexchange_codegolf | "This problem is a complex simulation involving multiple interactions between bots on a structured 2(...TRUNCATED) | 30,502 | 1,906 | "Okay, so I need to create a bot for this King of the Hill Ziggurat challenge. The goal is to stay a(...TRUNCATED) | "To solve this problem, we need to create a bot that can effectively navigate a ziggurat structure t(...TRUNCATED) | "<think>\nOkay, so I need to create a bot for this King of the Hill Ziggurat challenge. The goal is (...TRUNCATED) | [{"from":"human","value":"Background\nYou awake on the ground. Above you is a giant stepped pyramid-(...TRUNCATED) |
null | "CHALLENGE STATUS: OPEN\nComment, open a PR, or otherwise yell at me if I'm missing your bot.\n\nPri(...TRUNCATED) | null | null | null | null | null | 8 | null | null | stackexchange_codegolf | "This problem involves strategic decision-making in a multi-agent context (Prisoner's Dilemma with m(...TRUNCATED) | 7,855 | 490 | "Okay, I need to create a bot for this Prisoner's Dilemma variant with three choices: C, N, D. The p(...TRUNCATED) | "To solve this problem, we need to design a bot that can play a variant of the Prisoner's Dilemma ga(...TRUNCATED) | "<think>\nOkay, I need to create a bot for this Prisoner's Dilemma variant with three choices: C, N,(...TRUNCATED) | [{"from":"human","value":"CHALLENGE STATUS: OPEN\nComment, open a PR, or otherwise yell at me if I'm(...TRUNCATED) |
End of preview. Expand in Data Studio
README.md exists but content is empty.
- Downloads last month
- 6