#include<stdio.h>
#define MAX 102
int flags[MAX+1][(MAX+1)*MAX/2]={0};
int main()
{
    int i,j,k;
    for(i =1;i<=MAX;i++)
	{
        flags[i][0] =i+1;
        for(j =1;j<i;j++)
		{
			for(k =0;k<=(i-j)*(i-j-1)/2;k++)                
			{
				if(flags[i][j*(i-j)+k]<flags[i-j][k]+(i-j+1)*j)
				   flags[i][j*(i-j)+k]=flags[i-j][k]+(i-j+1)*j;
			}
		}
    }
	k=1;
	while(scanf("%d %d",&i,&j)&&(i+j))
	{
		if(flags[i][j])
			printf("Case %d: %d lines with exactly %d crossings can cut the plane into %d pieces at most.\n",k,i,j,flags[i][j]);
		else printf("Case %d: %d lines cannot make exactly %d crossings.\n",k,i,j);
		k++;
    }
    return 0;
}

• 谁给点数据啊!!!! (7) bjtuacmer200701 2007-09-06 17:04:52