Uva1586 - 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 C₃H₄O₃, 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 C₆H₅OH 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.

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).

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.

4 
C 
C6H5OH 
NH2CH2COOH 
C12H22O11

12.010 
94.108 
75.070 
342.296


代码：
#include <cstdio>
#include <cstring>
#include <ctype.h>

int main()
{
    int Case = 0;
    scanf("%d", &Case);

    while (Case--)
    {
        char formula[90];
        scanf("%s", formula);
        int len = strlen(formula);

        double total = 0.0;
        int weight = 1;
        int counter = 0;
        for (int i = len - 1; i >= 0; --i)
        {
            int c = formula[i];
            //printf("%c", c);
            if (isdigit(c))
            {
                int n = c - '0';
                //printf("%d\t", n);
                counter += weight * n;
                weight *= 10;
            }
            else
            {
                double sWeight;
                switch (c)
                {
                    case 'C':
                        sWeight = 12.01; break;
                    case 'H':
                        sWeight = 1.008; break;
                    case 'O':
                        sWeight = 16.00; break;
                    case 'N':
                        sWeight = 14.01; break;
                }

                if (counter == 0)
                    counter = 1;
                total += sWeight * counter;
                counter = 0;
                weight = 1;
            }
        }
        printf("%.3f\n", total);

    }
}

 总结：
1）对问题进行分类，从实例出发，细致分析。

Uva1586 - Molar mass

标签：

原文地址：http://blog.csdn.net/u013573789/article/details/45028833