ZOJ 2971 Give Me the Number
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的更多相关文章
- ZOJ 2971 Give Me the Number;ZOJ 2311 Inglish-Number Translator (字符处理,防空行,strstr)
ZOJ 2971 Give Me the Number 题目 ZOJ 2311 Inglish-Number Translator 题目 //两者题目差不多,细节有点点不一样,因为不是一起做的,所以处 ...
- ZOJ 2971 Give Me the Number (模拟,字符数组的清空+map)
Give Me the Number Time Limit: 2 Seconds Memory Limit: 65536 KB Numbers in English are written ...
- 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 ...
- ZOJ 2132 The Most Frequent Number (贪心)
题意:给定一个序列,里面有一个数字出现了超过 n / 2,问你是哪个数字,但是内存只有 1 M. 析:首先不能开数组,其实也是可以的了,后台数据没有那么大,每次申请内存就可以过了.正解应该是贪心,模拟 ...
- ZOJ - 2132:The Most Frequent Number(思维题)
pro:给定N个数的数组a[],其中一个数X的出现次数大于N/2,求X,空间很小. sol:不能用保存数组,考虑其他做法. 由于出现次数较多,我们维护一个栈,栈中的数字相同,所以我们记录栈的元素和个数 ...
- nenu contest3 The 5th Zhejiang Provincial Collegiate Programming Contest
ZOJ Problem Set - 2965 Accurately Say "CocaCola"! http://acm.zju.edu.cn/onlinejudge/showP ...
- 主席树[可持久化线段树](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 ...
- 整体二分(SP3946 K-th Number ZOJ 2112 Dynamic Rankings)
SP3946 K-th Number (/2和>>1不一样!!) #include <algorithm> #include <bitset> #include & ...
- ZOJ 3622 Magic Number 打表找规律
A - Magic Number Time Limit:2000MS Memory Limit:32768KB 64bit IO Format:%lld & %llu Subm ...
随机推荐
- BFC开启条件
当元素CSS属性设置了下列之一时,即可创建一个BFC: float:left|right position:absolute|fixed display: table-cell|table-capti ...
- web开发有那些牛逼东西可以用
1.squid 缓存网页 2.Pingdom 我使用Pingdom来验证Superexpert.com网站是否总是处在正常运行状态之中.你可以通过浏览“Pingdom.com”的方式来注册Pingdo ...
- 三.jenkins 在windows上配置master 和 agent(slave)
参考链接: https://wiki.jenkins-ci.org/display/JENKINS/Step+by+step+guide+to+set+up+master+and+slave+mach ...
- .net core 使用 redis
.net core 使用 redis 个人感觉.net core 对于微软技术而言有很重要的意义 ,所以最近已有时间就想看一看关于.net core 的文章. 今天我就来写一写如何在.net core ...
- Selenium框架切换-----Selenium快速入门(七)
上一篇说了窗口的切换,本篇说说框架的切换. 切换框架:是指切换html中的iframe标签元素或者frame标签元素,注意,并不包括frameset 以下是常用的方法: 方法 说明 WebDriver ...
- unity 移动物体的方式
1. 简介 在Unity3D中,有多种方式可以改变物体的坐标,实现移动的目的,其本质是每帧修改物体的position. 2. 通过Transform组件移动物体 Transform 组件用于描述物体在 ...
- k8s 常用指令
kubectl rolling-update redis-master --image=redis-master:2.0 基于镜像灰度发布 推荐链接
- Android 如何查看源码 (eclipse 按住 ctrl )
首先要确认 Android SDK Manager 下载并安装了 sources.然后在代码中按住 ctrl 在点一个类名, 如果打开的页面是找不到源码,就点那个按钮,然后找到源码所在的文件夹,就可以 ...
- django系列2--下载安装、项目创建、配置、启动
Django下载与安装 一.使用pip: 1.下载: django的官网下载页:https://www.djangoproject.com/download/ 1.使用pip安装, 在cmd命令行中输 ...
- “全栈2019”Java第八十八章:接口中嵌套接口的应用场景
难度 初级 学习时间 10分钟 适合人群 零基础 开发语言 Java 开发环境 JDK v11 IntelliJ IDEA v2018.3 文章原文链接 "全栈2019"Java第 ...