hdu 4706 Children's Day

Children's Day

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 163 Accepted Submission(s): 76

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.

#include
#include
#include
#include
using namespace std;
#define N 12
char a[N][N],ch='a'-1;
char getChar(){
    ++ch;
    if(ch>'z')ch-=26;
    return ch;
}
void output(int n){
    int i,j;
    for(i=0;i0;i--)a[i][n-i-1]=getChar();
    for(i=0;i