A + B
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 13582 Accepted Submission(s): 8032
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
Source
map,string的应用,废话不多,见代码。
代码:
#include <cstdio>
#include <string>
#include <map>
#include <iostream>
using namespace std;
int main()
{
map<string, int> M;
M["ze"] = 0; //单词对应到数字,这里只取前个字符
M["on"] = 1;
M["tw"] = 2;
M["th"] = 3;
M["fo"] = 4;
M["fi"] = 5;
M["si"] = 6;
M["se"] = 7;
M["ei"] = 8;
M["ni"] = 9;
char ch[200];
while(1)
{
gets(ch);
int s1 = 0, s2 = 0, ok = 1;
string str = ""; //保存每个单词的前两个字符
str += ch[0];
str += ch[1];
for(int i = 0; ch[i]; i++)
{
if(ch[i] == '+') //遇到加号,后面的为s2的值
{
ok = 0;
str = "";
str += ch[i + 2];
str += ch[i + 3];
continue;
}
if(ch[i] != ' ' && ch[i + 1] == ' ') //这个单词结束了,将他的值累加起来
{
if(ok) s1 = 10 * s1 + M[str];
else s2 = 10 * s2 + M[str];
str = "";
str += ch[i + 2];
str += ch[i + 3];
}
}
if(s1 + s2 == 0) break;
printf("%d\n", s1 + s2);
}
return 0;
}