prefix large_stringlengths 1.14k 4.78k | response large_stringclasses 1
value | extra_info large_stringlengths 496 2.89k | data_source large_stringclasses 1
value |
|---|---|---|---|
<|im_start|>user
You are given an **undirected graph** with 9 vertices, labeled from `0` to `8`. The graph contains the following undirected edges:
(2, 3)
(2, 7)
(3, 6)
(3, 7)
(2, 4)
(1, 3)
(4, 8)
(7, 8)
(0, 4)
Please count the number of simple cycles in the graph. A simple cycle is a cycle with at least 3 vertices, w... | {"metadata": "{\"environment\": \"CycleCounting\", \"config\": {\"seed\": 10139, \"parameter\": {\"N\": 9, \"edge_density\": 0.25, \"edges\": [[2, 3], [2, 7], [3, 6], [3, 7], [2, 4], [1, 3], [4, 8], [7, 8], [0, 4]], \"reference_answer\": 3}, \"passing_reward_threshold\": 1.0}}", "question": "You are given an **undirect... | rlve | |
<|im_start|>user
There are 7 segments in the 2D plane, given as:
(6, 7)-(9, 12)
(3, 2)-(6, 7)
(5, 9)-(1, 10)
(3, 11)-(9, 13)
(6, 9)-(7, 12)
(1, 13)-(10, 5)
(14, 9)-(12, 2)
You may shoot at most 1 rays from the origin (0, 0) in any directions. Each segment is allowed to intersect with **at most one** of these rays. Ple... | {"metadata": "{\"environment\": \"LASLaser\", \"config\": {\"seed\": 10379, \"parameter\": {\"N\": 7, \"segments\": [[6, 7, 9, 12], [3, 2, 6, 7], [5, 9, 1, 10], [3, 11, 9, 13], [6, 9, 7, 12], [1, 13, 10, 5], [14, 9, 12, 2]], \"K\": 1, \"reference_answer\": 3}, \"passing_reward_threshold\": 1.0}}", "question": "There ar... | rlve | |
<|im_start|>user
Please find 8 **distinct positive integers** such that the sums of all 8 * (8 - 1) / 2 distinct pairs among them (in any order) are exactly: 18, 19, 16, 9, 18, 7, 5, 29, 9, 16, 15, 21, 11, 19, 8, 19, 20, 28, 6, 17, 17, 7, 27, 8, 18, 20, 10, 17
Output these 8 integers, separated by spaces.<|im_end|>
<|i... | {"metadata": "{\"environment\": \"SquSquarks\", \"config\": {\"seed\": 10261, \"parameter\": {\"N\": 8, \"reference_answer\": \"4 6 3 5 14 2 13 15\", \"sums\": [18, 19, 16, 9, 18, 7, 5, 29, 9, 16, 15, 21, 11, 19, 8, 19, 20, 28, 6, 17, 17, 7, 27, 8, 18, 20, 10, 17]}, \"passing_reward_threshold\": 1.0}}", "question": "Pl... | rlve | |
<|im_start|>user
You are given an array A of 9 integers: A[0]=2 A[1]=1 A[2]=9 A[3]=1 A[4]=3 A[5]=6 A[6]=9 A[7]=2 A[8]=6
Initially, the entire array is one single block. Let S = 0. You need to perform the following operation exactly 2 times:
- Choose a position `i` such that A[i] and A[i + 1] are still in the same bloc... | {"metadata": "{\"environment\": \"MaxDifferentGroupPairDivision\", \"config\": {\"seed\": 10197, \"parameter\": {\"N\": 9, \"K\": 2, \"A\": [2, 1, 9, 1, 3, 6, 9, 2, 6], \"gold_answer\": 494, \"reference_answer\": \"2 5\"}, \"passing_reward_threshold\": 1.0}}", "question": "You are given an array A of 9 integers: A[0]=2... | rlve | |
<|im_start|>user
In a three-dimensional space, you start at point (0, 0, 0) and want to reach the point (1, 2, 0). 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 A... | {"metadata": "{\"environment\": \"BannedPointSupersetPathCounting\", \"config\": {\"seed\": 10106, \"parameter\": {\"MAX_N_M_R\": 6, \"MAX_O\": 20, \"N\": 1, \"M\": 2, \"R\": 0, \"O\": 2, \"obstacles\": [[1, 0, 0], [0, 2, 0]], \"MOD\": 8279, \"reference_answer\": 0}, \"passing_reward_threshold\": 1.0}}", "question": "I... | rlve | |
<|im_start|>user
There are 7 segments in the 2D plane, given as:
(10, 4)-(14, 6)
(12, 10)-(4, 5)
(1, 3)-(4, 2)
(7, 7)-(12, 5)
(9, 13)-(6, 10)
(1, 7)-(4, 1)
(5, 4)-(5, 3)
You may shoot at most 1 rays from the origin (0, 0) in any directions. Each segment is allowed to intersect with **at most one** of these rays. Pleas... | {"metadata": "{\"environment\": \"LASLaser\", \"config\": {\"seed\": 10439, \"parameter\": {\"N\": 7, \"segments\": [[10, 4, 14, 6], [12, 10, 4, 5], [1, 3, 4, 2], [7, 7, 12, 5], [9, 13, 6, 10], [1, 7, 4, 1], [5, 4, 5, 3]], \"K\": 1, \"reference_answer\": 4}, \"passing_reward_threshold\": 1.0}}", "question": "There are ... | rlve | |
<|im_start|>user
You are given 8 items labeled from `0` to `7`. Each item has a base value W[i] and a diminishing factor R[i]. The list of values and diminishing factors is given as:
W[0]=21 R[0]=2
W[1]=31 R[1]=4
W[2]=1 R[2]=3
W[3]=11 R[3]=2
W[4]=8 R[4]=7
W[5]=13 R[5]=3
W[6]=7 R[6]=5
W[7]=2 R[7]=4
You must select a se... | {"metadata": "{\"environment\": \"ValueDiminishingSelection\", \"config\": {\"seed\": 10352, \"parameter\": {\"N\": 8, \"W\": [21, 31, 1, 11, 8, 13, 7, 2], \"R\": [2, 4, 3, 2, 7, 3, 5, 4], \"gold_answer\": 63}, \"passing_reward_threshold\": 1.0}}", "question": "You are given 8 items labeled from `0` to `7`. Each item h... | rlve | |
<|im_start|>user
You are given an **undirected graph** with 9 vertices, labeled from `0` to `8`. The graph contains the following undirected edges:
(2, 3)
(5, 7)
(0, 1)
(2, 4)
(6, 7)
(6, 8)
(3, 6)
(0, 4)
(1, 6)
Please count the number of simple cycles in the graph. A simple cycle is a cycle with at least 3 vertices, w... | {"metadata": "{\"environment\": \"CycleCounting\", \"config\": {\"seed\": 10376, \"parameter\": {\"N\": 9, \"edge_density\": 0.25, \"edges\": [[2, 3], [5, 7], [0, 1], [2, 4], [6, 7], [6, 8], [3, 6], [0, 4], [1, 6]], \"reference_answer\": 1}, \"passing_reward_threshold\": 1.0}}", "question": "You are given an **undirect... | rlve | |
<|im_start|>user
You are given a **tree** (i.e., a connected undirected graph with no cycles) with 9 vertices labeled from `1` to `9`. It contains the following 8 undirected edges:
1 2
4 8
2 3
1 6
4 9
2 4
5 7
2 7
You are allowed to add 2 arbitrary edges to the tree. Each added edge can connect any two existing vertice... | {"metadata": "{\"environment\": \"Patrol\", \"config\": {\"seed\": 10208, \"parameter\": {\"N\": 9, \"edges\": [[1, 2], [4, 8], [2, 3], [1, 6], [4, 9], [2, 4], [5, 7], [2, 7]], \"K\": 2, \"reference_answer\": 11}, \"passing_reward_threshold\": 1.0}}", "question": "You are given a **tree** (i.e., a connected undirected ... | rlve | |
<|im_start|>user
You are given two matrices `A` and `B`, each of size 8 × 8:
A[0][0]=4 A[0][1]=6 A[0][2]=4 A[0][3]=5 A[0][4]=1 A[0][5]=3 A[0][6]=4 A[0][7]=2
A[1][0]=7 A[1][1]=7 A[1][2]=5 A[1][3]=6 A[1][4]=1 A[1][5]=7 A[1][6]=4 A[1][7]=1
A[2][0]=5 A[2][1]=4 A[2][2]=5 A[2][3]=3 A[2][4]=2 A[2][5]=3 A[2][6]=1 A[2][7]=5
A[3... | {"metadata": "{\"environment\": \"MinPairSumMultiplicationPermutation\", \"config\": {\"seed\": 10439, \"parameter\": {\"N\": 8, \"A\": [[4, 6, 4, 5, 1, 3, 4, 2], [7, 7, 5, 6, 1, 7, 4, 1], [5, 4, 5, 3, 2, 3, 1, 5], [5, 4, 7, 1, 7, 1, 8, 1], [7, 5, 6, 1, 8, 4, 8, 3], [2, 5, 1, 2, 6, 6, 5, 3], [7, 4, 6, 2, 8, 7, 4, 5], [... | rlve | |
<|im_start|>user
You are given a 2 × 4 grid, where each cell contains a digit from `0` to `7`. At any time, you may select a cell `(i, j)` such that 0 ≤ i ≤ 2 - 2 and 0 ≤ j ≤ 4 - 2. Then, you perform a **90-degree counterclockwise rotation** on the 2 × 2 subgrid starting at position `(i, j)`.
You start with the follow... | {"metadata": "{\"environment\": \"TwiddlePuzzle\", \"config\": {\"seed\": 10335, \"parameter\": {\"MAX_N_M\": 8, \"steps\": 2, \"N\": 2, \"M\": 4, \"K\": 2, \"start_grid\": [[7, 6, 5, 3], [1, 2, 0, 4]], \"reference_answer\": \"0 0\\n0 0\\n\", \"destination_grid\": [[2, 1, 5, 3], [6, 7, 0, 4]]}, \"passing_reward_thresho... | rlve | |
<|im_start|>user
You are given 10 coins in a row (1-indexed from left to right). The i-th coin has value C[i]: C[1]=19 C[2]=8 C[3]=14 C[4]=13 C[5]=10 C[6]=20 C[7]=12 C[8]=4 C[9]=12 C[10]=13
Alice and Bob play alternately, with Alice going first. On a turn, a player removes some **positive number** of **leftmost** coins... | {"metadata": "{\"environment\": \"CoinSquareGame\", \"config\": {\"seed\": 10344, \"parameter\": {\"N\": 10, \"C\": [19, 8, 14, 13, 10, 20, 12, 4, 12, 13], \"reference_answer\": 71}, \"passing_reward_threshold\": 1.0}}", "question": "You are given 10 coins in a row (1-indexed from left to right). The i-th coin has valu... | rlve | |
<|im_start|>user
You are given a **tree** (i.e., a connected undirected graph with no cycles) with 9 vertices labeled from `1` to `9`. It contains the following 8 undirected edges:
2 5
1 2
4 8
4 9
1 7
3 9
6 8
4 7
You are allowed to add 1 arbitrary edges to the tree. Each added edge can connect any two existing vertice... | {"metadata": "{\"environment\": \"Patrol\", \"config\": {\"seed\": 10115, \"parameter\": {\"N\": 9, \"edges\": [[2, 5], [1, 2], [4, 8], [4, 9], [1, 7], [3, 9], [6, 8], [4, 7]], \"K\": 1, \"reference_answer\": 11}, \"passing_reward_threshold\": 1.0}}", "question": "You are given a **tree** (i.e., a connected undirected ... | rlve | |
<|im_start|>user
You are given an **undirected graph** with 9 vertices, labeled from `0` to `8`. The graph contains the following undirected edges:
(0, 7)
(0, 6)
(0, 4)
(1, 3)
(1, 8)
(1, 2)
(3, 5)
(0, 5)
(5, 8)
Please count the number of simple cycles in the graph. A simple cycle is a cycle with at least 3 vertices, w... | {"metadata": "{\"environment\": \"CycleCounting\", \"config\": {\"seed\": 10031, \"parameter\": {\"N\": 9, \"edge_density\": 0.25, \"edges\": [[0, 7], [0, 6], [0, 4], [1, 3], [1, 8], [1, 2], [3, 5], [0, 5], [5, 8]], \"reference_answer\": 1}, \"passing_reward_threshold\": 1.0}}", "question": "You are given an **undirect... | rlve | |
<|im_start|>user
You are given a **directed graph** with 8 vertices, labeled from 0 to 7. Each vertex `i` has exactly one incoming edge from vertex `A[i]` to vertex `i`. The initial array A is given as: A[0]=7 A[1]=2 A[2]=1 A[3]=6 A[4]=2 A[5]=3 A[6]=4 A[7]=0
You are allowed to modify A[i] to any other vertex `j` (0 ≤ ... | {"metadata": "{\"environment\": \"MinConversionToCycleCost\", \"config\": {\"seed\": 10080, \"parameter\": {\"N\": 8, \"A\": [7, 2, 1, 6, 2, 3, 4, 0], \"C\": [6, 2, 5, 1, 8, 2, 7, 4], \"gold_answer\": 6}, \"passing_reward_threshold\": 1.0}}", "question": "You are given a **directed graph** with 8 vertices, labeled from... | rlve | |
<|im_start|>user
You are given 10 coins in a row (1-indexed from left to right). The i-th coin has value C[i]: C[1]=10 C[2]=4 C[3]=13 C[4]=6 C[5]=8 C[6]=3 C[7]=14 C[8]=12 C[9]=9 C[10]=10
Alice and Bob play alternately, with Alice going first. On a turn, a player removes some **positive number** of **leftmost** coins an... | {"metadata": "{\"environment\": \"CoinSquareGame\", \"config\": {\"seed\": 10099, \"parameter\": {\"N\": 10, \"C\": [10, 4, 13, 6, 8, 3, 14, 12, 9, 10], \"reference_answer\": 42}, \"passing_reward_threshold\": 1.0}}", "question": "You are given 10 coins in a row (1-indexed from left to right). The i-th coin has value C... | rlve | |
<|im_start|>user
You are given an **undirected graph** with 9 vertices, labeled from `0` to `8`. The graph contains the following undirected edges:
(3, 8)
(1, 6)
(1, 4)
(5, 6)
(5, 7)
(1, 7)
(0, 8)
(2, 8)
(6, 8)
Please count the number of simple cycles in the graph. A simple cycle is a cycle with at least 3 vertices, w... | {"metadata": "{\"environment\": \"CycleCounting\", \"config\": {\"seed\": 10192, \"parameter\": {\"N\": 9, \"edge_density\": 0.25, \"edges\": [[3, 8], [1, 6], [1, 4], [5, 6], [5, 7], [1, 7], [0, 8], [2, 8], [6, 8]], \"reference_answer\": 1}, \"passing_reward_threshold\": 1.0}}", "question": "You are given an **undirect... | rlve | |
<|im_start|>user
You are given an **undirected graph** with 9 vertices, labeled from `0` to `8`. The graph contains the following undirected edges:
(5, 8)
(1, 2)
(2, 4)
(1, 6)
(4, 8)
(2, 6)
(0, 7)
(2, 7)
(1, 7)
Please count the number of simple cycles in the graph. A simple cycle is a cycle with at least 3 vertices, w... | {"metadata": "{\"environment\": \"CycleCounting\", \"config\": {\"seed\": 10140, \"parameter\": {\"N\": 9, \"edge_density\": 0.25, \"edges\": [[5, 8], [1, 2], [2, 4], [1, 6], [4, 8], [2, 6], [0, 7], [2, 7], [1, 7]], \"reference_answer\": 3}, \"passing_reward_threshold\": 1.0}}", "question": "You are given an **undirect... | rlve | |
<|im_start|>user
You are given an array A of 8 integers: A[1]=0, A[2]=8, A[3]=6, A[4]=0, A[5]=1, A[6]=5, A[7]=2, A[8]=0
This array has 8 × (8 + 1) / 2 contiguous subarrays. For each subarray, compute its sum; then, output the **bitwise XOR** of all these subarray sums.<|im_end|>
<|im_start|>assistant
<think>
Okay, let'... | {"metadata": "{\"environment\": \"SubarraySumXor\", \"config\": {\"seed\": 10279, \"parameter\": {\"N\": 8, \"A\": [0, 8, 6, 0, 1, 5, 2, 0], \"reference_answer\": 14}, \"passing_reward_threshold\": 1.0}}", "question": "You are given an array A of 8 integers: A[1]=0, A[2]=8, A[3]=6, A[4]=0, A[5]=1, A[6]=5, A[7]=2, A[8]=... | rlve | |
<|im_start|>user
You are given two arrays `T` and `D`, each containing 8 integers:
T[1]=7 D[1]=8
T[2]=2 D[2]=3
T[3]=1 D[3]=3
T[4]=5 D[4]=6
T[5]=5 D[5]=7
T[6]=3 D[6]=2
T[7]=1 D[7]=2
T[8]=4 D[8]=5
Please output **a permutation of 1 to 8**, denoted as p[1], p[2], ..., p[8] (8 integers in one line) with adjacent numbers s... | {"metadata": "{\"environment\": \"ProtectingFlowers\", \"config\": {\"seed\": 10408, \"parameter\": {\"N\": 8, \"T\": [7, 2, 1, 5, 5, 3, 1, 4], \"D\": [8, 3, 3, 6, 7, 2, 2, 5], \"gold_answer\": 353}, \"passing_reward_threshold\": 1.0}}", "question": "You are given two arrays `T` and `D`, each containing 8 integers:\nT[... | rlve | |
<|im_start|>user
You are given 8 items labeled from `0` to `7`. Each item has a base value W[i] and a diminishing factor R[i]. The list of values and diminishing factors is given as:
W[0]=30 R[0]=6
W[1]=5 R[1]=5
W[2]=18 R[2]=3
W[3]=24 R[3]=4
W[4]=2 R[4]=5
W[5]=9 R[5]=4
W[6]=11 R[6]=6
W[7]=6 R[7]=7
You must select a se... | {"metadata": "{\"environment\": \"ValueDiminishingSelection\", \"config\": {\"seed\": 10004, \"parameter\": {\"N\": 8, \"W\": [30, 5, 18, 24, 2, 9, 11, 6], \"R\": [6, 5, 3, 4, 5, 4, 6, 7], \"gold_answer\": 62}, \"passing_reward_threshold\": 1.0}}", "question": "You are given 8 items labeled from `0` to `7`. Each item h... | rlve | |
<|im_start|>user
You are given a **tree** (i.e., a connected undirected graph with no cycles) with 9 vertices labeled from `1` to `9`. It contains the following 8 undirected edges:
6 8
4 8
2 3
3 9
2 5
3 7
2 4
1 4
You are allowed to add 1 arbitrary edges to the tree. Each added edge can connect any two existing vertice... | {"metadata": "{\"environment\": \"Patrol\", \"config\": {\"seed\": 10477, \"parameter\": {\"N\": 9, \"edges\": [[6, 8], [4, 8], [2, 3], [3, 9], [2, 5], [3, 7], [2, 4], [1, 4]], \"K\": 1, \"reference_answer\": 12}, \"passing_reward_threshold\": 1.0}}", "question": "You are given a **tree** (i.e., a connected undirected ... | rlve | |
<|im_start|>user
You are given an **undirected graph** with 9 vertices, labeled from `0` to `8`. The graph contains the following undirected edges:
(2, 6)
(6, 8)
(6, 7)
(1, 4)
(4, 8)
(3, 4)
(3, 5)
(0, 4)
(1, 5)
Please count the number of simple cycles in the graph. A simple cycle is a cycle with at least 3 vertices, w... | {"metadata": "{\"environment\": \"CycleCounting\", \"config\": {\"seed\": 10016, \"parameter\": {\"N\": 9, \"edge_density\": 0.25, \"edges\": [[2, 6], [6, 8], [6, 7], [1, 4], [4, 8], [3, 4], [3, 5], [0, 4], [1, 5]], \"reference_answer\": 1}, \"passing_reward_threshold\": 1.0}}", "question": "You are given an **undirect... | rlve | |
<|im_start|>user
You are given an **undirected graph** with 9 vertices, labeled from `0` to `8`. The graph contains the following undirected edges:
(1, 7)
(1, 4)
(3, 8)
(0, 8)
(1, 5)
(1, 2)
(0, 3)
(2, 7)
(1, 8)
Please count the number of simple cycles in the graph. A simple cycle is a cycle with at least 3 vertices, w... | {"metadata": "{\"environment\": \"CycleCounting\", \"config\": {\"seed\": 10099, \"parameter\": {\"N\": 9, \"edge_density\": 0.25, \"edges\": [[1, 7], [1, 4], [3, 8], [0, 8], [1, 5], [1, 2], [0, 3], [2, 7], [1, 8]], \"reference_answer\": 2}, \"passing_reward_threshold\": 1.0}}", "question": "You are given an **undirect... | rlve | |
<|im_start|>user
You are given an **undirected graph** with 9 vertices, labeled from `0` to `8`. The graph contains the following undirected edges:
(1, 4)
(5, 6)
(0, 6)
(0, 3)
(0, 7)
(1, 3)
(2, 5)
(1, 7)
(6, 8)
Please count the number of simple cycles in the graph. A simple cycle is a cycle with at least 3 vertices, w... | {"metadata": "{\"environment\": \"CycleCounting\", \"config\": {\"seed\": 10291, \"parameter\": {\"N\": 9, \"edge_density\": 0.25, \"edges\": [[1, 4], [5, 6], [0, 6], [0, 3], [0, 7], [1, 3], [2, 5], [1, 7], [6, 8]], \"reference_answer\": 1}, \"passing_reward_threshold\": 1.0}}", "question": "You are given an **undirect... | rlve | |
<|im_start|>user
A **double cross** is a specific shape consisting of two horizontal and one vertical segments of `1`s. For example:
```
..........
....1..... ..1..
..11111... .111.
....1..... ..1..
.1111111.. 11111
....1..... ..1..
....1.....
..........
```
A valid double cross must satisfy th... | {"metadata": "{\"environment\": \"DoubleCrossCounting\", \"config\": {\"seed\": 10108, \"parameter\": {\"MAX_N_M\": 10, \"N\": 9, \"M\": 8, \"zero_coordinates\": [[7, 6], [7, 2], [3, 5], [6, 1], [0, 4], [6, 0], [7, 1], [6, 4]], \"reference_answer\": 99}, \"passing_reward_threshold\": 1.0}}", "question": "A **double cro... | rlve | |
<|im_start|>user
You are given an array A of 8 integers: A[1]=7, A[2]=1, A[3]=8, A[4]=4, A[5]=6, A[6]=0, A[7]=8, A[8]=2
This array has 8 × (8 + 1) / 2 contiguous subarrays. For each subarray, compute its sum; then, output the **bitwise XOR** of all these subarray sums.<|im_end|>
<|im_start|>assistant
<think>
Okay, let'... | {"metadata": "{\"environment\": \"SubarraySumXor\", \"config\": {\"seed\": 10004, \"parameter\": {\"N\": 8, \"A\": [7, 1, 8, 4, 6, 0, 8, 2], \"reference_answer\": 18}, \"passing_reward_threshold\": 1.0}}", "question": "You are given an array A of 8 integers: A[1]=7, A[2]=1, A[3]=8, A[4]=4, A[5]=6, A[6]=0, A[7]=8, A[8]=... | rlve | |
<|im_start|>user
Please find 8 **distinct positive integers** such that the sums of all 8 * (8 - 1) / 2 distinct pairs among them (in any order) are exactly: 15, 6, 27, 14, 11, 15, 17, 16, 29, 9, 4, 5, 10, 12, 17, 17, 28, 23, 5, 18, 7, 18, 16, 21, 16, 22, 3, 19
Output these 8 integers, separated by spaces.<|im_end|>
<|... | {"metadata": "{\"environment\": \"SquSquarks\", \"config\": {\"seed\": 10355, \"parameter\": {\"N\": 8, \"reference_answer\": \"14 15 13 4 8 1 2 3\", \"sums\": [15, 6, 27, 14, 11, 15, 17, 16, 29, 9, 4, 5, 10, 12, 17, 17, 28, 23, 5, 18, 7, 18, 16, 21, 16, 22, 3, 19]}, \"passing_reward_threshold\": 1.0}}", "question": "P... | rlve | |
<|im_start|>user
A **double cross** is a specific shape consisting of two horizontal and one vertical segments of `1`s. For example:
```
..........
....1..... ..1..
..11111... .111.
....1..... ..1..
.1111111.. 11111
....1..... ..1..
....1.....
..........
```
A valid double cross must satisfy th... | {"metadata": "{\"environment\": \"DoubleCrossCounting\", \"config\": {\"seed\": 10466, \"parameter\": {\"MAX_N_M\": 10, \"N\": 5, \"M\": 8, \"zero_coordinates\": [[4, 0], [0, 2]], \"reference_answer\": 7}, \"passing_reward_threshold\": 1.0}}", "question": "A **double cross** is a specific shape consisting of two horizo... | rlve | |
<|im_start|>user
You are given an array A of 8 integers: A[1]=5, A[2]=8, A[3]=8, A[4]=1, A[5]=4, A[6]=2, A[7]=2, A[8]=3
This array has 8 × (8 + 1) / 2 contiguous subarrays. For each subarray, compute its sum; then, output the **bitwise XOR** of all these subarray sums.<|im_end|>
<|im_start|>assistant
<think>
Okay, let'... | {"metadata": "{\"environment\": \"SubarraySumXor\", \"config\": {\"seed\": 10103, \"parameter\": {\"N\": 8, \"A\": [5, 8, 8, 1, 4, 2, 2, 3], \"reference_answer\": 56}, \"passing_reward_threshold\": 1.0}}", "question": "You are given an array A of 8 integers: A[1]=5, A[2]=8, A[3]=8, A[4]=1, A[5]=4, A[6]=2, A[7]=2, A[8]=... | rlve | |
<|im_start|>user
You are given two arrays `T` and `D`, each containing 8 integers:
T[1]=8 D[1]=3
T[2]=4 D[2]=8
T[3]=4 D[3]=7
T[4]=6 D[4]=8
T[5]=4 D[5]=4
T[6]=8 D[6]=4
T[7]=6 D[7]=4
T[8]=4 D[8]=1
Please output **a permutation of 1 to 8**, denoted as p[1], p[2], ..., p[8] (8 integers in one line) with adjacent numbers s... | {"metadata": "{\"environment\": \"ProtectingFlowers\", \"config\": {\"seed\": 10317, \"parameter\": {\"N\": 8, \"T\": [8, 4, 4, 6, 4, 8, 6, 4], \"D\": [3, 8, 7, 8, 4, 4, 4, 1], \"gold_answer\": 452}, \"passing_reward_threshold\": 1.0}}", "question": "You are given two arrays `T` and `D`, each containing 8 integers:\nT[... | rlve | |
<|im_start|>user
You are given an **undirected graph** with 9 vertices, labeled from `0` to `8`. The graph contains the following undirected edges:
(1, 5)
(0, 1)
(1, 3)
(3, 4)
(2, 7)
(2, 5)
(2, 4)
(5, 7)
(1, 4)
Please count the number of simple cycles in the graph. A simple cycle is a cycle with at least 3 vertices, w... | {"metadata": "{\"environment\": \"CycleCounting\", \"config\": {\"seed\": 10323, \"parameter\": {\"N\": 9, \"edge_density\": 0.25, \"edges\": [[1, 5], [0, 1], [1, 3], [3, 4], [2, 7], [2, 5], [2, 4], [5, 7], [1, 4]], \"reference_answer\": 6}, \"passing_reward_threshold\": 1.0}}", "question": "You are given an **undirect... | rlve | |
<|im_start|>user
You are given an **undirected graph** with 9 vertices, labeled from `0` to `8`. The graph contains the following undirected edges:
(1, 8)
(3, 8)
(0, 2)
(4, 8)
(3, 4)
(0, 6)
(0, 8)
(2, 3)
(1, 7)
Please count the number of simple cycles in the graph. A simple cycle is a cycle with at least 3 vertices, w... | {"metadata": "{\"environment\": \"CycleCounting\", \"config\": {\"seed\": 10127, \"parameter\": {\"N\": 9, \"edge_density\": 0.25, \"edges\": [[1, 8], [3, 8], [0, 2], [4, 8], [3, 4], [0, 6], [0, 8], [2, 3], [1, 7]], \"reference_answer\": 3}, \"passing_reward_threshold\": 1.0}}", "question": "You are given an **undirect... | rlve | |
<|im_start|>user
You are given a set of integers: 8 11 2 4 9 7 3 10
Please compute the number of set pairs (S, T) such that:
1. S and T are disjoint subsets of the given set.
2. For every x in S and y in T, gcd(x, y) = 1 (i.e., there is no pair with gcd > 1).<|im_end|>
<|im_start|>assistant
<think>
Okay, let's try to ... | {"metadata": "{\"environment\": \"TwoSet_AllCoprime_Counting\", \"config\": {\"seed\": 10410, \"parameter\": {\"N\": 16, \"set\": [8, 11, 2, 4, 9, 7, 3, 10], \"reference_answer\": 1953}, \"passing_reward_threshold\": 1.0}}", "question": "You are given a set of integers: 8 11 2 4 9 7 3 10\n\nPlease compute the number of... | rlve | |
<|im_start|>user
There are 7 segments in the 2D plane, given as:
(12, 9)-(2, 9)
(13, 8)-(4, 14)
(9, 14)-(7, 3)
(10, 13)-(5, 10)
(5, 14)-(6, 11)
(4, 7)-(7, 2)
(7, 6)-(4, 11)
You may shoot at most 1 rays from the origin (0, 0) in any directions. Each segment is allowed to intersect with **at most one** of these rays. Pl... | {"metadata": "{\"environment\": \"LASLaser\", \"config\": {\"seed\": 10167, \"parameter\": {\"N\": 7, \"segments\": [[12, 9, 2, 9], [13, 8, 4, 14], [9, 14, 7, 3], [10, 13, 5, 10], [5, 14, 6, 11], [4, 7, 7, 2], [7, 6, 4, 11]], \"K\": 1, \"reference_answer\": 6}, \"passing_reward_threshold\": 1.0}}", "question": "There a... | rlve | |
<|im_start|>user
Please find 8 **distinct positive integers** such that the sums of all 8 * (8 - 1) / 2 distinct pairs among them (in any order) are exactly: 23, 14, 20, 24, 19, 17, 18, 23, 18, 12, 11, 16, 20, 21, 22, 17, 21, 25, 9, 10, 26, 19, 8, 24, 17, 29, 27, 15
Output these 8 integers, separated by spaces.<|im_end... | {"metadata": "{\"environment\": \"SquSquarks\", \"config\": {\"seed\": 10198, \"parameter\": {\"N\": 8, \"reference_answer\": \"16 7 13 10 1 8 11 9\", \"sums\": [23, 14, 20, 24, 19, 17, 18, 23, 18, 12, 11, 16, 20, 21, 22, 17, 21, 25, 9, 10, 26, 19, 8, 24, 17, 29, 27, 15]}, \"passing_reward_threshold\": 1.0}}", "questio... | rlve | |
<|im_start|>user
You are given an **undirected graph** with 9 vertices, labeled from `0` to `8`. The graph contains the following undirected edges:
(1, 7)
(0, 5)
(3, 8)
(7, 8)
(5, 8)
(3, 5)
(6, 8)
(4, 6)
(3, 4)
Please count the number of simple cycles in the graph. A simple cycle is a cycle with at least 3 vertices, w... | {"metadata": "{\"environment\": \"CycleCounting\", \"config\": {\"seed\": 10247, \"parameter\": {\"N\": 9, \"edge_density\": 0.25, \"edges\": [[1, 7], [0, 5], [3, 8], [7, 8], [5, 8], [3, 5], [6, 8], [4, 6], [3, 4]], \"reference_answer\": 3}, \"passing_reward_threshold\": 1.0}}", "question": "You are given an **undirect... | rlve | |
<|im_start|>user
You are given two arrays `T` and `D`, each containing 8 integers:
T[1]=6 D[1]=7
T[2]=1 D[2]=6
T[3]=6 D[3]=3
T[4]=1 D[4]=3
T[5]=1 D[5]=7
T[6]=8 D[6]=7
T[7]=7 D[7]=6
T[8]=8 D[8]=5
Please output **a permutation of 1 to 8**, denoted as p[1], p[2], ..., p[8] (8 integers in one line) with adjacent numbers s... | {"metadata": "{\"environment\": \"ProtectingFlowers\", \"config\": {\"seed\": 10241, \"parameter\": {\"N\": 8, \"T\": [6, 1, 6, 1, 1, 8, 7, 8], \"D\": [7, 6, 3, 3, 7, 7, 6, 5], \"gold_answer\": 414}, \"passing_reward_threshold\": 1.0}}", "question": "You are given two arrays `T` and `D`, each containing 8 integers:\nT[... | rlve | |
<|im_start|>user
You are given an **undirected graph** with 9 vertices, labeled from `0` to `8`. The graph contains the following undirected edges:
(1, 5)
(5, 6)
(1, 3)
(7, 8)
(4, 6)
(1, 4)
(2, 7)
(6, 7)
(5, 7)
Please count the number of simple cycles in the graph. A simple cycle is a cycle with at least 3 vertices, w... | {"metadata": "{\"environment\": \"CycleCounting\", \"config\": {\"seed\": 10113, \"parameter\": {\"N\": 9, \"edge_density\": 0.25, \"edges\": [[1, 5], [5, 6], [1, 3], [7, 8], [4, 6], [1, 4], [2, 7], [6, 7], [5, 7]], \"reference_answer\": 3}, \"passing_reward_threshold\": 1.0}}", "question": "You are given an **undirect... | rlve | |
<|im_start|>user
You are given an array A of 8 integers: A[1]=3, A[2]=8, A[3]=2, A[4]=0, A[5]=4, A[6]=5, A[7]=4, A[8]=4
This array has 8 × (8 + 1) / 2 contiguous subarrays. For each subarray, compute its sum; then, output the **bitwise XOR** of all these subarray sums.<|im_end|>
<|im_start|>assistant
<think>
Okay, let'... | {"metadata": "{\"environment\": \"SubarraySumXor\", \"config\": {\"seed\": 10181, \"parameter\": {\"N\": 8, \"A\": [3, 8, 2, 0, 4, 5, 4, 4], \"reference_answer\": 10}, \"passing_reward_threshold\": 1.0}}", "question": "You are given an array A of 8 integers: A[1]=3, A[2]=8, A[3]=2, A[4]=0, A[5]=4, A[6]=5, A[7]=4, A[8]=... | rlve | |
<|im_start|>user
You are given two arrays `T` and `D`, each containing 8 integers:
T[1]=5 D[1]=3
T[2]=5 D[2]=4
T[3]=3 D[3]=4
T[4]=3 D[4]=2
T[5]=6 D[5]=2
T[6]=7 D[6]=2
T[7]=5 D[7]=2
T[8]=8 D[8]=1
Please output **a permutation of 1 to 8**, denoted as p[1], p[2], ..., p[8] (8 integers in one line) with adjacent numbers s... | {"metadata": "{\"environment\": \"ProtectingFlowers\", \"config\": {\"seed\": 10007, \"parameter\": {\"N\": 8, \"T\": [5, 5, 3, 3, 6, 7, 5, 8], \"D\": [3, 4, 4, 2, 2, 2, 2, 1], \"gold_answer\": 223}, \"passing_reward_threshold\": 1.0}}", "question": "You are given two arrays `T` and `D`, each containing 8 integers:\nT[... | rlve | |
<|im_start|>user
You are given 10 coins in a row (1-indexed from left to right). The i-th coin has value C[i]: C[1]=6 C[2]=20 C[3]=10 C[4]=13 C[5]=2 C[6]=10 C[7]=4 C[8]=17 C[9]=19 C[10]=3
Alice and Bob play alternately, with Alice going first. On a turn, a player removes some **positive number** of **leftmost** coins a... | {"metadata": "{\"environment\": \"CoinSquareGame\", \"config\": {\"seed\": 10264, \"parameter\": {\"N\": 10, \"C\": [6, 20, 10, 13, 2, 10, 4, 17, 19, 3], \"reference_answer\": 59}, \"passing_reward_threshold\": 1.0}}", "question": "You are given 10 coins in a row (1-indexed from left to right). The i-th coin has value ... | rlve | |
<|im_start|>user
You are given an **undirected graph** with 9 vertices, labeled from `0` to `8`. The graph contains the following undirected edges:
(0, 1)
(4, 5)
(5, 6)
(0, 2)
(6, 8)
(1, 6)
(2, 6)
(5, 7)
(7, 8)
Please count the number of simple cycles in the graph. A simple cycle is a cycle with at least 3 vertices, w... | {"metadata": "{\"environment\": \"CycleCounting\", \"config\": {\"seed\": 10239, \"parameter\": {\"N\": 9, \"edge_density\": 0.25, \"edges\": [[0, 1], [4, 5], [5, 6], [0, 2], [6, 8], [1, 6], [2, 6], [5, 7], [7, 8]], \"reference_answer\": 2}, \"passing_reward_threshold\": 1.0}}", "question": "You are given an **undirect... | rlve | |
<|im_start|>user
Please find 8 **distinct positive integers** such that the sums of all 8 * (8 - 1) / 2 distinct pairs among them (in any order) are exactly: 15, 7, 27, 18, 24, 24, 13, 17, 29, 18, 20, 12, 26, 23, 31, 18, 25, 15, 21, 19, 28, 16, 23, 13, 26, 21, 10, 21
Output these 8 integers, separated by spaces.<|im_en... | {"metadata": "{\"environment\": \"SquSquarks\", \"config\": {\"seed\": 10182, \"parameter\": {\"N\": 8, \"reference_answer\": \"11 2 16 5 10 8 15 13\", \"sums\": [15, 7, 27, 18, 24, 24, 13, 17, 29, 18, 20, 12, 26, 23, 31, 18, 25, 15, 21, 19, 28, 16, 23, 13, 26, 21, 10, 21]}, \"passing_reward_threshold\": 1.0}}", "quest... | rlve | |
<|im_start|>user
You are given a set of integers: 11 7 5 4 3 16 2
Please compute the number of set pairs (S, T) such that:
1. S and T are disjoint subsets of the given set.
2. For every x in S and y in T, gcd(x, y) = 1 (i.e., there is no pair with gcd > 1).<|im_end|>
<|im_start|>assistant
<think>
Okay, let's try to fi... | {"metadata": "{\"environment\": \"TwoSet_AllCoprime_Counting\", \"config\": {\"seed\": 10079, \"parameter\": {\"N\": 16, \"set\": [11, 7, 5, 4, 3, 16, 2], \"reference_answer\": 1215}, \"passing_reward_threshold\": 1.0}}", "question": "You are given a set of integers: 11 7 5 4 3 16 2\n\nPlease compute the number of set ... | rlve | |
<|im_start|>user
You are given 10 coins in a row (1-indexed from left to right). The i-th coin has value C[i]: C[1]=13 C[2]=19 C[3]=2 C[4]=16 C[5]=15 C[6]=7 C[7]=12 C[8]=10 C[9]=8 C[10]=17
Alice and Bob play alternately, with Alice going first. On a turn, a player removes some **positive number** of **leftmost** coins ... | {"metadata": "{\"environment\": \"CoinSquareGame\", \"config\": {\"seed\": 10248, \"parameter\": {\"N\": 10, \"C\": [13, 19, 2, 16, 15, 7, 12, 10, 8, 17], \"reference_answer\": 76}, \"passing_reward_threshold\": 1.0}}", "question": "You are given 10 coins in a row (1-indexed from left to right). The i-th coin has value... | rlve | |
<|im_start|>user
In a three-dimensional space, you start at point (0, 0, 0) and want to reach the point (1, 1, 0). 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 A... | {"metadata": "{\"environment\": \"BannedPointSupersetPathCounting\", \"config\": {\"seed\": 10382, \"parameter\": {\"MAX_N_M_R\": 6, \"MAX_O\": 20, \"N\": 1, \"M\": 1, \"R\": 0, \"O\": 2, \"obstacles\": [[0, 1, 0], [1, 0, 0]], \"MOD\": 2654, \"reference_answer\": 0}, \"passing_reward_threshold\": 1.0}}", "question": "I... | rlve | |
<|im_start|>user
You are given a set of integers: 11 2
Please compute the number of set pairs (S, T) such that:
1. S and T are disjoint subsets of the given set.
2. For every x in S and y in T, gcd(x, y) = 1 (i.e., there is no pair with gcd > 1).<|im_end|>
<|im_start|>assistant
<think>
Okay, let's try to figure out th... | {"metadata": "{\"environment\": \"TwoSet_AllCoprime_Counting\", \"config\": {\"seed\": 10390, \"parameter\": {\"N\": 16, \"set\": [11, 2], \"reference_answer\": 9}, \"passing_reward_threshold\": 1.0}}", "question": "You are given a set of integers: 11 2\n\nPlease compute the number of set pairs (S, T) such that:\n1. S ... | rlve | |
<|im_start|>user
You are given a **directed graph** with 8 vertices, labeled from 0 to 7. Each vertex `i` has exactly one incoming edge from vertex `A[i]` to vertex `i`. The initial array A is given as: A[0]=6 A[1]=4 A[2]=6 A[3]=4 A[4]=1 A[5]=7 A[6]=7 A[7]=0
You are allowed to modify A[i] to any other vertex `j` (0 ≤ ... | {"metadata": "{\"environment\": \"MinConversionToCycleCost\", \"config\": {\"seed\": 10234, \"parameter\": {\"N\": 8, \"A\": [6, 4, 6, 4, 1, 7, 7, 0], \"C\": [7, 2, 8, 5, 4, 7, 3, 6], \"gold_answer\": 12}, \"passing_reward_threshold\": 1.0}}", "question": "You are given a **directed graph** with 8 vertices, labeled fro... | rlve | |
<|im_start|>user
You are given 8 items labeled from `0` to `7`. Each item has a base value W[i] and a diminishing factor R[i]. The list of values and diminishing factors is given as:
W[0]=14 R[0]=8
W[1]=15 R[1]=1
W[2]=18 R[2]=3
W[3]=5 R[3]=7
W[4]=29 R[4]=5
W[5]=0 R[5]=5
W[6]=11 R[6]=6
W[7]=13 R[7]=6
You must select a ... | {"metadata": "{\"environment\": \"ValueDiminishingSelection\", \"config\": {\"seed\": 10402, \"parameter\": {\"N\": 8, \"W\": [14, 15, 18, 5, 29, 0, 11, 13], \"R\": [8, 1, 3, 7, 5, 5, 6, 6], \"gold_answer\": 62}, \"passing_reward_threshold\": 1.0}}", "question": "You are given 8 items labeled from `0` to `7`. Each item... | rlve | |
<|im_start|>user
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 A... | {"metadata": "{\"environment\": \"BannedPointSupersetPathCounting\", \"config\": {\"seed\": 10210, \"parameter\": {\"MAX_N_M_R\": 6, \"MAX_O\": 20, \"N\": 1, \"M\": 1, \"R\": 1, \"O\": 2, \"obstacles\": [[1, 0, 1], [1, 1, 0]], \"MOD\": 2009, \"reference_answer\": 2}, \"passing_reward_threshold\": 1.0}}", "question": "I... | rlve | |
<|im_start|>user
Please find 8 **distinct positive integers** such that the sums of all 8 * (8 - 1) / 2 distinct pairs among them (in any order) are exactly: 15, 12, 12, 13, 9, 20, 19, 22, 13, 11, 5, 6, 7, 9, 3, 19, 18, 16, 15, 8, 10, 14, 7, 16, 10, 25, 17, 6
Output these 8 integers, separated by spaces.<|im_end|>
<|im... | {"metadata": "{\"environment\": \"SquSquarks\", \"config\": {\"seed\": 10258, \"parameter\": {\"N\": 8, \"reference_answer\": \"8 5 4 6 11 1 2 14\", \"sums\": [15, 12, 12, 13, 9, 20, 19, 22, 13, 11, 5, 6, 7, 9, 3, 19, 18, 16, 15, 8, 10, 14, 7, 16, 10, 25, 17, 6]}, \"passing_reward_threshold\": 1.0}}", "question": "Plea... | rlve | |
<|im_start|>user
Please find 8 **distinct positive integers** such that the sums of all 8 * (8 - 1) / 2 distinct pairs among them (in any order) are exactly: 6, 18, 15, 8, 14, 16, 21, 14, 22, 28, 17, 12, 5, 11, 7, 14, 25, 19, 16, 19, 10, 23, 3, 17, 25, 13, 27, 16
Output these 8 integers, separated by spaces.<|im_end|>
... | {"metadata": "{\"environment\": \"SquSquarks\", \"config\": {\"seed\": 10098, \"parameter\": {\"N\": 8, \"reference_answer\": \"13 1 12 4 10 2 15 6\", \"sums\": [6, 18, 15, 8, 14, 16, 21, 14, 22, 28, 17, 12, 5, 11, 7, 14, 25, 19, 16, 19, 10, 23, 3, 17, 25, 13, 27, 16]}, \"passing_reward_threshold\": 1.0}}", "question":... | rlve | |
<|im_start|>user
You are given two arrays `T` and `D`, each containing 8 integers:
T[1]=6 D[1]=4
T[2]=3 D[2]=3
T[3]=6 D[3]=8
T[4]=8 D[4]=3
T[5]=7 D[5]=4
T[6]=6 D[6]=1
T[7]=1 D[7]=8
T[8]=6 D[8]=8
Please output **a permutation of 1 to 8**, denoted as p[1], p[2], ..., p[8] (8 integers in one line) with adjacent numbers s... | {"metadata": "{\"environment\": \"ProtectingFlowers\", \"config\": {\"seed\": 10229, \"parameter\": {\"N\": 8, \"T\": [6, 3, 6, 8, 7, 6, 1, 6], \"D\": [4, 3, 8, 3, 4, 1, 8, 8], \"gold_answer\": 379}, \"passing_reward_threshold\": 1.0}}", "question": "You are given two arrays `T` and `D`, each containing 8 integers:\nT[... | rlve | |
<|im_start|>user
You are given two arrays `T` and `D`, each containing 8 integers:
T[1]=3 D[1]=8
T[2]=4 D[2]=8
T[3]=1 D[3]=7
T[4]=6 D[4]=3
T[5]=5 D[5]=8
T[6]=8 D[6]=8
T[7]=8 D[7]=6
T[8]=3 D[8]=2
Please output **a permutation of 1 to 8**, denoted as p[1], p[2], ..., p[8] (8 integers in one line) with adjacent numbers s... | {"metadata": "{\"environment\": \"ProtectingFlowers\", \"config\": {\"seed\": 10382, \"parameter\": {\"N\": 8, \"T\": [3, 4, 1, 6, 5, 8, 8, 3], \"D\": [8, 8, 7, 3, 8, 8, 6, 2], \"gold_answer\": 488}, \"passing_reward_threshold\": 1.0}}", "question": "You are given two arrays `T` and `D`, each containing 8 integers:\nT[... | rlve | |
<|im_start|>user
Please find 8 **distinct positive integers** such that the sums of all 8 * (8 - 1) / 2 distinct pairs among them (in any order) are exactly: 14, 17, 11, 20, 23, 21, 25, 24, 15, 22, 27, 22, 20, 18, 21, 29, 14, 21, 13, 24, 26, 23, 31, 17, 20, 28, 30, 19
Output these 8 integers, separated by spaces.<|im_e... | {"metadata": "{\"environment\": \"SquSquarks\", \"config\": {\"seed\": 10008, \"parameter\": {\"N\": 8, \"reference_answer\": \"5 15 8 14 16 6 12 9\", \"sums\": [14, 17, 11, 20, 23, 21, 25, 24, 15, 22, 27, 22, 20, 18, 21, 29, 14, 21, 13, 24, 26, 23, 31, 17, 20, 28, 30, 19]}, \"passing_reward_threshold\": 1.0}}", "quest... | rlve | |
<|im_start|>user
There are 7 segments in the 2D plane, given as:
(1, 2)-(7, 7)
(5, 14)-(11, 4)
(13, 6)-(10, 6)
(12, 11)-(13, 13)
(5, 8)-(8, 7)
(12, 10)-(10, 6)
(6, 10)-(13, 14)
You may shoot at most 1 rays from the origin (0, 0) in any directions. Each segment is allowed to intersect with **at most one** of these rays... | {"metadata": "{\"environment\": \"LASLaser\", \"config\": {\"seed\": 10203, \"parameter\": {\"N\": 7, \"segments\": [[1, 2, 7, 7], [5, 14, 11, 4], [13, 6, 10, 6], [12, 11, 13, 13], [5, 8, 8, 7], [12, 10, 10, 6], [6, 10, 13, 14]], \"K\": 1, \"reference_answer\": 4}, \"passing_reward_threshold\": 1.0}}", "question": "The... | rlve | |
<|im_start|>user
You are given an **undirected graph** with 9 vertices, labeled from `0` to `8`. The graph contains the following undirected edges:
(4, 8)
(3, 4)
(1, 4)
(3, 8)
(0, 2)
(7, 8)
(2, 5)
(1, 7)
(0, 6)
Please count the number of simple cycles in the graph. A simple cycle is a cycle with at least 3 vertices, w... | {"metadata": "{\"environment\": \"CycleCounting\", \"config\": {\"seed\": 10461, \"parameter\": {\"N\": 9, \"edge_density\": 0.25, \"edges\": [[4, 8], [3, 4], [1, 4], [3, 8], [0, 2], [7, 8], [2, 5], [1, 7], [0, 6]], \"reference_answer\": 3}, \"passing_reward_threshold\": 1.0}}", "question": "You are given an **undirect... | rlve |
End of preview. Expand in Data Studio
No dataset card yet
- Downloads last month
- 39