首页 > ACM题库 > HDU-杭电 > HDU 1321 Reverse Text[解题报告] C++
2013
12-09

HDU 1321 Reverse Text[解题报告] C++

Reverse Text

问题描述 :

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

#include<stdio.h>
#include<string.h>
int main()
{
    char str[70];
    int n;
    scanf("%d",&n);
    getchar();//吸收回车
    while(n--)
    {
        int i;
        gets(str);
        for(i=strlen(str)-1;i>=0;i--)
            printf("%c",str[i]);
        printf("\n");
    }
    return 0;
}

解题报告转自:http://www.cnblogs.com/TheLaughingMan/archive/2013/05/16/3082735.html


  1. #!/usr/bin/env python
    def cou(n):
    arr =
    i = 1
    while(i<n):
    arr.append(arr[i-1]+selfcount(i))
    i+=1
    return arr[n-1]

    def selfcount(n):
    count = 0
    while(n):
    if n%10 == 1:
    count += 1
    n /= 10
    return count