题目:
ASCII
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 4367 Accepted Submission(s): 2321
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.
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.
Warning: no extra characters are allowed.
Sample Input
13 72 101 108 108 111 44 32 119 111 114 108 100 33
Sample Output
Hello, world!
代码:
#include<iostream>
#include<cstring>
#include<cstdio>
#include<cstdlib>
#include<ctype.h> //tower()
#include<set>
#include<map>
#include<iomanip>// cout<<setprecision(1)<<fixed<<a;
#include<vector>
#include<cmath>
#include<algorithm>
#include<bitset>
#include<limits.h>
#include<stack>
#include<queue>
using namespace std;
const int maxn=1010;
const int INF=0x3f3f3f3f;
int n,t,a[maxn];
int main(){
while(~scanf("%d",&n)){
while(n--){
scanf("%d",&t);
printf("%c",t);
}
}
return 0;
}