zoukankan      html  css  js  c++  java
  • HDU 3361 ASCII

    Time Limit: 2000/1000 MS (Java/Others)     Memory Limit: 65536/65536 K (Java/Others)
    Total Submission(s): 756    Accepted Submission(s): 382 

    Problem Description
    Since all we know the ASCII code, your job is simple: input numbers and output corresponding messages.
     
    Input
    The first line contains one integer T (1<=T<=1000).
    The input will contain T positive integers separated by whitespaces (spaces, newlines, TABs).
    The integers will be no less than 32.
     
    Output
    Output the corresponding message in just one line.
    Warning: no extra characters are allowed.
     
    SampleInput
    13
    72 101 108 108 111 44
    32 119 111 114 108 100 33
     
    SampleOutput
    Hello, world!


    注意不要无缘无故有空行呀,要不然会PE的=-=
     1 #include<cstdio>
     2 #include<iostream>
     3 using namespace std;
     4 
     5 char a[1005];
     6 
     7 int main()
     8 {
     9     int T,t;
    10     while(~scanf("%d",&T))
    11     {
    12         while(T--)
    13         {
    14             scanf("%d",&t);
    15             printf("%c",t);
    16          }
    17     }
    18     return 0;
    19 }
  • 相关阅读:
    Search Insert Position
    lintcode: 最长连续序列
    lintcode:颜色分类
    lintcode: 堆化
    lintcode: 旋转图像
    lintcode: 寻找旋转排序数组中的最小值
    lintcode: 跳跃游戏 II
    lintcode:最小差
    华为:数独填充
    华为:字符集合
  • 原文地址:https://www.cnblogs.com/Annetree/p/6288740.html
Copyright © 2011-2022 走看看