POJ3697

/*
    Memory  Time
    7096K    2641MS
*/
 
#include <iostream>
#include <string>
 
using namespace std;
 
#define HASHLEN 1000117
#define DEMNUM  1000001
 
int hashTable[HASHLEN];
int factor = ;
 
int pcs[];
 
struct Node {
    int a;
    int b;
    int next;
};
Node dam_node[DEMNUM];
 
int myq[DEMNUM];
 
inline int is_demaged(int a, int b) {
 
    int idx = hashTable[(a * factor + b) % HASHLEN];
    while (idx > ) {
        if (dam_node[idx].a == a && dam_node[idx].b == b) {
            return ;
        }
        idx = dam_node[idx].next;
    }
    return ;
}
 
int main() {
    int case_i = ;
    int pc_num = , dam_num = , i, j, num, pca, pcb, head, tail, hVal, idx, flag;
    while(scanf("%d %d", &pc_num, &dam_num) && !(pc_num ==  && dam_num == )) {
 
        memset(hashTable, 0x00, sizeof(hashTable));
        memset(pcs, 0x00, sizeof(pcs));
        for (i = ; i <= dam_num; i++) {
            //input data
            scanf("%d %d", &pca, &pcb);
            if (pca < pcb) {
                dam_node[i].a = pca;
                dam_node[i].b = pcb;
                hVal = (pca * factor + pcb) % HASHLEN;
            } else {
                dam_node[i].a = pcb;
                dam_node[i].b = pca;
                hVal = (pcb * factor + pca) % HASHLEN;
            }
            dam_node[i].next = ;
 
            //create hash table
            idx = hashTable[hVal];
            if (idx > ) {
                dam_node[i].next = idx;
                hashTable[hVal] = i;
            } else {
                hashTable[hVal] = i;
            }
        }
 
        num = ;
        head = ;
        tail = ;
        for (i = ; i <= pc_num; i++) {
            if (!is_demaged(,i)) {
                myq[(tail++) % DEMNUM] = i;
                num++;
                pcs[i]=;
            }
        }
        while(head!=tail) {
            int v = myq[(head++) % DEMNUM];
            for (j = ; j <= pc_num; j++) {
                if (pcs[j]== || v == j) continue;
                if (v < j) {
                    flag = is_demaged(v,j);
                } else {
                    flag = is_demaged(j,v);
                }
                if (!flag) {
                    pcs[j]=;
                    myq[(tail++) % DEMNUM] = j;
                    num++;
                }
            }
        }
        printf("Case %d: %d\n", ++case_i, num);
    }
}