UVA_1605: Building for UN

最新推荐文章于 2018-08-07 20:53:20 发布

epsilon1

最新推荐文章于 2018-08-07 20:53:20 发布

阅读量564

点赞数 1

分类专栏：算法文章标签： c++ uva

本文链接：https://blog.csdn.net/qq_20480611/article/details/49314307

版权

算法专栏收录该内容

141 篇文章 2 订阅

订阅专栏

Description

The United Nations has decided to build a new headquarters in Saint Petersburg, Russia. It will have a form of a rectangular parallelepiped and will consist of several rectangular floors, one on top of another. Each floor is a rectangular grid of the same dimensions, each cell of this grid is an office. Two offices are considered adjacent if they are located on the same floor and share a common wall, or if one's floor is the other's ceiling. The St. Petersburg building will host n national missions. Each country gets several offices that form a connected set. Moreover, modern political situation shows that countries might want to form secret coalitions. For that to be possible, each pair of countries must have at least one pair of adjacent offices, so that they can raise the wall or the ceiling they share to perform secret pair-wise negotiations just in case they need to. You are hired to design an appropriate building for the UN.

Input

Input consists of several datasets. Each of them has a single integer number n (1 $\le$ n $\le$ 50) -- the number of countries that are hosted in the building.

Output

On the first line of the output for each dataset write three integer numbers h , w , and l -- height, width and length of the building respectively. h descriptions of floors should follow. Each floor description consists of l lines with w characters on each line. Separate descriptions of adjacent floors with an empty line. Use capital and small Latin letters to denote offices of different countries. There should be at most 1 000 000 offices in the building. Each office should be occupied by a country. There should be exactly n different countries in the building. In this problem the required building design always exists. Print a blank line between test cases.

Sample Input

Sample Output

2 2 2 
AB 
CC 

zz 
zz

分析：注意到最多有50个国家，而方格子有1000000个，假设国家在分别在两成，第一成每i行为第i个国家，第二成每i列为第i个国家，这样正好每个国家都有交集，而且最多只用到了50×50×2=5000,远小于方格的限制。

#include <cstdio>

using namespace std;
const int maxn = 51;
char tables[maxn][maxn];

int main()
{
	for(int i=0; i<maxn; i++) {
		int t = i+'A';
		if(i>=26) t = i-26+'a';
		for(int j=0; j<maxn; j++) {
            tables[i][j] = t;
		}
	}

	int n, first = 1;
	while(~scanf("%d", &n)) {
		if(first) first = 0;
		else putchar('\n');
        printf("%d %d %d\n", 2, n, n);
        for(int i=0; i<n; i++) {
			for(int j=0; j<n; j++) {
                putchar(tables[i][j]);
			}
			putchar('\n');
        }
        putchar('\n');
        for(int i=0; i<n; i++) {
            for(int j=0; j<n; j++) {
				putchar(tables[j][i]);
            }
            putchar('\n');
        }
	}
    return 0;
}