problem
stringclasses 5
values | n
int64 5
9
| p
float64 0.2
1
| answer
float64 0
9
| prompt
stringlengths 364
666
|
|---|---|---|---|---|
LargestCycle | 8 | 1 | 8 | Given a graph with 8 nodes indexed 0 through 7 and 28 edges (0, 1), (0, 2), (0, 3), (0, 4), (0, 5), (0, 6), (0, 7), (1, 2), (1, 3), (1, 4), (1, 5), (1, 6), (1, 7), (2, 3), (2, 4), (2, 5), (2, 6), (2, 7), (3, 4), (3, 5), (3, 6), (3, 7), (4, 5), (4, 6), (4, 7), (5, 6), (5, 7), (6, 7), where an edge (i,j) means that node i and node j are connected with an directed edge., what is its largest cycle, the length of the longest cycle in the graph? If the answer is a floating point number, round it to 2 decimal places. Please give answer in \boxed{} format. |
LargestCycle | 9 | 0.2 | 5 | Given a graph with 9 nodes indexed 0 through 8 and 9 edges (0, 3), (0, 6), (1, 4), (1, 5), (1, 7), (2, 3), (3, 7), (3, 8), (5, 8), where an edge (i,j) means that node i and node j are connected with an directed edge., what is its largest cycle, the length of the longest cycle in the graph? If the answer is a floating point number, round it to 2 decimal places. Please give answer in \boxed{} format. |
LargestCycle | 9 | 0.3 | 5 | Given a graph with 9 nodes indexed 0 through 8 and 11 edges (0, 1), (0, 2), (0, 3), (0, 6), (0, 7), (1, 2), (1, 4), (2, 7), (4, 7), (5, 6), (5, 8), where an edge (i,j) means that node i and node j are connected with an directed edge., what is its largest cycle, the length of the longest cycle in the graph? If the answer is a floating point number, round it to 2 decimal places. Please give answer in \boxed{} format. |
LargestCycle | 9 | 0.3 | 7 | Given a graph with 9 nodes indexed 0 through 8 and 12 edges (0, 7), (1, 6), (1, 7), (2, 8), (3, 4), (3, 5), (3, 7), (3, 8), (4, 5), (5, 6), (5, 7), (6, 8), where an edge (i,j) means that node i and node j are connected with an directed edge., what is its largest cycle, the length of the longest cycle in the graph? If the answer is a floating point number, round it to 2 decimal places. Please give answer in \boxed{} format. |
LargestCycle | 9 | 0.3 | 7 | Given a graph with 9 nodes indexed 0 through 8 and 11 edges (0, 4), (0, 5), (0, 6), (0, 8), (1, 5), (2, 5), (2, 8), (3, 4), (3, 6), (3, 7), (5, 7), where an edge (i,j) means that node i and node j are connected with an directed edge., what is its largest cycle, the length of the longest cycle in the graph? If the answer is a floating point number, round it to 2 decimal places. Please give answer in \boxed{} format. |
LargestCycle | 9 | 0.4 | 7 | Given a graph with 9 nodes indexed 0 through 8 and 13 edges (0, 3), (0, 4), (0, 5), (0, 8), (1, 7), (2, 6), (2, 7), (2, 8), (3, 6), (4, 8), (5, 8), (6, 7), (6, 8), where an edge (i,j) means that node i and node j are connected with an directed edge., what is its largest cycle, the length of the longest cycle in the graph? If the answer is a floating point number, round it to 2 decimal places. Please give answer in \boxed{} format. |
LargestCycle | 9 | 0.4 | 5 | Given a graph with 9 nodes indexed 0 through 8 and 12 edges (0, 1), (0, 2), (0, 3), (0, 6), (0, 7), (1, 2), (1, 3), (1, 7), (2, 4), (3, 7), (5, 6), (7, 8), where an edge (i,j) means that node i and node j are connected with an directed edge., what is its largest cycle, the length of the longest cycle in the graph? If the answer is a floating point number, round it to 2 decimal places. Please give answer in \boxed{} format. |
LargestCycle | 9 | 0.5 | 9 | Given a graph with 9 nodes indexed 0 through 8 and 21 edges (0, 1), (0, 2), (0, 3), (0, 7), (0, 8), (1, 2), (1, 7), (1, 8), (2, 3), (2, 4), (2, 6), (2, 7), (2, 8), (3, 5), (3, 6), (3, 8), (4, 8), (5, 6), (6, 7), (6, 8), (7, 8), where an edge (i,j) means that node i and node j are connected with an directed edge., what is its largest cycle, the length of the longest cycle in the graph? If the answer is a floating point number, round it to 2 decimal places. Please give answer in \boxed{} format. |
LargestCycle | 9 | 0.5 | 7 | Given a graph with 9 nodes indexed 0 through 8 and 15 edges (0, 5), (1, 2), (1, 4), (1, 7), (2, 3), (2, 4), (2, 6), (2, 7), (3, 5), (3, 7), (4, 5), (4, 6), (4, 7), (5, 7), (7, 8), where an edge (i,j) means that node i and node j are connected with an directed edge., what is its largest cycle, the length of the longest cycle in the graph? If the answer is a floating point number, round it to 2 decimal places. Please give answer in \boxed{} format. |
LargestCycle | 9 | 0.5 | 7 | Given a graph with 9 nodes indexed 0 through 8 and 17 edges (0, 1), (0, 2), (0, 3), (0, 4), (0, 5), (0, 6), (0, 7), (0, 8), (1, 3), (2, 3), (2, 6), (2, 7), (3, 4), (3, 5), (3, 7), (5, 7), (6, 7), where an edge (i,j) means that node i and node j are connected with an directed edge., what is its largest cycle, the length of the longest cycle in the graph? If the answer is a floating point number, round it to 2 decimal places. Please give answer in \boxed{} format. |
LargestCycle | 9 | 0.6 | 9 | Given a graph with 9 nodes indexed 0 through 8 and 17 edges (0, 1), (0, 2), (0, 4), (0, 5), (1, 4), (1, 7), (2, 3), (2, 5), (2, 7), (2, 8), (3, 4), (3, 5), (3, 6), (4, 8), (5, 7), (5, 8), (6, 8), where an edge (i,j) means that node i and node j are connected with an directed edge., what is its largest cycle, the length of the longest cycle in the graph? If the answer is a floating point number, round it to 2 decimal places. Please give answer in \boxed{} format. |
LargestCycle | 9 | 0.6 | 9 | Given a graph with 9 nodes indexed 0 through 8 and 20 edges (0, 4), (0, 5), (0, 6), (0, 7), (0, 8), (1, 3), (1, 4), (1, 6), (1, 7), (2, 3), (2, 7), (2, 8), (3, 7), (3, 8), (4, 6), (4, 8), (5, 6), (5, 7), (6, 7), (7, 8), where an edge (i,j) means that node i and node j are connected with an directed edge., what is its largest cycle, the length of the longest cycle in the graph? If the answer is a floating point number, round it to 2 decimal places. Please give answer in \boxed{} format. |
LargestCycle | 9 | 0.6 | 9 | Given a graph with 9 nodes indexed 0 through 8 and 26 edges (0, 1), (0, 2), (0, 3), (0, 4), (0, 6), (0, 8), (1, 2), (1, 3), (1, 6), (1, 7), (2, 3), (2, 5), (2, 8), (3, 4), (3, 5), (3, 6), (3, 8), (4, 5), (4, 6), (4, 7), (4, 8), (5, 6), (5, 7), (5, 8), (6, 8), (7, 8), where an edge (i,j) means that node i and node j are connected with an directed edge., what is its largest cycle, the length of the longest cycle in the graph? If the answer is a floating point number, round it to 2 decimal places. Please give answer in \boxed{} format. |
LargestCycle | 9 | 0.7 | 9 | Given a graph with 9 nodes indexed 0 through 8 and 23 edges (0, 1), (0, 2), (0, 3), (0, 4), (0, 5), (0, 7), (0, 8), (1, 2), (1, 3), (1, 5), (1, 6), (1, 7), (1, 8), (2, 4), (2, 6), (3, 5), (3, 6), (4, 5), (4, 6), (4, 7), (5, 7), (6, 7), (7, 8), where an edge (i,j) means that node i and node j are connected with an directed edge., what is its largest cycle, the length of the longest cycle in the graph? If the answer is a floating point number, round it to 2 decimal places. Please give answer in \boxed{} format. |
LargestCycle | 9 | 0.7 | 9 | Given a graph with 9 nodes indexed 0 through 8 and 23 edges (0, 1), (0, 4), (0, 5), (0, 7), (1, 3), (1, 4), (1, 5), (1, 6), (1, 8), (2, 4), (2, 5), (2, 6), (2, 8), (3, 5), (3, 6), (3, 7), (3, 8), (4, 5), (4, 6), (5, 6), (5, 8), (6, 7), (7, 8), where an edge (i,j) means that node i and node j are connected with an directed edge., what is its largest cycle, the length of the longest cycle in the graph? If the answer is a floating point number, round it to 2 decimal places. Please give answer in \boxed{} format. |
LargestCycle | 9 | 0.7 | 9 | Given a graph with 9 nodes indexed 0 through 8 and 29 edges (0, 1), (0, 2), (0, 3), (0, 4), (0, 5), (0, 6), (0, 7), (0, 8), (1, 2), (1, 4), (1, 5), (1, 6), (1, 7), (1, 8), (2, 3), (2, 4), (2, 6), (2, 7), (3, 4), (3, 5), (3, 6), (3, 7), (3, 8), (4, 5), (4, 6), (4, 7), (5, 6), (5, 7), (7, 8), where an edge (i,j) means that node i and node j are connected with an directed edge., what is its largest cycle, the length of the longest cycle in the graph? If the answer is a floating point number, round it to 2 decimal places. Please give answer in \boxed{} format. |
LargestCycle | 9 | 0.8 | 9 | Given a graph with 9 nodes indexed 0 through 8 and 32 edges (0, 1), (0, 2), (0, 3), (0, 4), (0, 5), (0, 6), (0, 7), (0, 8), (1, 2), (1, 5), (1, 6), (1, 7), (1, 8), (2, 3), (2, 4), (2, 5), (2, 6), (2, 7), (2, 8), (3, 4), (3, 5), (3, 7), (3, 8), (4, 5), (4, 6), (4, 7), (4, 8), (5, 6), (5, 8), (6, 7), (6, 8), (7, 8), where an edge (i,j) means that node i and node j are connected with an directed edge., what is its largest cycle, the length of the longest cycle in the graph? If the answer is a floating point number, round it to 2 decimal places. Please give answer in \boxed{} format. |
LargestCycle | 9 | 0.8 | 9 | Given a graph with 9 nodes indexed 0 through 8 and 31 edges (0, 1), (0, 2), (0, 4), (0, 5), (0, 6), (0, 7), (0, 8), (1, 3), (1, 5), (1, 6), (1, 7), (1, 8), (2, 3), (2, 4), (2, 5), (2, 6), (2, 7), (2, 8), (3, 4), (3, 5), (3, 6), (3, 8), (4, 5), (4, 6), (4, 7), (4, 8), (5, 7), (5, 8), (6, 7), (6, 8), (7, 8), where an edge (i,j) means that node i and node j are connected with an directed edge., what is its largest cycle, the length of the longest cycle in the graph? If the answer is a floating point number, round it to 2 decimal places. Please give answer in \boxed{} format. |
LargestCycle | 9 | 0.8 | 9 | Given a graph with 9 nodes indexed 0 through 8 and 30 edges (0, 1), (0, 2), (0, 3), (0, 4), (0, 5), (0, 6), (0, 7), (0, 8), (1, 2), (1, 3), (1, 4), (1, 5), (1, 7), (1, 8), (2, 3), (2, 4), (2, 5), (2, 6), (2, 7), (3, 5), (3, 6), (4, 5), (4, 6), (4, 7), (4, 8), (5, 7), (5, 8), (6, 7), (6, 8), (7, 8), where an edge (i,j) means that node i and node j are connected with an directed edge., what is its largest cycle, the length of the longest cycle in the graph? If the answer is a floating point number, round it to 2 decimal places. Please give answer in \boxed{} format. |
LargestCycle | 9 | 0.9 | 9 | Given a graph with 9 nodes indexed 0 through 8 and 30 edges (0, 4), (0, 5), (0, 6), (0, 7), (0, 8), (1, 2), (1, 3), (1, 4), (1, 5), (1, 6), (1, 7), (1, 8), (2, 3), (2, 4), (2, 5), (2, 6), (2, 7), (2, 8), (3, 4), (3, 5), (3, 6), (3, 7), (3, 8), (4, 5), (4, 7), (4, 8), (5, 7), (6, 7), (6, 8), (7, 8), where an edge (i,j) means that node i and node j are connected with an directed edge., what is its largest cycle, the length of the longest cycle in the graph? If the answer is a floating point number, round it to 2 decimal places. Please give answer in \boxed{} format. |
LargestCycle | 9 | 0.9 | 9 | Given a graph with 9 nodes indexed 0 through 8 and 33 edges (0, 1), (0, 2), (0, 3), (0, 4), (0, 5), (0, 6), (0, 7), (0, 8), (1, 2), (1, 3), (1, 4), (1, 5), (1, 7), (1, 8), (2, 3), (2, 4), (2, 6), (2, 7), (2, 8), (3, 4), (3, 5), (3, 6), (3, 8), (4, 5), (4, 6), (4, 7), (4, 8), (5, 6), (5, 7), (5, 8), (6, 7), (6, 8), (7, 8), where an edge (i,j) means that node i and node j are connected with an directed edge., what is its largest cycle, the length of the longest cycle in the graph? If the answer is a floating point number, round it to 2 decimal places. Please give answer in \boxed{} format. |
LargestCycle | 9 | 0.9 | 9 | Given a graph with 9 nodes indexed 0 through 8 and 34 edges (0, 1), (0, 2), (0, 3), (0, 4), (0, 5), (0, 6), (0, 7), (0, 8), (1, 2), (1, 3), (1, 4), (1, 5), (1, 6), (1, 7), (1, 8), (2, 3), (2, 4), (2, 5), (2, 6), (2, 7), (2, 8), (3, 4), (3, 5), (3, 6), (3, 7), (3, 8), (4, 5), (4, 6), (4, 7), (4, 8), (5, 6), (5, 7), (5, 8), (6, 8), where an edge (i,j) means that node i and node j are connected with an directed edge., what is its largest cycle, the length of the longest cycle in the graph? If the answer is a floating point number, round it to 2 decimal places. Please give answer in \boxed{} format. |
LargestCycle | 9 | 1 | 9 | Given a graph with 9 nodes indexed 0 through 8 and 36 edges (0, 1), (0, 2), (0, 3), (0, 4), (0, 5), (0, 6), (0, 7), (0, 8), (1, 2), (1, 3), (1, 4), (1, 5), (1, 6), (1, 7), (1, 8), (2, 3), (2, 4), (2, 5), (2, 6), (2, 7), (2, 8), (3, 4), (3, 5), (3, 6), (3, 7), (3, 8), (4, 5), (4, 6), (4, 7), (4, 8), (5, 6), (5, 7), (5, 8), (6, 7), (6, 8), (7, 8), where an edge (i,j) means that node i and node j are connected with an directed edge., what is its largest cycle, the length of the longest cycle in the graph? If the answer is a floating point number, round it to 2 decimal places. Please give answer in \boxed{} format. |
LargestCycle | 9 | 1 | 9 | Given a graph with 9 nodes indexed 0 through 8 and 36 edges (0, 1), (0, 2), (0, 3), (0, 4), (0, 5), (0, 6), (0, 7), (0, 8), (1, 2), (1, 3), (1, 4), (1, 5), (1, 6), (1, 7), (1, 8), (2, 3), (2, 4), (2, 5), (2, 6), (2, 7), (2, 8), (3, 4), (3, 5), (3, 6), (3, 7), (3, 8), (4, 5), (4, 6), (4, 7), (4, 8), (5, 6), (5, 7), (5, 8), (6, 7), (6, 8), (7, 8), where an edge (i,j) means that node i and node j are connected with an directed edge., what is its largest cycle, the length of the longest cycle in the graph? If the answer is a floating point number, round it to 2 decimal places. Please give answer in \boxed{} format. |
LargestCycle | 9 | 1 | 9 | Given a graph with 9 nodes indexed 0 through 8 and 36 edges (0, 1), (0, 2), (0, 3), (0, 4), (0, 5), (0, 6), (0, 7), (0, 8), (1, 2), (1, 3), (1, 4), (1, 5), (1, 6), (1, 7), (1, 8), (2, 3), (2, 4), (2, 5), (2, 6), (2, 7), (2, 8), (3, 4), (3, 5), (3, 6), (3, 7), (3, 8), (4, 5), (4, 6), (4, 7), (4, 8), (5, 6), (5, 7), (5, 8), (6, 7), (6, 8), (7, 8), where an edge (i,j) means that node i and node j are connected with an directed edge., what is its largest cycle, the length of the longest cycle in the graph? If the answer is a floating point number, round it to 2 decimal places. Please give answer in \boxed{} format. |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.