UVa 280 Vertex ( dfs搜索 水题 ）

有向图搜索，水题

代码：

#include <cstdio>
#include <cstring>

const int N = 110;
int n, g[N][N], vn;
bool vis[N];

void dfs( int x ) {
    for ( int i = 1; i <= n; ++i ) 
        if ( !vis[i] && g[x][i] ) {
            vis[i] = true;
            vn--;
            dfs(i);
        }
}
int main()
{
    while ( scanf("%d", &n) != EOF && n ) {
        int i, j, num;
        memset( g, 0, sizeof(g) );
        while ( scanf("%d", &i), i ) 
            while ( scanf("%d", &j) , j ) g[i][j] = 1;
        scanf("%d", &num);
        while ( num-- ) {
            int st;
            vn = n;
            scanf("%d", &st);
            memset( vis, 0, sizeof(vis) );
            dfs( st );
            printf("%d", vn);
            for ( int i = 1; i <= n; ++i ) if ( !vis[i] ) printf(" %d", i);
            printf("\n");
        }
    }
}