#UVa:1586-Molar mass

剖析字串後再查表加總即可得解。

C++(0.000)

/*******************************************************/
/* UVa 1586 Molar mass                                 */
/* Author: Maplewing [at] knightzone.studio            */
/* Version: 2019/03/31                                 */
/*******************************************************/
#include <iostream>
#include <cstdio>
#include <cctype>
#include <string>
#include <map>
using namespace std;

map<char, double> getMassMap(){
  map<char, double> mass;
  mass['C'] = 12.01;
  mass['H'] = 1.008;
  mass['O'] = 16.00;
  mass['N'] = 14.01;

  return mass;
}

int getNumberToken(const string& formula, int& index){
  if(!isdigit(formula[index])) return 1;

  int number = 0;
  while(index < formula.length() && isdigit(formula[index])){
    number = number * 10 + formula[index] - '0';
    ++index;
  }

  return number;
}

int main(){
  const map<char, double> MASS = getMassMap();

  int T;
  while(scanf("%d", &T) != EOF){
    for(int caseNumber = 1 ; caseNumber <= T ; ++caseNumber){
      string formula;
      cin >> formula;

      double totalMass = 0;
      for(int i = 0 ; i < formula.length() ;){
        char symbol = formula[i];
        ++i;
        int number = getNumberToken(formula, i);
        totalMass += MASS.at(symbol) * number;
      }

      printf("%.3lf\n", totalMass);
    }
  }

  return 0;
}

回應

目前無留言,歡迎留言!

發表迴響

這個網站採用 Akismet 服務減少垃圾留言。進一步瞭解 Akismet 如何處理網站訪客的留言資料

%d 位部落客按了讚: