HDU 1228（简单的字符处理）

最新推荐文章于 2020-02-27 08:59:26 发布

守护生命的绿荷

最新推荐文章于 2020-02-27 08:59:26 发布

阅读量305

点赞数

分类专栏： ACM 数学文章标签： HDU

本文链接：https://blog.csdn.net/u013929990/article/details/40510029

版权

ACM 同时被 2 个专栏收录

71 篇文章 0 订阅

订阅专栏

数学

21 篇文章 0 订阅

订阅专栏

A + B

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 12190 Accepted Submission(s): 7130

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 <cstdio>
#include <cstring>
using namespace std;
int main()
{
	char s[100];
	while(scanf("%s",s)!=EOF) 
	{
		int k=0;
		int num1;
		if(strcmp(s,"zero")==0)
			k=k*10+0;
			if(strcmp(s,"one")==0)
			k=k*10+1;
			if(strcmp(s,"two")==0)
			k=k*10+2;
			if(strcmp(s,"three")==0)
			k=k*10+3;
			if(strcmp(s,"four")==0)
			k=k*10+4;
			if(strcmp(s,"five")==0)
			k=k*10+5;
			if(strcmp(s,"six")==0)
			k=k*10+6;
			if(strcmp(s,"seven")==0)
			k=k*10+7;
			if(strcmp(s,"eight")==0)
			k=k*10+8;
			if(strcmp(s,"nine")==0)
			k=k*10+9;
	   while(scanf("%s",s)&&strcmp(s,"=")!=0)
		{
			if(strcmp(s,"zero")==0)
			k=k*10+0;
			if(strcmp(s,"one")==0)
			k=k*10+1;
			if(strcmp(s,"two")==0)
			k=k*10+2;
			if(strcmp(s,"three")==0)
			k=k*10+3;
			if(strcmp(s,"four")==0)
			k=k*10+4;
			if(strcmp(s,"five")==0)
			k=k*10+5;
			if(strcmp(s,"six")==0)
			k=k*10+6;
			if(strcmp(s,"seven")==0)
			k=k*10+7;
			if(strcmp(s,"eight")==0)
			k=k*10+8;
			if(strcmp(s,"nine")==0)
			k=k*10+9;
			if(strcmp(s,"+")==0)
			{ 
			  num1=k;
			  k=0; 
			} 
		}
		if((num1+k)==0)
		break;
		else
		printf("%d\n",num1+k);
	} 
	return 0;
}