2437415_ac_0ms_48k.cpp

来自「北大大牛代码 1240道题的原代码 超级权威」· C++ 代码 · 共 47 行

#include <algorithm>
using namespace std;

int mark[1001], a[1001];
bool cmp(int a,int b)
{
	return a>b;
}

int main()
{
	int n, k, i, ans, cas = 1;
	int min, max, j, tmp;
	char name[81];

	while(scanf("%d%d",&n,&k)==2)
	{
		if(n==0&&k==0)
			break;
		printf("Case %d: ",cas++);
		for(i = 0; i < n; i++)
		{
			scanf("%s",name);
			a[i] = strlen(name);
		}
		memset(mark,0,sizeof(mark));
		sort(a,a+n,cmp);
		ans = 0;
		for(i = 0; i < n; i+=k)
		{
			tmp = 0;
			max = a[i]*k;
			min = (a[i]-2)*k;
			for(j = i; j < i+k; j++)
				tmp += a[j];
			if(tmp>max||tmp<min)
			{
				printf("no\n\n");
				goto con;
			}
		}
		printf("yes\n\n");
con:
		;
	}
	return 1;
}