Reverse Number

最新推荐文章于 2023-11-22 23:39:03 发布

原创最新推荐文章于 2023-11-22 23:39:03 发布 · 538 阅读

0 ·

CC 4.0 BY-SA版权

ACM 专栏收录该内容

95 篇文章

订阅专栏

本文介绍了一种用于求解整数逆序数的算法，并通过示例解释了逆序数的概念及其特殊情况。输入包含多个测试用例，对于每个测试用例，程序输出对应的逆序数。文中提供了一个实现该功能的C++代码示例。

http://acm.hdu.edu.cn/showproblem.php?pid=1266

Reverse Number

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

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

Sample Output

Author

lcy

#include <cstdio>
#include <cstring>
void rev(char *ch1,char *ch2)
{
    while(*ch2=='0')ch2--;
    while(ch1<=ch2){
        char ch=*ch1;
        *ch1=*ch2;
        *ch2=ch;
        ch1++;
        ch2--;
    }
    return;
}
int main()
{
    int t;
    char ch[11];
    scanf("%d",&t);
    while (t--){
        scanf("%s",ch);
        int len=strlen(ch);
        if(ch[0]=='-')rev(ch+1,ch+len-1);
        else rev(ch,ch+len-1);
        printf("%s\n",ch);
    }
    return 0;
}