题目来源:http://ac.jobdu.com/problem.php?pid=1432
-
题目描述:
-
把一个个大小差一圈的筐叠上去,使得从上往下看时,边筐花色交错。这个工作现在要让计算机来完成,得看你的了。
-
输入:
-
输入是一个个的三元组,分别是,外筐尺寸n(n为满足0<n<80的奇整数),中心花色字符,外筐花色字符,后二者都为ASCII可见字符;
-
输出:
-
输出叠在一起的筐图案,中心花色与外筐花色字符从内层起交错相叠,多筐相叠时,最外筐的角总是被打磨掉。叠筐与叠筐之间应有一行间隔。
-
样例输入:
-
11 B A 5 @ W
-
样例输出:
-
AAAAAAAAA ABBBBBBBBBA ABAAAAAAABA ABABBBBBABA ABABAAABABA ABABABABABA ABABAAABABA ABABBBBBABA ABAAAAAAABA ABBBBBBBBBA AAAAAAAAA @@@ @WWW@ @W@W@ @WWW@ @@@
#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
const int MAXN = 81;
void Print_Folding(int n, char a, char b)
{
int i, j, k, iCirNum = 0;
char c;
char Graph[MAXN][MAXN];
memset(Graph, 0, sizeof(Graph));
for(k = (n >> 1); k >= 0; --k)
{
if(iCirNum & 1)
c = b;
else
c = a;
iCirNum++;
for(i = k, j = i; j < n-i; ++j)
{
Graph[i][j] = Graph[j][i] = c;
Graph[n-1-i][j] = Graph[j][n-1-i] = c;
}
}
Graph[n-1][0] = Graph[n-1][n-1] = Graph[0][0] = Graph[0][n-1] = ' ';
for(i = 0; i < n; ++i)
printf("%s\n", Graph[i]);
}
int main()
{
int n, kCase = 0;
char a, b;
while(~scanf("%d %c %c", &n, &a, &b))
{
getchar();
if(kCase != 0)
printf("\n");
else kCase++;
if(n == 1)
{
printf("%c\n", a);
continue ;
}
Print_Folding(n, a, b);
}
return 0;
}