0
1
mirror of https://git.sb/baoshuo/OI-codes.git synced 2024-11-30 21:16:27 +00:00
OI-codes/Luogu/problem/P2108/P2108.cpp
2021-07-08 17:49:28 +08:00

55 lines
1.1 KiB
C++

#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
map<string, int> m;
int ans = 0, tmp = 0, w = 1;
m["one"] = 1;
m["two"] = 2;
m["three"] = 3;
m["four"] = 4;
m["five"] = 5;
m["six"] = 6;
m["seven"] = 7;
m["eight"] = 8;
m["nine"] = 9;
m["ten"] = 10;
m["eleven"] = 11;
m["twelve"] = 12;
m["thirteen"] = 13;
m["fourteen"] = 14;
m["fifteen"] = 15;
m["sixteen"] = 16;
m["seventeen"] = 17;
m["eighteen"] = 18;
m["nineteen"] = 19;
m["twenty"] = 20;
m["thirty"] = 30;
m["forty"] = 40;
m["fifty"] = 50;
m["sixty"] = 60;
m["seventy"] = 70;
m["eighty"] = 80;
m["ninety"] = 90;
while (cin >> s) {
if (s == "negative") {
w = -1;
} else if (s == "hundred") {
tmp *= 100;
} else if (s == "thousand") {
ans += tmp * 1000;
tmp = 0;
} else if (s == "million") {
ans += tmp * 1000000;
tmp = 0;
} else {
tmp += m[s];
}
}
ans += tmp;
cout << w * ans << endl;
return 0;
}