- 3900 - Molar mass
Asia - Seoul - 2007/2008
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 C 3 H 4 O 3, 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‘.For example, the molar mass of a molecular formula
C6H5OHis 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 (2n99) .
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
1 #include<stdio.h>
2 #include<string.h>
3 int main()
4 {
5 int n,i,j,chang,k;
6 double sum=0;
7 char c[85];
8 scanf("%d",&n);
9 while(n--){
10 sum=0;
11 memset(c,0,sizeof(c));
12 scanf("%s",&c);
13 chang=strlen(c);
14 for(i=0;i<chang;i++)
15 {
16 if(c[i]==‘C‘)
17 {
18 if((c[i+2]>=‘1‘)&&(c[i+2]<=‘9‘)&&(c[i+1]>=‘0‘)&&(c[i+1]<=‘9‘))
19 {
20 k=c[i+2]-‘0‘+(c[i+1]-‘0‘)*10;
21 i=i+2;
22 }
23 else if((c[i+1]>=‘1‘)&&(c[i+1]<=‘9‘))
24 {
25 k=c[i+1]-‘0‘;
26 i=i+1;
27 }
28 else
29 k=1;
30 sum+=12.01*k;
31 }
32 else if(c[i]==‘H‘)
33 {
34 if((c[i+2]>=‘1‘)&&(c[i+2]<=‘9‘)&&(c[i+1]>=‘0‘)&&(c[i+1]<=‘9‘))
35 {
36 k=c[i+2]-‘0‘+(c[i+1]-‘0‘)*10;
37 i=i+2;
38 }
39 else if((c[i+1]>=‘1‘)&&(c[i+1]<=‘9‘))
40 {
41 k=c[i+1]-‘0‘;
42 i=i+1;
43 }
44 else
45 k=1;
46 sum+=1.008*k;
47 }
48 else if(c[i]==‘O‘)
49 {
50 if((c[i+2]>=‘1‘)&&(c[i+2]<=‘9‘)&&(c[i+1]>=‘0‘)&&(c[i+1]<=‘9‘))
51 {
52 k=c[i+2]-‘0‘+(c[i+1]-‘0‘)*10;
53 i=i+2;
54 }
55 else if((c[i+1]>=‘1‘)&&(c[i+1]<=‘9‘))
56 {
57 k=c[i+1]-‘0‘;
58 i=i+1;
59 }
60 else
61 k=1;
62 sum+=16.00*k;
63 }
64 else if(c[i]==‘N‘)
65 {
66 if((c[i+2]>=‘1‘)&&(c[i+2]<=‘9‘)&&(c[i+1]>=‘0‘)&&(c[i+1]<=‘9‘))
67 {
68 k=c[i+2]-‘0‘+(c[i+1]-‘0‘)*10;
69 i=i+2;
70 }
71 else if((c[i+1]>=‘1‘)&&(c[i+1]<=‘9‘))
72 {
73 k=c[i+1]-‘0‘;
74 i=i+1;
75 }
76 else
77 k=1;
78 sum+=14.01*k;
79 }
80 else
81 continue;
82 }
83 printf("%.3lf\n",sum);
84 }
85 }