zoukankan      html  css  js  c++  java
  • HDU3257 Hello World!

    Hello World!

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


    Problem Description
    Your task is to print ... er ... "Hello World" ... in a fantastic way -- using a beautiful font.

    I've sent you a nice font for you to use, but I'm too busy to tell you how. Can you help yourself?
     

    Input
    The first line contains a single integer T (T <= 20), the number of test cases.
    Each case begins with an integer C (1 <= C <= 80) in a single line, then each of the following C lines contains five two-digit numbers in hex (letters will be in uppercase). Don't ask me what they mean, I'm too busy...
     

    Output
    For each test case, print the case number in the first line, then followed by a blank line.
    After that, print all T characters. Use a single blank column of spaces between two consecutive characters. Each line should have exactly 6C-1 character (again, don't ask me why).
    Don't forget to print another blank line after the output of each test case.
     

    Sample Input
    2 11 7F 08 08 08 7F 38 54 54 54 18 00 41 7F 40 00 00 41 7F 40 00 38 44 44 44 38 00 00 00 00 00 3F 40 38 40 3F 38 44 44 44 38 7C 08 04 04 08 00 41 7F 40 00 38 44 44 48 7F 5 14 08 3E 08 14 04 02 01 02 04 40 40 40 40 40 04 02 01 02 04 14 08 3E 08 14
     

    Sample Output
    Case 1: # # ## ## # # ## # # # # # # # # # # # ### # # ### # # ### # ## # ## # ##### # # # # # # # # # # # ## # # # ## # # ##### # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # ### ### ### ### # # ### # ### #### Case 2: # # # # # # # # # # # # # # # # # # ### ### # # # # # # # # #####
     

    Source

    题意:前面基本上都是废话,主要是让你自己看输入输出找规律。

    题解:坑人的地方是这题输出的时候事实上是7行,而不是8行!!!因此PE了N次!


    #include <stdio.h>
    #define maxn 482
    
    char map[8][maxn];
    bool isPrint[8];
    
    void getIsPrint(int n)
    {
        for(int i = 0; i < 7; ++i){
            isPrint[i] = n & 1;
            n >>= 1;
        }
    }
    
    int main()
    {
        //freopen("stdout.txt", "w", stdout);
        int t, n, arr[5], i, j, id, k, cas = 1;
        scanf("%d", &t);
        while(t--){
            scanf("%d", &n);
            for(i = id = 0; i < n; ++i){
                for(j = 0; j < 5; ++j, ++id){
                    scanf("%X", arr + j);
                    getIsPrint(arr[j]);
                    for(k = 0; k < 7; ++k)
                        if(isPrint[k]) map[k][id] = '#';
                        else map[k][id] = ' ';
                }
                if(i != n - 1){
                    for(k = 0; k < 7; ++k)
                        map[k][id] = ' ';
                    ++id;
                }
            }
            printf("Case %d:
    
    ", cas++);
            for(k = 0; k < 7; ++k){
                map[k][id] = '';
                printf("%s
    ", map[k]);
            }
            printf("
    ");
        }
        return 0;
    }
    


  • 相关阅读:
    WeX5开发指南
    移动web app开发框架
    [转]10款 Web 开发常备工具
    为兴趣求职:如何学习UI框架,请将你的看法观点写在评论下面
    10 个顶尖的 Linux 开源人工智能工具
    【转】编写Chrome扩展程序
    HDOJ 4455 Substrings 递推+树状数组
    iOS开发人员:事实上你还有非常多东西须要学
    鸡肋的JdbcRDD
    OFbiz实体引擎
  • 原文地址:https://www.cnblogs.com/mfrbuaa/p/3927773.html
Copyright © 2011-2022 走看看