text reverse

Ignatius 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.
Input
The input contains several test cases. The first line of the input is a single integer T which is the number of test cases. T test cases follow.
Each test case contains a single line with several words. There will be at most 1000 characters in a line.
Output
For each test case, you should output the text which is processed.
Sample Input
3
olleh !dlrow
m’I morf .udh
I ekil .mca
Sample Output
hello world!
I’m from hdu.
I like acm.

#include<iostream>
#include<stdio.h>
#include<string.h>
#include<algorithm>
#define N 1000000
using namespace std;
char a[N];
int main() {
	int n,x,y,i,j;
	char m;
	while(scanf("%d",&n)!=EOF) {
		m=getchar();//此处消除回车
		//int left=0;
		for(i=0; i<n; i++) {
			gets(a);
			int left=0;
			for(j=0; j<=strlen(a); j++) {
				if(a[j]==' '||j==strlen(a)) {
					reverse(a+left,a+j);//倒置函数
					left=j+1;
				}
			}
			puts(a);
		}
	}
	return 0;
}