Dataset Viewer
id
stringclasses 675
values | instruction_seed
stringlengths 80
26.8k
| output
stringlengths 3.8k
69.9k
⌀ | source
stringclasses 10
values | license
stringclasses 4
values | dataset
stringclasses 4
values | split
stringclasses 3
values | difficulty
int64 6
10
| solution
stringlengths 8
7.89k
⌀ | index
stringclasses 119
values | _source
stringclasses 2
values | difficulty_reasoning
stringlengths 256
886
| __original_row_idx
int64 0
63.2k
| ms_id
int64 0
3.95k
| qwq_thinking_trajectory
stringlengths 2.56k
137k
| qwq_attempt
stringlengths 0
37.6k
| qwq_response
stringlengths 2.72k
141k
| question_answer_string
stringlengths 4.82k
144k
| _fasttext_score
float64 1
1
| conversations
listlengths 2
2
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
519fc27dc3b32dfef8a8028cca11bdc1
| "Problem\n\nGiven an undirected graph of $ N $ vertices $ M $ edges. Each vertex has a different num(...TRUNCATED) | "<think>\nOkay, let's try to tackle this problem. Hmm, the problem is about finding the minimum time(...TRUNCATED) |
aizu
|
cc-by-4.0
|
code_contests
|
train
| 8 | "import math\nimport heapq\n\ndef compute_x_min(b):\n if b == 0:\n return 0\n x_candida(...TRUNCATED) | null |
nvidia/OpenCodeReasoning
| "This problem involves finding the shortest path in a graph with edges that have weighted traversal (...TRUNCATED) | 24,969 | 1,560 | "<think>\nOkay, let's tackle this problem. Hmm, so the task is to find the shortest time to go from (...TRUNCATED) | "```python\nimport math\nimport heapq\n\ndef main():\n import sys\n input = sys.stdin.read().s(...TRUNCATED) | "<think>\nOkay, let's tackle this problem. Hmm, so the task is to find the shortest time to go from (...TRUNCATED) | "Question: Problem\n\nGiven an undirected graph of $ N $ vertices $ M $ edges. Each vertex has a dif(...TRUNCATED) | 0.999907 | [{"from":"human","value":"Problem\n\nGiven an undirected graph of $ N $ vertices $ M $ edges. Each v(...TRUNCATED) |
129974d876a2575bd5db6a7e3ef543f2
| "We all are aware of Gaurav and his love for \"weird\" recurrences.\nRecently, he came up with anoth(...TRUNCATED) | "<think>\nOkay, let's see. I need to find F(n) for very large n, up to 1e18, which means that a recu(...TRUNCATED) |
hackerearth
|
apache-2.0
|
taco
|
train
| 8 | "MOD = 10**7 + 7\n\ndef matrix_mult(a, b, mod):\n res = [[0] * 5 for _ in range(5)]\n for i in(...TRUNCATED) |
16346
|
nvidia/OpenCodeReasoning
| "The problem involves evaluating a recurrence relation which has a non-trivial structure, requiring (...TRUNCATED) | 14,314 | 894 | "<think>\nOkay, let's think about this problem. So we have this recurrence relation for F(n), which (...TRUNCATED) | "To solve this problem, we need to compute the nth term of a sequence defined by a linear recurrence(...TRUNCATED) | "<think>\nOkay, let's think about this problem. So we have this recurrence relation for F(n), which (...TRUNCATED) | "Question: We all are aware of Gaurav and his love for \"weird\" recurrences.\nRecently, he came up (...TRUNCATED) | 0.999919 | [{"from":"human","value":"We all are aware of Gaurav and his love for \"weird\" recurrences.\nRecent(...TRUNCATED) |
e43b132522beec6644cd49d35ed696f1
| "On a wall, there are C circles. You need to connect various circles using straight lines so that th(...TRUNCATED) | "<think>\nOkay, let's tackle this problem. Hmm, the problem says that we need to find the unit digit(...TRUNCATED) |
geeksforgeeks
|
apache-2.0
|
taco
|
train
| 8 | "def findNoOfEdges(C, F):\n c_last = int(C[-1])\n f_last = int(F[-1])\n return (c_last + f_(...TRUNCATED) |
13351
|
nvidia/OpenCodeReasoning
| "The problem involves determining the number of edges in a planar graph based on the values of circl(...TRUNCATED) | 28,771 | 1,798 | "<think>\nOkay, I need to solve this problem where given the number of circles C and the required nu(...TRUNCATED) | "To solve this problem, we need to determine the units digit of the number of edges required to form(...TRUNCATED) | "<think>\nOkay, I need to solve this problem where given the number of circles C and the required nu(...TRUNCATED) | "Question: On a wall, there are C circles. You need to connect various circles using straight lines (...TRUNCATED) | 0.99984 | [{"from":"human","value":"On a wall, there are C circles. You need to connect various circles using (...TRUNCATED) |
null | "Hearts is a 4-player game that uses the following scoring rules:\n\nEveryone starts with score 0.\n(...TRUNCATED) | null | null | null | null | null | 7 | null | null |
stackexchange_codegolf
| "This problem involves understanding the mechanics of a complex game with specific scoring rules and(...TRUNCATED) | 62,447 | 3,902 | "<think>\nOkay, so I need to figure out how to determine if a given set of four scores from Hearts i(...TRUNCATED) | "To determine if a given set of scores from a Hearts game is valid, we need to ensure the following (...TRUNCATED) | "<think>\nOkay, so I need to figure out how to determine if a given set of four scores from Hearts i(...TRUNCATED) | "Question: Hearts is a 4-player game that uses the following scoring rules:\n\nEveryone starts with (...TRUNCATED) | 0.9998 | [{"from":"human","value":"Hearts is a 4-player game that uses the following scoring rules:\n\nEveryo(...TRUNCATED) |
null | "The riddle\nIn yesterday's newspaper, I found a puzzle in which a Rook should start in the lower-le(...TRUNCATED) | null | null | null | null | null | 8 | null | null |
stackexchange_codegolf
| "The problem requires a deep understanding of algorithms related to grid traversal, specifically inv(...TRUNCATED) | 21,808 | 1,363 | "<think>\nOkay, I need to solve this puzzle by writing code that outputs the same image as the given(...TRUNCATED) | "```python\nprint(\"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAABXoAAAV6AgMAAAAuWCySAAAADFBMVEX///(...TRUNCATED) | "<think>\nOkay, I need to solve this puzzle by writing code that outputs the same image as the given(...TRUNCATED) | "Question: The riddle\nIn yesterday's newspaper, I found a puzzle in which a Rook should start in th(...TRUNCATED) | 0.999935 | [{"from":"human","value":"The riddle\nIn yesterday's newspaper, I found a puzzle in which a Rook sho(...TRUNCATED) |
null | "Codegolf the hamming code (with distance equals 3)! \nThe sequence looks like this: 0, 7, 25, 30, 4(...TRUNCATED) | null | null | null | null | null | 8 | null | null |
stackexchange_codegolf
| "The problem requires generating Hamming codewords with a specific distance, which involves understa(...TRUNCATED) | 5,913 | 369 | "<think>\nOkay, I need to generate the first n terms of the Hamming code sequence A075926. The seque(...TRUNCATED) | "To solve this problem, we need to generate the first `n` terms of the Hamming code sequence A075926(...TRUNCATED) | "<think>\nOkay, I need to generate the first n terms of the Hamming code sequence A075926. The seque(...TRUNCATED) | "Question: Codegolf the hamming code (with distance equals 3)! \nThe sequence looks like this: 0, 7,(...TRUNCATED) | 0.999889 | [{"from":"human","value":"Codegolf the hamming code (with distance equals 3)! \nThe sequence looks l(...TRUNCATED) |
1945a48dabb0437b9b0b99620a0170c0
| "The Head Chef is interested in studying interactions between his chefs . There are N chefs with i(...TRUNCATED) | "<think>\nOkay, let's see. The problem is about counting the number of paths from each chef in the q(...TRUNCATED) |
codechef
|
cc-by-4.0
|
code_contests
|
train
| 8 | "MOD = 10**9 + 7\n\ndef main():\n import sys\n input = sys.stdin.read\n data = input().spli(...TRUNCATED) | null |
nvidia/OpenCodeReasoning
| "This problem involves understanding directed graphs, where chefs represent nodes and trust relation(...TRUNCATED) | 14,113 | 882 | "<think>\nOkay, let's tackle this problem. Hmm, the task is to find the number of trust lines from e(...TRUNCATED) | "To solve this problem, we need to determine the number of paths (lines of trust) from each chef in (...TRUNCATED) | "<think>\nOkay, let's tackle this problem. Hmm, the task is to find the number of trust lines from e(...TRUNCATED) | "Question: The Head Chef is interested in studying interactions between his chefs . There are N ch(...TRUNCATED) | 0.999765 | [{"from":"human","value":"The Head Chef is interested in studying interactions between his chefs . T(...TRUNCATED) |
b93f5cd02dd5a32a08d1d5ecc078c846
| "SaMer has written the greatest test case of all time for one of his problems. For a given array of (...TRUNCATED) | "<think>\nOkay, let's see. The problem is about finding, for each k from 1 to n, the number of conti(...TRUNCATED) |
codeforces
|
cc-by-4.0
|
code_contests
|
train
| 8 | "def square_free_part(x):\n if x == 0:\n return 0\n sign = 1\n if x < 0:\n si(...TRUNCATED) | null |
nvidia/OpenCodeReasoning
| "The problem requires understanding of number theory concepts related to divisibility and perfect sq(...TRUNCATED) | 1,868 | 116 | "<think>\nOkay, I need to solve this problem where I have to find for each k between 1 and n, the nu(...TRUNCATED) | "To solve this problem, we need to determine the number of contiguous subarrays of an array A such t(...TRUNCATED) | "<think>\nOkay, I need to solve this problem where I have to find for each k between 1 and n, the nu(...TRUNCATED) | "Question: SaMer has written the greatest test case of all time for one of his problems. For a given(...TRUNCATED) | 0.999899 | [{"from":"human","value":"SaMer has written the greatest test case of all time for one of his proble(...TRUNCATED) |
null | "This challenge will have you count \"creatures\" in the tile game Palago.\n\nA creature is any clos(...TRUNCATED) | null | null | null | null | null | 8 | null | null |
stackexchange_codegolf
| "This problem requires deep mathematical insights into the enumeration of closed shapes (creatures) (...TRUNCATED) | 35,849 | 2,240 | "<think>\nOkay, so I have this challenge where I need to count the number of creatures in the Palago(...TRUNCATED) | "To solve this problem, we need to count the number of creatures in the tile game Palago for a given(...TRUNCATED) | "<think>\nOkay, so I have this challenge where I need to count the number of creatures in the Palago(...TRUNCATED) | "Question: This challenge will have you count \"creatures\" in the tile game Palago.\n\nA creature i(...TRUNCATED) | 0.999755 | [{"from":"human","value":"This challenge will have you count \"creatures\" in the tile game Palago.\(...TRUNCATED) |
null | "In set theory, a set is an unordered group of unique elements. A pure set is either the empty set \(...TRUNCATED) | null | null | null | null | null | 7 | null | null |
stackexchange_codegolf
| "This problem requires a solid understanding of set theory and involves recursive definitions, which(...TRUNCATED) | 54,375 | 3,398 | "<think>\nOkay, so I need to figure out how to enumerate all pure sets in a systematic way. Hmm, pur(...TRUNCATED) | "```python\nf=lambda n:[f(m)for m in range(n)if(n>>m)&1];print(f(int(input())))\n```\n\nThis Python (...TRUNCATED) | "<think>\nOkay, so I need to figure out how to enumerate all pure sets in a systematic way. Hmm, pur(...TRUNCATED) | "Question: In set theory, a set is an unordered group of unique elements. A pure set is either the e(...TRUNCATED) | 0.999892 | [{"from":"human","value":"In set theory, a set is an unordered group of unique elements. A pure set (...TRUNCATED) |
End of preview. Expand
in Data Studio
README.md exists but content is empty.
- Downloads last month
- 7