HDU4706:Children's Day

Problem Description

Today is Children's Day. Some children ask you to output a big letter 'N'. 'N' is constituted by two vertical linesand one diagonal. Each pixel of this letter is a character orderly. No tail blank is allowed.
For example, this is a big 'N' start with 'a' and it's size is 3.

a e
bdf
c g

Your task is to write different 'N' from size 3 to size 10. The pixel character used is from 'a' to 'z' continuously and periodic('a' is reused after 'z').

 

Input

This problem has no input.

 

Output

Output different 'N' from size 3 to size 10. There is no blank line among output.

 

Sample Output

[pre] a e bdf c g h n i mo jl p k q ......... r j [/pre]

Hint

Not all the resultsare listed in the sample. There are just some lines. The ellipsis expresseswhat you should write.

 

 

题意：输出由26个字母组成的长度3~10的N

什么叫暴力？

于是我的代码告诉了你

什么叫暴力

#include <stdio.h>
#include <string.h>
#include <algorithm>
using namespace std;

int main()
{
    printf("a e
bdf
c g
");
    printf("h  n
i mo
jl p
k  q
");
    printf("r   z
s  ya
t x b
uw  c
v   d
");
    printf("e    o
f   np
g  m q
h l  r
ik   s
j    t
");
    printf("u     g
v    fh
w   e i
x  d  j
y c   k
zb    l
a     m
");
    printf("n      b
o     ac
p    z d
q   y  e
r  x   f
s w    g
tv     h
u      i
");
    printf("j       z
k      ya
l     x b
m    w  c
n   v   d
o  u    e
p t     f
qs      g
r       h
");
    printf("i        a
j       zb
k      y c
l     x  d
m    w   e
n   v    f
o  u     g
p t      h
qs       i
r        j
");

    return 0;
}