ACM 10926 Q10926: How Many Dependencies?
作法:BFS對每個點作一次BFS 把相連的串起來/************************************************************/#include<stdio.h>#include<stdlib.h>int map[101][101],maptop[101]={0};main(){ int n,m,a,b,c,p; while(scanf("%d",&n)&&n!=0) {&nb...
