#include int count = 0; dfs(int now_node, int* node, int nodenum,int root) { int check = 0; for (int i = 0; i =0&&now_node!=root&& count++; } int main() { int node[50]; int nodenum,ignore_node; int root=100; scanf("%d", &nodenum); for (int i = 0; i < nodenum; i+..