UVA 1586 Molar mass

An organic compound is any member of a large class of chemical compounds whose molecules contain carbon. The molar mass of an organic compound is the mass of one mole of the organic compound. The molar mass of an organic compound can be computed from the standard atomic weights of the elements.

When an organic compound is given as a molecular formula, Dr. CHON wants to find its molar mass. A molecular formula, such as C3H4O3, identifies each constituent element by its chemical symbol and indicates the number of atoms of each element found in each discrete molecule of that compound. If a molecule contains more than one atom of a particular element, this quantity is indicated using a subscript after the chemical symbol.

In this problem, we assume that the molecular formula is represented by only four elements, ‘C’ (Carbon), ‘H’ (Hydrogen), ‘O’ (Oxygen), and ‘N’ (Nitrogen) without parentheses.

The following table shows that the standard atomic weights for ‘C’, ‘H’, ‘O’, and ‘N’.

Atomic Name	Carbon	Hydrogen	Oxygen	Nitrogen
Standard Atomic Weight	12.01 g/mol	1.008 g/mol	16.00 g/mol	14.01 g/mol

For example, the molar mass of a molecular formula C6H5OH is 94.108 g/mol which is computed by 6 × (12.01 g/mol) + 6 × (1.008 g/mol) + 1 × (16.00 g/mol).

Given a molecular formula, write a program to compute the molar mass of the formula.

Input

Your program is to read from standard input. The input consists of T test cases. The number of test cases T is given in the first line of the input. Each test case is given in a single line, which contains a molecular formula as a string. The chemical symbol is given by a capital letter and the length of the string is greater than 0 and less than 80. The quantity number n which is represented after the chemical symbol would be omitted when the number is 1 (2 ≤n≤ 99).

Output

Your program is to write to standard output. Print exactly one line for each test case. The line should contain the molar mass of the given molecular formula.

Sample Input

4

C

C6H5OH

NH2CH2COOH

C12H22O11

Sample Output

12.010

94.108

75.070

342.296

================================================================================================

#include"stdio.h"
#include"ctype.h" 
#include"stdlib.h" 
#include"math.h"
main()
{
int i,n,J;
char CHO[31],h;
scanf("%d",&n);
for(J=0;J<n;J++)  
  {double s=0;
   scanf("%s",CHO);
    for(i=0;CHO[i]!='\0';i++)
       {
	       if(isalpha(CHO[i])&&isalpha(CHO[i+1]))//判断i和i+1是否为都字母。 
           switch(CHO[i])
               {
	           case 'H':s=s+1.008;break;
               case 'C':s=s+12.01;break;
               case 'O':s=s+16;break;
               case 'N':s=s+14.01;break;
               } 
             else
    if(isalpha(CHO[i])&&isdigit(CHO[i+1])&&isdigit(CHO[i+2])&&CHO[i+2]!='\0')//判断字母后是否为二位数 
      {switch(CHO[i])
           {case 'H':s=s+1.008*((CHO[i+1]-48)*10+(CHO[i+2]-48));break;
            case 'C':s=s+12.01*((CHO[i+1]-48)*10+(CHO[i+2]-48));break;
            case 'O':s=s+16*((CHO[i+1]-48)*10+(CHO[i+2]-48));break;
           case 'N':s=s+14.01*((CHO[i+1]-48)*10+(CHO[i+2]-48));break;
		   } 
      }
      else
      if(isalpha(CHO[i])&&isdigit(CHO[i+1])&&CHO[i+1]!='\0')//判断字母后是否为一位数
      {switch(CHO[i])
        {case 'H':s=s+1.008*(CHO[i+1]-48);break;
         case 'C':s=s+12.01*(CHO[i+1]-48);break;
         case 'O':s=s+16*(CHO[i+1]-48);break;
         case 'N':s=s+14.01*(CHO[i+1]-48);break;
        } 
      }
      else
      if(isalpha(CHO[i])&&CHO[i+1]=='\0')//对最后一个字符进行判断 
      {switch(CHO[i])
        {case 'H':s=s+1.008;break;
         case 'C':s=s+12.01;break;
         case 'O':s=s+16;break;
         case 'N':s=s+14.01;break;
        } 
      }
  
  
 }
 s=fabs(s);
printf("%.3f\n",s);
s=0;
 
 }  
}
//本题肯定有更好的写法，这题就连我都觉得写的繁琐了，主要就是对字母后的数字进行判断。