POJ - 1020：Anniversary Cake

Anniversary Cake

来源：POJ

标签：

参考资料：

相似题目：

题目

Nahid Khaleh decides to invite the kids of the “Shahr-e Ghashang” to her wedding anniversary. She wants to prepare a square-shaped chocolate cake with known size. She asks each invited person to determine the size of the piece of cake that he/she wants (which should also be square-shaped). She knows that Mr. Kavoosi would not bear any wasting of the cake. She wants to know whether she can make a square cake with that size that serves everybody exactly with the requested size, and without any waste.

输入

The first line of the input file contains a single integer t (1 ≤ t ≤ 10), the number of test cases, followed by input data for each test case. Each test case consist of a single line containing an integer s, the side of the cake, followed by an integer n (1 ≤ n ≤ 16), the number of cake pieces, followed by n integers (in the range 1…10) specifying the side of each piece.

输出

There should be one output line per test case containing one of the words KHOOOOB! or HUTUTU! depending on whether the cake can be cut into pieces of specified size without any waste or not.

输入样例

2
4 8 1 1 1 1 1 3 1 1
5 6 3 3 2 1 1 1

输出样例

KHOOOOB!
HUTUTU!

参考代码

#include
#include
#include
int col[45];
int sizeCnt[15];
int s,n;

int findMinCol()
{
	int minCol=s,minPos;
	for(int i=0;i<s;i++)
	{
		if(minCol>col[i])
		{
			minCol=col[i];
			minPos=i;
		}
	}
	return minPos;
}

bool dfs(int fillNum)
{
	if(fillNum==n)return true;
	
	int pos=findMinCol();

	for(int size=10;size>=1;size--)
	{
		if(sizeCnt[size]==0 || pos+size>s || col[pos]+size>s)continue;
		
		bool judge=true;
		for(int j=1;j<size;j++)
		{
			if(col[pos+j]!=col[pos])
				judge=false;
		}
		
		if(judge)
		{
			sizeCnt[size]--;
			for(int j=0;j<size;j++)
				col[pos+j]+=size;
				
			if(dfs(fillNum+1))return true;
			
			sizeCnt[size]++;
			for(int j=0;j<size;j++)
				col[pos+j]-=size;
		}
	}
	return false;
}

int main()
{
	int t;
	scanf("%d",&t);
	while(t--)
	{
		memset(col,0,sizeof(col));
		memset(sizeCnt,0,sizeof(sizeCnt));
		
		scanf("%d%d",&s,&n);
		int area=0,cnt=0; 
		for(int i=0;i<n;i++)
		{
			int size;
			scanf("%d",&size);
			sizeCnt[size]++;
			
			area+=size*size;
			if(size>s/2)cnt++;
		}
		if(cnt>1 || area!=s*s)printf("HUTUTU!\n");
		else
		{
			if(dfs(0))printf("KHOOOOB!\n");
			else printf("HUTUTU!\n");
		}
	}
	return 0;
}