Dataset Viewer
id
stringlengths 32
32
⌀ | instruction_seed
stringlengths 187
10.5k
| output
stringlengths 8.63k
70.4k
⌀ | source
stringclasses 9
values | license
stringclasses 4
values | dataset
stringclasses 4
values | split
stringclasses 3
values | difficulty
int64 6
10
| solution
stringlengths 25
8.94k
⌀ | index
stringclasses 26
values | _source
stringclasses 2
values | difficulty_reasoning
stringlengths 305
780
| __original_row_idx
int64 119
63.1k
| ms_id
int64 7
3.95k
| reasoning
stringlengths 5.42k
89.1k
| deepseek_solution
stringlengths 0
13.4k
| final_reasoning_trace
stringlengths 5.87k
93.5k
| question_answer_string
stringlengths 6.13k
104k
| _fasttext_score
float64 1
1
| conversations
listlengths 2
2
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
null | "Your task is to create a program that outputs the string:\nHello, Toroidal Earth!\n\nwith an option(...TRUNCATED) | null | null | null | null | null | 7 | null | null |
stackexchange_codegolf
| "The problem requires understanding of programming concepts related to input/output handling, string(...TRUNCATED) | 4,025 | 251 | "Okay, I need to create a program that outputs \"Hello, Toroidal Earth!\" with an optional trailing (...TRUNCATED) | "To solve this problem, we need to create a program that outputs the string \"Hello, Toroidal Earth!(...TRUNCATED) | "<think>\nOkay, I need to create a program that outputs \"Hello, Toroidal Earth!\" with an optional (...TRUNCATED) | "Question: Your task is to create a program that outputs the string:\nHello, Toroidal Earth!\n\nwith(...TRUNCATED) | 1.000009 | [{"from":"human","value":"Your task is to create a program that outputs the string:\nHello, Toroidal(...TRUNCATED) |
91983b7437449b03ddd4eadd57b42064
| "In 2337, people are bored at daily life and have crazy desire of having extraordinary experience. T(...TRUNCATED) | "<think>\nOkay, I need to solve this problem. Let's read it carefully.\n\nThe problem is about a dun(...TRUNCATED) |
aizu
|
cc-by-4.0
|
code_contests
|
train
| 8 | "from collections import deque\n\ndef bfs(start, end, walls, W, H):\n visited = [[-1 for _ in ran(...TRUNCATED) | null |
nvidia/OpenCodeReasoning
| "The problem involves a grid structure with walls, requiring knowledge of pathfinding and graph trav(...TRUNCATED) | 54,592 | 3,412 | "Okay, let's see. I need to solve this programming problem. Let me read the problem carefully.\n\nSo(...TRUNCATED) | "To solve this problem, we need to determine the optimal placement of a single unit-length wall in a(...TRUNCATED) | "<think>\nOkay, let's see. I need to solve this programming problem. Let me read the problem careful(...TRUNCATED) | "Question: In 2337, people are bored at daily life and have crazy desire of having extraordinary exp(...TRUNCATED) | 1.000009 | [{"from":"human","value":"In 2337, people are bored at daily life and have crazy desire of having ex(...TRUNCATED) |
null | "The absolute value of a number \\$x\\$ is normally written as \\$|x|\\$. The left and right side of(...TRUNCATED) | null | null | null | null | null | 8 | null | null |
stackexchange_codegolf
| "The problem involves parsing nested structures which requires a good understanding of recursion or (...TRUNCATED) | 56,378 | 3,523 | "Okay, let's see. I need to parse a string with nested absolute values, represented by |, and output(...TRUNCATED) | "To solve this problem, we need to parse an expression containing nested absolute values and convert(...TRUNCATED) | "<think>\nOkay, let's see. I need to parse a string with nested absolute values, represented by |, a(...TRUNCATED) | "Question: The absolute value of a number \\$x\\$ is normally written as \\$|x|\\$. The left and rig(...TRUNCATED) | 1.00001 | [{"from":"human","value":"The absolute value of a number \\$x\\$ is normally written as \\$|x|\\$. T(...TRUNCATED) |
97cda1441efb5c10ab642220752e7203
| "Given are a prime number p and a sequence of p integers a_0, \\ldots, a_{p-1} consisting of zeros a(...TRUNCATED) | "<think>\nOkay, let's see. I need to find a polynomial of degree at most p-1 that satisfies f(i) ≡(...TRUNCATED) |
atcoder
|
cc-by-4.0
|
code_contests
|
train
| 8 | "p = int(input())\na = list(map(int, input().split()))\nD = (-1) ** p % p\ninv_D = pow(D, p - 2, p)\(...TRUNCATED) | null |
nvidia/OpenCodeReasoning
| "The problem requires constructing a polynomial of degree p-1 with specific modular constraints, whi(...TRUNCATED) | 15,953 | 997 | "Okay, I need to find a polynomial of degree at most p-1 that satisfies certain modular conditions f(...TRUNCATED) | "To solve this problem, we need to find a polynomial of degree at most \\( p-1 \\) such that the pol(...TRUNCATED) | "<think>\nOkay, I need to find a polynomial of degree at most p-1 that satisfies certain modular con(...TRUNCATED) | "Question: Given are a prime number p and a sequence of p integers a_0, \\ldots, a_{p-1} consisting (...TRUNCATED) | 1.000004 | [{"from":"human","value":"Given are a prime number p and a sequence of p integers a_0, \\ldots, a_{p(...TRUNCATED) |
null | "This is my pet emoji, Billy:\n-_-\n\nEmojis don't like to be in the rain, so Billy is sad... Let's (...TRUNCATED) | null | null | null | null | null | 6 | null | null |
stackexchange_codegolf
| "The problem requires understanding of string manipulation and spatial representation of the emoji i(...TRUNCATED) | 1,664 | 104 | "Okay, so I need to solve this problem where I have to determine which sections of the emoji are exp(...TRUNCATED) | "To solve this problem, we need to determine which sections of the emoji \"-_-\" are exposed to the (...TRUNCATED) | "<think>\nOkay, so I need to solve this problem where I have to determine which sections of the emoj(...TRUNCATED) | "Question: This is my pet emoji, Billy:\n-_-\n\nEmojis don't like to be in the rain, so Billy is sad(...TRUNCATED) | 1.000009 | [{"from":"human","value":"This is my pet emoji, Billy:\n-_-\n\nEmojis don't like to be in the rain, (...TRUNCATED) |
3a8c63cf039734162553d50b35043162
| "Every day Ruslan tried to count sheep to fall asleep, but this didn't help. Now he has found a more(...TRUNCATED) | "<think>\nOkay, let's tackle this problem. Hmm, the goal is to find functions f(t) and g(t) such tha(...TRUNCATED) |
codeforces
|
cc-by-4.0
|
code_contests
|
train
| 8 | "n = int(input())\ncircles = [tuple(map(int, input().split())) for _ in range(n)]\n\nfor k in range((...TRUNCATED) | null |
nvidia/OpenCodeReasoning
| "The problem requires the solution of a geometric configuration involving circles and points, which (...TRUNCATED) | 57,032 | 3,564 | "Okay, so I need to solve this programming problem where I have to generate two correct functions f((...TRUNCATED) | "To solve this problem, we need to generate two functions f(t) and g(t) such that for each given cir(...TRUNCATED) | "<think>\nOkay, so I need to solve this programming problem where I have to generate two correct fun(...TRUNCATED) | "Question: Every day Ruslan tried to count sheep to fall asleep, but this didn't help. Now he has fo(...TRUNCATED) | 1.000006 | [{"from":"human","value":"Every day Ruslan tried to count sheep to fall asleep, but this didn't help(...TRUNCATED) |
null | "\nIn the context of quines, an intron (or payload) is a part of a quine that serves no purpose in p(...TRUNCATED) | null | null | null | null | null | 9 | null | null |
stackexchange_codegolf
| "The problem requires extensive knowledge of programming concepts and involves creating a quine whic(...TRUNCATED) | 25,173 | 1,573 | "Okay, I need to create a quine that can accept an argument. When it's run without the argument, it (...TRUNCATED) | "To solve this problem, we need to create a quine that can generate a new quine when an argument (in(...TRUNCATED) | "<think>\nOkay, I need to create a quine that can accept an argument. When it's run without the argu(...TRUNCATED) | "Question: \nIn the context of quines, an intron (or payload) is a part of a quine that serves no pu(...TRUNCATED) | 1.000007 | [{"from":"human","value":"\nIn the context of quines, an intron (or payload) is a part of a quine th(...TRUNCATED) |
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,970 | 1,560 | "Okay, I need to solve this programming problem. Let's read the problem carefully.\n\nSo the problem(...TRUNCATED) | "To solve this problem, we need to find the minimum time required to travel from vertex S to vertex (...TRUNCATED) | "<think>\nOkay, I need to solve this programming problem. Let's read the problem carefully.\n\nSo th(...TRUNCATED) | "Question: Problem\n\nGiven an undirected graph of $ N $ vertices $ M $ edges. Each vertex has a dif(...TRUNCATED) | 1.000007 | [{"from":"human","value":"Problem\n\nGiven an undirected graph of $ N $ vertices $ M $ edges. Each v(...TRUNCATED) |
191f01f56fc80f9a7c213beee805882a
| "There are n + 2 towns located on a coordinate line, numbered from 0 to n + 1. The i-th town is loca(...TRUNCATED) | "<think>\nOkay, let's tackle this problem step by step. So, the problem is about calculating the pro(...TRUNCATED) |
codeforces
|
cc-by-4.0
|
code_contests
|
train
| 8 | "mod = 998244353\nn = int(input())\n\nif n == 0:\n print(1)\nelse:\n f = [0] * (n + 1)\n f[(...TRUNCATED) | null |
nvidia/OpenCodeReasoning
| "The problem involves probabilistic reasoning, mathematical insights, and combinatorial interpretati(...TRUNCATED) | 28,384 | 1,774 | "Okay, I have to solve this programming problem. Let's read the problem statement carefully.\n\nThe (...TRUNCATED) | "To solve this problem, we need to determine the probability that after building radio towers in som(...TRUNCATED) | "<think>\nOkay, I have to solve this programming problem. Let's read the problem statement carefully(...TRUNCATED) | "Question: There are n + 2 towns located on a coordinate line, numbered from 0 to n + 1. The i-th to(...TRUNCATED) | 1.000007 | [{"from":"human","value":"There are n + 2 towns located on a coordinate line, numbered from 0 to n +(...TRUNCATED) |
null | "It's simple: Make a proper quine where if you remove any character, it's still a quine.\nThe differ(...TRUNCATED) | null | null | null | null | null | 9 | null | null |
stackexchange_codegolf
| "The problem requires a deep understanding of quines, a recursive self-replicating program that pres(...TRUNCATED) | 35,592 | 2,224 | "Okay, I need to create a quine where removing any single character still results in a valid quine. (...TRUNCATED) | "To solve this problem, we need to create a quine (a program that outputs its own source code) such (...TRUNCATED) | "<think>\nOkay, I need to create a quine where removing any single character still results in a vali(...TRUNCATED) | "Question: It's simple: Make a proper quine where if you remove any character, it's still a quine.\n(...TRUNCATED) | 1.00001 | [{"from":"human","value":"It's simple: Make a proper quine where if you remove any character, it's s(...TRUNCATED) |
End of preview. Expand
in Data Studio
README.md exists but content is empty.
- Downloads last month
- 5