hdoj 1228 A + B

A + B

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)

Total Submission(s): 12124    Accepted Submission(s): 7085

Problem Description

读入两个小于100的正整数A和B,计算A+B.
需要注意的是:A和B的每一位数字由对应的英文单词给出.

 

Input

测试输入包含若干测试用例,每个测试用例占一行,格式为"A + B =",相邻两字符串有一个空格间隔.当A和B同时为0时输入结束,相应的结果不要输出.

 

Output

对每个测试用例输出1行,即A+B的值.

 

Sample Input

  
  

   
   one + two =
three four + five six =
zero seven + eight nine =
zero + zero =
  
  

 

Sample Output

  
  

   
   3
90
96
  
  

代码：

#include <stdio.h>
#include <string.h>
#define M 10000
char s[M], a[M], b[M];
const char *di[10] = {"zero", "one", "two", "three", "four", "five", "six", "seven", "eight", "nine"};

int tran(char *p, int len){
    char temp[10];
    int sum = 0, c = 0, i, j;
    p[len] = ' ';  p[len+1] = '\0';
    for(i = 0, j = 0; i<=len+1; ++i){
        if(p[i]>='a'&&p[i]<='z'){
            temp[j++] = p[i];
        }
        else{
            temp[j] = '\0';
            for(int k = 0; k < 10; k ++){
                //puts(temp);
                if(strcmp(temp, di[k]) == 0){
                    sum = sum*10+k; break;
                }
            }
            j = 0;
            //i++;
        }
    }
    //printf("%d..", sum);
    return sum;
}
int main(){
    while(gets(s)){
        int len = strlen(s);
        int i, j, k;
        for(i = 0, j = 0; i<len&&s[i] != '+'; ++i){
            a[j++] = s[i];
        }
        a[j-1] = '\0';
        i+=2;
        for(j = 0; i < len&&s[i] != '='; ++i) b[j++] = s[i];
        b[j-1] = '\0';
        int la = strlen(a), lb = strlen(b);
        //printf("%d %d..", la, lb);
        int aa = tran(a, la), bb = tran(b, lb);
        if(aa == 0&&bb == 0) break;
        else{
            printf("%d\n", aa+bb);
        }
        //puts(a);
        //puts(b);
    }
    return 0;
}