hdoj 5326 Work

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=5326

     #include<stdio.h>
     #include<cstring>
     ;
     int n, k;
     int a[MAX][MAX];
     int b[MAX];
     void dfs(int i, int j){
         ; p < n; ++p){
             if( a[j][p] ){
                 b[i]++;
                 dfs(i,p);
             }
         }
     }
     int main(){
         freopen("1011.in", "r", stdin);
         freopen("a.out","w",stdout);
         int i, j;
         int A, B;
         int ans;
         ){
             ans = ;
             memset(a,,sizeof(a));
             memset(b,,sizeof(b));
             ; i <= n-; ++i){
                 scanf("%d%d",&A,&B);
                 a[A-][B-] = ;
             }
             ; i < n; ++i){
                 ; j < n; ++j){
                     if( a[i][j] ){
                         b[i]++;
                         dfs(i,j);
                     }
                 }
             }
             ; i < n; ++i){
 //                printf("%d\n",b[i]);
                 if( b[i] == k )
                     ans++;
             }
             printf("%d\n",ans);
         }
     }