河南理工大学新生挑战赛 C.Xor Path
河南理工大学新生挑战赛 C.Xor Path题目描述In graph theory, if an undirected gragh G(V, E) without cycle has n vertices, n − 1 edges and the graph is connected, then G(V, E) is called a tree.You are given a tree ha...
原创
2020-01-21 11:35:35 ·
2634 阅读 ·
0 评论