题目:
1372 101 108 108 111 4432 119 111 114 108 100 33 Sample OutputHello, 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;}
新闻热点
疑难解答