zoukankan      html  css  js  c++  java
  • HDUOJ----(4706)Children's Day

    Children's Day

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

    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
     
    Recommend
    liuyiding
    代码:
     1 #include<iostream>
     2 #include<cstdio>
     3 using namespace std;
     4 int main()
     5 {
     6 //printf("[pre]
    ");
     7 printf("a e
    bdf
    c g
    "); 
     8 printf("h  n
    i mo
    jl p
    k  q
    "); 
     9 printf("r   z
    s  ya
    t x b
    uw  c
    v   d
    "); 
    10 printf("e    o
    f   np
    g  m q
    h l  r
    ik   s
    j    t
    ") ;
    11 printf("u     g
    v    fh
    w   e i
    x  d  j
    y c   k
    zb    l
    a     m
    ");
    12 printf("n      b
    o     ac
    p    z d
    q   y  e
    r  x   f
    s w    g
    tv     h
    u      i
    ");
    13 printf("j       z
    k      ya
    l     x b
    m    w  c
    n   v   d
    o  u    e
    p t     f
    qs      g
    r       h
    ");
    14 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
    ");
    15 //printf("/[pre]
    ");
    16 return 0;
    17 }
    View Code
  • 相关阅读:
    [leetcode] Longest Palindromic Substring
    [leetcode] Add Two Numbers
    [leetcode] Longest Substring Without Repeating Characters
    [leetcode] Median of Two Sorted Arrays
    [leetcode] Two Sum
    poj 2718 Smallest Difference
    AOJ 0525 Osenbei
    poj3190 stall revertation
    poj1328Radar Installation
    poj 2376 Cleaning Shifts
  • 原文地址:https://www.cnblogs.com/gongxijun/p/3309048.html
Copyright © 2011-2022 走看看