题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1266
3 12 -12 1200
21 -21 2100
代码如下:
#include <cstdio>
#include <cstring>
int main()
{
int t;
char s[117];
scanf("%d",&t);
while(t--)
{
scanf("%s",s);
int k = 0;
int len = strlen(s);
if(s[0] == '-')
printf("-");
int flag = 0;
for(int i = len-1; i >= 0; i--)
{
if(s[i]=='0'&&flag==0)
k++;
else if(s[i]=='-')
continue;
else
{
flag = 1;
printf("%c",s[i]);
}
}
for(int i = 0; i < k; i++)
printf("0");
printf("\n");
}
return 0;
}
HDU 1266 Reverse Number(字符串逆转 水题)
原文地址:http://blog.csdn.net/u012860063/article/details/39084235