http://acm.hdu.edu.cn/showproblem.php?pid=1228
A + B
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 11878 Accepted Submission(s): 6935
Problem Description
读入两个小于100的正整数A和B,计算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
这个题以前写过一次,现在又写了一次,第一次写思路是把两个字母字符串(也就是加号两边的数字)放到两个字符串中,在函数里边把字符串转换成数字,所用的方法只判断到字符串的最后一位,没有用strcmp比较,很顺利就写出来了,但第二次用strcmp比较,开始怎么都不对,后来才发现是把字符串放到两个字符串是,后边没加'\0',这样就不是一个完整的字符串,用srtcmp与“zero”,“one”.........比较肯定不对,加上'0\'才AC。但在第一种方法中函数用两个不完整(也就是最后没有'0\')的字符串无影响,因为只判断到最后一位,不管后边。(以后注意)
下边贴代码
第一次写
#include<stdio.h>
#include<string.h>
int change(int n,char *N)//将所给英文转换成数字
{
int i,j,k,s,s_=0;
for(i=0,j=1;i!=n;i=k+2,j=j*10)//最多循环两次
{
if(N[i]=='z'&&N[i+1]=='e'&&N[i+2]=='r'&&N[i+3]=='o')
{
s=0;
k=i+3;
}
if(N[i]=='o'&&N[i+1]=='n'&&N[i+2]=='e')
{
s=1;
k=i+2;
}
if(N[i]=='t'&&N[i+1]=='w'&&N[i+2]=='o')
{
s=2;
k=i+2;
}
if(N[i]=='t'&&N[i+1]=='h'&&N[i+2]=='r'&&N[i+3]=='e'&&N[i+4]=='e')
{
s=3;
k=i+4;
}
if(N[i]=='f'&&N[i+1]=='o'&&N[i+2]=='u'&&N[i+3]=='r')
{
s=4;
k=i+3;
}
if(N[i]=='f'&&N[i+1]=='i'&&N[i+2]=='v'&&N[i+3]=='e')
{
s=5;
k=i+3;
}
if(N[i]=='s'&&N[i+1]=='i'&&N[i+2]=='x')
{
s=6;
k=i+2;
}
if(N[i]=='s'&&N[i+1]=='e'&&N[i+2]=='v'&&N[i+3]=='e'&&N[i+4]=='n')
{
s=7;
k=i+4;
}
if(N[i]=='e'&&N[i+1]=='i'&&N[i+2]=='g'&&N[i+3]=='h'&&N[i+4]=='t')
{
s=8;
k=i+4;
}
if(N[i]=='n'&&N[i+1]=='i'&&N[i+2]=='n'&&N[i+3]=='e')
{
s=9;
k=i+3;
}
s_=s+s_*j;
}
return s_;
}
int main()
{
char C[100],A[100],B[100];
int i,j,a,b,n1,n2;
while(gets(C)&&(C[0]!='z'||C[1]!='e'||C[2]!='r'||C[3]!='o'||C[7]!='z'||C[8]!='e'||C[9]!='r'||C[10]!='o'))
{
for(i=0;C[i]!='+';i++)
A[i]=C[i];
n1=i;
for(i=0,j=n1+2;C[j]!='=';i++,j++)
B[i]=C[j];
n2=i;
a=change(n1,A);
b=change(n2,B);
printf("%d\n",a+b);
}
return 0;
}
第二次写
#include<stdio.h>
#include<string.h>
int judge(char *s)
{
if(strcmp(s,"zero")==0)
return 0;
else if(strcmp(s,"one")==0)
return 1;
else if(strcmp(s,"two")==0)
return 2;
else if(strcmp(s,"three")==0)
return 3;
else if(strcmp(s,"four")==0)
return 4;
else if(strcmp(s,"five")==0)
return 5;
else if(strcmp(s,"six")==0)
return 6;
else if(strcmp(s,"seven")==0)
return 7;
else if(strcmp(s,"eight")==0)
return 8;
else if(strcmp(s,"nine")==0)
return 9;
}
int change(int n,char *s)
{
int i,j;
char s1[20],s2[20];
memset(s1,'\0',sizeof(s1));
memset(s2,'\0',sizeof(s2));
for(i=0,j=1;i<n;i++)
if(s[i]==' ')
{
j=2;
break;
}
if(j==1)
{
for(i=0;i<n;i++)
s1[i]=s[i];
return judge(s1);
}
else if(j==2)
{
for(i=0;s[i]!=' ';i++)
s1[i]=s[i];
for(j=0,i+=1;i<n;i++,j++)
s2[j]=s[i];
//printf("%s %s*******\n",s1,s2);
return judge(s1)*10+judge(s2);
}
}
int main()
{
int i,j,n,n_1,n_2;
char s_1[20],s_2[20],s[100];
while(gets(s))
{
n=strlen(s);
for(i=0;!(s[i]==' '&&s[i+1]=='+');i++)
s_1[i]=s[i];
s_1[i]='\0';
n_1=i;
for(j=0,i+=3;!(s[i]==' '&&s[i+1]=='=');i++,j++)
s_2[j]=s[i];
s_2[j]='\0';
n_2=j;
if(change(n_1,s_1)==0&&change(n_2,s_2)==0) break;
printf("%d\n",change(n_1,s_1)+change(n_2,s_2));
}
return 0;
}