请问如何生成一棵有根树，并以父->子的形式输出 #91

Open

opened

on Aug 22, 2021

就类似于这道题的形式输出树边。每行两个数 a,b 表示 a 是 b 的父亲。

to join this conversation on GitHub. Already have an account? Sign in to comment

Metadata

Assignees

No one assigned

Labels

No labels

No labels

Type

No type

Projects

No projects

Milestone

No milestone

Relationships

None yet

Development

No branches or pull requests