HDU 1266 Reverse Number

HDU 1266 Reverse Number
 Reverse NumberTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission (s): 5738 Accepted Submission (s): 2632


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, cannot 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 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

312-121200

Sample Output

21-212100

Author lcy
Source HDU 2006-4 Programming Contest
The error occurs four times... I forgot the leading 0 .. -00000000000000 output 0 00000000000 output 0 this simulation of my code is cumbersome, in fact, it can be very simple ..

# Include
 
  
# Include
  
   
# Include
   # Include
    
     
# Include
     
      
# Include
      
        # Include
       
         # Include
        
          # Include
         
           # Include using namespace std; # define inf 0x6f6f6f6f # define mod 10int flag; void Reverse (_ int64 a [] ,__ int64 n ,__ int64 B []) {int flag1 = 0; if (flag) printf ("-"); int I, l, l1, j, p; p = l = 0; l1 ++; while (n) {if (n % 10! = 0 | flag1 = 1) {a [l ++] = n % 10; flag1 = 1 ;} else if (n % 10 = 0 & flag1 = 0) B [p ++] = 0; n/= 10;} if (p> 0) {for (I = 0, j = 0; I
          
            > T; while (t --) {int flag2 = 0; memset (a, 0, sizeof (a); int p = 0; flag = 0; scanf ("% I64d", & n); if (n <0) n =-n, flag = 1; int o = n; if (o = 0) // WA is missing for four times .. {Printf ("0 \ n"); continue;} memset (a, 0, sizeof (a); memset (B, 0, sizeof (B )); reverse (a, n, B);} return 0 ;}