index int64 | sample_id int64 | data_source string | prompt string | response string | rewards float64 | metadata string | answer unknown | model string | continual_response string | continual_model string |
|---|---|---|---|---|---|---|---|---|---|---|
1 | 0 | AlmostCompleteGraphCycleCounting | Consider a graph with 4 vertices labeled from 1 to 4. Every pair of vertices is connected by an undirected edge, except for the edge between vertices 1 and 4 (so the graph has 4 × (4 - 1) / 2 - 1 edges).
What's the number of **simple cycles** in this graph? A simple cycle must:
- Have at least 3 vertices,
- Contain no... | <think>
Okay, let's try to figure out the number of simple cycles in this graph. The graph has 4 vertices labeled 1 to 4. It's a complete graph except for the edge between 1 and 4. So normally, a complete graph with 4 vertices would have 6 edges (since each of the 4 vertices connects to 3 others, but we divide by 2 for... | -1 | {"environment": "AlmostCompleteGraphCycleCounting", "config": {"seed": 6, "parameter": {"MAX_N": 5, "N": 4, "MOD": 508597, "reference_answer": 3}, "passing_reward_threshold": 1.0}} | 3 | Qwen/Qwen3-4B | <think>
Okay, let's try to figure out the number of simple cycles in this graph. The graph has 4 vertices labeled 1 to 4. It's a complete graph except for the edge between 1 and 4. So normally, a complete graph with 4 vertices would have 6 edges (since each of the 4 vertices connects to 3 others, but we divide by 2 for... | Qwen/Qwen3-4B-Thinking-2507 |
1 | 1 | AlmostCompleteGraphCycleCounting | Consider a graph with 4 vertices labeled from 1 to 4. Every pair of vertices is connected by an undirected edge, except for the edge between vertices 1 and 4 (so the graph has 4 × (4 - 1) / 2 - 1 edges).
What's the number of **simple cycles** in this graph? A simple cycle must:
- Have at least 3 vertices,
- Contain no... | <think>
Okay, let's try to figure out the number of simple cycles in this graph. The graph has 4 vertices labeled 1 to 4. It's a complete graph except for the edge between 1 and 4. So normally, a complete graph with 4 vertices has 6 edges (since each pair is connected), but here we're missing one edge, so there are 5 e... | -1 | {"environment": "AlmostCompleteGraphCycleCounting", "config": {"seed": 6, "parameter": {"MAX_N": 5, "N": 4, "MOD": 508597, "reference_answer": 3}, "passing_reward_threshold": 1.0}} | 3 | Qwen/Qwen3-4B | <think>
Okay, let's try to figure out the number of simple cycles in this graph. The graph has 4 vertices labeled 1 to 4. It's a complete graph except for the edge between 1 and 4. So normally, a complete graph with 4 vertices has 6 edges (since each pair is connected), but here we're missing one edge, so there are 5 e... | Qwen/Qwen3-4B-Thinking-2507 |
2 | 0 | BannedPointSupersetPathCounting | In a three-dimensional space, you start at point (0, 0, 0) and want to reach the point (1, 1, 1). At each step, if you are currently at (x, y, z), you may move to a new (different from the current one) point of one of the following types:
1. (x', y, z) such that x AND x' = x
2. (x, y', z) such that y AND y' = y
3. (x, ... | <think>
Okay, let's try to tackle this problem. So, we need to find the number of distinct paths from (0,0,0) to (1,1,1) in 3D space, with certain movement rules and avoiding specific forbidden points. Let me break this down step by step.
First, let's understand the movement rules. At each step, from a current point (... | -1 | {"environment": "BannedPointSupersetPathCounting", "config": {"seed": 16, "parameter": {"MAX_N_M_R": 1, "MAX_O": 10, "N": 1, "M": 1, "R": 1, "O": 3, "obstacles": [[1, 1, 0], [0, 1, 1], [0, 1, 0]], "MOD": 6934, "reference_answer": 2}, "passing_reward_threshold": 1.0}} | 2 | Qwen/Qwen3-4B | <think>
Okay, let's try to tackle this problem. So, we need to find the number of distinct paths from (0,0,0) to (1,1,1) in 3D space, with certain movement rules and avoiding specific forbidden points. Let me break this down step by step.
First, let's understand the movement rules. At each step, from a current point (... | Qwen/Qwen3-4B-Thinking-2507 |
2 | 1 | BannedPointSupersetPathCounting | "In a three-dimensional space, you start at point (0, 0, 0) and want to reach the point (1, 1, 1). A(...TRUNCATED) | "<think>\nOkay, let's tackle this problem. So, we need to find the number of valid paths from (0,0,0(...TRUNCATED) | -1 | "{\"environment\": \"BannedPointSupersetPathCounting\", \"config\": {\"seed\": 16, \"parameter\": {\(...TRUNCATED) | 2 | Qwen/Qwen3-4B | "<think>\nOkay, let's tackle this problem. So, we need to find the number of valid paths from (0,0,0(...TRUNCATED) | Qwen/Qwen3-4B-Thinking-2507 |
4 | 0 | BlockImage | "You are given a 2 × 1 rectangular grid, where each cell represents a stack of identical cube block(...TRUNCATED) | "<think>\nOkay, let's tackle this problem. Hmm, the task is to generate a 3D isometric projection of(...TRUNCATED) | 0 | "{\"environment\": \"BlockImage\", \"config\": {\"seed\": 40, \"parameter\": {\"MAX_M_N\": 2, \"M\":(...TRUNCATED) | "..+---+..\n./ /|-+\n+---+ |/|\n| | + |\n| |/| +\n+---+ |/|\n| | + |\n| |/| +\n+---+ |/.\n(...TRUNCATED) | Qwen/Qwen3-4B | "<think>\nOkay, let's tackle this problem. Hmm, the task is to generate a 3D isometric projection of(...TRUNCATED) | Qwen/Qwen3-4B-Thinking-2507 |
4 | 1 | BlockImage | "You are given a 2 × 1 rectangular grid, where each cell represents a stack of identical cube block(...TRUNCATED) | "<think>\nOkay, let's see. I need to solve this problem where I have to draw a 3D isometric projecti(...TRUNCATED) | -1 | "{\"environment\": \"BlockImage\", \"config\": {\"seed\": 40, \"parameter\": {\"MAX_M_N\": 2, \"M\":(...TRUNCATED) | "..+---+..\n./ /|-+\n+---+ |/|\n| | + |\n| |/| +\n+---+ |/|\n| | + |\n| |/| +\n+---+ |/.\n(...TRUNCATED) | Qwen/Qwen3-4B | "<think>\nOkay, let's see. I need to solve this problem where I have to draw a 3D isometric projecti(...TRUNCATED) | Qwen/Qwen3-4B-Thinking-2507 |
6 | 0 | BucketSorting | "You are given the following array: 2 0 1 2 2\n\nPlease find the number that appears **most frequent(...TRUNCATED) | "<think>\nOkay, let's see. I need to find the number that appears most frequently in the array [2, 0(...TRUNCATED) | -0.5 | "{\"environment\": \"BucketSorting\", \"config\": {\"seed\": 56, \"parameter\": {\"N\": 5, \"MAX\": (...TRUNCATED) | 2 | Qwen/Qwen3-4B | "<think>\nOkay, let's see. I need to find the number that appears most frequently in the array [2, 0(...TRUNCATED) | Qwen/Qwen3-4B-Thinking-2507 |
6 | 1 | BucketSorting | "You are given the following array: 2 0 1 2 2\n\nPlease find the number that appears **most frequent(...TRUNCATED) | "<think>\nOkay, let's see. I need to find the number that appears most frequently in the array [2, 0(...TRUNCATED) | -0.5 | "{\"environment\": \"BucketSorting\", \"config\": {\"seed\": 56, \"parameter\": {\"N\": 5, \"MAX\": (...TRUNCATED) | 2 | Qwen/Qwen3-4B | "<think>\nOkay, let's see. I need to find the number that appears most frequently in the array [2, 0(...TRUNCATED) | Qwen/Qwen3-4B-Thinking-2507 |
7 | 0 | CatalanNumberMod | "We define a **valid permutation** of the integers from 1 to 2×2 (i.e., a permutation A[1], A[2], .(...TRUNCATED) | "<think>\nOkay, let's try to tackle this problem. So, we need to find the number of valid permutatio(...TRUNCATED) | -1 | "{\"environment\": \"CatalanNumberMod\", \"config\": {\"seed\": 70, \"parameter\": {\"MAX_N\": 3, \"(...TRUNCATED) | 2 | Qwen/Qwen3-4B | "<think>\nOkay, let's try to tackle this problem. So, we need to find the number of valid permutatio(...TRUNCATED) | Qwen/Qwen3-4B-Thinking-2507 |
7 | 1 | CatalanNumberMod | "We define a **valid permutation** of the integers from 1 to 2×2 (i.e., a permutation A[1], A[2], .(...TRUNCATED) | "<think>\nOkay, let's try to figure out how to solve this problem. The problem is about counting the(...TRUNCATED) | -1 | "{\"environment\": \"CatalanNumberMod\", \"config\": {\"seed\": 70, \"parameter\": {\"MAX_N\": 3, \"(...TRUNCATED) | 2 | Qwen/Qwen3-4B | "<think>\nOkay, let's try to figure out how to solve this problem. The problem is about counting the(...TRUNCATED) | Qwen/Qwen3-4B-Thinking-2507 |
End of preview. Expand in Data Studio
No dataset card yet
- Downloads last month
- 6