Reverse Text

Reverse Text

时间： 1ms        内存：64M

描述：

In most languages, text is written from left to right. However, there are other languages where text is read and written from right to left. As a first step towards a program that automatically translates from a left-to-right language into a right-to-left language and back, you are to write a program that changes the direction of a given text.

输入：

The input contains several test cases. The first line contains an integer specifying the number of test cases. Each test case consists of a single line of text which contains at most 70 characters. However, the newline character at the end of each line is not considered to be part of the line.

输出：

For each test case, print a line containing the characters of the input line in reverse order.

示例输入：

3
Frankly, I don't think we'll make much
money out of this scheme.
madam I'm adam

示例输出：

hcum ekam ll'ew kniht t'nod I ,ylknarF
.emehcs siht fo tuo yenom
mada m'I madam

提示：

参考答案（内存最优[752]）：

#include"stdio.h"
#include"string.h"
int main()
{
    int i,j,n,m;
    char c[81],a;
    scanf("%d\n",&n);
    for(i=0;i<n;i++){
        gets(c);
        m=strlen(c);
        for(j=0;j<m/2;j++){
            a=c[j];
            c[j]=c[m-1-j];
            c[m-1-j]=a;
        }
        puts(c);
    }
    return 0;
}

参考答案（时间最优[0]）：

#include"stdio.h"
#include"string.h"
int main()
{
    int i,j,n,m;
    char c[81],a;
    scanf("%d\n",&n);
    for(i=0;i<n;i++){
        gets(c);
        m=strlen(c);
        for(j=0;j<m/2;j++){
            a=c[j];
            c[j]=c[m-1-j];
            c[m-1-j]=a;
        }
        puts(c);
    }
    return 0;
}

题目和答案均来自于互联网，仅供参考，如有问题请联系管理员修改或删除。