ZOJ 2971 Give Me the Number （模拟，字符数组的清空+map）

Give Me the Number

---

Time Limit: 2 Seconds      Memory Limit: 65536 KB

---

Numbers in English are written down in the following way (only numbers less than 10⁹ are 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 10⁹.

Sample Input

3
one
eleven
one hundred and two

Sample Output

1
11
102

---

Author: CAO, Peng
Source: The 5th Zhejiang Provincial Collegiate Programming Contest

#include <iostream>
#include<cstdio>
#include<cstring>
#include<map>
using namespace std;
map<string,int> mp;
char ch[100],str[10];
int t,ans,num;
int main()
{

    mp.clear();
    mp["zero"]=0; mp["one"]=1;
    mp["two"]=2; mp["three"]=3;mp["four"]=4;
    mp["five"]=5;mp["six"]=6;mp["seven"]=7; mp["eight"]=8;
    mp["nine"]=9;mp["ten"]=10; mp["eleven"]=11;
    mp["twelve"]=12;mp["thirteen"]=13; mp["fourteen"]=14;
    mp["fifteen"]=15; mp["sixteen"]=16;  mp["seventeen"]=17;
    mp["eighteen"]=18;mp["nineteen"]=19;
    mp["twenty"]=20;  mp["thirty"]=30;  mp["forty"]=40;
    mp["fifty"]=50;  mp["sixty"]=60; mp["seventy"]=70;
    mp["eighty"]=80;  mp["ninety"]=90;

    while(~scanf("%d",&t))
    {
        getchar();
    for(;t>0;t--)
    {
        gets(ch);
        //getchar();
        int len=strlen(ch),l=-1;
        ch[len]=' '; len++;
        memset(str,0,10);
        ans=0; num=0;
        for(int i=0;i<len;i++)
        {
          if (ch[i]!=' ') str[++l]=ch[i];
           else
           {
              if (mp.find(str)!=mp.end()) num+=mp[str];
              else
              {
                  if (strcmp(str,"million")==0)
                  {num=num*1000000; ans+=num; num=0;}
                  if (strcmp(str,"thousand")==0)
                  {num=num*1000; ans+=num; num=0;}
                  if (strcmp(str,"hundred")==0)
                   num=num*100;
              }
              //str[]='';
                memset(str,0,10);//把字符串数组清空的神奇方法
              l=-1;
           }

        }
        printf("%d
",ans+num);
    }
    }
    return 0;
}