HDU1266 Reverse Number【水题】

Reverse Number

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 10477    Accepted Submission(s): 4659

Problem Description

Welcome to 2006'4 computer college programming contest!

Specially, I give my best regards to all freshmen! You are the future of HDU ACM! And now, I must tell you that ACM problems are always not so easy, but, except this one... Ha-Ha!

Give you an integer; your task is to output its reverse number. Here, reverse number is defined as follows:
1. The reverse number of a positive integer ending without 0 is general reverse, for example, reverse (12) = 21;
2. The reverse number of a negative integer is negative, for example, reverse (-12) = -21;
3. The reverse number of an integer ending with 0 is described as example, reverse (1200) = 2100.

 

Input

Input file contains multiple test cases. There is a positive integer n (n<100) in the first line, which means the number of test cases, and then n 32-bit integers follow.

 

Output

For each test case, you should output its reverse number, one case per line.

 

Sample Input

  
  

   
   3
12
-12
1200
  
  

 

Sample Output

  
  

   
   21
-21
2100
  
  

 

Author

lcy

 

Source

HDU 2006-4 Programming Contest

问题链接：HDU1266 Reverse Number。

问题简述：（略）

问题分析：（略）

程序说明：（略）

AC通过的C语言程序如下：

/* HDU1266 Reverse Number */

#include <stdio.h>
#include <string.h>

#define MAXN 16

int main(void)
{
    int t, start, end;
    char s[MAXN], c;

    scanf("%d", &t);
    while(t--) {
        scanf("%s", s);

        start = 0;
        end = strlen(s) - 1;
        if(s[start] == '-')
            start++;
        while(end >= 0 && s[end] == '0')
            end--;
        while(start < end) {
            c = s[start];
            s[start] = s[end];
            s[end] = c;

            start++;
            end--;
        }

        printf("%s\n", s);
    }

    return 0;
}