#include <algorithm>
using namespace std;
bool num[1010];
int num1[110];
int main(){
	int m,n,k,count,j,s=0,count1;
	while(scanf("%d%d",&m,&n) &&(m+n))
	{
		s++;
		memset (num,false,sizeof(num));
		num[0]=true;
		for(int i=0;i<n;i++)
		{
			scanf("%d",&num1[i]);
			num[num1[i]]=true;	
		}
		sort(num1,num1+n);
		count1=0;
		for(i=0;i<n;i++)
		{
			count=0;
			k=num1[i];
			int k1=k+1;
			while(k1<=m*n)
			{
				if(num[k1]==false)
				{
					num[k1]=true;
					count++;
					count1++;
					break;
				}
				k1++;
			}
			j=0;	
			for(int p=0;p<=m*n;p++)
			{
				if(num[p]==false)
				{
					num[p]=true;
					j++;
				}
				if(j==m-1-count)
					break;
			}	
		}
		printf("Case %d: %d\n",s,n-count1);
	}
	return 0;
}

• Re:到底哪里错了啊 求高手帮忙看看 (10) huangp218 2008-04-15 21:38:54