Give Me the Number

  Numbers in English are written down in the following way (only numbers less than 109are considered). Number abc,def,ghi is written as "[abc] million [def] thousand [ghi]". Here "[xyz] " means the written down number xyz .

  In the written down number the part "[abc] million" is omitted if abc = 0 , "[def]thousand" is omitted if def = 0 , and "[ghi] " is omitted if ghi = 0 . If the whole number is equal to 0 it is written down as "zero". Note that words "million" and "thousand" are singular even if the number of millions or thousands respectively is greater than one.

  Numbers under one thousand are written down in the following way. The number xyz is written as "[x] hundred and [yz] ”. ( If yz = 0 it should be only “[x] hundred”. Otherwise if y = 0 it should be only “[x] hundred and [z]”.) Here "[x] hundred and" is omitted if x = 0 . Note that "hundred" is also always singular.

  Numbers under 20 are written down as "zero", "one", "two", "three", "four", "five", "six", "seven", "eight", "nine", "ten", "eleven", "twelve", "thirteen", "fourteen", "fifteen", "sixteen", "seventeen", "eighteen", and "nineteen" respectively. Numbers from 20 to 99 are written down in the following way. Number xy is written as "[x0][y] ", and numbers divisible by ten are written as "twenty", "thirty", "forty", "fifty", "sixty", "seventy", "eighty", and "ninety" respectively.

  For example, number 987,654,312 is written down as "nine hundred and eighty seven million six hundred and fifty four thousand three hundred and twelve", number 100,000,037 as "one hundred million thirty seven", number 1,000 as "one thousand". Note that "one" is never omitted for millions, thousands and hundreds.

  Give you the written down words of a number, please give out the original number.

Input

  Standard input will contain multiple test cases. The first line of the input is a single integer T (1 <= T <= 1900) which is the number of test cases. It will be followed by T consecutive test cases.

  Each test case contains only one line consisting of a sequence of English words representing a number.

Output

  For each line of the English words output the corresponding integer in a single line. You can assume that the integer is smaller than 109.

Sample Input

3
one
eleven
one hundred and two

Sample Output

1
11
102

解题思路:
  给出行数t,之后t行每行给出一个用英文描述的数字,要求输出这个数字。

  这里从头开始记录这个数字,每记录一个数字就将它加入答案,根据题目语法以百万"million",千"thousand"和百"hundred"这几个在英文中有特殊表示形式的单词为标值,每次遇到这些标值就将目前的答案乘以标志数,如果是"million"或"thousand"("hundred"不用)从0开始重新记录下一个标值前的数字,一直记录到字符串的最后一个单词。

样例分析:

nine hundred and eighty seven million six hundred and fifty four thousand three hundred and twelve

nine: 9 + 0 = 9

hundred: 9 * 100 = 900

eighty :80 + 900 = 980

and :0 + 980 = 980

seven :7 + 980 = 987

million :987  * 1000000 = 987000000  (遇到million重新从0开始记录)

six : 6 + 0 = 6

hundred : 6 * 100 = 600

and : 0 + 600 = 600

fifty : 50 + 600 = 650

four : 4 + 650 = 654

thousand : 654 * 1000 + 987000000 = 987654000  (遇到thousand重新从0开始记录)

three : 0 + 3 = 3

hundred : 3 * 100 = 300

and : 0 + 300 = 300;

twelve : 12 + 300 = 312;

987654000 + 312 = 987654312

  知道解法后就要思考怎样实现它,由于每一行为一个数字,输入时我们用一个getline之间获得一行存入string型的变量str中,用头文件sstream下的istringstream可以以空格为界读取str中的每个单词,将获取的每个单词计入string型变量temp中,并根据temp的内容进行操作,我们可以用map来建立每个(非"million","thousand","hundred")单词和其对应数字的关系。

AC代码

 #include<bits/stdc++.h>
using namespace std;
map<string, int> m;
string s1[] = {"zero","one","two","three","four","five","six","seven","eight","nine","ten","eleven","twelve","thirteen","fourteen","fifteen","sixteen","seventeen","eighteen","nineteen"};
string s2[] = {"twenty","thirty","forty","fifty","sixty","seventy","eighty","ninety"};
string s3 = "and";
string str, temp;
int main(){
for(int i = ; i < ; i++){ //建立0~19的映射
m[s1[i]] = i;
}
for(int i = ; i < ; i++){ //建立20,30……,90的映射
m[s2[i]] = + i * ;
}
m[s3] = ; //如果遇到and不需要操作,就将and映射为0即可
int t; //行数
scanf("%d", &t);
getchar(); //吸收换行符
while(t--){
getline(cin,str); //获取一行
istringstream cinstr(str);
int ans = , num = ; //ans记录答案,temp记录当前数字
while(cinstr >> temp){ //在str中读取单词
if(temp == "million"){ //遇到million乘以1000000并从0开始重新记录
ans += num * ;
num = ;
}else if(temp == "thousand"){ //遇到thousand乘以1000并从0开始重新记录
ans += num * ;
num = ;
}else if(temp == "hundred"){ //遇到hundred乘以100
num *= ;
}else{
num += m[temp]; //记录数字
}
}
ans += num; //将最后记录的数字加入答案
printf("%d\n", ans);
}
return ;
}

