baoshuo/OI-codes
baoshuo/OI-codes
0
1
Fork 0
mirror of https://git.sb/baoshuo/OI-codes.git synced 2024-11-30 18:56:26 +00:00
Code Releases Activity

P2108 学英语

Browse Source 
R52635743
This commit is contained in:
Baoshuo Ren 2021-07-08 17:49:28 +08:00 committed by Baoshuo Ren
parent 25ce10f451
commit caf0293b04
Signed by: baoshuo
GPG Key ID: 70F90A673FB1AB68
1 changed files with 41 additions and 53 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

42
Luogu/problem/P2108/P2108.cpp
View File

@ -3,10 +3,9 @@
using namespace std;
int main() {
map<string, int> m;
string s;
long long ans = 0, now = 0;
map<string, int> m;
int ans = 0, tmp = 0, w = 1;
m["one"] = 1;
m["two"] = 2;
m["three"] = 3;
@ -34,33 +33,22 @@ int main() {
m["seventy"] = 70;
m["eighty"] = 80;
m["ninety"] = 90;
while (cin >> s) {
if (s == "negative") {
cout << "-";
}
else if (s == "hundred") {
ans += now;
ans *= 100;
now = 0;
}
else if (s == "thousand") {
ans += now;
ans *= 1000;
now = 0;
}
else if (s == "million") {
ans += now;
ans *= 1000000;
now = 0;
}
else {
now += m[s];
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];
}
}
if (now) {
ans += now;
}
cout << ans << endl;
ans += tmp;
cout << w * ans << endl;
return 0;
}