UVa 10928 - My Dear Neighbours

题目：求一个有向图中出度最少的节点。

分析：简单题、图论。统计每个节点度数，比较大小输出。

注意：有向图。

#include <stdio.h>#include <stdlib.h>#include <string.h>int edge[ 1005 ]; int main(){int T,P,M; while ( scanf("%d",&T) != EOF ) {getchar();for ( int t = 1 ; t <= T ; ++ t ) {scanf("%d",&P);getchar();memset( edge, 0, sizeof(edge) );int min = P;for ( int i = 1 ; i <= P ; ++ i ) {while ( 1 ) {scanf("%d",&M);edge[i] ++;char c = getchar();if ( c == '\n' ) break;}if ( min > edge[i] )min = edge[i];}int flag = 0;for ( int i = 1 ; i <= P ; ++ i ) if ( edge[i] == min ) {if ( !flag ) {flag = 1;printf("%d",i);}elseprintf(" %d",i);}printf("\n");}}return 0;}