HEU euler path

欧拉回路

#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;

const int N = 110;
int n, m, T;
int s, e;
int g[N][N];

int main()
{
    scanf("%d", &T);
    while ( T-- ) {
        scanf("%d%d", &n, &m);
        memset( g, 0, sizeof(g) );
        for ( int i = 0; i < m; ++i ) {
            scanf("%d%d", &s, &e);
            g[s][e]++;
            g[e][s]++;
        }
        bool ans = true;
        for ( int i = 1, num; i <= n && ans; ++i ) {
            num = 0;
            for ( int j = 1; j <= n; ++j ) num += g[i][j];
            if ( num % 2 ) {
                ans = false;
                break;
            }
        }
        if ( ans ) printf("yes\n");
        else printf("no\n");
    }
}