EOJ 1180 Inglish-Number Translator

http://www.acm.cs.ecnu.edu.cn/problem.php?problemid=1180

poj 2121 http://poj.org/problem?id=2121

题目大意：输入数字的英文写法，输出阿拉伯数字。

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <queue>
#include <vector>
#include <string>
#include <set>
#include <cstdlib>
#include <map>
using namespace std;

map<string, int>my;

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

string str[200];
int k;

void solve(string s)
{
    string st = "";
    k = 0;
    for (int i = 0; i < s.size(); i++)
    {
        if (s[i] == ' ')
        {
            if (st.size())
                str[k++] = st;
            st = "";
        }
        else
            st += s[i];
    }
    if (st.size())
        str[k++] = st;
    int start = 0;
    if (str[start] == "negative")
    {
        cout << "-";
        start++;
    }
    int tmp = 0;
    int sum = 0;
    for (int i = start; i < k; i++)
    {
        if (my[str[i]] == 1000 || my[str[i]] == 1000000)
        {
            tmp *= my[str[i]];
            sum += tmp;
            tmp = 0;
        }
        else if (my[str[i]] == 100)
        {
            tmp *= my[str[i]];
        }
        else
            tmp += my[str[i]];
    }
    sum += tmp;
    cout << sum << endl;
}

int main()
{
    string s;
    init();
    while (getline(cin, s))
    {
        if (s.size() == 0 || s.size() == 1)
            continue;
        solve(s);
    }
    return 0;    
}