没什么需要注意的,普及-的难度
#include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define mk make_pair
#define sz(x) ((int) (x).size())
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pa;
int main() {
int t;
cin >> t;
map<char, double> mp;
mp['C'] = 12.01;
mp['H'] = 1.008;
mp['O'] = 16.00;
mp['N'] = 14.01;
while (t--) {
string s;
cin >> s;
double ans = 0;
for (int i = 0; i < sz(s); i++) {
if (isalpha(s[i])) {
if (i == sz(s) - 1 || i < sz(s) - 1 && isalpha(s[i + 1])) ans += mp[s[i]];
else {
int num = 0;
int j = i + 1;
while (j < sz(s) && !isalpha(s[j])) num = num * 10 + s[j++] - '0';
ans += mp[s[i]] * num;
}
}
}
printf("%.3f\n", ans);
}
return 0;
}