zoukankan      html  css  js  c++  java
  • Molar mass ( UVA

    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 <cstdio>
    #include <algorithm>
    #include <string.h>
    #define N 1024
    #define MAXN 0x3f3f3f3f
    #include <iostream>
    #include <map>
    #include <string>
    #include <cmath>
    #define pi acos(-1.0)
    using namespace std;
    const int mx=10000;
    int main()
    {
        int n,m,t,l,k,i,j;
        string str;
        while(cin>>t)
        {
            while(t--)
            {
                cin>>str;
                int ans=0;double cnt=0,sum=0;
                if(str.size()==1)
                {
                    if(str[0]=='H') cout<<"1.008"<<endl;
                    else if(str[0]=='C') cout<<"12.010"<<endl;
                    else if(str[0]=='O') cout<<"16.000"<<endl;
                    else cout<<"14.010"<<endl;;
                }
                else
                {
                    for(i=0;i<str.size();)
                    {
                        if(str[i]<'Z'&&str[i]>'A')
                        {
                            if(str[i]=='H') cnt=1.008;
                            else if(str[i]=='C') cnt=12.01;
                            else if(str[i]=='O') cnt=16.00;
                            else cnt=14.01;
                            i++;
                        }
                        if(str[i]<'Z'&&str[i]>'A') sum+=cnt;
                        else
                        {
                            ans=0;
                            while(str[i]>'0'&&str[i]<='9')
                            {
                                ans=ans*10+str[i]-'0';i++;
                            //    cout<<"+++"<<ans<<endl;
                            }
                            sum+=ans*cnt;
                        }
                    }
                    if(str[str.size()-1]<'Z'&&str[str.size()-1]>'A')
                    {
                        if(str[str.size()-1]=='H') sum+=1.008;
                        else if(str[str.size()-1]=='C')    sum+=12.010;
                        else if(str[str.size()-1]=='O') sum+=16.000;
                        else sum+=14.010;
                    }
                    printf("%.3lf
    ",sum);
                }
                
            }
        }
        return 0;
    }
    所遇皆星河
  • 相关阅读:
    Design Pattern
    javascript summary
    nodejs template
    MVC---Case 1
    About js
    本地schemeApp扩展
    BNU4208:Bubble sort
    [置顶] think in java interview-高级开发人员面试宝典代码示例
    java+socket 简易聊天工具
    oracle 字段自增 两段代码搞定
  • 原文地址:https://www.cnblogs.com/Shallow-dream/p/11632243.html
Copyright © 2011-2022 走看看