Reverse Text
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 5790 Accepted Submission(s): 3269
Problem Description
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.
Input
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.
Output
For each test case, print a line containing the characters of the input line in reverse order.
Sample Input
3
Frankly, I don’t think we’ll make much
money out of this scheme.
madam I’m adam
Sample Output
hcum ekam ll’ew kniht t’nod I ,ylknarF
.emehcs siht fo tuo yenom
mada m’I madam
1,字符串的翻转问题,该注意的地方是scanf与gets函数混用时必须注意对行尾回车符用getchar接收掉,否则gets函数会出问题,并注意getchar函数的位置
#include<iostream>
#include<cstring>
#include <stdio.h>
using namespace std;
int main()
{
int len,i,j,T;
char input[70] = "\0";
char change;
scanf("%d",&T);
getchar();
while(T--)
{
gets(input);
len = strlen(input) ;
i = 0; j = len - 1;
while(i < j)
{
change = input[i];
input[i] = input[j];
input[j] = change;
i++;
j--;
}
cout << input << endl;
}
return 0;
}