func_code_string: #include <bits/stdc++.h>   using namespace std;   vector<int> e[111];   int used[111], cnt, cnt2;   void dfs(int x) {     used[x] = 1;     cnt += e[x].size();     cnt2++;     for (int i = 0; i < e[x].size(); i++)       if (used[e[x][i]] == 0) dfs(e[x][i]);   }   int main() {     int i, j, k, n, m, stop = 0;     scanf( %d%d , &n, &m);     for (i = 0; i < m; i++) {       int x, y;       scanf( %d%d , &x, &y);       e[x].push_back(y);       e[y].push_back(x);     }     for (i = 1; i <= n; i++) {       if (!used[i]) {         cnt = 0;         cnt2 = 0;         dfs(i);         if (cnt2 % 2 == 1 && cnt2 * 2 == cnt) {           stop++;         }       }     }     printf( %d n , stop + (n - stop) % 2);     return 0;   }   