HDU - 2074
2017-04-17 22:38
453 查看
需要的时候,就把一个个大小差一圈的筐叠上去,使得从上往下看时,边筐花色交错。这个工作现在要让计算机来完成,得看你的了。
Input
输入是一个个的三元组,分别是,外筐尺寸n(n为满足0<n<80的奇整数),中心花色字符,外筐花色字符,后二者都为ASCII可见字符;
Output
输出叠在一起的筐图案,中心花色与外筐花色字符从内层起交错相叠,多筐相叠时,最外筐的角总是被打磨掉。叠筐与叠筐之间应有一行间隔。
Sample Input
11 B A
5 @ W
Sample Output
AAAAAAAAA
ABBBBBBBBBA
ABAAAAAAABA
ABABBBBBABA
ABABAAABABA
ABABABABABA
ABABAAABABA
ABABBBBBABA
ABAAAAAAABA
ABBBBBBBBBA
AAAAAAAAA
@@@
@WWW@
@W@W@
@WWW@
@@@
注意格式,注意一个的时候特殊讨论下。#include <cstdio>
#include <iostream>
#include <algorithm>
#include <queue>
#include <cstring>
using namespace std;
int main()
{
int n;
char ch1, ch2;
int kase = 0;
while( cin >> n >> ch1 >> ch2)
{
if(kase++ > 0)
cout << endl;
if(n == 1)
cout << ch1 <<endl;
else
{
if(n / 2 % 2 == 0)
{
swap(ch1, ch2);
}
for(int i = 1; i <= n / 2 ; i++)
{
if(i == 1)
{
for(int j = 1; j <= n; j++)
{
if(j == 1 || j == n)
cout << " ";
else
cout << ch2;
}
cout << endl;
continue;
}
for(int j = 1; j <= n / 2; j++)
{
if( j <= i && j % 2 == 1)
cout << ch2;
else if(j <= i && j % 2 == 0)
cout << ch1;
if(j > i && i % 2 == 0)
cout << ch1;
if( j > i && i % 2 == 1)
cout << ch2;
}
for(int j = n / 2 + 1; j <= n; j++)
{
if(j > n - i && j % 2 == 1)
cout << ch2;
else if( j > n - i && j % 2 == 0)
cout << ch1;
if(j <= n - i && i % 2 == 1)
cout << ch2;
if(j <= n - i && i % 2 == 0)
cout << ch1;
}
cout << endl;
}
for(int i = n / 2 + 1; i >= 1 ; i--)
{
if(i == 1)
{
for(int j = 1; j <= n; j++)
{
if(j == 1 || j == n)
cout << " ";
else
cout << ch2;
}
cout << endl;
continue;
}
for(int j = 1; j <= n / 2; j++)
{
if( j <= i && j % 2 == 1)
cout << ch2;
else if(j <= i && j % 2 == 0)
cout << ch1;
if(j > i && i % 2 == 0)
cout << ch1;
if( j > i && i % 2 == 1)
cout << ch2;
}
for(int j = n / 2 + 1; j <= n; j++)
{
if(j > n - i && j % 2 == 1)
cout << ch2;
else if( j > n - i && j % 2 == 0)
cout << ch1;
if(j <= n - i && i % 2 == 1)
cout << ch2;
if(j <= n - i && i % 2 == 0)
cout << ch1;
}
cout << endl;
}
}
}
return 0;
}
Input
输入是一个个的三元组,分别是,外筐尺寸n(n为满足0<n<80的奇整数),中心花色字符,外筐花色字符,后二者都为ASCII可见字符;
Output
输出叠在一起的筐图案,中心花色与外筐花色字符从内层起交错相叠,多筐相叠时,最外筐的角总是被打磨掉。叠筐与叠筐之间应有一行间隔。
Sample Input
11 B A
5 @ W
Sample Output
AAAAAAAAA
ABBBBBBBBBA
ABAAAAAAABA
ABABBBBBABA
ABABAAABABA
ABABABABABA
ABABAAABABA
ABABBBBBABA
ABAAAAAAABA
ABBBBBBBBBA
AAAAAAAAA
@@@
@WWW@
@W@W@
@WWW@
@@@
注意格式,注意一个的时候特殊讨论下。#include <cstdio>
#include <iostream>
#include <algorithm>
#include <queue>
#include <cstring>
using namespace std;
int main()
{
int n;
char ch1, ch2;
int kase = 0;
while( cin >> n >> ch1 >> ch2)
{
if(kase++ > 0)
cout << endl;
if(n == 1)
cout << ch1 <<endl;
else
{
if(n / 2 % 2 == 0)
{
swap(ch1, ch2);
}
for(int i = 1; i <= n / 2 ; i++)
{
if(i == 1)
{
for(int j = 1; j <= n; j++)
{
if(j == 1 || j == n)
cout << " ";
else
cout << ch2;
}
cout << endl;
continue;
}
for(int j = 1; j <= n / 2; j++)
{
if( j <= i && j % 2 == 1)
cout << ch2;
else if(j <= i && j % 2 == 0)
cout << ch1;
if(j > i && i % 2 == 0)
cout << ch1;
if( j > i && i % 2 == 1)
cout << ch2;
}
for(int j = n / 2 + 1; j <= n; j++)
{
if(j > n - i && j % 2 == 1)
cout << ch2;
else if( j > n - i && j % 2 == 0)
cout << ch1;
if(j <= n - i && i % 2 == 1)
cout << ch2;
if(j <= n - i && i % 2 == 0)
cout << ch1;
}
cout << endl;
}
for(int i = n / 2 + 1; i >= 1 ; i--)
{
if(i == 1)
{
for(int j = 1; j <= n; j++)
{
if(j == 1 || j == n)
cout << " ";
else
cout << ch2;
}
cout << endl;
continue;
}
for(int j = 1; j <= n / 2; j++)
{
if( j <= i && j % 2 == 1)
cout << ch2;
else if(j <= i && j % 2 == 0)
cout << ch1;
if(j > i && i % 2 == 0)
cout << ch1;
if( j > i && i % 2 == 1)
cout << ch2;
}
for(int j = n / 2 + 1; j <= n; j++)
{
if(j > n - i && j % 2 == 1)
cout << ch2;
else if( j > n - i && j % 2 == 0)
cout << ch1;
if(j <= n - i && i % 2 == 1)
cout << ch2;
if(j <= n - i && i % 2 == 0)
cout << ch1;
}
cout << endl;
}
}
}
return 0;
}
相关文章推荐
- hdu 4544 叛逆的小明 -- 数字反转 和 hdu 2074 叠筐(水题)
- HDU_2074叠筐
- hdu 2074 叠框
- HDU - 2074 叠筐(字符图案)
- HDU 2074 叠筐
- HDU 2074 叠筐
- hdu 2074 叠筐(数论)
- hdu 2074 叠筐
- hdu 2074 叠筐 好有意思的画图题
- hdu-oj 2074 叠筐
- hdu 2074 叠筐
- [恢]hdu 2074
- HDU 2074 叠筐
- hdu 杭电2074 叠筐
- HDU 2074 叠筐
- hdu 2074 堆放篮 好开心图纸标题
- hdu 2074 叠筐 好有意思的绘图题
- hdu 2074 输出图形
- hdu 2074
- HDU 2074 叠筐(基础字符串处理)