HDU1266 Reverse Number

问题链接:HDU1266 Reverse Number。基础训练级的题,用C语言编写。

简单的问题,就不说了。

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;
}
时间: 2024-10-13 20:50:21

HDU1266 Reverse Number的相关文章

HDU-1266 Reverse Number

题目链接:点我点我点我 其实这题没啥难度,简单的字符串处理,开学考java练练手而已 只需要注意0 负数 还有 末尾有0的数字就好 另外,书写风格还是太差了. 代码如下: import java.util.Arrays; import java.util.Scanner; public class Main { public static void main(String args[]) { Scanner in = new Scanner(System.in); int n = in.next

HUST 1343 Reverse Number(哈理工 亚洲区选拔赛前练习赛)

G - Reverse Number Time Limit:1000MS    Memory Limit:131072KB    64bit IO Format:%lld & %llu SubmitStatusPracticeHUST 1347 Description Given a non-negative integer sequence A with length N, you can exchange two adjacent numbers each time. After K exc

hust 1347 - Reverse Number

题目描述 Given a non-negative integer sequence A with length N, you can exchange two adjacent numbers each time. After K exchanging operations, what’s the minimum reverse number the sequence can achieve? The reverse number of a sequence is the number of

HDU 1266 Reverse Number(字符串逆转 水题)

题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1266 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 proble

杭电 HDU 1266 Reverse Number

Reverse Number Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 5763    Accepted Submission(s): 2643 Problem Description Welcome to 2006'4 computer college programming contest! Specially, I give

LeetCode #Reverse Number#

刚背了单词,然后做个题玩玩-挑个软柿子踩踩-哈哈 很简单的思路.不过好玩的是我忘记检查处理完的数据是否符合整形数据返回了.因而好一会儿不能AC. 感谢 @Fantasy. 很快的指出我没有检查返回数据的范围. 先给出我超丑陋的解(python), 而后给出其他高手给出的很优雅的解!!也是用python 最后会给出利用java和C/C++的解. """ Programmer : EOF Date : 2015.03.31 File : reverse_interger.py &

reverse number

class Solution {public: int reverse(int x) { bool negative_flag=false; if(x==INT_MIN) return 0; if(x<0) { x=-x; negative_flag=true; } long long result=0; while(x!=0) { result=result*10+x%10; x=x/10; } if(result>INT_MAX) return 0; if(negative_flag) r

(HDU)1266 -- Reverse Number(反向数)

题目链接:http://bak.vjudge.net/problem/HDU-1266 这题要注意前导0和后导0了,用字符串处理找出需要倒序的位置,这题读入字符串忘了getchar(),调试了半天. 另外要注意的是字符串数组下标是从0开始的,最后有一个回车符.而strlen计算字符串长度遇到回车符停止,长度不包括回车符. 举例 :我往s字符串读入hello. s[0]=h s[1]=e s[2]=l s[3=l]  s[4]=o s[5]=\0 strlen(s)返回的是5 . 1 #inclu

Palindrome Number &amp;&amp; Reverse Number

Problem I: 判断数字是不是回文字符串形式 Determine whether an integer is a palindrome. Do this without extra space. click to show spoilers. Some hints: Could negative integers be palindromes? (ie, -1) If you are thinking of converting the integer to string, note th