zoukankan      html  css  js  c++  java
  • GDUFE ACM-1356

    题目:http://acm.gdufe.edu.cn/Problem/read/id/1356

    Problem B. Relative atomic mass

    Time Limit: 2000/1000ms (Java/Others)

    Problem Description:

    Relative atomic mass is a dimensionless physical quantity, the ratio of the average mass of atoms of an element (from a single given sample or source) to 1/12 of the mass of an atom of carbon-12 (known as the unified atomic mass unit). You need to calculate the relative atomic mass of a molecule, which consists of one or several atoms. In this problem, you only need to process molecules which contain hydrogen atoms, oxygen atoms, and carbon atoms. These three types of atom are written as ’H’, ’O’ and ’C’ repectively. For your information, the relative atomic mass of one hydrogen atom is 1, and the relative atomic mass of one oxygen atom is 16 and the relative atomic mass of one carbon atom is 12. A molecule is demonstrated as a string, of which each letter is for an atom. For example, a molecule ’HOH’ contains two hydrogen atoms and one oxygen atom, therefore its relative atomic mass is 18 = 2∗1 + 16. 

    Input:

    The first line of input contains one integer N(N ≤ 10), the number of molecules. In the next N lines, the i-th line contains a string, describing the i-th molecule. The length of each string would not exceed 10. 

    Output:

    For each molecule, output its relative atomic mass. 

    Sample Input:

    5
    H
    C
    O
    HOH
    CHHHCHHOH

    Sample Output:

    1
    12
    16
    18
    46

    思路:判断遇到的字符是哪一个,如果遇到'H'则+1,如果遇到'C'则+12,如果遇到'O'则+16

    难度:非常简单

    代码:
     1 #include<stdio.h>
     2 #include<string.h>
     3 int main()
     4 {
     5     int n,i,sum,k;
     6     char a[11];
     7     while(scanf("%d",&n)!=EOF)
     8     {
     9         while(n--)
    10         {
    11             sum=0;
    12             scanf("%s",&a);
    13             k=strlen(a);
    14             for(i=0;i<k;i++)
    15             {
    16                 if(a[i]=='H')
    17                     sum+=1;
    18                 else if(a[i]=='O')
    19                     sum+=16;
    20                 else if(a[i]=='C')
    21                     sum+=12;
    22             }
    23             printf("%d
    ",sum);
    24         }
    25     }
    26     return 0;
    27 }
  • 相关阅读:
    [LeetCode] Dungeon Game
    [LeetCode] Maximal Rectangle
    [LeetCode] Scramble String -- 三维动态规划的范例
    [LeetCode] Palindrome Partitioning II
    [LeetCode] Palindrome Partitioning
    [LeetCode] Interleaving String
    [LeetCode] Longest Valid Parentheses -- 挂动态规划羊头卖stack的狗肉
    JPA将查询结果转换为DTO对象
    EOS签名R值过大导致报错"is_canonical( c ): signature is not canonical"
    比特币中P2SH(pay-to-script-hash)多重签名的锁定脚本和解锁脚本
  • 原文地址:https://www.cnblogs.com/ruo786828164/p/6009316.html
Copyright © 2011-2022 走看看