九度 oj 题目1089：数字反转

http://ac.jobdu.com/problem.php?pid=1089

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

void reverse(char * a){ 
     int len = (int) strlen(a);   
     int i=0,j=len-1;
     while(i<j){ 
         std::swap(a[i],a[j]);   
         i++,j--;
     }  
}  


int main(){ 
    char sa[12],sb[12],sc[12];
    int i,c,c1,nCase;
    scanf("%d",&nCase); 
    while(nCase--){ 
        scanf("%s %s",sa,sb);
        c = atoi(sa) + atoi(sb); 
        reverse(sa); 
        reverse(sb); 
        c1 = atoi(sa) + atoi(sb);  
        i=0;
        while(c1!=0){ 
            sc[i++] = '0'+ c1%10; 
            c1/=10;
        }  
        sc[i] = '\0';
        if(c == atoi(sc)) 
           printf("%d\n",c);  
        else 
            printf("NO\n"); 
    }  
}