HDU4706 Children's Day【水题】

 

Children's Day

 

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

 

 

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.

 

 

Source

2013 ACM/ICPC Asia Regional Online —— Warmup

 

 

 

 

问题链接：HDU4706 Children's Day。

问题分析：看似简单的题，只是打印字符图案，做起来没有那么轻松。

程序说明：直接用若干printf()函数语句也是可以实现的，那就毫无技术含量了。

题记：

  程序员的工作就是寻找共性，编写通用的程序，以便做到一劳永逸。这需要付出相当的辛苦的。

 

AC通过的C语言程序如下：

 

/* HDU4706 Children's Day */

#include <stdio.h>
#include <memory.h>

#define MAXN 10

char grid[MAXN][MAXN+1];
int c;

char getalphabet(int c)
{
    if(c > 'z') {
        c -= 'a';
        c %= 26;
        c +='a';
    }

    return c;
}

void print_n(int n)
{
    int i;

    memset(grid, ' ', sizeof(grid));

    for(i=0; i<n; i++)
        grid[i][n] = '\0';

    for(i=0; i<n; i++) {
        grid[i][0] = getalphabet(c + i);
        grid[i][n-1] = getalphabet(c + 2*n - 2 + i);
    }

    for(i=1; i<n-1; i++)
        grid[i][n-1-i] = getalphabet(c + 2*n -2 - i);

    for(i=0; i<n; i++)
        printf("%s\n", grid[i]);
}

int main(void)
{
    int i;

    c = 'a';
    for(i=3; i<=10; i++) {
        print_n(i);
        c += 3 * i - 2;
    }
    return 0;
}