t3题解

using namespace std;
typedef long long ll;
const int MAXN=100010;
int a[MAXN],n,cnt,m;
int (){
    cin>>n>>m;
    for(int i=1;i<=m;i++){
        int x,y;
        cin>>x>>y;
        a[x]++;
        a[y]++;
    }
    for(int i=1;i<=n;i++){
        if(a[i]%2==1) cnt++;
    }
    if(cnt==0||cnt==2) cout<<"fuckccf";
    else {cout<<"ccf_is_a_shit"<<endl;
    cout<<(cnt-2)/2;}
    return 0;
}