zoukankan      html  css  js  c++  java
  • Molar Mass, ACM/ICPC Seoul 2007, UVa 1586

                                            Molar mass

    Description

    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.

    epsfbox{p3900.eps}

    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$ le$n$ le$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<string.h>
    #include<ctype.h>
    int main()
    {
        int t;
        scanf("%d", &t);
        while( t-- )
        {
            char str[81];
            double molar_mass=0, weightC=12.01, weightH=1.008, weightO=16.00, weightN=14.01;
            scanf("%s", str);
            int length = strlen(str);
            for( int i=0; i<length; i++ )
            {
                switch(str[i])
                {
                case 'C':
                    if(isdigit(str[i+1]))
                        if(isdigit(str[i+2]))
                        molar_mass += weightC*( (str[i+2]-48)+(str[i+1]-48)*10 );
                        else
                        molar_mass += weightC*(str[i+1]-48);
                    else
                        molar_mass += weightC;
                    break;
                case 'H':
                     if(isdigit(str[i+1]))
                        if(isdigit(str[i+2]))
                        molar_mass += weightH*( (str[i+2]-48)+(str[i+1]-48)*10 );
                        else
                        molar_mass += weightH*(str[i+1]-48);
                    else
                        molar_mass += weightH;
                    break;
                case 'O':
                    if(isdigit(str[i+1]))
                        if(isdigit(str[i+2]))
                        molar_mass += weightO*( (str[i+2]-48)+(str[i+1]-48)*10 );
                        else
                        molar_mass += weightO*(str[i+1]-48);
                    else
                        molar_mass += weightO;
                    break;
                case 'N':
                    if(isdigit(str[i+1]))
                        if(isdigit(str[i+2]))
                        molar_mass += weightN*( (str[i+2]-48)+(str[i+1]-48)*10 );
                        else
                        molar_mass += weightN*(str[i+1]-48);
                    else
                        molar_mass += weightN;
                    break;
                }
            }
            printf("%.3lf
    ", molar_mass);
        }
        return 0;
    }
    


  • 相关阅读:
    centos安装python
    【剑指Offer学习】【所有面试题汇总】
    内连接,外链接(左连接、右连接、全连接),交叉连接
    数据库三范式
    聚集索引与非聚集索引
    B树和B+树的区别
    TCP建立连接三次握手和释放连接四次握手
    HTTP协议详解
    常见的HTTP状态码(HTTP Status Code)说明
    归并排序的思想及递归运行步骤详解
  • 原文地址:https://www.cnblogs.com/Genesis2018/p/8304844.html
Copyright © 2011-2022 走看看