POJ2121题解（有借鉴）

最新推荐文章于 2021-04-05 00:23:00 发布

豆腐约束值

最新推荐文章于 2021-04-05 00:23:00 发布

阅读量494

点赞数

本文链接：https://blog.csdn.net/Transquilizer/article/details/110245974

版权

该博客详细介绍了如何解决POJ2121编程问题，涉及将英语数字转化为整数的算法。内容包括处理负数、零以及从一到亿的英文数字单词，特别指出输入处理中的常见错误和注意事项，如 cin 不会读取换行符，以及使用临时变量处理million和thousand的情况。

摘要由CSDN通过智能技术生成

POJ2121
Description

In this problem, you will be given one or more integers in English. Your task is to translate these numbers into their integer representation. The numbers can range from negative 999,999,999 to positive 999,999,999. The following is an exhaustive list of English words that your program must account for:
negative, zero, one, two, three, four, five, six, seven, eight, nine, ten, eleven, twelve, thirteen, fourteen, fifteen, sixteen, seventeen, eighteen, nineteen, twenty, thirty, forty, fifty, sixty, seventy, eighty, ninety, hundred, thousand, million

#include<iostream>
#include<string>
using namespace std;
string s[]={
   "negative", "zero", "one", "two", 
"three", "four", "five", "six", "seven", "eight", 
"nine", "ten", "eleven", "twelve", "thirteen", "fourteen", 
"fifteen", "sixteen", "seventeen", "eighteen",