POJ 1300 Door Man（欧拉回路的判定）

 1 //POJ 1300
 2 #include <stdio.h>
 3 #include <string>
 4 #include <iostream>
 5 #include <string.h>
 6 
 7 using namespace std ;
 8 
 9 int M,N,door[20] ;
10 string sh ;
11 char sh1[789] ;
12 int main()
13 {
14     while(cin >> sh)
15     {
16         if(sh == "ENDOFINPUT")
17             break ;
18         cin >> M >> N ;
19         getchar() ;
20         int cnt = 0 ;
21         memset(door,0,sizeof(door)) ;
22         for(int i = 0 ; i < N ; i++)
23         {
24             gets(sh1) ;
25             int len = strlen(sh1) ;
26             for(int j = 0 ; j < len ; j++)
27             {
28                 if(sh1[j] != ‘ ‘)
29                 {
30                     int d = sh1[j]-‘0‘ ;
31                     cnt ++ ;
32                     door[i] ++ ;
33                     door[d] ++ ;
34                 }
35             }
36         }
37         cin >> sh ;
38         int odd = 0 ,even = 0 ;
39         for(int i = 0 ; i < N ; i++)
40         {
41             if(door[i] % 2) odd ++ ;
42             else even ++ ;
43         }
44         if(odd == 0 && M == 0)
45             cout<< "YES "<< cnt <<endl ;
46         else if(odd == 2 && M != 0)
47             cout << "YES "<<cnt <<endl ;
48         else cout<<"NO"<<endl ;
49     }
50     return 0 ;
51 }