acm pku 3697 USTC campus network

Description

USTC campus network is a huge network. There is a bi-directional link between every pair of computers in the network. One of the computers is the BBS server, which is so popular that thousands of people log on it every day. Recently some links of the network are damaged by the rainstorm. The network administrator is going to check which computers are still connected with the BBS server directly or indirectly.

You are to help the administrator to report the number of computers still connecting with the BBS server (not including itself).

Input

The input consists of multiple test cases. Each test case starts with a line containing two integers N and M (1 ≤ N ≤ 10,000, 0 ≤ M ≤ 1,000,000), which are the number of computers and the number of damaged links in USTC campus network, respectively. The computers are numbered from 1 to N and computer 1 is the BBS server.
Each of the following M lines contains two integers A and B(1 ≤ A ≤ N, 1 ≤ B ≤ N, A ≠ B), which means the link between computer A and B is damaged. A link will appear at most once.

The last test case is followed by a line containing two zeros.

Output

For each test case, print a line containing the test case number( beginning with 1) followed by the number of computers still connecting with the BBS server.

Sample Input

3 2
1 2
1 3
4 3
1 2
3 2
4 2
0 0

Sample Output

Case 1: 0
Case 2: 2

很可惜内存超了，不知道怎么改进，要用什么算法？？？？？？

#include<iostream>
#include<stdio.h>
#include<queue>
#include<string>
using namespace std;
const int MAX=100;
int a[MAX][MAX];

int BigGraph(int n)//广度优先遍历
{
	int i,k,sum,set[MAX];
	memset(set,0,sizeof(set));
	queue<int> L;
	set[0]=1;sum=0;
	for(i=1;i<n;i++)
		if(a[0][i]!=0)
		{
			set[i]=1;//标记以被访问
			L.push(i);
			++sum;
		}
	while(!L.empty())
	{
		k=L.front();
		L.pop();
		for(i=1;i<n;i++)
		{
			if(a[k][i]!=0&&set[i]!=1)
			{
				++sum;
				L.push(i);
				set[i]=1;
			}
		}
	}
	return sum;
}

int main()
{
	int N,M,i,j,sum,A,B,flag=0;
	while(scanf("%d%d",&N,&M)&&(N!=0||M!=0))
	{
		for(i=0;i<N;i++)//初始化
			for(j=0;j<N;j++)
				if(i==j)
					a[i][j]=0;
				else
					a[i][j]=1;
		for(i=0;i<M;i++)
		{
			scanf("%d%d",&A,&B);
			a[B-1][A-1]=a[A-1][B-1]=0;
		}
/*	
		for(i=0;i<N;i++)
		{
			for(j=0;j<N;j++)
				cout<<a[i][j]<<"  ";		
			cout<<endl;
		}
*/
		sum=BigGraph(N);
		cout<<"Case "<<++flag<<": "<<sum<<endl;
	}
	return 0;
}