#include <algorithm>
#include <iostream>
#include <utility>
#include <cstring>
#include <cstdlib>
#include <cstdio>
#include <deque>
#include <string>
#include <vector>
#include <cmath>
#include <stack>
#include <queue>
#include <map>
#include <set>
using namespace std;
#define mm(a,i) memset(a, i, sizeof(a));
#define LL long long
#define Mod 1000000007
#define SC_C(s) scanf("%c", &s)
#define SC(a) scanf("%d", &a)
#define SCC(a,b) scanf("%d %d", &a, &b)
#define SCCC(a,b,c) scanf("%d %d %d", &a, &b, &c)
#define FXA(i,a,n) for(i=a; i<n; i++)
#define FDA(i,a,n) for(i=a; i>n; i++)
#define FXDA(i,a,n) for(i=a; i<=n; i++)
#define FDDA(i,a,n) for(i=a; i>=n; i++)
#define FXB(i,a,n) for(i=a; i<n; i--)
#define FDB(i,a,n) for(i=a; i>n; i--)
#define FXDB(i,a,n) for(i=a; i<=n; i--)
#define FDDB(i,a,n) for(i=a; i>=n; i--)
#define PF(n) printf("%d\n", n);
#define PFF(n,m) printf("%d %d\n", n, m);
#define PFFF(x,y,z) printf("%d %d %d\n", x, y, z);
#define PF_Case(i) printf("Case %d:\n",i);
#define PF_C(i) printf("%d:\n",i);
#define PF_L(x) printf("%I64d\n",x);
#define IN freopen("D:\\in.txt","r",stdin);
#define MAX(a,b) a>b?a:b
#define MIN(a,b) a<b?a:b
int maxx = 999999999;
int minn = -999999999;
bool flag;
int i,j,k,T,ans,sum,m,n,cnt;
//string s;
char s[100];
int main() {
int T;
cin>>T;
while(T--) {
mm(s,0)
cin>>s;
float sum=0,x=0;
int n = strlen(s);
for(int i=0; i<n; i++) {
if(isdigit(s[i+1])) {
if(isdigit(s[i+2])) x = 10*(s[i+1]-'0')+(s[i+2]-'0');
else x = s[i+1]-'0';
// cout<<x<<endl;
} else x = 1;
if(isalpha(s[i])!=0) {
switch(s[i]) {
case 'C': sum += 12.01*x;break;
case 'H': sum += 1.008*x;break;
case 'O': sum += 16.00*x;break;
case 'N': sum += 14.01*x;break;
}
}
}
printf("%.3f\n",sum);
sum = 0;
}
return 0;
}
UVA-1586
最新推荐文章于 2022-02-21 23:07:16 发布