二分图着色

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <cstring>
#include <stack>
#include <cctype>
#include <queue>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <climits>
#define lson root<<1,l,mid
#define rson root<<1|1,mid+1,r
#define fi first
#define se second
#define ping(x,y) ((x-y)*(x-y))
#define mst(x,y) memset(x,y,sizeof(x))
#define mcp(x,y) memcpy(x,y,sizeof(y))
#define Min(x,y) (x<y?x:y)
#define Max(x,y) (x>y?x:y)
using namespace std;
#define gamma 0.5772156649015328606065120
#define MOD 1000000007
#define inf 0x3f3f3f3f
#define N 5005
#define maxn 10005
typedef long long LL;
typedef pair<int,int> PII;

int pic[200][200];
int vis[200],n,m;

inline void init(){
    mst(vis,-1);
    mst(pic,0);
}

int dfs(int x,int c){
    if(vis[x]!=-1&&vis[x]==c)return 0;
    vis[x]=c;
    for(int i=0;i<n;++i){
        if(pic[x][i]){
            if(vis[i]==-1)
                dfs(i,c^1);
            else if(vis[i]==c)return 0;
        }
    }
    return 1;
}

int main(){
    int i,j,group,Case=0,x,y;
    while(scanf("%d",&n)!=EOF&&n){
        scanf("%d",&m);
        init();
        if(n==0)break;
        while(m--){
            scanf("%d%d",&x,&y);
            pic[x][y]=pic[y][x]=1;
        }
        if(dfs(0,0))printf("BICOLORABLE.\n");
        else printf("NOT BICOLORABLE.\n");
    }
    return 0;
}