摘要：
#include<stdio.h>int judge(int x){ int p[110],k,i,t,num; k=0; if(x<0) { x=-x; k=1; } num=1; while(x) { p[num++]=x%10; x=x/10; } t=0; for(i=1;i<num;i++) t=t*10+p[i]; if(k) return -t; else return t;}int main(){ int n,a,b,x,y,s1,s2; scanf("%d",&n); while(n--) { scanf("%d 阅读全文
摘要：
Problem DescriptionIgnatius likes to write words in reverse way. Given a single line of text which is written by Ignatius, you should reverse all the words and then output them.InputThe input contains several test cases. The first line of the input is a single integer T which is the number of test c 阅读全文