task
stringclasses 6
values | level
int64 1
5
| split
stringclasses 1
value | question
stringlengths 117
20.7k
| answer
stringclasses 685
values | metadata
stringlengths 165
40.3k
| config
stringclasses 30
values | seed
int64 3.23M
1.97B
|
|---|---|---|---|---|---|---|---|
course_schedule
| 1
|
train
|
There are a total of 8 courses you have to take, labeled from 0 to 7.
You are given the following list of prerequisites, where prerequisites[i] = (a_i, b_i) indicates that you must first take course b_i if you want to take course a_i:
[(3, 4), (0, 3), (5, 1), (6, 1), (4, 1), (7, 3), (2, 6), (6, 3), (7, 6), (2, 3), (5, 3), (5, 4), (6, 4), (7, 4), (3, 1), (0, 6), (2, 0)]
Return True if you can finish all courses considering the prerequisites, or False otherwise.
|
True
|
{"source_dataset":"course_schedule","source_index":0,"courses":[1,4,3,6,0,2,5,7],"prerequisites":[[3,4],[0,3],[5,1],[6,1],[4,1],[7,3],[2,6],[6,3],[7,6],[2,3],[5,3],[5,4],[6,4],[7,4],[3,1],[0,6],[2,0]],"solution":true,"solvable":true,"difficulty":{"num_courses":[5,10],"num_prerequisites":[2,3],"cycle_length":[3,4]}}
|
{"min_num_courses":5,"max_num_courses":10,"min_num_prerequisites":2,"max_num_prerequisites":3,"min_cycle_length":3,"max_cycle_length":4,"p_solvable":0.6}
| 679,778,029
|
course_schedule
| 1
|
train
|
There are a total of 6 courses you have to take, labeled from 0 to 5.
You are given the following list of prerequisites, where prerequisites[i] = (a_i, b_i) indicates that you must first take course b_i if you want to take course a_i:
[(0, 3), (0, 1), (2, 4), (3, 1), (0, 2), (5, 3), (5, 4), (4, 1), (3, 4), (5, 1), (2, 3)]
Return True if you can finish all courses considering the prerequisites, or False otherwise.
|
True
|
{"source_dataset":"course_schedule","source_index":1,"courses":[1,4,3,5,2,0],"prerequisites":[[0,3],[0,1],[2,4],[3,1],[0,2],[5,3],[5,4],[4,1],[3,4],[5,1],[2,3]],"solution":true,"solvable":true,"difficulty":{"num_courses":[5,10],"num_prerequisites":[2,3],"cycle_length":[3,4]}}
|
{"min_num_courses":5,"max_num_courses":10,"min_num_prerequisites":2,"max_num_prerequisites":3,"min_cycle_length":3,"max_cycle_length":4,"p_solvable":0.6}
| 679,778,029
|
course_schedule
| 1
|
train
|
There are a total of 9 courses you have to take, labeled from 0 to 8.
You are given the following list of prerequisites, where prerequisites[i] = (a_i, b_i) indicates that you must first take course b_i if you want to take course a_i:
[(4, 2), (8, 3), (0, 8), (6, 8), (4, 7), (7, 1), (0, 1), (0, 2), (5, 1), (2, 1), (5, 4), (2, 8), (7, 2), (5, 3), (7, 6), (8, 1), (1, 3), (4, 1), (6, 2)]
Return True if you can finish all courses considering the prerequisites, or False otherwise.
|
True
|
{"source_dataset":"course_schedule","source_index":2,"courses":[3,1,8,2,6,7,4,0,5],"prerequisites":[[4,2],[8,3],[0,8],[6,8],[4,7],[7,1],[0,1],[0,2],[5,1],[2,1],[5,4],[2,8],[7,2],[5,3],[7,6],[8,1],[1,3],[4,1],[6,2]],"solution":true,"solvable":true,"difficulty":{"num_courses":[5,10],"num_prerequisites":[2,3],"cycle_length":[3,4]}}
|
{"min_num_courses":5,"max_num_courses":10,"min_num_prerequisites":2,"max_num_prerequisites":3,"min_cycle_length":3,"max_cycle_length":4,"p_solvable":0.6}
| 679,778,029
|
course_schedule
| 1
|
train
|
There are a total of 8 courses you have to take, labeled from 0 to 7.
You are given the following list of prerequisites, where prerequisites[i] = (a_i, b_i) indicates that you must first take course b_i if you want to take course a_i:
[(2, 4), (2, 0), (7, 0), (0, 3), (1, 2), (6, 2), (2, 5), (3, 5), (7, 6), (6, 4), (0, 2), (4, 5), (4, 3), (1, 4), (3, 2), (0, 4), (0, 6), (3, 4), (7, 4), (6, 3)]
Return True if you can finish all courses considering the prerequisites, or False otherwise.
|
False
|
{"source_dataset":"course_schedule","source_index":3,"courses":[5,4,2,3,6,0,7,1],"prerequisites":[[2,4],[2,0],[7,0],[0,3],[1,2],[6,2],[2,5],[3,5],[7,6],[6,4],[0,2],[4,5],[4,3],[1,4],[3,2],[0,4],[0,6],[3,4],[7,4],[6,3]],"solution":false,"solvable":false,"difficulty":{"num_courses":[5,10],"num_prerequisites":[2,3],"cycle_length":[3,4]}}
|
{"min_num_courses":5,"max_num_courses":10,"min_num_prerequisites":2,"max_num_prerequisites":3,"min_cycle_length":3,"max_cycle_length":4,"p_solvable":0.6}
| 679,778,029
|
course_schedule
| 1
|
train
|
There are a total of 6 courses you have to take, labeled from 0 to 5.
You are given the following list of prerequisites, where prerequisites[i] = (a_i, b_i) indicates that you must first take course b_i if you want to take course a_i:
[(1, 3), (5, 3), (4, 0), (4, 2), (2, 3), (2, 5), (0, 3), (1, 2), (4, 3), (0, 5), (1, 0)]
Return True if you can finish all courses considering the prerequisites, or False otherwise.
|
True
|
{"source_dataset":"course_schedule","source_index":4,"courses":[3,5,2,0,4,1],"prerequisites":[[1,3],[5,3],[4,0],[4,2],[2,3],[2,5],[0,3],[1,2],[4,3],[0,5],[1,0]],"solution":true,"solvable":true,"difficulty":{"num_courses":[5,10],"num_prerequisites":[2,3],"cycle_length":[3,4]}}
|
{"min_num_courses":5,"max_num_courses":10,"min_num_prerequisites":2,"max_num_prerequisites":3,"min_cycle_length":3,"max_cycle_length":4,"p_solvable":0.6}
| 679,778,029
|
course_schedule
| 1
|
train
|
There are a total of 10 courses you have to take, labeled from 0 to 9.
You are given the following list of prerequisites, where prerequisites[i] = (a_i, b_i) indicates that you must first take course b_i if you want to take course a_i:
[(6, 3), (3, 0), (4, 1), (2, 3), (1, 0), (8, 0), (4, 5), (1, 3), (2, 9), (1, 8), (0, 7), (5, 9), (7, 9), (9, 3), (9, 8), (7, 3), (6, 5), (7, 8), (9, 0), (8, 3), (6, 1), (5, 8), (2, 5)]
Return True if you can finish all courses considering the prerequisites, or False otherwise.
|
False
|
{"source_dataset":"course_schedule","source_index":5,"courses":[0,3,8,9,1,5,7,2,6,4],"prerequisites":[[6,3],[3,0],[4,1],[2,3],[1,0],[8,0],[4,5],[1,3],[2,9],[1,8],[0,7],[5,9],[7,9],[9,3],[9,8],[7,3],[6,5],[7,8],[9,0],[8,3],[6,1],[5,8],[2,5]],"solution":false,"solvable":false,"difficulty":{"num_courses":[5,10],"num_prerequisites":[2,3],"cycle_length":[3,4]}}
|
{"min_num_courses":5,"max_num_courses":10,"min_num_prerequisites":2,"max_num_prerequisites":3,"min_cycle_length":3,"max_cycle_length":4,"p_solvable":0.6}
| 679,778,029
|
course_schedule
| 1
|
train
|
There are a total of 7 courses you have to take, labeled from 0 to 6.
You are given the following list of prerequisites, where prerequisites[i] = (a_i, b_i) indicates that you must first take course b_i if you want to take course a_i:
[(6, 3), (3, 0), (3, 2), (4, 2), (6, 4), (2, 0), (4, 3), (6, 5), (1, 6), (5, 4), (1, 5), (5, 3)]
Return True if you can finish all courses considering the prerequisites, or False otherwise.
|
True
|
{"source_dataset":"course_schedule","source_index":6,"courses":[0,2,3,4,5,6,1],"prerequisites":[[6,3],[3,0],[3,2],[4,2],[6,4],[2,0],[4,3],[6,5],[1,6],[5,4],[1,5],[5,3]],"solution":true,"solvable":true,"difficulty":{"num_courses":[5,10],"num_prerequisites":[2,3],"cycle_length":[3,4]}}
|
{"min_num_courses":5,"max_num_courses":10,"min_num_prerequisites":2,"max_num_prerequisites":3,"min_cycle_length":3,"max_cycle_length":4,"p_solvable":0.6}
| 679,778,029
|
course_schedule
| 1
|
train
|
There are a total of 8 courses you have to take, labeled from 0 to 7.
You are given the following list of prerequisites, where prerequisites[i] = (a_i, b_i) indicates that you must first take course b_i if you want to take course a_i:
[(1, 3), (1, 4), (7, 3), (5, 1), (0, 1), (5, 3), (5, 4), (4, 3), (2, 5), (2, 0), (6, 7), (7, 1), (0, 7), (7, 4), (6, 3), (2, 3)]
Return True if you can finish all courses considering the prerequisites, or False otherwise.
|
True
|
{"source_dataset":"course_schedule","source_index":7,"courses":[3,4,1,7,5,0,6,2],"prerequisites":[[1,3],[1,4],[7,3],[5,1],[0,1],[5,3],[5,4],[4,3],[2,5],[2,0],[6,7],[7,1],[0,7],[7,4],[6,3],[2,3]],"solution":true,"solvable":true,"difficulty":{"num_courses":[5,10],"num_prerequisites":[2,3],"cycle_length":[3,4]}}
|
{"min_num_courses":5,"max_num_courses":10,"min_num_prerequisites":2,"max_num_prerequisites":3,"min_cycle_length":3,"max_cycle_length":4,"p_solvable":0.6}
| 679,778,029
|
course_schedule
| 1
|
train
|
There are a total of 9 courses you have to take, labeled from 0 to 8.
You are given the following list of prerequisites, where prerequisites[i] = (a_i, b_i) indicates that you must first take course b_i if you want to take course a_i:
[(0, 4), (0, 8), (7, 2), (5, 6), (1, 2), (2, 8), (4, 3), (7, 0), (2, 6), (7, 8), (0, 2), (2, 5), (3, 8), (3, 0), (5, 8), (6, 8), (4, 8), (4, 5), (1, 8), (1, 6), (3, 2)]
Return True if you can finish all courses considering the prerequisites, or False otherwise.
|
False
|
{"source_dataset":"course_schedule","source_index":8,"courses":[8,6,5,2,0,7,1,3,4],"prerequisites":[[0,4],[0,8],[7,2],[5,6],[1,2],[2,8],[4,3],[7,0],[2,6],[7,8],[0,2],[2,5],[3,8],[3,0],[5,8],[6,8],[4,8],[4,5],[1,8],[1,6],[3,2]],"solution":false,"solvable":false,"difficulty":{"num_courses":[5,10],"num_prerequisites":[2,3],"cycle_length":[3,4]}}
|
{"min_num_courses":5,"max_num_courses":10,"min_num_prerequisites":2,"max_num_prerequisites":3,"min_cycle_length":3,"max_cycle_length":4,"p_solvable":0.6}
| 679,778,029
|
course_schedule
| 1
|
train
|
There are a total of 10 courses you have to take, labeled from 0 to 9.
You are given the following list of prerequisites, where prerequisites[i] = (a_i, b_i) indicates that you must first take course b_i if you want to take course a_i:
[(7, 8), (7, 5), (6, 0), (4, 5), (3, 5), (6, 8), (0, 8), (2, 1), (4, 9), (2, 8), (3, 7), (5, 8), (6, 1), (9, 2), (4, 1), (9, 3), (1, 8), (5, 0), (1, 0)]
Return True if you can finish all courses considering the prerequisites, or False otherwise.
|
True
|
{"source_dataset":"course_schedule","source_index":9,"courses":[8,0,5,7,1,6,2,3,9,4],"prerequisites":[[7,8],[7,5],[6,0],[4,5],[3,5],[6,8],[0,8],[2,1],[4,9],[2,8],[3,7],[5,8],[6,1],[9,2],[4,1],[9,3],[1,8],[5,0],[1,0]],"solution":true,"solvable":true,"difficulty":{"num_courses":[5,10],"num_prerequisites":[2,3],"cycle_length":[3,4]}}
|
{"min_num_courses":5,"max_num_courses":10,"min_num_prerequisites":2,"max_num_prerequisites":3,"min_cycle_length":3,"max_cycle_length":4,"p_solvable":0.6}
| 679,778,029
|
course_schedule
| 1
|
train
|
There are a total of 10 courses you have to take, labeled from 0 to 9.
You are given the following list of prerequisites, where prerequisites[i] = (a_i, b_i) indicates that you must first take course b_i if you want to take course a_i:
[(0, 8), (5, 8), (9, 6), (7, 1), (7, 8), (5, 7), (3, 1), (6, 8), (2, 0), (2, 6), (6, 5), (9, 7), (4, 0), (8, 1), (3, 0), (5, 1), (4, 3), (0, 1)]
Return True if you can finish all courses considering the prerequisites, or False otherwise.
|
True
|
{"source_dataset":"course_schedule","source_index":10,"courses":[1,8,7,5,0,3,4,6,9,2],"prerequisites":[[0,8],[5,8],[9,6],[7,1],[7,8],[5,7],[3,1],[6,8],[2,0],[2,6],[6,5],[9,7],[4,0],[8,1],[3,0],[5,1],[4,3],[0,1]],"solution":true,"solvable":true,"difficulty":{"num_courses":[5,10],"num_prerequisites":[2,3],"cycle_length":[3,4]}}
|
{"min_num_courses":5,"max_num_courses":10,"min_num_prerequisites":2,"max_num_prerequisites":3,"min_cycle_length":3,"max_cycle_length":4,"p_solvable":0.6}
| 679,778,029
|
course_schedule
| 1
|
train
|
There are a total of 6 courses you have to take, labeled from 0 to 5.
You are given the following list of prerequisites, where prerequisites[i] = (a_i, b_i) indicates that you must first take course b_i if you want to take course a_i:
[(5, 0), (5, 2), (1, 0), (3, 0), (4, 3), (5, 3), (3, 2), (4, 5), (0, 2), (1, 2)]
Return True if you can finish all courses considering the prerequisites, or False otherwise.
|
True
|
{"source_dataset":"course_schedule","source_index":11,"courses":[2,0,3,1,5,4],"prerequisites":[[5,0],[5,2],[1,0],[3,0],[4,3],[5,3],[3,2],[4,5],[0,2],[1,2]],"solution":true,"solvable":true,"difficulty":{"num_courses":[5,10],"num_prerequisites":[2,3],"cycle_length":[3,4]}}
|
{"min_num_courses":5,"max_num_courses":10,"min_num_prerequisites":2,"max_num_prerequisites":3,"min_cycle_length":3,"max_cycle_length":4,"p_solvable":0.6}
| 679,778,029
|
course_schedule
| 1
|
train
|
There are a total of 5 courses you have to take, labeled from 0 to 4.
You are given the following list of prerequisites, where prerequisites[i] = (a_i, b_i) indicates that you must first take course b_i if you want to take course a_i:
[(4, 2), (0, 1), (2, 1), (3, 1), (3, 2), (2, 0), (3, 0), (1, 3), (3, 4), (4, 1), (4, 3)]
Return True if you can finish all courses considering the prerequisites, or False otherwise.
|
False
|
{"source_dataset":"course_schedule","source_index":12,"courses":[1,0,2,3,4],"prerequisites":[[4,2],[0,1],[2,1],[3,1],[3,2],[2,0],[3,0],[1,3],[3,4],[4,1],[4,3]],"solution":false,"solvable":false,"difficulty":{"num_courses":[5,10],"num_prerequisites":[2,3],"cycle_length":[3,4]}}
|
{"min_num_courses":5,"max_num_courses":10,"min_num_prerequisites":2,"max_num_prerequisites":3,"min_cycle_length":3,"max_cycle_length":4,"p_solvable":0.6}
| 679,778,029
|
course_schedule
| 1
|
train
|
There are a total of 5 courses you have to take, labeled from 0 to 4.
You are given the following list of prerequisites, where prerequisites[i] = (a_i, b_i) indicates that you must first take course b_i if you want to take course a_i:
[(2, 3), (2, 1), (2, 0), (2, 4), (4, 3), (0, 2), (3, 4), (4, 2), (0, 4), (4, 1), (1, 3), (0, 3)]
Return True if you can finish all courses considering the prerequisites, or False otherwise.
|
False
|
{"source_dataset":"course_schedule","source_index":13,"courses":[3,1,4,2,0],"prerequisites":[[2,3],[2,1],[2,0],[2,4],[4,3],[0,2],[3,4],[4,2],[0,4],[4,1],[1,3],[0,3]],"solution":false,"solvable":false,"difficulty":{"num_courses":[5,10],"num_prerequisites":[2,3],"cycle_length":[3,4]}}
|
{"min_num_courses":5,"max_num_courses":10,"min_num_prerequisites":2,"max_num_prerequisites":3,"min_cycle_length":3,"max_cycle_length":4,"p_solvable":0.6}
| 679,778,029
|
course_schedule
| 1
|
train
|
There are a total of 6 courses you have to take, labeled from 0 to 5.
You are given the following list of prerequisites, where prerequisites[i] = (a_i, b_i) indicates that you must first take course b_i if you want to take course a_i:
[(4, 5), (0, 4), (0, 1), (2, 4), (2, 1), (0, 2), (2, 5), (1, 5), (4, 1), (3, 2), (3, 0)]
Return True if you can finish all courses considering the prerequisites, or False otherwise.
|
True
|
{"source_dataset":"course_schedule","source_index":14,"courses":[5,1,4,2,0,3],"prerequisites":[[4,5],[0,4],[0,1],[2,4],[2,1],[0,2],[2,5],[1,5],[4,1],[3,2],[3,0]],"solution":true,"solvable":true,"difficulty":{"num_courses":[5,10],"num_prerequisites":[2,3],"cycle_length":[3,4]}}
|
{"min_num_courses":5,"max_num_courses":10,"min_num_prerequisites":2,"max_num_prerequisites":3,"min_cycle_length":3,"max_cycle_length":4,"p_solvable":0.6}
| 679,778,029
|
course_schedule
| 1
|
train
|
There are a total of 9 courses you have to take, labeled from 0 to 8.
You are given the following list of prerequisites, where prerequisites[i] = (a_i, b_i) indicates that you must first take course b_i if you want to take course a_i:
[(8, 3), (5, 4), (1, 7), (7, 6), (2, 4), (6, 4), (1, 5), (0, 5), (8, 4), (1, 0), (6, 3), (4, 0), (2, 3), (5, 8), (8, 6), (4, 3), (7, 5), (0, 8), (0, 2), (0, 7), (5, 3), (2, 8)]
Return True if you can finish all courses considering the prerequisites, or False otherwise.
|
False
|
{"source_dataset":"course_schedule","source_index":15,"courses":[3,4,6,8,2,5,7,0,1],"prerequisites":[[8,3],[5,4],[1,7],[7,6],[2,4],[6,4],[1,5],[0,5],[8,4],[1,0],[6,3],[4,0],[2,3],[5,8],[8,6],[4,3],[7,5],[0,8],[0,2],[0,7],[5,3],[2,8]],"solution":false,"solvable":false,"difficulty":{"num_courses":[5,10],"num_prerequisites":[2,3],"cycle_length":[3,4]}}
|
{"min_num_courses":5,"max_num_courses":10,"min_num_prerequisites":2,"max_num_prerequisites":3,"min_cycle_length":3,"max_cycle_length":4,"p_solvable":0.6}
| 679,778,029
|
course_schedule
| 1
|
train
|
There are a total of 5 courses you have to take, labeled from 0 to 4.
You are given the following list of prerequisites, where prerequisites[i] = (a_i, b_i) indicates that you must first take course b_i if you want to take course a_i:
[(4, 1), (4, 0), (3, 1), (1, 2), (3, 4), (0, 2), (2, 4), (3, 2), (4, 2), (1, 3), (1, 0)]
Return True if you can finish all courses considering the prerequisites, or False otherwise.
|
False
|
{"source_dataset":"course_schedule","source_index":16,"courses":[2,0,1,4,3],"prerequisites":[[4,1],[4,0],[3,1],[1,2],[3,4],[0,2],[2,4],[3,2],[4,2],[1,3],[1,0]],"solution":false,"solvable":false,"difficulty":{"num_courses":[5,10],"num_prerequisites":[2,3],"cycle_length":[3,4]}}
|
{"min_num_courses":5,"max_num_courses":10,"min_num_prerequisites":2,"max_num_prerequisites":3,"min_cycle_length":3,"max_cycle_length":4,"p_solvable":0.6}
| 679,778,029
|
course_schedule
| 1
|
train
|
There are a total of 6 courses you have to take, labeled from 0 to 5.
You are given the following list of prerequisites, where prerequisites[i] = (a_i, b_i) indicates that you must first take course b_i if you want to take course a_i:
[(5, 0), (1, 3), (4, 2), (4, 0), (3, 0), (3, 2), (1, 0), (5, 1), (0, 2)]
Return True if you can finish all courses considering the prerequisites, or False otherwise.
|
True
|
{"source_dataset":"course_schedule","source_index":17,"courses":[2,0,4,3,1,5],"prerequisites":[[5,0],[1,3],[4,2],[4,0],[3,0],[3,2],[1,0],[5,1],[0,2]],"solution":true,"solvable":true,"difficulty":{"num_courses":[5,10],"num_prerequisites":[2,3],"cycle_length":[3,4]}}
|
{"min_num_courses":5,"max_num_courses":10,"min_num_prerequisites":2,"max_num_prerequisites":3,"min_cycle_length":3,"max_cycle_length":4,"p_solvable":0.6}
| 679,778,029
|
course_schedule
| 1
|
train
|
There are a total of 5 courses you have to take, labeled from 0 to 4.
You are given the following list of prerequisites, where prerequisites[i] = (a_i, b_i) indicates that you must first take course b_i if you want to take course a_i:
[(2, 3), (3, 1), (4, 3), (0, 1), (3, 0), (2, 1), (4, 1), (2, 0)]
Return True if you can finish all courses considering the prerequisites, or False otherwise.
|
True
|
{"source_dataset":"course_schedule","source_index":18,"courses":[1,0,3,2,4],"prerequisites":[[2,3],[3,1],[4,3],[0,1],[3,0],[2,1],[4,1],[2,0]],"solution":true,"solvable":true,"difficulty":{"num_courses":[5,10],"num_prerequisites":[2,3],"cycle_length":[3,4]}}
|
{"min_num_courses":5,"max_num_courses":10,"min_num_prerequisites":2,"max_num_prerequisites":3,"min_cycle_length":3,"max_cycle_length":4,"p_solvable":0.6}
| 679,778,029
|
course_schedule
| 1
|
train
|
There are a total of 8 courses you have to take, labeled from 0 to 7.
You are given the following list of prerequisites, where prerequisites[i] = (a_i, b_i) indicates that you must first take course b_i if you want to take course a_i:
[(2, 4), (0, 6), (1, 7), (7, 3), (1, 2), (7, 4), (0, 2), (0, 3), (2, 7), (5, 4), (6, 7), (5, 3), (3, 4), (6, 2)]
Return True if you can finish all courses considering the prerequisites, or False otherwise.
|
True
|
{"source_dataset":"course_schedule","source_index":19,"courses":[4,3,7,2,6,0,5,1],"prerequisites":[[2,4],[0,6],[1,7],[7,3],[1,2],[7,4],[0,2],[0,3],[2,7],[5,4],[6,7],[5,3],[3,4],[6,2]],"solution":true,"solvable":true,"difficulty":{"num_courses":[5,10],"num_prerequisites":[2,3],"cycle_length":[3,4]}}
|
{"min_num_courses":5,"max_num_courses":10,"min_num_prerequisites":2,"max_num_prerequisites":3,"min_cycle_length":3,"max_cycle_length":4,"p_solvable":0.6}
| 679,778,029
|
course_schedule
| 1
|
train
|
There are a total of 8 courses you have to take, labeled from 0 to 7.
You are given the following list of prerequisites, where prerequisites[i] = (a_i, b_i) indicates that you must first take course b_i if you want to take course a_i:
[(2, 5), (0, 2), (1, 3), (3, 6), (1, 6), (4, 0), (3, 7), (2, 7), (0, 5), (7, 6), (7, 5), (5, 6), (0, 3), (2, 6), (6, 0), (5, 1), (1, 2), (4, 5)]
Return True if you can finish all courses considering the prerequisites, or False otherwise.
|
False
|
{"source_dataset":"course_schedule","source_index":20,"courses":[6,5,7,3,2,0,1,4],"prerequisites":[[2,5],[0,2],[1,3],[3,6],[1,6],[4,0],[3,7],[2,7],[0,5],[7,6],[7,5],[5,6],[0,3],[2,6],[6,0],[5,1],[1,2],[4,5]],"solution":false,"solvable":false,"difficulty":{"num_courses":[5,10],"num_prerequisites":[2,3],"cycle_length":[3,4]}}
|
{"min_num_courses":5,"max_num_courses":10,"min_num_prerequisites":2,"max_num_prerequisites":3,"min_cycle_length":3,"max_cycle_length":4,"p_solvable":0.6}
| 679,778,029
|
course_schedule
| 1
|
train
|
There are a total of 10 courses you have to take, labeled from 0 to 9.
You are given the following list of prerequisites, where prerequisites[i] = (a_i, b_i) indicates that you must first take course b_i if you want to take course a_i:
[(4, 6), (6, 0), (5, 1), (4, 7), (8, 6), (5, 4), (8, 0), (7, 0), (7, 9), (3, 9), (2, 0), (2, 9), (3, 7), (9, 1), (1, 0), (5, 0), (9, 0), (3, 0), (1, 6), (8, 1), (7, 1), (9, 6), (2, 1)]
Return True if you can finish all courses considering the prerequisites, or False otherwise.
|
True
|
{"source_dataset":"course_schedule","source_index":21,"courses":[0,6,1,9,7,8,4,2,5,3],"prerequisites":[[4,6],[6,0],[5,1],[4,7],[8,6],[5,4],[8,0],[7,0],[7,9],[3,9],[2,0],[2,9],[3,7],[9,1],[1,0],[5,0],[9,0],[3,0],[1,6],[8,1],[7,1],[9,6],[2,1]],"solution":true,"solvable":true,"difficulty":{"num_courses":[5,10],"num_prerequisites":[2,3],"cycle_length":[3,4]}}
|
{"min_num_courses":5,"max_num_courses":10,"min_num_prerequisites":2,"max_num_prerequisites":3,"min_cycle_length":3,"max_cycle_length":4,"p_solvable":0.6}
| 679,778,029
|
course_schedule
| 1
|
train
|
There are a total of 7 courses you have to take, labeled from 0 to 6.
You are given the following list of prerequisites, where prerequisites[i] = (a_i, b_i) indicates that you must first take course b_i if you want to take course a_i:
[(6, 1), (0, 6), (3, 1), (3, 0), (2, 6), (6, 4), (4, 1), (2, 0), (0, 1), (2, 3), (5, 2), (5, 6), (0, 4), (5, 0)]
Return True if you can finish all courses considering the prerequisites, or False otherwise.
|
True
|
{"source_dataset":"course_schedule","source_index":22,"courses":[1,4,6,0,3,2,5],"prerequisites":[[6,1],[0,6],[3,1],[3,0],[2,6],[6,4],[4,1],[2,0],[0,1],[2,3],[5,2],[5,6],[0,4],[5,0]],"solution":true,"solvable":true,"difficulty":{"num_courses":[5,10],"num_prerequisites":[2,3],"cycle_length":[3,4]}}
|
{"min_num_courses":5,"max_num_courses":10,"min_num_prerequisites":2,"max_num_prerequisites":3,"min_cycle_length":3,"max_cycle_length":4,"p_solvable":0.6}
| 679,778,029
|
course_schedule
| 1
|
train
|
There are a total of 9 courses you have to take, labeled from 0 to 8.
You are given the following list of prerequisites, where prerequisites[i] = (a_i, b_i) indicates that you must first take course b_i if you want to take course a_i:
[(8, 4), (2, 4), (6, 1), (2, 1), (7, 2), (7, 4), (8, 1), (3, 1), (5, 1), (6, 0), (3, 8), (5, 8), (0, 3), (3, 7), (1, 4), (5, 0), (0, 4)]
Return True if you can finish all courses considering the prerequisites, or False otherwise.
|
True
|
{"source_dataset":"course_schedule","source_index":23,"courses":[4,1,8,2,7,3,0,5,6],"prerequisites":[[8,4],[2,4],[6,1],[2,1],[7,2],[7,4],[8,1],[3,1],[5,1],[6,0],[3,8],[5,8],[0,3],[3,7],[1,4],[5,0],[0,4]],"solution":true,"solvable":true,"difficulty":{"num_courses":[5,10],"num_prerequisites":[2,3],"cycle_length":[3,4]}}
|
{"min_num_courses":5,"max_num_courses":10,"min_num_prerequisites":2,"max_num_prerequisites":3,"min_cycle_length":3,"max_cycle_length":4,"p_solvable":0.6}
| 679,778,029
|
course_schedule
| 1
|
train
|
There are a total of 10 courses you have to take, labeled from 0 to 9.
You are given the following list of prerequisites, where prerequisites[i] = (a_i, b_i) indicates that you must first take course b_i if you want to take course a_i:
[(4, 9), (4, 3), (1, 2), (6, 2), (7, 5), (5, 6), (8, 3), (2, 9), (6, 0), (3, 9), (1, 3), (9, 0), (2, 3), (2, 0), (8, 1), (7, 6), (7, 1), (3, 0), (5, 4)]
Return True if you can finish all courses considering the prerequisites, or False otherwise.
|
True
|
{"source_dataset":"course_schedule","source_index":24,"courses":[0,9,3,2,4,6,1,5,8,7],"prerequisites":[[4,9],[4,3],[1,2],[6,2],[7,5],[5,6],[8,3],[2,9],[6,0],[3,9],[1,3],[9,0],[2,3],[2,0],[8,1],[7,6],[7,1],[3,0],[5,4]],"solution":true,"solvable":true,"difficulty":{"num_courses":[5,10],"num_prerequisites":[2,3],"cycle_length":[3,4]}}
|
{"min_num_courses":5,"max_num_courses":10,"min_num_prerequisites":2,"max_num_prerequisites":3,"min_cycle_length":3,"max_cycle_length":4,"p_solvable":0.6}
| 679,778,029
|
course_schedule
| 1
|
train
|
There are a total of 10 courses you have to take, labeled from 0 to 9.
You are given the following list of prerequisites, where prerequisites[i] = (a_i, b_i) indicates that you must first take course b_i if you want to take course a_i:
[(9, 3), (9, 1), (6, 1), (9, 4), (4, 5), (2, 4), (7, 6), (2, 3), (3, 6), (0, 5), (4, 6), (8, 9), (3, 5), (8, 0), (0, 7), (5, 1), (8, 1), (7, 4), (6, 5), (0, 1), (3, 4), (2, 7), (4, 1)]
Return True if you can finish all courses considering the prerequisites, or False otherwise.
|
True
|
{"source_dataset":"course_schedule","source_index":25,"courses":[1,5,6,4,7,3,2,9,0,8],"prerequisites":[[9,3],[9,1],[6,1],[9,4],[4,5],[2,4],[7,6],[2,3],[3,6],[0,5],[4,6],[8,9],[3,5],[8,0],[0,7],[5,1],[8,1],[7,4],[6,5],[0,1],[3,4],[2,7],[4,1]],"solution":true,"solvable":true,"difficulty":{"num_courses":[5,10],"num_prerequisites":[2,3],"cycle_length":[3,4]}}
|
{"min_num_courses":5,"max_num_courses":10,"min_num_prerequisites":2,"max_num_prerequisites":3,"min_cycle_length":3,"max_cycle_length":4,"p_solvable":0.6}
| 679,778,029
|
course_schedule
| 1
|
train
|
There are a total of 7 courses you have to take, labeled from 0 to 6.
You are given the following list of prerequisites, where prerequisites[i] = (a_i, b_i) indicates that you must first take course b_i if you want to take course a_i:
[(4, 5), (1, 5), (0, 5), (3, 1), (4, 6), (2, 5), (3, 6), (0, 4), (2, 4), (1, 4), (1, 0), (6, 5)]
Return True if you can finish all courses considering the prerequisites, or False otherwise.
|
True
|
{"source_dataset":"course_schedule","source_index":26,"courses":[5,6,4,0,2,1,3],"prerequisites":[[4,5],[1,5],[0,5],[3,1],[4,6],[2,5],[3,6],[0,4],[2,4],[1,4],[1,0],[6,5]],"solution":true,"solvable":true,"difficulty":{"num_courses":[5,10],"num_prerequisites":[2,3],"cycle_length":[3,4]}}
|
{"min_num_courses":5,"max_num_courses":10,"min_num_prerequisites":2,"max_num_prerequisites":3,"min_cycle_length":3,"max_cycle_length":4,"p_solvable":0.6}
| 679,778,029
|
course_schedule
| 1
|
train
|
There are a total of 6 courses you have to take, labeled from 0 to 5.
You are given the following list of prerequisites, where prerequisites[i] = (a_i, b_i) indicates that you must first take course b_i if you want to take course a_i:
[(0, 2), (3, 1), (2, 5), (1, 5), (3, 2), (0, 5), (1, 2), (0, 4), (2, 1), (5, 2), (2, 4), (5, 4)]
Return True if you can finish all courses considering the prerequisites, or False otherwise.
|
False
|
{"source_dataset":"course_schedule","source_index":27,"courses":[4,5,2,0,1,3],"prerequisites":[[0,2],[3,1],[2,5],[1,5],[3,2],[0,5],[1,2],[0,4],[2,1],[5,2],[2,4],[5,4]],"solution":false,"solvable":false,"difficulty":{"num_courses":[5,10],"num_prerequisites":[2,3],"cycle_length":[3,4]}}
|
{"min_num_courses":5,"max_num_courses":10,"min_num_prerequisites":2,"max_num_prerequisites":3,"min_cycle_length":3,"max_cycle_length":4,"p_solvable":0.6}
| 679,778,029
|
course_schedule
| 1
|
train
|
There are a total of 8 courses you have to take, labeled from 0 to 7.
You are given the following list of prerequisites, where prerequisites[i] = (a_i, b_i) indicates that you must first take course b_i if you want to take course a_i:
[(6, 1), (0, 4), (4, 2), (5, 2), (4, 5), (6, 7), (0, 7), (3, 7), (1, 0), (3, 0), (3, 4), (1, 5), (7, 4), (6, 4), (7, 2), (1, 4)]
Return True if you can finish all courses considering the prerequisites, or False otherwise.
|
True
|
{"source_dataset":"course_schedule","source_index":28,"courses":[2,5,4,7,0,1,6,3],"prerequisites":[[6,1],[0,4],[4,2],[5,2],[4,5],[6,7],[0,7],[3,7],[1,0],[3,0],[3,4],[1,5],[7,4],[6,4],[7,2],[1,4]],"solution":true,"solvable":true,"difficulty":{"num_courses":[5,10],"num_prerequisites":[2,3],"cycle_length":[3,4]}}
|
{"min_num_courses":5,"max_num_courses":10,"min_num_prerequisites":2,"max_num_prerequisites":3,"min_cycle_length":3,"max_cycle_length":4,"p_solvable":0.6}
| 679,778,029
|
course_schedule
| 1
|
train
|
There are a total of 6 courses you have to take, labeled from 0 to 5.
You are given the following list of prerequisites, where prerequisites[i] = (a_i, b_i) indicates that you must first take course b_i if you want to take course a_i:
[(1, 3), (2, 3), (5, 0), (4, 3), (1, 4), (3, 0), (1, 0), (4, 0), (2, 0), (5, 3), (5, 1)]
Return True if you can finish all courses considering the prerequisites, or False otherwise.
|
True
|
{"source_dataset":"course_schedule","source_index":29,"courses":[0,3,2,4,1,5],"prerequisites":[[1,3],[2,3],[5,0],[4,3],[1,4],[3,0],[1,0],[4,0],[2,0],[5,3],[5,1]],"solution":true,"solvable":true,"difficulty":{"num_courses":[5,10],"num_prerequisites":[2,3],"cycle_length":[3,4]}}
|
{"min_num_courses":5,"max_num_courses":10,"min_num_prerequisites":2,"max_num_prerequisites":3,"min_cycle_length":3,"max_cycle_length":4,"p_solvable":0.6}
| 679,778,029
|
course_schedule
| 1
|
train
|
There are a total of 7 courses you have to take, labeled from 0 to 6.
You are given the following list of prerequisites, where prerequisites[i] = (a_i, b_i) indicates that you must first take course b_i if you want to take course a_i:
[(1, 0), (1, 3), (5, 4), (2, 4), (0, 3), (3, 4), (6, 2), (6, 4), (5, 2), (3, 2), (0, 4), (6, 0), (5, 6), (0, 2)]
Return True if you can finish all courses considering the prerequisites, or False otherwise.
|
True
|
{"source_dataset":"course_schedule","source_index":30,"courses":[4,2,3,0,6,5,1],"prerequisites":[[1,0],[1,3],[5,4],[2,4],[0,3],[3,4],[6,2],[6,4],[5,2],[3,2],[0,4],[6,0],[5,6],[0,2]],"solution":true,"solvable":true,"difficulty":{"num_courses":[5,10],"num_prerequisites":[2,3],"cycle_length":[3,4]}}
|
{"min_num_courses":5,"max_num_courses":10,"min_num_prerequisites":2,"max_num_prerequisites":3,"min_cycle_length":3,"max_cycle_length":4,"p_solvable":0.6}
| 679,778,029
|
course_schedule
| 1
|
train
|
There are a total of 5 courses you have to take, labeled from 0 to 4.
You are given the following list of prerequisites, where prerequisites[i] = (a_i, b_i) indicates that you must first take course b_i if you want to take course a_i:
[(1, 4), (3, 2), (1, 0), (4, 0), (2, 4), (3, 4), (2, 0), (2, 1)]
Return True if you can finish all courses considering the prerequisites, or False otherwise.
|
True
|
{"source_dataset":"course_schedule","source_index":31,"courses":[0,4,1,2,3],"prerequisites":[[1,4],[3,2],[1,0],[4,0],[2,4],[3,4],[2,0],[2,1]],"solution":true,"solvable":true,"difficulty":{"num_courses":[5,10],"num_prerequisites":[2,3],"cycle_length":[3,4]}}
|
{"min_num_courses":5,"max_num_courses":10,"min_num_prerequisites":2,"max_num_prerequisites":3,"min_cycle_length":3,"max_cycle_length":4,"p_solvable":0.6}
| 679,778,029
|
course_schedule
| 1
|
train
|
There are a total of 8 courses you have to take, labeled from 0 to 7.
You are given the following list of prerequisites, where prerequisites[i] = (a_i, b_i) indicates that you must first take course b_i if you want to take course a_i:
[(4, 1), (6, 5), (0, 1), (6, 0), (3, 5), (0, 5), (6, 2), (2, 1), (7, 1), (2, 4), (1, 5), (0, 4), (4, 5), (7, 5), (3, 4), (7, 2), (3, 1)]
Return True if you can finish all courses considering the prerequisites, or False otherwise.
|
True
|
{"source_dataset":"course_schedule","source_index":32,"courses":[5,1,4,3,0,2,7,6],"prerequisites":[[4,1],[6,5],[0,1],[6,0],[3,5],[0,5],[6,2],[2,1],[7,1],[2,4],[1,5],[0,4],[4,5],[7,5],[3,4],[7,2],[3,1]],"solution":true,"solvable":true,"difficulty":{"num_courses":[5,10],"num_prerequisites":[2,3],"cycle_length":[3,4]}}
|
{"min_num_courses":5,"max_num_courses":10,"min_num_prerequisites":2,"max_num_prerequisites":3,"min_cycle_length":3,"max_cycle_length":4,"p_solvable":0.6}
| 679,778,029
|
course_schedule
| 1
|
train
|
There are a total of 6 courses you have to take, labeled from 0 to 5.
You are given the following list of prerequisites, where prerequisites[i] = (a_i, b_i) indicates that you must first take course b_i if you want to take course a_i:
[(2, 0), (5, 3), (4, 5), (5, 0), (2, 4), (0, 3), (4, 3), (1, 4), (1, 3), (4, 0)]
Return True if you can finish all courses considering the prerequisites, or False otherwise.
|
True
|
{"source_dataset":"course_schedule","source_index":33,"courses":[3,0,5,4,1,2],"prerequisites":[[2,0],[5,3],[4,5],[5,0],[2,4],[0,3],[4,3],[1,4],[1,3],[4,0]],"solution":true,"solvable":true,"difficulty":{"num_courses":[5,10],"num_prerequisites":[2,3],"cycle_length":[3,4]}}
|
{"min_num_courses":5,"max_num_courses":10,"min_num_prerequisites":2,"max_num_prerequisites":3,"min_cycle_length":3,"max_cycle_length":4,"p_solvable":0.6}
| 679,778,029
|
course_schedule
| 1
|
train
|
There are a total of 5 courses you have to take, labeled from 0 to 4.
You are given the following list of prerequisites, where prerequisites[i] = (a_i, b_i) indicates that you must first take course b_i if you want to take course a_i:
[(2, 3), (2, 1), (1, 3), (3, 2), (3, 1), (0, 4), (0, 3), (4, 1), (4, 2), (0, 1), (0, 2), (4, 3), (2, 0)]
Return True if you can finish all courses considering the prerequisites, or False otherwise.
|
False
|
{"source_dataset":"course_schedule","source_index":34,"courses":[1,3,2,4,0],"prerequisites":[[2,3],[2,1],[1,3],[3,2],[3,1],[0,4],[0,3],[4,1],[4,2],[0,1],[0,2],[4,3],[2,0]],"solution":false,"solvable":false,"difficulty":{"num_courses":[5,10],"num_prerequisites":[2,3],"cycle_length":[3,4]}}
|
{"min_num_courses":5,"max_num_courses":10,"min_num_prerequisites":2,"max_num_prerequisites":3,"min_cycle_length":3,"max_cycle_length":4,"p_solvable":0.6}
| 679,778,029
|
course_schedule
| 1
|
train
|
There are a total of 5 courses you have to take, labeled from 0 to 4.
You are given the following list of prerequisites, where prerequisites[i] = (a_i, b_i) indicates that you must first take course b_i if you want to take course a_i:
[(1, 4), (2, 1), (2, 3), (4, 3), (0, 2), (1, 3), (2, 4), (4, 1), (3, 0), (0, 1), (0, 4)]
Return True if you can finish all courses considering the prerequisites, or False otherwise.
|
False
|
{"source_dataset":"course_schedule","source_index":35,"courses":[3,1,4,2,0],"prerequisites":[[1,4],[2,1],[2,3],[4,3],[0,2],[1,3],[2,4],[4,1],[3,0],[0,1],[0,4]],"solution":false,"solvable":false,"difficulty":{"num_courses":[5,10],"num_prerequisites":[2,3],"cycle_length":[3,4]}}
|
{"min_num_courses":5,"max_num_courses":10,"min_num_prerequisites":2,"max_num_prerequisites":3,"min_cycle_length":3,"max_cycle_length":4,"p_solvable":0.6}
| 679,778,029
|
course_schedule
| 1
|
train
|
There are a total of 7 courses you have to take, labeled from 0 to 6.
You are given the following list of prerequisites, where prerequisites[i] = (a_i, b_i) indicates that you must first take course b_i if you want to take course a_i:
[(0, 4), (5, 4), (3, 5), (2, 3), (0, 5), (6, 2), (1, 2), (2, 5), (6, 5), (3, 4), (2, 4), (1, 6)]
Return True if you can finish all courses considering the prerequisites, or False otherwise.
|
True
|
{"source_dataset":"course_schedule","source_index":36,"courses":[4,5,3,2,0,6,1],"prerequisites":[[0,4],[5,4],[3,5],[2,3],[0,5],[6,2],[1,2],[2,5],[6,5],[3,4],[2,4],[1,6]],"solution":true,"solvable":true,"difficulty":{"num_courses":[5,10],"num_prerequisites":[2,3],"cycle_length":[3,4]}}
|
{"min_num_courses":5,"max_num_courses":10,"min_num_prerequisites":2,"max_num_prerequisites":3,"min_cycle_length":3,"max_cycle_length":4,"p_solvable":0.6}
| 679,778,029
|
course_schedule
| 1
|
train
|
There are a total of 10 courses you have to take, labeled from 0 to 9.
You are given the following list of prerequisites, where prerequisites[i] = (a_i, b_i) indicates that you must first take course b_i if you want to take course a_i:
[(3, 0), (9, 7), (2, 7), (5, 0), (2, 9), (7, 0), (1, 0), (6, 0), (7, 1), (4, 3), (3, 1), (8, 2), (8, 6), (2, 1), (6, 9), (9, 0), (8, 7), (7, 2), (5, 3), (6, 7), (7, 3), (4, 7), (2, 5), (5, 1)]
Return True if you can finish all courses considering the prerequisites, or False otherwise.
|
False
|
{"source_dataset":"course_schedule","source_index":37,"courses":[0,1,3,7,5,2,9,4,6,8],"prerequisites":[[3,0],[9,7],[2,7],[5,0],[2,9],[7,0],[1,0],[6,0],[7,1],[4,3],[3,1],[8,2],[8,6],[2,1],[6,9],[9,0],[8,7],[7,2],[5,3],[6,7],[7,3],[4,7],[2,5],[5,1]],"solution":false,"solvable":false,"difficulty":{"num_courses":[5,10],"num_prerequisites":[2,3],"cycle_length":[3,4]}}
|
{"min_num_courses":5,"max_num_courses":10,"min_num_prerequisites":2,"max_num_prerequisites":3,"min_cycle_length":3,"max_cycle_length":4,"p_solvable":0.6}
| 679,778,029
|
course_schedule
| 1
|
train
|
There are a total of 6 courses you have to take, labeled from 0 to 5.
You are given the following list of prerequisites, where prerequisites[i] = (a_i, b_i) indicates that you must first take course b_i if you want to take course a_i:
[(0, 1), (0, 3), (0, 5), (1, 5), (1, 3), (2, 3), (3, 1), (5, 3), (4, 0), (4, 3), (2, 5), (4, 2), (1, 4)]
Return True if you can finish all courses considering the prerequisites, or False otherwise.
|
False
|
{"source_dataset":"course_schedule","source_index":38,"courses":[3,5,1,0,2,4],"prerequisites":[[0,1],[0,3],[0,5],[1,5],[1,3],[2,3],[3,1],[5,3],[4,0],[4,3],[2,5],[4,2],[1,4]],"solution":false,"solvable":false,"difficulty":{"num_courses":[5,10],"num_prerequisites":[2,3],"cycle_length":[3,4]}}
|
{"min_num_courses":5,"max_num_courses":10,"min_num_prerequisites":2,"max_num_prerequisites":3,"min_cycle_length":3,"max_cycle_length":4,"p_solvable":0.6}
| 679,778,029
|
course_schedule
| 1
|
train
|
There are a total of 7 courses you have to take, labeled from 0 to 6.
You are given the following list of prerequisites, where prerequisites[i] = (a_i, b_i) indicates that you must first take course b_i if you want to take course a_i:
[(3, 6), (2, 5), (4, 3), (4, 2), (6, 5), (0, 5), (3, 5), (2, 0), (5, 3), (1, 0), (3, 2), (2, 6), (1, 3), (0, 6)]
Return True if you can finish all courses considering the prerequisites, or False otherwise.
|
False
|
{"source_dataset":"course_schedule","source_index":39,"courses":[5,6,0,2,3,1,4],"prerequisites":[[3,6],[2,5],[4,3],[4,2],[6,5],[0,5],[3,5],[2,0],[5,3],[1,0],[3,2],[2,6],[1,3],[0,6]],"solution":false,"solvable":false,"difficulty":{"num_courses":[5,10],"num_prerequisites":[2,3],"cycle_length":[3,4]}}
|
{"min_num_courses":5,"max_num_courses":10,"min_num_prerequisites":2,"max_num_prerequisites":3,"min_cycle_length":3,"max_cycle_length":4,"p_solvable":0.6}
| 679,778,029
|
course_schedule
| 1
|
train
|
There are a total of 10 courses you have to take, labeled from 0 to 9.
You are given the following list of prerequisites, where prerequisites[i] = (a_i, b_i) indicates that you must first take course b_i if you want to take course a_i:
[(8, 1), (8, 5), (3, 9), (6, 8), (2, 8), (7, 0), (1, 5), (1, 0), (4, 8), (0, 5), (6, 3), (4, 3), (9, 0), (3, 5), (7, 5), (9, 1), (1, 7), (2, 9)]
Return True if you can finish all courses considering the prerequisites, or False otherwise.
|
True
|
{"source_dataset":"course_schedule","source_index":40,"courses":[5,0,7,1,8,9,2,3,4,6],"prerequisites":[[8,1],[8,5],[3,9],[6,8],[2,8],[7,0],[1,5],[1,0],[4,8],[0,5],[6,3],[4,3],[9,0],[3,5],[7,5],[9,1],[1,7],[2,9]],"solution":true,"solvable":true,"difficulty":{"num_courses":[5,10],"num_prerequisites":[2,3],"cycle_length":[3,4]}}
|
{"min_num_courses":5,"max_num_courses":10,"min_num_prerequisites":2,"max_num_prerequisites":3,"min_cycle_length":3,"max_cycle_length":4,"p_solvable":0.6}
| 679,778,029
|
course_schedule
| 1
|
train
|
There are a total of 8 courses you have to take, labeled from 0 to 7.
You are given the following list of prerequisites, where prerequisites[i] = (a_i, b_i) indicates that you must first take course b_i if you want to take course a_i:
[(0, 6), (7, 5), (0, 1), (2, 0), (7, 3), (4, 6), (0, 4), (5, 2), (1, 6), (4, 2), (4, 3), (5, 3), (3, 2), (5, 6), (5, 1), (3, 6), (1, 4), (0, 7), (7, 4), (6, 2)]
Return True if you can finish all courses considering the prerequisites, or False otherwise.
|
False
|
{"source_dataset":"course_schedule","source_index":41,"courses":[2,6,3,4,1,0,7,5],"prerequisites":[[0,6],[7,5],[0,1],[2,0],[7,3],[4,6],[0,4],[5,2],[1,6],[4,2],[4,3],[5,3],[3,2],[5,6],[5,1],[3,6],[1,4],[0,7],[7,4],[6,2]],"solution":false,"solvable":false,"difficulty":{"num_courses":[5,10],"num_prerequisites":[2,3],"cycle_length":[3,4]}}
|
{"min_num_courses":5,"max_num_courses":10,"min_num_prerequisites":2,"max_num_prerequisites":3,"min_cycle_length":3,"max_cycle_length":4,"p_solvable":0.6}
| 679,778,029
|
course_schedule
| 1
|
train
|
There are a total of 6 courses you have to take, labeled from 0 to 5.
You are given the following list of prerequisites, where prerequisites[i] = (a_i, b_i) indicates that you must first take course b_i if you want to take course a_i:
[(0, 3), (5, 1), (3, 5), (1, 2), (4, 1), (3, 1), (1, 3), (0, 1), (4, 0), (3, 2), (5, 3)]
Return True if you can finish all courses considering the prerequisites, or False otherwise.
|
False
|
{"source_dataset":"course_schedule","source_index":42,"courses":[2,1,3,0,5,4],"prerequisites":[[0,3],[5,1],[3,5],[1,2],[4,1],[3,1],[1,3],[0,1],[4,0],[3,2],[5,3]],"solution":false,"solvable":false,"difficulty":{"num_courses":[5,10],"num_prerequisites":[2,3],"cycle_length":[3,4]}}
|
{"min_num_courses":5,"max_num_courses":10,"min_num_prerequisites":2,"max_num_prerequisites":3,"min_cycle_length":3,"max_cycle_length":4,"p_solvable":0.6}
| 679,778,029
|
course_schedule
| 1
|
train
|
There are a total of 10 courses you have to take, labeled from 0 to 9.
You are given the following list of prerequisites, where prerequisites[i] = (a_i, b_i) indicates that you must first take course b_i if you want to take course a_i:
[(5, 7), (7, 1), (9, 3), (9, 5), (2, 9), (2, 8), (3, 7), (3, 5), (9, 7), (6, 0), (8, 1), (4, 3), (8, 7), (6, 1), (3, 8), (6, 5), (0, 8), (4, 8), (5, 8), (0, 3)]
Return True if you can finish all courses considering the prerequisites, or False otherwise.
|
True
|
{"source_dataset":"course_schedule","source_index":43,"courses":[1,7,8,5,3,9,2,0,6,4],"prerequisites":[[5,7],[7,1],[9,3],[9,5],[2,9],[2,8],[3,7],[3,5],[9,7],[6,0],[8,1],[4,3],[8,7],[6,1],[3,8],[6,5],[0,8],[4,8],[5,8],[0,3]],"solution":true,"solvable":true,"difficulty":{"num_courses":[5,10],"num_prerequisites":[2,3],"cycle_length":[3,4]}}
|
{"min_num_courses":5,"max_num_courses":10,"min_num_prerequisites":2,"max_num_prerequisites":3,"min_cycle_length":3,"max_cycle_length":4,"p_solvable":0.6}
| 679,778,029
|
course_schedule
| 1
|
train
|
There are a total of 7 courses you have to take, labeled from 0 to 6.
You are given the following list of prerequisites, where prerequisites[i] = (a_i, b_i) indicates that you must first take course b_i if you want to take course a_i:
[(2, 3), (0, 3), (4, 6), (6, 5), (5, 6), (4, 0), (3, 5), (4, 5), (5, 3), (1, 6), (1, 5), (2, 6), (0, 1), (3, 6)]
Return True if you can finish all courses considering the prerequisites, or False otherwise.
|
False
|
{"source_dataset":"course_schedule","source_index":44,"courses":[6,5,3,1,2,0,4],"prerequisites":[[2,3],[0,3],[4,6],[6,5],[5,6],[4,0],[3,5],[4,5],[5,3],[1,6],[1,5],[2,6],[0,1],[3,6]],"solution":false,"solvable":false,"difficulty":{"num_courses":[5,10],"num_prerequisites":[2,3],"cycle_length":[3,4]}}
|
{"min_num_courses":5,"max_num_courses":10,"min_num_prerequisites":2,"max_num_prerequisites":3,"min_cycle_length":3,"max_cycle_length":4,"p_solvable":0.6}
| 679,778,029
|
course_schedule
| 1
|
train
|
There are a total of 9 courses you have to take, labeled from 0 to 8.
You are given the following list of prerequisites, where prerequisites[i] = (a_i, b_i) indicates that you must first take course b_i if you want to take course a_i:
[(3, 2), (6, 2), (2, 5), (4, 1), (3, 6), (4, 6), (0, 7), (3, 0), (7, 4), (2, 0), (6, 1), (0, 1), (7, 1), (1, 8), (7, 8), (4, 0), (6, 5), (5, 7), (5, 1), (5, 8)]
Return True if you can finish all courses considering the prerequisites, or False otherwise.
|
False
|
{"source_dataset":"course_schedule","source_index":45,"courses":[8,1,7,0,5,2,6,4,3],"prerequisites":[[3,2],[6,2],[2,5],[4,1],[3,6],[4,6],[0,7],[3,0],[7,4],[2,0],[6,1],[0,1],[7,1],[1,8],[7,8],[4,0],[6,5],[5,7],[5,1],[5,8]],"solution":false,"solvable":false,"difficulty":{"num_courses":[5,10],"num_prerequisites":[2,3],"cycle_length":[3,4]}}
|
{"min_num_courses":5,"max_num_courses":10,"min_num_prerequisites":2,"max_num_prerequisites":3,"min_cycle_length":3,"max_cycle_length":4,"p_solvable":0.6}
| 679,778,029
|
course_schedule
| 1
|
train
|
There are a total of 10 courses you have to take, labeled from 0 to 9.
You are given the following list of prerequisites, where prerequisites[i] = (a_i, b_i) indicates that you must first take course b_i if you want to take course a_i:
[(0, 4), (9, 5), (7, 0), (1, 4), (6, 1), (7, 4), (0, 2), (3, 1), (1, 2), (3, 4), (5, 4), (5, 0), (8, 0), (6, 2), (1, 0), (3, 2), (9, 4), (8, 9), (7, 3), (5, 2), (6, 0), (2, 4), (9, 3)]
Return True if you can finish all courses considering the prerequisites, or False otherwise.
|
True
|
{"source_dataset":"course_schedule","source_index":46,"courses":[4,2,0,5,1,3,7,9,6,8],"prerequisites":[[0,4],[9,5],[7,0],[1,4],[6,1],[7,4],[0,2],[3,1],[1,2],[3,4],[5,4],[5,0],[8,0],[6,2],[1,0],[3,2],[9,4],[8,9],[7,3],[5,2],[6,0],[2,4],[9,3]],"solution":true,"solvable":true,"difficulty":{"num_courses":[5,10],"num_prerequisites":[2,3],"cycle_length":[3,4]}}
|
{"min_num_courses":5,"max_num_courses":10,"min_num_prerequisites":2,"max_num_prerequisites":3,"min_cycle_length":3,"max_cycle_length":4,"p_solvable":0.6}
| 679,778,029
|
course_schedule
| 1
|
train
|
There are a total of 5 courses you have to take, labeled from 0 to 4.
You are given the following list of prerequisites, where prerequisites[i] = (a_i, b_i) indicates that you must first take course b_i if you want to take course a_i:
[(0, 4), (2, 1), (2, 3), (1, 4), (1, 3), (0, 2), (3, 4), (0, 3), (4, 0), (2, 0)]
Return True if you can finish all courses considering the prerequisites, or False otherwise.
|
False
|
{"source_dataset":"course_schedule","source_index":47,"courses":[4,3,0,1,2],"prerequisites":[[0,4],[2,1],[2,3],[1,4],[1,3],[0,2],[3,4],[0,3],[4,0],[2,0]],"solution":false,"solvable":false,"difficulty":{"num_courses":[5,10],"num_prerequisites":[2,3],"cycle_length":[3,4]}}
|
{"min_num_courses":5,"max_num_courses":10,"min_num_prerequisites":2,"max_num_prerequisites":3,"min_cycle_length":3,"max_cycle_length":4,"p_solvable":0.6}
| 679,778,029
|
course_schedule
| 1
|
train
|
There are a total of 5 courses you have to take, labeled from 0 to 4.
You are given the following list of prerequisites, where prerequisites[i] = (a_i, b_i) indicates that you must first take course b_i if you want to take course a_i:
[(0, 2), (4, 1), (2, 1), (3, 1), (4, 2), (3, 2), (0, 1)]
Return True if you can finish all courses considering the prerequisites, or False otherwise.
|
True
|
{"source_dataset":"course_schedule","source_index":48,"courses":[1,2,3,4,0],"prerequisites":[[0,2],[4,1],[2,1],[3,1],[4,2],[3,2],[0,1]],"solution":true,"solvable":true,"difficulty":{"num_courses":[5,10],"num_prerequisites":[2,3],"cycle_length":[3,4]}}
|
{"min_num_courses":5,"max_num_courses":10,"min_num_prerequisites":2,"max_num_prerequisites":3,"min_cycle_length":3,"max_cycle_length":4,"p_solvable":0.6}
| 679,778,029
|
course_schedule
| 1
|
train
|
There are a total of 8 courses you have to take, labeled from 0 to 7.
You are given the following list of prerequisites, where prerequisites[i] = (a_i, b_i) indicates that you must first take course b_i if you want to take course a_i:
[(3, 4), (5, 2), (0, 4), (6, 1), (4, 7), (0, 1), (2, 1), (2, 0), (2, 7), (4, 2), (6, 2), (0, 2), (4, 1), (3, 2), (6, 0), (0, 7), (1, 7), (4, 0), (5, 1), (3, 5)]
Return True if you can finish all courses considering the prerequisites, or False otherwise.
|
False
|
{"source_dataset":"course_schedule","source_index":49,"courses":[7,1,2,0,4,6,5,3],"prerequisites":[[3,4],[5,2],[0,4],[6,1],[4,7],[0,1],[2,1],[2,0],[2,7],[4,2],[6,2],[0,2],[4,1],[3,2],[6,0],[0,7],[1,7],[4,0],[5,1],[3,5]],"solution":false,"solvable":false,"difficulty":{"num_courses":[5,10],"num_prerequisites":[2,3],"cycle_length":[3,4]}}
|
{"min_num_courses":5,"max_num_courses":10,"min_num_prerequisites":2,"max_num_prerequisites":3,"min_cycle_length":3,"max_cycle_length":4,"p_solvable":0.6}
| 679,778,029
|
course_schedule
| 1
|
train
|
There are a total of 8 courses you have to take, labeled from 0 to 7.
You are given the following list of prerequisites, where prerequisites[i] = (a_i, b_i) indicates that you must first take course b_i if you want to take course a_i:
[(7, 3), (3, 5), (0, 6), (4, 2), (0, 3), (7, 5), (1, 5), (3, 1), (6, 1), (4, 0), (2, 1), (4, 3), (6, 3), (2, 3), (0, 1)]
Return True if you can finish all courses considering the prerequisites, or False otherwise.
|
True
|
{"source_dataset":"course_schedule","source_index":50,"courses":[5,1,3,7,2,6,0,4],"prerequisites":[[7,3],[3,5],[0,6],[4,2],[0,3],[7,5],[1,5],[3,1],[6,1],[4,0],[2,1],[4,3],[6,3],[2,3],[0,1]],"solution":true,"solvable":true,"difficulty":{"num_courses":[5,10],"num_prerequisites":[2,3],"cycle_length":[3,4]}}
|
{"min_num_courses":5,"max_num_courses":10,"min_num_prerequisites":2,"max_num_prerequisites":3,"min_cycle_length":3,"max_cycle_length":4,"p_solvable":0.6}
| 679,778,029
|
course_schedule
| 1
|
train
|
There are a total of 6 courses you have to take, labeled from 0 to 5.
You are given the following list of prerequisites, where prerequisites[i] = (a_i, b_i) indicates that you must first take course b_i if you want to take course a_i:
[(1, 3), (1, 4), (2, 4), (1, 2), (2, 3), (5, 4), (3, 5), (3, 0), (5, 0), (0, 4), (2, 5)]
Return True if you can finish all courses considering the prerequisites, or False otherwise.
|
True
|
{"source_dataset":"course_schedule","source_index":51,"courses":[4,0,5,3,2,1],"prerequisites":[[1,3],[1,4],[2,4],[1,2],[2,3],[5,4],[3,5],[3,0],[5,0],[0,4],[2,5]],"solution":true,"solvable":true,"difficulty":{"num_courses":[5,10],"num_prerequisites":[2,3],"cycle_length":[3,4]}}
|
{"min_num_courses":5,"max_num_courses":10,"min_num_prerequisites":2,"max_num_prerequisites":3,"min_cycle_length":3,"max_cycle_length":4,"p_solvable":0.6}
| 679,778,029
|
course_schedule
| 1
|
train
|
There are a total of 5 courses you have to take, labeled from 0 to 4.
You are given the following list of prerequisites, where prerequisites[i] = (a_i, b_i) indicates that you must first take course b_i if you want to take course a_i:
[(3, 2), (4, 2), (1, 4), (0, 2), (3, 0), (1, 2), (0, 4)]
Return True if you can finish all courses considering the prerequisites, or False otherwise.
|
True
|
{"source_dataset":"course_schedule","source_index":52,"courses":[2,4,1,0,3],"prerequisites":[[3,2],[4,2],[1,4],[0,2],[3,0],[1,2],[0,4]],"solution":true,"solvable":true,"difficulty":{"num_courses":[5,10],"num_prerequisites":[2,3],"cycle_length":[3,4]}}
|
{"min_num_courses":5,"max_num_courses":10,"min_num_prerequisites":2,"max_num_prerequisites":3,"min_cycle_length":3,"max_cycle_length":4,"p_solvable":0.6}
| 679,778,029
|
course_schedule
| 1
|
train
|
There are a total of 9 courses you have to take, labeled from 0 to 8.
You are given the following list of prerequisites, where prerequisites[i] = (a_i, b_i) indicates that you must first take course b_i if you want to take course a_i:
[(5, 3), (5, 4), (8, 3), (3, 4), (0, 7), (3, 7), (1, 4), (6, 4), (8, 2), (4, 6), (6, 2), (0, 3), (0, 4), (4, 2), (1, 3), (4, 7), (8, 4), (6, 5), (7, 2), (1, 8), (3, 5), (5, 7)]
Return True if you can finish all courses considering the prerequisites, or False otherwise.
|
False
|
{"source_dataset":"course_schedule","source_index":53,"courses":[2,7,4,5,3,8,0,6,1],"prerequisites":[[5,3],[5,4],[8,3],[3,4],[0,7],[3,7],[1,4],[6,4],[8,2],[4,6],[6,2],[0,3],[0,4],[4,2],[1,3],[4,7],[8,4],[6,5],[7,2],[1,8],[3,5],[5,7]],"solution":false,"solvable":false,"difficulty":{"num_courses":[5,10],"num_prerequisites":[2,3],"cycle_length":[3,4]}}
|
{"min_num_courses":5,"max_num_courses":10,"min_num_prerequisites":2,"max_num_prerequisites":3,"min_cycle_length":3,"max_cycle_length":4,"p_solvable":0.6}
| 679,778,029
|
course_schedule
| 1
|
train
|
There are a total of 8 courses you have to take, labeled from 0 to 7.
You are given the following list of prerequisites, where prerequisites[i] = (a_i, b_i) indicates that you must first take course b_i if you want to take course a_i:
[(0, 5), (2, 3), (4, 5), (7, 4), (6, 2), (2, 5), (2, 1), (4, 1), (7, 3), (5, 1), (0, 4), (3, 5), (6, 4), (3, 4), (5, 4), (3, 2), (4, 2), (3, 1), (7, 5)]
Return True if you can finish all courses considering the prerequisites, or False otherwise.
|
False
|
{"source_dataset":"course_schedule","source_index":54,"courses":[1,5,4,2,3,0,6,7],"prerequisites":[[0,5],[2,3],[4,5],[7,4],[6,2],[2,5],[2,1],[4,1],[7,3],[5,1],[0,4],[3,5],[6,4],[3,4],[5,4],[3,2],[4,2],[3,1],[7,5]],"solution":false,"solvable":false,"difficulty":{"num_courses":[5,10],"num_prerequisites":[2,3],"cycle_length":[3,4]}}
|
{"min_num_courses":5,"max_num_courses":10,"min_num_prerequisites":2,"max_num_prerequisites":3,"min_cycle_length":3,"max_cycle_length":4,"p_solvable":0.6}
| 679,778,029
|
course_schedule
| 1
|
train
|
There are a total of 10 courses you have to take, labeled from 0 to 9.
You are given the following list of prerequisites, where prerequisites[i] = (a_i, b_i) indicates that you must first take course b_i if you want to take course a_i:
[(1, 6), (9, 1), (6, 3), (5, 1), (5, 9), (2, 1), (4, 3), (7, 1), (7, 6), (4, 1), (0, 7), (9, 4), (8, 7), (8, 3), (0, 3), (1, 3), (2, 3)]
Return True if you can finish all courses considering the prerequisites, or False otherwise.
|
True
|
{"source_dataset":"course_schedule","source_index":55,"courses":[3,6,1,4,7,2,8,9,5,0],"prerequisites":[[1,6],[9,1],[6,3],[5,1],[5,9],[2,1],[4,3],[7,1],[7,6],[4,1],[0,7],[9,4],[8,7],[8,3],[0,3],[1,3],[2,3]],"solution":true,"solvable":true,"difficulty":{"num_courses":[5,10],"num_prerequisites":[2,3],"cycle_length":[3,4]}}
|
{"min_num_courses":5,"max_num_courses":10,"min_num_prerequisites":2,"max_num_prerequisites":3,"min_cycle_length":3,"max_cycle_length":4,"p_solvable":0.6}
| 679,778,029
|
course_schedule
| 1
|
train
|
There are a total of 10 courses you have to take, labeled from 0 to 9.
You are given the following list of prerequisites, where prerequisites[i] = (a_i, b_i) indicates that you must first take course b_i if you want to take course a_i:
[(1, 6), (6, 2), (7, 6), (5, 0), (4, 1), (2, 3), (5, 9), (9, 0), (5, 3), (8, 2), (8, 9), (3, 9), (6, 0), (2, 0), (7, 2), (4, 6), (3, 0), (1, 0)]
Return True if you can finish all courses considering the prerequisites, or False otherwise.
|
True
|
{"source_dataset":"course_schedule","source_index":56,"courses":[0,9,3,2,5,6,1,4,8,7],"prerequisites":[[1,6],[6,2],[7,6],[5,0],[4,1],[2,3],[5,9],[9,0],[5,3],[8,2],[8,9],[3,9],[6,0],[2,0],[7,2],[4,6],[3,0],[1,0]],"solution":true,"solvable":true,"difficulty":{"num_courses":[5,10],"num_prerequisites":[2,3],"cycle_length":[3,4]}}
|
{"min_num_courses":5,"max_num_courses":10,"min_num_prerequisites":2,"max_num_prerequisites":3,"min_cycle_length":3,"max_cycle_length":4,"p_solvable":0.6}
| 679,778,029
|
course_schedule
| 1
|
train
|
There are a total of 10 courses you have to take, labeled from 0 to 9.
You are given the following list of prerequisites, where prerequisites[i] = (a_i, b_i) indicates that you must first take course b_i if you want to take course a_i:
[(3, 2), (6, 2), (5, 8), (3, 9), (1, 8), (4, 6), (3, 1), (5, 4), (7, 2), (5, 2), (6, 3), (0, 9), (2, 8), (9, 8), (9, 4), (4, 8), (7, 6), (0, 5), (0, 3), (2, 4), (6, 5), (1, 2), (1, 4)]
Return True if you can finish all courses considering the prerequisites, or False otherwise.
|
False
|
{"source_dataset":"course_schedule","source_index":57,"courses":[8,4,2,9,1,5,6,3,7,0],"prerequisites":[[3,2],[6,2],[5,8],[3,9],[1,8],[4,6],[3,1],[5,4],[7,2],[5,2],[6,3],[0,9],[2,8],[9,8],[9,4],[4,8],[7,6],[0,5],[0,3],[2,4],[6,5],[1,2],[1,4]],"solution":false,"solvable":false,"difficulty":{"num_courses":[5,10],"num_prerequisites":[2,3],"cycle_length":[3,4]}}
|
{"min_num_courses":5,"max_num_courses":10,"min_num_prerequisites":2,"max_num_prerequisites":3,"min_cycle_length":3,"max_cycle_length":4,"p_solvable":0.6}
| 679,778,029
|
course_schedule
| 1
|
train
|
There are a total of 8 courses you have to take, labeled from 0 to 7.
You are given the following list of prerequisites, where prerequisites[i] = (a_i, b_i) indicates that you must first take course b_i if you want to take course a_i:
[(1, 0), (1, 6), (3, 1), (4, 6), (7, 0), (2, 4), (2, 0), (5, 1), (5, 2), (5, 6), (7, 6), (0, 6), (3, 0), (2, 3), (4, 3)]
Return True if you can finish all courses considering the prerequisites, or False otherwise.
|
True
|
{"source_dataset":"course_schedule","source_index":58,"courses":[6,0,1,3,4,2,7,5],"prerequisites":[[1,0],[1,6],[3,1],[4,6],[7,0],[2,4],[2,0],[5,1],[5,2],[5,6],[7,6],[0,6],[3,0],[2,3],[4,3]],"solution":true,"solvable":true,"difficulty":{"num_courses":[5,10],"num_prerequisites":[2,3],"cycle_length":[3,4]}}
|
{"min_num_courses":5,"max_num_courses":10,"min_num_prerequisites":2,"max_num_prerequisites":3,"min_cycle_length":3,"max_cycle_length":4,"p_solvable":0.6}
| 679,778,029
|
course_schedule
| 1
|
train
|
There are a total of 8 courses you have to take, labeled from 0 to 7.
You are given the following list of prerequisites, where prerequisites[i] = (a_i, b_i) indicates that you must first take course b_i if you want to take course a_i:
[(5, 0), (1, 3), (6, 1), (3, 0), (7, 2), (2, 5), (4, 2), (3, 5), (4, 5), (1, 0), (2, 3), (7, 1), (6, 3), (1, 4), (2, 0), (7, 3), (6, 7)]
Return True if you can finish all courses considering the prerequisites, or False otherwise.
|
True
|
{"source_dataset":"course_schedule","source_index":59,"courses":[0,5,3,2,4,1,7,6],"prerequisites":[[5,0],[1,3],[6,1],[3,0],[7,2],[2,5],[4,2],[3,5],[4,5],[1,0],[2,3],[7,1],[6,3],[1,4],[2,0],[7,3],[6,7]],"solution":true,"solvable":true,"difficulty":{"num_courses":[5,10],"num_prerequisites":[2,3],"cycle_length":[3,4]}}
|
{"min_num_courses":5,"max_num_courses":10,"min_num_prerequisites":2,"max_num_prerequisites":3,"min_cycle_length":3,"max_cycle_length":4,"p_solvable":0.6}
| 679,778,029
|
course_schedule
| 1
|
train
|
There are a total of 8 courses you have to take, labeled from 0 to 7.
You are given the following list of prerequisites, where prerequisites[i] = (a_i, b_i) indicates that you must first take course b_i if you want to take course a_i:
[(1, 3), (2, 3), (7, 3), (0, 2), (0, 1), (4, 1), (6, 2), (5, 0), (2, 7), (2, 5), (5, 1), (6, 4), (6, 0), (0, 7), (4, 2), (5, 3), (5, 4), (1, 7)]
Return True if you can finish all courses considering the prerequisites, or False otherwise.
|
False
|
{"source_dataset":"course_schedule","source_index":60,"courses":[3,7,2,1,0,4,5,6],"prerequisites":[[1,3],[2,3],[7,3],[0,2],[0,1],[4,1],[6,2],[5,0],[2,7],[2,5],[5,1],[6,4],[6,0],[0,7],[4,2],[5,3],[5,4],[1,7]],"solution":false,"solvable":false,"difficulty":{"num_courses":[5,10],"num_prerequisites":[2,3],"cycle_length":[3,4]}}
|
{"min_num_courses":5,"max_num_courses":10,"min_num_prerequisites":2,"max_num_prerequisites":3,"min_cycle_length":3,"max_cycle_length":4,"p_solvable":0.6}
| 679,778,029
|
course_schedule
| 1
|
train
|
There are a total of 9 courses you have to take, labeled from 0 to 8.
You are given the following list of prerequisites, where prerequisites[i] = (a_i, b_i) indicates that you must first take course b_i if you want to take course a_i:
[(5, 7), (5, 1), (5, 8), (4, 8), (3, 6), (8, 1), (7, 1), (0, 5), (2, 0), (4, 7), (2, 8), (6, 7), (3, 8), (3, 5), (2, 6), (7, 8), (6, 1), (0, 1)]
Return True if you can finish all courses considering the prerequisites, or False otherwise.
|
True
|
{"source_dataset":"course_schedule","source_index":61,"courses":[1,8,7,5,6,0,2,4,3],"prerequisites":[[5,7],[5,1],[5,8],[4,8],[3,6],[8,1],[7,1],[0,5],[2,0],[4,7],[2,8],[6,7],[3,8],[3,5],[2,6],[7,8],[6,1],[0,1]],"solution":true,"solvable":true,"difficulty":{"num_courses":[5,10],"num_prerequisites":[2,3],"cycle_length":[3,4]}}
|
{"min_num_courses":5,"max_num_courses":10,"min_num_prerequisites":2,"max_num_prerequisites":3,"min_cycle_length":3,"max_cycle_length":4,"p_solvable":0.6}
| 679,778,029
|
course_schedule
| 1
|
train
|
There are a total of 8 courses you have to take, labeled from 0 to 7.
You are given the following list of prerequisites, where prerequisites[i] = (a_i, b_i) indicates that you must first take course b_i if you want to take course a_i:
[(7, 0), (0, 4), (2, 4), (6, 5), (3, 1), (7, 2), (5, 4), (0, 1), (5, 2), (4, 1), (6, 7), (7, 4), (6, 2), (5, 0), (2, 1), (3, 7)]
Return True if you can finish all courses considering the prerequisites, or False otherwise.
|
True
|
{"source_dataset":"course_schedule","source_index":62,"courses":[1,4,0,2,7,5,6,3],"prerequisites":[[7,0],[0,4],[2,4],[6,5],[3,1],[7,2],[5,4],[0,1],[5,2],[4,1],[6,7],[7,4],[6,2],[5,0],[2,1],[3,7]],"solution":true,"solvable":true,"difficulty":{"num_courses":[5,10],"num_prerequisites":[2,3],"cycle_length":[3,4]}}
|
{"min_num_courses":5,"max_num_courses":10,"min_num_prerequisites":2,"max_num_prerequisites":3,"min_cycle_length":3,"max_cycle_length":4,"p_solvable":0.6}
| 679,778,029
|
course_schedule
| 1
|
train
|
There are a total of 9 courses you have to take, labeled from 0 to 8.
You are given the following list of prerequisites, where prerequisites[i] = (a_i, b_i) indicates that you must first take course b_i if you want to take course a_i:
[(6, 5), (0, 4), (6, 2), (5, 1), (4, 1), (0, 5), (8, 3), (5, 2), (0, 1), (7, 0), (2, 0), (6, 1), (1, 2), (3, 2), (3, 5), (7, 2), (8, 1), (8, 0), (3, 0), (7, 6), (4, 3)]
Return True if you can finish all courses considering the prerequisites, or False otherwise.
|
False
|
{"source_dataset":"course_schedule","source_index":63,"courses":[2,1,5,0,3,8,6,4,7],"prerequisites":[[6,5],[0,4],[6,2],[5,1],[4,1],[0,5],[8,3],[5,2],[0,1],[7,0],[2,0],[6,1],[1,2],[3,2],[3,5],[7,2],[8,1],[8,0],[3,0],[7,6],[4,3]],"solution":false,"solvable":false,"difficulty":{"num_courses":[5,10],"num_prerequisites":[2,3],"cycle_length":[3,4]}}
|
{"min_num_courses":5,"max_num_courses":10,"min_num_prerequisites":2,"max_num_prerequisites":3,"min_cycle_length":3,"max_cycle_length":4,"p_solvable":0.6}
| 679,778,029
|
course_schedule
| 1
|
train
|
There are a total of 10 courses you have to take, labeled from 0 to 9.
You are given the following list of prerequisites, where prerequisites[i] = (a_i, b_i) indicates that you must first take course b_i if you want to take course a_i:
[(8, 2), (0, 6), (8, 9), (9, 5), (1, 2), (5, 8), (6, 5), (9, 2), (5, 2), (3, 5), (3, 2), (7, 5), (1, 8), (6, 3), (0, 8), (3, 8), (4, 7), (4, 6), (4, 9), (7, 3), (7, 8), (0, 5), (2, 8)]
Return True if you can finish all courses considering the prerequisites, or False otherwise.
|
False
|
{"source_dataset":"course_schedule","source_index":64,"courses":[2,8,5,3,7,9,6,1,4,0],"prerequisites":[[8,2],[0,6],[8,9],[9,5],[1,2],[5,8],[6,5],[9,2],[5,2],[3,5],[3,2],[7,5],[1,8],[6,3],[0,8],[3,8],[4,7],[4,6],[4,9],[7,3],[7,8],[0,5],[2,8]],"solution":false,"solvable":false,"difficulty":{"num_courses":[5,10],"num_prerequisites":[2,3],"cycle_length":[3,4]}}
|
{"min_num_courses":5,"max_num_courses":10,"min_num_prerequisites":2,"max_num_prerequisites":3,"min_cycle_length":3,"max_cycle_length":4,"p_solvable":0.6}
| 679,778,029
|
course_schedule
| 1
|
train
|
There are a total of 9 courses you have to take, labeled from 0 to 8.
You are given the following list of prerequisites, where prerequisites[i] = (a_i, b_i) indicates that you must first take course b_i if you want to take course a_i:
[(6, 1), (2, 8), (5, 6), (3, 4), (4, 8), (7, 2), (0, 8), (8, 6), (3, 0), (7, 6), (7, 5), (4, 6), (2, 1), (6, 0), (0, 4), (8, 1), (1, 6), (4, 1), (5, 8)]
Return True if you can finish all courses considering the prerequisites, or False otherwise.
|
False
|
{"source_dataset":"course_schedule","source_index":65,"courses":[1,6,8,4,2,5,7,0,3],"prerequisites":[[6,1],[2,8],[5,6],[3,4],[4,8],[7,2],[0,8],[8,6],[3,0],[7,6],[7,5],[4,6],[2,1],[6,0],[0,4],[8,1],[1,6],[4,1],[5,8]],"solution":false,"solvable":false,"difficulty":{"num_courses":[5,10],"num_prerequisites":[2,3],"cycle_length":[3,4]}}
|
{"min_num_courses":5,"max_num_courses":10,"min_num_prerequisites":2,"max_num_prerequisites":3,"min_cycle_length":3,"max_cycle_length":4,"p_solvable":0.6}
| 679,778,029
|
course_schedule
| 1
|
train
|
There are a total of 5 courses you have to take, labeled from 0 to 4.
You are given the following list of prerequisites, where prerequisites[i] = (a_i, b_i) indicates that you must first take course b_i if you want to take course a_i:
[(2, 3), (3, 4), (1, 3), (2, 4), (1, 4), (0, 2), (1, 2), (0, 3), (0, 4)]
Return True if you can finish all courses considering the prerequisites, or False otherwise.
|
True
|
{"source_dataset":"course_schedule","source_index":66,"courses":[4,3,2,0,1],"prerequisites":[[2,3],[3,4],[1,3],[2,4],[1,4],[0,2],[1,2],[0,3],[0,4]],"solution":true,"solvable":true,"difficulty":{"num_courses":[5,10],"num_prerequisites":[2,3],"cycle_length":[3,4]}}
|
{"min_num_courses":5,"max_num_courses":10,"min_num_prerequisites":2,"max_num_prerequisites":3,"min_cycle_length":3,"max_cycle_length":4,"p_solvable":0.6}
| 679,778,029
|
course_schedule
| 1
|
train
|
There are a total of 7 courses you have to take, labeled from 0 to 6.
You are given the following list of prerequisites, where prerequisites[i] = (a_i, b_i) indicates that you must first take course b_i if you want to take course a_i:
[(0, 2), (0, 5), (5, 2), (6, 5), (4, 5), (5, 1), (4, 2), (0, 3), (1, 2), (1, 3), (3, 2), (4, 3), (6, 2)]
Return True if you can finish all courses considering the prerequisites, or False otherwise.
|
True
|
{"source_dataset":"course_schedule","source_index":67,"courses":[2,3,1,5,4,0,6],"prerequisites":[[0,2],[0,5],[5,2],[6,5],[4,5],[5,1],[4,2],[0,3],[1,2],[1,3],[3,2],[4,3],[6,2]],"solution":true,"solvable":true,"difficulty":{"num_courses":[5,10],"num_prerequisites":[2,3],"cycle_length":[3,4]}}
|
{"min_num_courses":5,"max_num_courses":10,"min_num_prerequisites":2,"max_num_prerequisites":3,"min_cycle_length":3,"max_cycle_length":4,"p_solvable":0.6}
| 679,778,029
|
course_schedule
| 1
|
train
|
There are a total of 7 courses you have to take, labeled from 0 to 6.
You are given the following list of prerequisites, where prerequisites[i] = (a_i, b_i) indicates that you must first take course b_i if you want to take course a_i:
[(5, 1), (1, 6), (0, 4), (4, 3), (1, 3), (5, 3), (2, 4), (2, 3), (5, 6), (0, 3), (6, 0), (6, 4)]
Return True if you can finish all courses considering the prerequisites, or False otherwise.
|
True
|
{"source_dataset":"course_schedule","source_index":68,"courses":[3,4,2,0,6,1,5],"prerequisites":[[5,1],[1,6],[0,4],[4,3],[1,3],[5,3],[2,4],[2,3],[5,6],[0,3],[6,0],[6,4]],"solution":true,"solvable":true,"difficulty":{"num_courses":[5,10],"num_prerequisites":[2,3],"cycle_length":[3,4]}}
|
{"min_num_courses":5,"max_num_courses":10,"min_num_prerequisites":2,"max_num_prerequisites":3,"min_cycle_length":3,"max_cycle_length":4,"p_solvable":0.6}
| 679,778,029
|
course_schedule
| 1
|
train
|
There are a total of 6 courses you have to take, labeled from 0 to 5.
You are given the following list of prerequisites, where prerequisites[i] = (a_i, b_i) indicates that you must first take course b_i if you want to take course a_i:
[(2, 4), (0, 5), (5, 1), (1, 2), (5, 3), (3, 4), (0, 2), (1, 3), (2, 3)]
Return True if you can finish all courses considering the prerequisites, or False otherwise.
|
True
|
{"source_dataset":"course_schedule","source_index":69,"courses":[4,3,2,1,5,0],"prerequisites":[[2,4],[0,5],[5,1],[1,2],[5,3],[3,4],[0,2],[1,3],[2,3]],"solution":true,"solvable":true,"difficulty":{"num_courses":[5,10],"num_prerequisites":[2,3],"cycle_length":[3,4]}}
|
{"min_num_courses":5,"max_num_courses":10,"min_num_prerequisites":2,"max_num_prerequisites":3,"min_cycle_length":3,"max_cycle_length":4,"p_solvable":0.6}
| 679,778,029
|
course_schedule
| 1
|
train
|
There are a total of 6 courses you have to take, labeled from 0 to 5.
You are given the following list of prerequisites, where prerequisites[i] = (a_i, b_i) indicates that you must first take course b_i if you want to take course a_i:
[(5, 0), (3, 2), (3, 5), (2, 1), (1, 3), (1, 5), (3, 0), (4, 0), (4, 5), (2, 5), (2, 0), (1, 4), (5, 1), (4, 3)]
Return True if you can finish all courses considering the prerequisites, or False otherwise.
|
False
|
{"source_dataset":"course_schedule","source_index":70,"courses":[0,5,3,4,1,2],"prerequisites":[[5,0],[3,2],[3,5],[2,1],[1,3],[1,5],[3,0],[4,0],[4,5],[2,5],[2,0],[1,4],[5,1],[4,3]],"solution":false,"solvable":false,"difficulty":{"num_courses":[5,10],"num_prerequisites":[2,3],"cycle_length":[3,4]}}
|
{"min_num_courses":5,"max_num_courses":10,"min_num_prerequisites":2,"max_num_prerequisites":3,"min_cycle_length":3,"max_cycle_length":4,"p_solvable":0.6}
| 679,778,029
|
course_schedule
| 1
|
train
|
There are a total of 6 courses you have to take, labeled from 0 to 5.
You are given the following list of prerequisites, where prerequisites[i] = (a_i, b_i) indicates that you must first take course b_i if you want to take course a_i:
[(0, 2), (4, 2), (3, 2), (2, 4), (5, 4), (1, 5), (1, 3), (2, 0), (5, 3), (3, 0), (4, 0), (3, 4)]
Return True if you can finish all courses considering the prerequisites, or False otherwise.
|
False
|
{"source_dataset":"course_schedule","source_index":71,"courses":[0,2,4,3,5,1],"prerequisites":[[0,2],[4,2],[3,2],[2,4],[5,4],[1,5],[1,3],[2,0],[5,3],[3,0],[4,0],[3,4]],"solution":false,"solvable":false,"difficulty":{"num_courses":[5,10],"num_prerequisites":[2,3],"cycle_length":[3,4]}}
|
{"min_num_courses":5,"max_num_courses":10,"min_num_prerequisites":2,"max_num_prerequisites":3,"min_cycle_length":3,"max_cycle_length":4,"p_solvable":0.6}
| 679,778,029
|
course_schedule
| 1
|
train
|
There are a total of 8 courses you have to take, labeled from 0 to 7.
You are given the following list of prerequisites, where prerequisites[i] = (a_i, b_i) indicates that you must first take course b_i if you want to take course a_i:
[(6, 0), (3, 6), (7, 1), (7, 2), (3, 7), (2, 1), (6, 1), (1, 5), (1, 0), (6, 2), (4, 2), (5, 0), (4, 6), (3, 1), (2, 5), (2, 0)]
Return True if you can finish all courses considering the prerequisites, or False otherwise.
|
True
|
{"source_dataset":"course_schedule","source_index":72,"courses":[0,5,1,2,6,4,7,3],"prerequisites":[[6,0],[3,6],[7,1],[7,2],[3,7],[2,1],[6,1],[1,5],[1,0],[6,2],[4,2],[5,0],[4,6],[3,1],[2,5],[2,0]],"solution":true,"solvable":true,"difficulty":{"num_courses":[5,10],"num_prerequisites":[2,3],"cycle_length":[3,4]}}
|
{"min_num_courses":5,"max_num_courses":10,"min_num_prerequisites":2,"max_num_prerequisites":3,"min_cycle_length":3,"max_cycle_length":4,"p_solvable":0.6}
| 679,778,029
|
course_schedule
| 1
|
train
|
There are a total of 7 courses you have to take, labeled from 0 to 6.
You are given the following list of prerequisites, where prerequisites[i] = (a_i, b_i) indicates that you must first take course b_i if you want to take course a_i:
[(0, 4), (0, 5), (3, 1), (5, 2), (6, 4), (4, 1), (3, 2), (6, 0), (4, 5), (5, 1), (3, 0), (2, 1), (4, 2)]
Return True if you can finish all courses considering the prerequisites, or False otherwise.
|
True
|
{"source_dataset":"course_schedule","source_index":73,"courses":[1,2,5,4,0,3,6],"prerequisites":[[0,4],[0,5],[3,1],[5,2],[6,4],[4,1],[3,2],[6,0],[4,5],[5,1],[3,0],[2,1],[4,2]],"solution":true,"solvable":true,"difficulty":{"num_courses":[5,10],"num_prerequisites":[2,3],"cycle_length":[3,4]}}
|
{"min_num_courses":5,"max_num_courses":10,"min_num_prerequisites":2,"max_num_prerequisites":3,"min_cycle_length":3,"max_cycle_length":4,"p_solvable":0.6}
| 679,778,029
|
course_schedule
| 1
|
train
|
There are a total of 7 courses you have to take, labeled from 0 to 6.
You are given the following list of prerequisites, where prerequisites[i] = (a_i, b_i) indicates that you must first take course b_i if you want to take course a_i:
[(0, 2), (2, 1), (6, 3), (6, 5), (4, 6), (4, 1), (0, 6), (5, 1), (3, 1), (3, 2), (0, 5), (5, 2)]
Return True if you can finish all courses considering the prerequisites, or False otherwise.
|
True
|
{"source_dataset":"course_schedule","source_index":74,"courses":[1,2,3,5,6,4,0],"prerequisites":[[0,2],[2,1],[6,3],[6,5],[4,6],[4,1],[0,6],[5,1],[3,1],[3,2],[0,5],[5,2]],"solution":true,"solvable":true,"difficulty":{"num_courses":[5,10],"num_prerequisites":[2,3],"cycle_length":[3,4]}}
|
{"min_num_courses":5,"max_num_courses":10,"min_num_prerequisites":2,"max_num_prerequisites":3,"min_cycle_length":3,"max_cycle_length":4,"p_solvable":0.6}
| 679,778,029
|
course_schedule
| 1
|
train
|
There are a total of 6 courses you have to take, labeled from 0 to 5.
You are given the following list of prerequisites, where prerequisites[i] = (a_i, b_i) indicates that you must first take course b_i if you want to take course a_i:
[(1, 0), (0, 3), (2, 0), (5, 3), (4, 0), (2, 3), (1, 2), (4, 3), (5, 0), (5, 2), (4, 2)]
Return True if you can finish all courses considering the prerequisites, or False otherwise.
|
True
|
{"source_dataset":"course_schedule","source_index":75,"courses":[3,0,2,5,4,1],"prerequisites":[[1,0],[0,3],[2,0],[5,3],[4,0],[2,3],[1,2],[4,3],[5,0],[5,2],[4,2]],"solution":true,"solvable":true,"difficulty":{"num_courses":[5,10],"num_prerequisites":[2,3],"cycle_length":[3,4]}}
|
{"min_num_courses":5,"max_num_courses":10,"min_num_prerequisites":2,"max_num_prerequisites":3,"min_cycle_length":3,"max_cycle_length":4,"p_solvable":0.6}
| 679,778,029
|
course_schedule
| 1
|
train
|
There are a total of 5 courses you have to take, labeled from 0 to 4.
You are given the following list of prerequisites, where prerequisites[i] = (a_i, b_i) indicates that you must first take course b_i if you want to take course a_i:
[(4, 2), (0, 1), (4, 1), (1, 2), (3, 1), (4, 3), (0, 3), (0, 2), (3, 2)]
Return True if you can finish all courses considering the prerequisites, or False otherwise.
|
True
|
{"source_dataset":"course_schedule","source_index":76,"courses":[2,1,3,4,0],"prerequisites":[[4,2],[0,1],[4,1],[1,2],[3,1],[4,3],[0,3],[0,2],[3,2]],"solution":true,"solvable":true,"difficulty":{"num_courses":[5,10],"num_prerequisites":[2,3],"cycle_length":[3,4]}}
|
{"min_num_courses":5,"max_num_courses":10,"min_num_prerequisites":2,"max_num_prerequisites":3,"min_cycle_length":3,"max_cycle_length":4,"p_solvable":0.6}
| 679,778,029
|
course_schedule
| 1
|
train
|
There are a total of 9 courses you have to take, labeled from 0 to 8.
You are given the following list of prerequisites, where prerequisites[i] = (a_i, b_i) indicates that you must first take course b_i if you want to take course a_i:
[(6, 4), (1, 0), (4, 1), (2, 5), (5, 3), (2, 4), (7, 3), (0, 3), (1, 3), (5, 7), (8, 4), (2, 1), (0, 7), (4, 0), (8, 1), (6, 0)]
Return True if you can finish all courses considering the prerequisites, or False otherwise.
|
True
|
{"source_dataset":"course_schedule","source_index":77,"courses":[3,7,0,1,4,5,2,6,8],"prerequisites":[[6,4],[1,0],[4,1],[2,5],[5,3],[2,4],[7,3],[0,3],[1,3],[5,7],[8,4],[2,1],[0,7],[4,0],[8,1],[6,0]],"solution":true,"solvable":true,"difficulty":{"num_courses":[5,10],"num_prerequisites":[2,3],"cycle_length":[3,4]}}
|
{"min_num_courses":5,"max_num_courses":10,"min_num_prerequisites":2,"max_num_prerequisites":3,"min_cycle_length":3,"max_cycle_length":4,"p_solvable":0.6}
| 679,778,029
|
course_schedule
| 1
|
train
|
There are a total of 10 courses you have to take, labeled from 0 to 9.
You are given the following list of prerequisites, where prerequisites[i] = (a_i, b_i) indicates that you must first take course b_i if you want to take course a_i:
[(3, 7), (5, 3), (3, 1), (8, 1), (2, 1), (8, 9), (4, 2), (7, 1), (2, 7), (2, 6), (5, 2), (9, 3), (4, 6), (6, 4), (4, 7), (6, 2), (5, 1), (0, 7), (9, 1), (8, 3), (0, 8), (6, 7)]
Return True if you can finish all courses considering the prerequisites, or False otherwise.
|
False
|
{"source_dataset":"course_schedule","source_index":78,"courses":[1,7,3,9,2,8,6,4,5,0],"prerequisites":[[3,7],[5,3],[3,1],[8,1],[2,1],[8,9],[4,2],[7,1],[2,7],[2,6],[5,2],[9,3],[4,6],[6,4],[4,7],[6,2],[5,1],[0,7],[9,1],[8,3],[0,8],[6,7]],"solution":false,"solvable":false,"difficulty":{"num_courses":[5,10],"num_prerequisites":[2,3],"cycle_length":[3,4]}}
|
{"min_num_courses":5,"max_num_courses":10,"min_num_prerequisites":2,"max_num_prerequisites":3,"min_cycle_length":3,"max_cycle_length":4,"p_solvable":0.6}
| 679,778,029
|
course_schedule
| 1
|
train
|
There are a total of 5 courses you have to take, labeled from 0 to 4.
You are given the following list of prerequisites, where prerequisites[i] = (a_i, b_i) indicates that you must first take course b_i if you want to take course a_i:
[(1, 4), (1, 0), (4, 2), (0, 3), (0, 4), (2, 3), (3, 4), (0, 2), (3, 2), (1, 2), (4, 1), (1, 3)]
Return True if you can finish all courses considering the prerequisites, or False otherwise.
|
False
|
{"source_dataset":"course_schedule","source_index":79,"courses":[2,4,3,0,1],"prerequisites":[[1,4],[1,0],[4,2],[0,3],[0,4],[2,3],[3,4],[0,2],[3,2],[1,2],[4,1],[1,3]],"solution":false,"solvable":false,"difficulty":{"num_courses":[5,10],"num_prerequisites":[2,3],"cycle_length":[3,4]}}
|
{"min_num_courses":5,"max_num_courses":10,"min_num_prerequisites":2,"max_num_prerequisites":3,"min_cycle_length":3,"max_cycle_length":4,"p_solvable":0.6}
| 679,778,029
|
course_schedule
| 1
|
train
|
There are a total of 9 courses you have to take, labeled from 0 to 8.
You are given the following list of prerequisites, where prerequisites[i] = (a_i, b_i) indicates that you must first take course b_i if you want to take course a_i:
[(1, 2), (0, 7), (6, 4), (8, 2), (7, 4), (3, 7), (6, 3), (1, 8), (1, 4), (0, 8), (6, 8), (3, 4), (2, 3), (8, 3), (2, 4), (5, 8), (5, 3), (0, 3)]
Return True if you can finish all courses considering the prerequisites, or False otherwise.
|
True
|
{"source_dataset":"course_schedule","source_index":80,"courses":[4,7,3,2,8,1,6,5,0],"prerequisites":[[1,2],[0,7],[6,4],[8,2],[7,4],[3,7],[6,3],[1,8],[1,4],[0,8],[6,8],[3,4],[2,3],[8,3],[2,4],[5,8],[5,3],[0,3]],"solution":true,"solvable":true,"difficulty":{"num_courses":[5,10],"num_prerequisites":[2,3],"cycle_length":[3,4]}}
|
{"min_num_courses":5,"max_num_courses":10,"min_num_prerequisites":2,"max_num_prerequisites":3,"min_cycle_length":3,"max_cycle_length":4,"p_solvable":0.6}
| 679,778,029
|
course_schedule
| 1
|
train
|
There are a total of 5 courses you have to take, labeled from 0 to 4.
You are given the following list of prerequisites, where prerequisites[i] = (a_i, b_i) indicates that you must first take course b_i if you want to take course a_i:
[(4, 2), (4, 3), (2, 0), (4, 0), (3, 2), (1, 0), (1, 3), (3, 0)]
Return True if you can finish all courses considering the prerequisites, or False otherwise.
|
True
|
{"source_dataset":"course_schedule","source_index":81,"courses":[0,2,3,4,1],"prerequisites":[[4,2],[4,3],[2,0],[4,0],[3,2],[1,0],[1,3],[3,0]],"solution":true,"solvable":true,"difficulty":{"num_courses":[5,10],"num_prerequisites":[2,3],"cycle_length":[3,4]}}
|
{"min_num_courses":5,"max_num_courses":10,"min_num_prerequisites":2,"max_num_prerequisites":3,"min_cycle_length":3,"max_cycle_length":4,"p_solvable":0.6}
| 679,778,029
|
course_schedule
| 1
|
train
|
There are a total of 5 courses you have to take, labeled from 0 to 4.
You are given the following list of prerequisites, where prerequisites[i] = (a_i, b_i) indicates that you must first take course b_i if you want to take course a_i:
[(3, 1), (3, 0), (4, 0), (2, 3), (2, 1), (1, 0), (4, 1)]
Return True if you can finish all courses considering the prerequisites, or False otherwise.
|
True
|
{"source_dataset":"course_schedule","source_index":82,"courses":[0,1,4,3,2],"prerequisites":[[3,1],[3,0],[4,0],[2,3],[2,1],[1,0],[4,1]],"solution":true,"solvable":true,"difficulty":{"num_courses":[5,10],"num_prerequisites":[2,3],"cycle_length":[3,4]}}
|
{"min_num_courses":5,"max_num_courses":10,"min_num_prerequisites":2,"max_num_prerequisites":3,"min_cycle_length":3,"max_cycle_length":4,"p_solvable":0.6}
| 679,778,029
|
course_schedule
| 1
|
train
|
There are a total of 8 courses you have to take, labeled from 0 to 7.
You are given the following list of prerequisites, where prerequisites[i] = (a_i, b_i) indicates that you must first take course b_i if you want to take course a_i:
[(4, 6), (2, 7), (6, 5), (3, 5), (4, 0), (2, 1), (1, 6), (4, 5), (3, 1), (1, 7), (0, 5), (6, 7), (0, 7), (3, 6), (5, 7)]
Return True if you can finish all courses considering the prerequisites, or False otherwise.
|
True
|
{"source_dataset":"course_schedule","source_index":83,"courses":[7,5,0,6,1,4,3,2],"prerequisites":[[4,6],[2,7],[6,5],[3,5],[4,0],[2,1],[1,6],[4,5],[3,1],[1,7],[0,5],[6,7],[0,7],[3,6],[5,7]],"solution":true,"solvable":true,"difficulty":{"num_courses":[5,10],"num_prerequisites":[2,3],"cycle_length":[3,4]}}
|
{"min_num_courses":5,"max_num_courses":10,"min_num_prerequisites":2,"max_num_prerequisites":3,"min_cycle_length":3,"max_cycle_length":4,"p_solvable":0.6}
| 679,778,029
|
course_schedule
| 1
|
train
|
There are a total of 6 courses you have to take, labeled from 0 to 5.
You are given the following list of prerequisites, where prerequisites[i] = (a_i, b_i) indicates that you must first take course b_i if you want to take course a_i:
[(5, 0), (2, 3), (2, 0), (3, 1), (5, 1), (1, 4), (1, 0), (2, 1), (3, 4), (4, 0), (5, 4)]
Return True if you can finish all courses considering the prerequisites, or False otherwise.
|
True
|
{"source_dataset":"course_schedule","source_index":84,"courses":[0,4,1,5,3,2],"prerequisites":[[5,0],[2,3],[2,0],[3,1],[5,1],[1,4],[1,0],[2,1],[3,4],[4,0],[5,4]],"solution":true,"solvable":true,"difficulty":{"num_courses":[5,10],"num_prerequisites":[2,3],"cycle_length":[3,4]}}
|
{"min_num_courses":5,"max_num_courses":10,"min_num_prerequisites":2,"max_num_prerequisites":3,"min_cycle_length":3,"max_cycle_length":4,"p_solvable":0.6}
| 679,778,029
|
course_schedule
| 1
|
train
|
There are a total of 9 courses you have to take, labeled from 0 to 8.
You are given the following list of prerequisites, where prerequisites[i] = (a_i, b_i) indicates that you must first take course b_i if you want to take course a_i:
[(0, 8), (7, 8), (1, 8), (1, 4), (5, 4), (5, 8), (3, 8), (0, 5), (5, 2), (3, 2), (6, 8), (2, 8), (1, 5), (7, 6), (5, 3), (2, 6), (4, 7), (0, 2), (4, 6), (3, 0)]
Return True if you can finish all courses considering the prerequisites, or False otherwise.
|
False
|
{"source_dataset":"course_schedule","source_index":85,"courses":[8,6,2,7,3,0,4,5,1],"prerequisites":[[0,8],[7,8],[1,8],[1,4],[5,4],[5,8],[3,8],[0,5],[5,2],[3,2],[6,8],[2,8],[1,5],[7,6],[5,3],[2,6],[4,7],[0,2],[4,6],[3,0]],"solution":false,"solvable":false,"difficulty":{"num_courses":[5,10],"num_prerequisites":[2,3],"cycle_length":[3,4]}}
|
{"min_num_courses":5,"max_num_courses":10,"min_num_prerequisites":2,"max_num_prerequisites":3,"min_cycle_length":3,"max_cycle_length":4,"p_solvable":0.6}
| 679,778,029
|
course_schedule
| 1
|
train
|
There are a total of 8 courses you have to take, labeled from 0 to 7.
You are given the following list of prerequisites, where prerequisites[i] = (a_i, b_i) indicates that you must first take course b_i if you want to take course a_i:
[(6, 4), (2, 0), (1, 4), (5, 3), (2, 3), (3, 6), (0, 3), (0, 4), (1, 7), (5, 6), (7, 0), (7, 4), (1, 3), (2, 6), (3, 4), (5, 0), (7, 3)]
Return True if you can finish all courses considering the prerequisites, or False otherwise.
|
True
|
{"source_dataset":"course_schedule","source_index":86,"courses":[4,6,3,0,5,2,7,1],"prerequisites":[[6,4],[2,0],[1,4],[5,3],[2,3],[3,6],[0,3],[0,4],[1,7],[5,6],[7,0],[7,4],[1,3],[2,6],[3,4],[5,0],[7,3]],"solution":true,"solvable":true,"difficulty":{"num_courses":[5,10],"num_prerequisites":[2,3],"cycle_length":[3,4]}}
|
{"min_num_courses":5,"max_num_courses":10,"min_num_prerequisites":2,"max_num_prerequisites":3,"min_cycle_length":3,"max_cycle_length":4,"p_solvable":0.6}
| 679,778,029
|
course_schedule
| 1
|
train
|
There are a total of 8 courses you have to take, labeled from 0 to 7.
You are given the following list of prerequisites, where prerequisites[i] = (a_i, b_i) indicates that you must first take course b_i if you want to take course a_i:
[(1, 3), (4, 0), (1, 0), (4, 3), (7, 3), (5, 4), (2, 6), (0, 3), (4, 7), (6, 1), (2, 7), (5, 3), (7, 0), (5, 0), (6, 4)]
Return True if you can finish all courses considering the prerequisites, or False otherwise.
|
True
|
{"source_dataset":"course_schedule","source_index":87,"courses":[3,0,1,7,4,5,6,2],"prerequisites":[[1,3],[4,0],[1,0],[4,3],[7,3],[5,4],[2,6],[0,3],[4,7],[6,1],[2,7],[5,3],[7,0],[5,0],[6,4]],"solution":true,"solvable":true,"difficulty":{"num_courses":[5,10],"num_prerequisites":[2,3],"cycle_length":[3,4]}}
|
{"min_num_courses":5,"max_num_courses":10,"min_num_prerequisites":2,"max_num_prerequisites":3,"min_cycle_length":3,"max_cycle_length":4,"p_solvable":0.6}
| 679,778,029
|
course_schedule
| 1
|
train
|
There are a total of 7 courses you have to take, labeled from 0 to 6.
You are given the following list of prerequisites, where prerequisites[i] = (a_i, b_i) indicates that you must first take course b_i if you want to take course a_i:
[(5, 2), (3, 6), (2, 4), (3, 2), (6, 4), (2, 0), (3, 0), (1, 6), (6, 0), (5, 0), (0, 4), (1, 0)]
Return True if you can finish all courses considering the prerequisites, or False otherwise.
|
True
|
{"source_dataset":"course_schedule","source_index":88,"courses":[4,0,6,2,3,5,1],"prerequisites":[[5,2],[3,6],[2,4],[3,2],[6,4],[2,0],[3,0],[1,6],[6,0],[5,0],[0,4],[1,0]],"solution":true,"solvable":true,"difficulty":{"num_courses":[5,10],"num_prerequisites":[2,3],"cycle_length":[3,4]}}
|
{"min_num_courses":5,"max_num_courses":10,"min_num_prerequisites":2,"max_num_prerequisites":3,"min_cycle_length":3,"max_cycle_length":4,"p_solvable":0.6}
| 679,778,029
|
course_schedule
| 1
|
train
|
There are a total of 7 courses you have to take, labeled from 0 to 6.
You are given the following list of prerequisites, where prerequisites[i] = (a_i, b_i) indicates that you must first take course b_i if you want to take course a_i:
[(3, 5), (2, 0), (6, 4), (3, 0), (1, 2), (1, 0), (6, 0), (2, 4), (5, 2), (1, 4), (1, 3), (5, 6), (3, 4), (6, 1), (4, 6), (0, 4), (6, 2)]
Return True if you can finish all courses considering the prerequisites, or False otherwise.
|
False
|
{"source_dataset":"course_schedule","source_index":89,"courses":[4,0,2,1,6,5,3],"prerequisites":[[3,5],[2,0],[6,4],[3,0],[1,2],[1,0],[6,0],[2,4],[5,2],[1,4],[1,3],[5,6],[3,4],[6,1],[4,6],[0,4],[6,2]],"solution":false,"solvable":false,"difficulty":{"num_courses":[5,10],"num_prerequisites":[2,3],"cycle_length":[3,4]}}
|
{"min_num_courses":5,"max_num_courses":10,"min_num_prerequisites":2,"max_num_prerequisites":3,"min_cycle_length":3,"max_cycle_length":4,"p_solvable":0.6}
| 679,778,029
|
course_schedule
| 1
|
train
|
There are a total of 10 courses you have to take, labeled from 0 to 9.
You are given the following list of prerequisites, where prerequisites[i] = (a_i, b_i) indicates that you must first take course b_i if you want to take course a_i:
[(2, 6), (4, 1), (1, 8), (0, 7), (2, 7), (5, 6), (4, 7), (5, 2), (9, 7), (8, 5), (1, 7), (9, 1), (8, 2), (9, 2), (5, 7), (3, 1), (0, 8), (3, 8), (6, 7), (0, 2), (4, 2)]
Return True if you can finish all courses considering the prerequisites, or False otherwise.
|
True
|
{"source_dataset":"course_schedule","source_index":90,"courses":[7,6,2,5,8,0,1,4,9,3],"prerequisites":[[2,6],[4,1],[1,8],[0,7],[2,7],[5,6],[4,7],[5,2],[9,7],[8,5],[1,7],[9,1],[8,2],[9,2],[5,7],[3,1],[0,8],[3,8],[6,7],[0,2],[4,2]],"solution":true,"solvable":true,"difficulty":{"num_courses":[5,10],"num_prerequisites":[2,3],"cycle_length":[3,4]}}
|
{"min_num_courses":5,"max_num_courses":10,"min_num_prerequisites":2,"max_num_prerequisites":3,"min_cycle_length":3,"max_cycle_length":4,"p_solvable":0.6}
| 679,778,029
|
course_schedule
| 1
|
train
|
There are a total of 8 courses you have to take, labeled from 0 to 7.
You are given the following list of prerequisites, where prerequisites[i] = (a_i, b_i) indicates that you must first take course b_i if you want to take course a_i:
[(6, 4), (1, 0), (5, 7), (1, 3), (0, 7), (3, 0), (2, 1), (6, 0), (5, 1), (2, 0), (4, 7), (4, 0), (3, 4), (6, 7), (3, 6), (2, 3)]
Return True if you can finish all courses considering the prerequisites, or False otherwise.
|
True
|
{"source_dataset":"course_schedule","source_index":91,"courses":[7,0,4,6,3,1,5,2],"prerequisites":[[6,4],[1,0],[5,7],[1,3],[0,7],[3,0],[2,1],[6,0],[5,1],[2,0],[4,7],[4,0],[3,4],[6,7],[3,6],[2,3]],"solution":true,"solvable":true,"difficulty":{"num_courses":[5,10],"num_prerequisites":[2,3],"cycle_length":[3,4]}}
|
{"min_num_courses":5,"max_num_courses":10,"min_num_prerequisites":2,"max_num_prerequisites":3,"min_cycle_length":3,"max_cycle_length":4,"p_solvable":0.6}
| 679,778,029
|
course_schedule
| 1
|
train
|
There are a total of 8 courses you have to take, labeled from 0 to 7.
You are given the following list of prerequisites, where prerequisites[i] = (a_i, b_i) indicates that you must first take course b_i if you want to take course a_i:
[(1, 0), (3, 4), (2, 1), (5, 1), (6, 3), (6, 0), (5, 4), (4, 3), (3, 2), (6, 4), (2, 5), (3, 0), (4, 1), (2, 0), (7, 6), (7, 0), (5, 0), (4, 0), (0, 4)]
Return True if you can finish all courses considering the prerequisites, or False otherwise.
|
False
|
{"source_dataset":"course_schedule","source_index":92,"courses":[0,1,4,5,2,3,6,7],"prerequisites":[[1,0],[3,4],[2,1],[5,1],[6,3],[6,0],[5,4],[4,3],[3,2],[6,4],[2,5],[3,0],[4,1],[2,0],[7,6],[7,0],[5,0],[4,0],[0,4]],"solution":false,"solvable":false,"difficulty":{"num_courses":[5,10],"num_prerequisites":[2,3],"cycle_length":[3,4]}}
|
{"min_num_courses":5,"max_num_courses":10,"min_num_prerequisites":2,"max_num_prerequisites":3,"min_cycle_length":3,"max_cycle_length":4,"p_solvable":0.6}
| 679,778,029
|
course_schedule
| 1
|
train
|
There are a total of 8 courses you have to take, labeled from 0 to 7.
You are given the following list of prerequisites, where prerequisites[i] = (a_i, b_i) indicates that you must first take course b_i if you want to take course a_i:
[(2, 3), (4, 7), (6, 3), (4, 5), (7, 3), (3, 5), (1, 6), (2, 5), (0, 6), (6, 5), (1, 5), (0, 5), (7, 0)]
Return True if you can finish all courses considering the prerequisites, or False otherwise.
|
True
|
{"source_dataset":"course_schedule","source_index":93,"courses":[5,3,6,0,2,7,4,1],"prerequisites":[[2,3],[4,7],[6,3],[4,5],[7,3],[3,5],[1,6],[2,5],[0,6],[6,5],[1,5],[0,5],[7,0]],"solution":true,"solvable":true,"difficulty":{"num_courses":[5,10],"num_prerequisites":[2,3],"cycle_length":[3,4]}}
|
{"min_num_courses":5,"max_num_courses":10,"min_num_prerequisites":2,"max_num_prerequisites":3,"min_cycle_length":3,"max_cycle_length":4,"p_solvable":0.6}
| 679,778,029
|
course_schedule
| 1
|
train
|
There are a total of 9 courses you have to take, labeled from 0 to 8.
You are given the following list of prerequisites, where prerequisites[i] = (a_i, b_i) indicates that you must first take course b_i if you want to take course a_i:
[(4, 5), (3, 5), (2, 6), (0, 5), (8, 3), (7, 4), (6, 1), (2, 8), (0, 8), (3, 1), (7, 6), (5, 1), (8, 1), (8, 5), (6, 5), (4, 3), (0, 2)]
Return True if you can finish all courses considering the prerequisites, or False otherwise.
|
True
|
{"source_dataset":"course_schedule","source_index":94,"courses":[1,5,3,8,6,2,0,4,7],"prerequisites":[[4,5],[3,5],[2,6],[0,5],[8,3],[7,4],[6,1],[2,8],[0,8],[3,1],[7,6],[5,1],[8,1],[8,5],[6,5],[4,3],[0,2]],"solution":true,"solvable":true,"difficulty":{"num_courses":[5,10],"num_prerequisites":[2,3],"cycle_length":[3,4]}}
|
{"min_num_courses":5,"max_num_courses":10,"min_num_prerequisites":2,"max_num_prerequisites":3,"min_cycle_length":3,"max_cycle_length":4,"p_solvable":0.6}
| 679,778,029
|
course_schedule
| 1
|
train
|
There are a total of 8 courses you have to take, labeled from 0 to 7.
You are given the following list of prerequisites, where prerequisites[i] = (a_i, b_i) indicates that you must first take course b_i if you want to take course a_i:
[(2, 1), (2, 6), (5, 6), (7, 6), (5, 1), (4, 1), (1, 7), (1, 6), (3, 5), (4, 0), (0, 7), (3, 7), (0, 6), (2, 0), (0, 1)]
Return True if you can finish all courses considering the prerequisites, or False otherwise.
|
True
|
{"source_dataset":"course_schedule","source_index":95,"courses":[6,7,1,5,3,0,2,4],"prerequisites":[[2,1],[2,6],[5,6],[7,6],[5,1],[4,1],[1,7],[1,6],[3,5],[4,0],[0,7],[3,7],[0,6],[2,0],[0,1]],"solution":true,"solvable":true,"difficulty":{"num_courses":[5,10],"num_prerequisites":[2,3],"cycle_length":[3,4]}}
|
{"min_num_courses":5,"max_num_courses":10,"min_num_prerequisites":2,"max_num_prerequisites":3,"min_cycle_length":3,"max_cycle_length":4,"p_solvable":0.6}
| 679,778,029
|
course_schedule
| 1
|
train
|
There are a total of 7 courses you have to take, labeled from 0 to 6.
You are given the following list of prerequisites, where prerequisites[i] = (a_i, b_i) indicates that you must first take course b_i if you want to take course a_i:
[(0, 4), (1, 2), (5, 2), (5, 6), (4, 2), (0, 6), (3, 0), (1, 4), (3, 2), (4, 5), (3, 4), (2, 6), (1, 6)]
Return True if you can finish all courses considering the prerequisites, or False otherwise.
|
True
|
{"source_dataset":"course_schedule","source_index":96,"courses":[6,2,5,4,0,3,1],"prerequisites":[[0,4],[1,2],[5,2],[5,6],[4,2],[0,6],[3,0],[1,4],[3,2],[4,5],[3,4],[2,6],[1,6]],"solution":true,"solvable":true,"difficulty":{"num_courses":[5,10],"num_prerequisites":[2,3],"cycle_length":[3,4]}}
|
{"min_num_courses":5,"max_num_courses":10,"min_num_prerequisites":2,"max_num_prerequisites":3,"min_cycle_length":3,"max_cycle_length":4,"p_solvable":0.6}
| 679,778,029
|
course_schedule
| 1
|
train
|
There are a total of 10 courses you have to take, labeled from 0 to 9.
You are given the following list of prerequisites, where prerequisites[i] = (a_i, b_i) indicates that you must first take course b_i if you want to take course a_i:
[(8, 6), (7, 4), (0, 3), (6, 3), (2, 0), (4, 8), (8, 0), (9, 4), (1, 0), (5, 2), (5, 4), (9, 8), (1, 5), (7, 9), (9, 0), (2, 4), (0, 6), (0, 7), (4, 3), (4, 0)]
Return True if you can finish all courses considering the prerequisites, or False otherwise.
|
False
|
{"source_dataset":"course_schedule","source_index":97,"courses":[3,6,0,8,4,2,9,7,5,1],"prerequisites":[[8,6],[7,4],[0,3],[6,3],[2,0],[4,8],[8,0],[9,4],[1,0],[5,2],[5,4],[9,8],[1,5],[7,9],[9,0],[2,4],[0,6],[0,7],[4,3],[4,0]],"solution":false,"solvable":false,"difficulty":{"num_courses":[5,10],"num_prerequisites":[2,3],"cycle_length":[3,4]}}
|
{"min_num_courses":5,"max_num_courses":10,"min_num_prerequisites":2,"max_num_prerequisites":3,"min_cycle_length":3,"max_cycle_length":4,"p_solvable":0.6}
| 679,778,029
|
course_schedule
| 1
|
train
|
There are a total of 9 courses you have to take, labeled from 0 to 8.
You are given the following list of prerequisites, where prerequisites[i] = (a_i, b_i) indicates that you must first take course b_i if you want to take course a_i:
[(0, 1), (1, 6), (3, 7), (8, 5), (2, 3), (6, 4), (3, 4), (4, 7), (2, 1), (5, 4), (7, 5), (8, 1), (0, 5), (5, 3), (8, 6), (2, 6), (1, 3), (0, 7), (6, 3)]
Return True if you can finish all courses considering the prerequisites, or False otherwise.
|
False
|
{"source_dataset":"course_schedule","source_index":98,"courses":[7,4,3,5,6,1,2,8,0],"prerequisites":[[0,1],[1,6],[3,7],[8,5],[2,3],[6,4],[3,4],[4,7],[2,1],[5,4],[7,5],[8,1],[0,5],[5,3],[8,6],[2,6],[1,3],[0,7],[6,3]],"solution":false,"solvable":false,"difficulty":{"num_courses":[5,10],"num_prerequisites":[2,3],"cycle_length":[3,4]}}
|
{"min_num_courses":5,"max_num_courses":10,"min_num_prerequisites":2,"max_num_prerequisites":3,"min_cycle_length":3,"max_cycle_length":4,"p_solvable":0.6}
| 679,778,029
|
course_schedule
| 1
|
train
|
There are a total of 7 courses you have to take, labeled from 0 to 6.
You are given the following list of prerequisites, where prerequisites[i] = (a_i, b_i) indicates that you must first take course b_i if you want to take course a_i:
[(0, 5), (5, 3), (1, 3), (1, 5), (5, 4), (1, 6), (0, 3), (2, 0), (2, 5), (4, 6), (6, 3), (4, 3)]
Return True if you can finish all courses considering the prerequisites, or False otherwise.
|
True
|
{"source_dataset":"course_schedule","source_index":99,"courses":[3,6,4,5,0,1,2],"prerequisites":[[0,5],[5,3],[1,3],[1,5],[5,4],[1,6],[0,3],[2,0],[2,5],[4,6],[6,3],[4,3]],"solution":true,"solvable":true,"difficulty":{"num_courses":[5,10],"num_prerequisites":[2,3],"cycle_length":[3,4]}}
|
{"min_num_courses":5,"max_num_courses":10,"min_num_prerequisites":2,"max_num_prerequisites":3,"min_cycle_length":3,"max_cycle_length":4,"p_solvable":0.6}
| 679,778,029
|
End of preview. Expand
in Data Studio
README.md exists but content is empty.
- Downloads last month
- 8