ZOJ 2971 Give Me the Number的更多相关文章

  1. ZOJ 2971 Give Me the Number;ZOJ 2311 Inglish-Number Translator (字符处理,防空行,strstr)

    ZOJ 2971 Give Me the Number 题目 ZOJ 2311 Inglish-Number Translator 题目 //两者题目差不多,细节有点点不一样,因为不是一起做的,所以处 ...

  2. ZOJ 2971 Give Me the Number (模拟,字符数组的清空+map)

    Give Me the Number Time Limit: 2 Seconds      Memory Limit: 65536 KB Numbers in English are written ...

  3. zoj 4099 Extended Twin Composite Number

    Do you know the twin prime conjecture? Two primes  and  are called twin primes if . The twin prime c ...

  4. ZOJ 2132 The Most Frequent Number (贪心)

    题意:给定一个序列,里面有一个数字出现了超过 n / 2,问你是哪个数字,但是内存只有 1 M. 析:首先不能开数组,其实也是可以的了,后台数据没有那么大,每次申请内存就可以过了.正解应该是贪心,模拟 ...

  5. ZOJ - 2132:The Most Frequent Number(思维题)

    pro:给定N个数的数组a[],其中一个数X的出现次数大于N/2,求X,空间很小. sol:不能用保存数组,考虑其他做法. 由于出现次数较多,我们维护一个栈,栈中的数字相同,所以我们记录栈的元素和个数 ...

  6. nenu contest3 The 5th Zhejiang Provincial Collegiate Programming Contest

    ZOJ Problem Set - 2965 Accurately Say "CocaCola"!  http://acm.zju.edu.cn/onlinejudge/showP ...

  7. 主席树[可持久化线段树](hdu 2665 Kth number、SP 10628 Count on a tree、ZOJ 2112 Dynamic Rankings、codeforces 813E Army Creation、codeforces960F:Pathwalks )

    在今天三黑(恶意评分刷上去的那种)两紫的智推中,突然出现了P3834 [模板]可持久化线段树 1(主席树)就突然有了不详的预感2333 果然...然后我gg了!被大佬虐了! hdu 2665 Kth ...

  8. 整体二分(SP3946 K-th Number ZOJ 2112 Dynamic Rankings)

    SP3946 K-th Number (/2和>>1不一样!!) #include <algorithm> #include <bitset> #include & ...

  9. ZOJ 3622 Magic Number 打表找规律

    A - Magic Number Time Limit:2000MS     Memory Limit:32768KB     64bit IO Format:%lld & %llu Subm ...

随机推荐

  1. 我的Jquery参考词典

    由于工作主要用到Asp.net Mvc+Jquery,最近也看了一些Jquery的书籍,在此总结以备回顾. 已读书籍:<Jquery In Action> 主要讲了些Jquery语法以及A ...

  2. 常用脚本--查看死锁和阻塞usp_who_lock

    USE [master] GO /****** Object: StoredProcedure [dbo].[sp_who_lock] Script Date: 02/07/2014 11:51:24 ...

  3. awk中NF的使用

    统计机器中网络连接各个状态个数 netstat -a | awk '/^tcp/ {++S[$NF]} END {for(a in S) print a, S[a]}'   一下子不明白$NF是什么意 ...

  4. PostgreSQL操作数据表

    1.创建表(SysUser) create table "SysUsers"( "UserId" serial, --用户Id,自增 "LoginNa ...

  5. sharepoint excute power shell

    Add-PSSnapin microsoft.sharepoint.powershell$UPA = Get-SPServiceApplication | ? {$_.typeName -like ' ...

  6. Android Performance 性能提升

    1. 经常变动的字符串要用 StringBuilder,然后每次变动用 append 方法.而不应该每次创建新的 String. 2. 使用 static final 变量. 3. It's reas ...

  7. 在线编辑器Ckeditor (1) - php (30)

    在线编辑器 在线编辑器也称之为所见即所得编辑器,是一种常见的html源码编辑器. 所见即所得:用户在输入的时候,不论是格式和是样式都能被系统原封不动的保存,最后在查看的时候,可以按照用户输入的原来的结 ...

  8. 小白学Linux

    Linux的文件关系: / 根最大的文件夹,存储此台计算机的所有数据 /etc  存放计算机的配置文件 /var/log 存放电脑的日志文件 /home 家的位置 路径:相对路径.绝对路径(从根下开始 ...

  9. Sublime Text几款常用插件及用法(前端)

    一.Sublime3下载 百度搜索sublime text3,出现如图: 2.然后点击进去下载: 或者https://pc.qq.com/detail/0/detail_10140.html这里下载 ...

  10. 【文文殿下】后缀自动机(Suffix Automaton,SAM)学习笔记

    前言 后缀自动机是一个强大的数据结构,能够解决很多字符串相关的(String-related)问题. 例如:他可以查询一个字符串在另一个字符串中出现的所有子串,以及查询一个字符串中本质不同的字符串的个 ...