习题3-2(uva-1586)

最新推荐文章于 2022-11-22 13:13:15 发布

小刀刺大熊

最新推荐文章于 2022-11-22 13:13:15 发布

阅读量97

点赞数

分类专栏：算法入门第三章

本文链接：https://blog.csdn.net/seanbill/article/details/109273379

版权

算法入门第三章专栏收录该内容

12 篇文章 0 订阅

订阅专栏

#include <iostream>
#include <vector>
#include <stack>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <cstring>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <numeric>
#include <chrono>
#include <ctime>
#include <cmath>
#include <cctype>
#include <string>
#include <cstdio>
#include <iomanip>


#include <thread>
#include <mutex>
#include <condition_variable>
#include <functional>
#include <iterator>
using namespace std;
const int MAXSIZE = 128;
const double arr[26] = { 0,0,12.01,0,0,0,0,1.008,0,0,0,0,0,14.01,16.00 };
int main()
{
	char str[MAXSIZE] = { 0 };int t;

	cin >> t;

	while (t--) {
		cin >> str;

		double ret = 0;int last = 0 ,nCount = 0;

		for (int i = 0; str[i] != '\0'; ++i) {
			if (isupper(str[i])) { ret += arr[last] * (nCount?nCount:1); last = str[i] - 'A'; nCount = 0; }
			else { nCount = nCount * 10 + (str[i] - '0'); }
		}
		ret += arr[last] * (nCount ? nCount : 1);

		cout <<fixed<<setprecision(3) <<ret << endl;
	}
	return 0;
}