Vasily exited from a store and now he wants to recheck the total price of all purchases in his bill. The bill is a string in which the names of the purchases and their prices are printed in a row without any spaces. Check has the format "name1price1name2price2...namenpricen", where namei (name of the i-th purchase) is a non-empty string of length not more than 10, consisting of lowercase English letters, and pricei(the price of the i-th purchase) is a non-empty string, consisting of digits and dots (decimal points). It is possible that purchases with equal names have different prices.

The price of each purchase is written in the following format. If the price is an integer number of dollars then cents are not written.

Otherwise, after the number of dollars a dot (decimal point) is written followed by cents in a two-digit format (if number of cents is between 1and 9 inclusively, there is a leading zero).

Also, every three digits (from less significant to the most) in dollars are separated by dot (decimal point). No extra leading zeroes are allowed. The price always starts with a digit and ends with a digit.

For example:

  • "234", "1.544", "149.431.10", "0.99" and "123.05" are valid prices,
  • ".333", "3.33.11", "12.00", ".33", "0.1234" and "1.2" are not valid.

Write a program that will find the total price of all purchases in the given bill.

Input

The only line of the input contains a non-empty string s with length not greater than 1000 — the content of the bill.

It is guaranteed that the bill meets the format described above. It is guaranteed that each price in the bill is not less than one cent and not greater than 106 dollars.

Output

Print the total price exactly in the same format as prices given in the input.

Examples
input
chipsy48.32televizor12.390
output
12.438.32
input
a1b2c3.38
output
6.38
input
aa0.01t0.03
output
0.04

题意:给出价格,不过价格表示不太一样,如果是小数点后面是3个数字,只是数字分割符号,比如12,345 表示12345,当然是两个以下说明是小数点,求所有的价格总和,并按照题意表示方式输出
解法:
1 主要在于如何把数字转化成常规数字。我用a表示整数,b表示小数
2 前面的数字自然是整数,中间出现的数字判断是不是长度为3,后面的数字也同样判断一下,然后放入a和b内
3 再判断b是不是有进位
4 按照题目意思输出,大概就是小数是1~2位。整数位是3位,判断一下
5 代码好长。。其实重复部分很多
#include<bits/stdc++.h>
using namespace std;
long long a,b;
int main(){
string s;
cin>>s;
int len=s.length();
int i=;
while(i<len){
if(s[i]>='a'&&s[i]<='z'){
i++;
}
if(s[i]>=''&&s[i]<=''){
int f=;
long long ans=;
long long pos=;
long long num=;
while(s[i]>=''&&s[i]<=''){
pos*=;
pos+=(s[i]-'');
i++;
}
if(s[i]=='.'){
f++;
i++;
int x=;
while(s[i]>=''&&s[i]<=''){
ans*=;
ans+=(s[i]-'');
i++;
x*=;
}
if(x>=){
pos*=x;
pos+=(ans);
}else{
b+=ans;
// cout<<b<<"A"<<endl;
// cout<<"A"<<endl;
}
}
if(s[i]=='.'&&f==){
i++;
long long x=;
while(s[i]>=''&&s[i]<=''){
num*=;
num+=(s[i]-'');
i++;
x*=;
}
if(x>=){
pos*=x;
pos+=num;
}else{
b+=num;
}
}else{
i++;
}
// cout<<pos<<" "<<b<<endl;
a+=pos;
}
} a+=(b/);
b%=;
//cout<<a<<" "<<b<<endl;
string ss="";
if(a==&&b==){
cout<<"0.0"<<endl;
return ;
}
if(a==&&b){
if(b<){
cout<<"0.0"<<b<<endl;
}else{
string ls="";
while(b){
long long dns=b%;
ls+=(dns+'');
b/=;
}
reverse(ls.begin(),ls.end());
cout<<"0."<<ls<<endl;
}
return ;
}
if(a&&b==){
int los=;
while(a){
long long dns=a%;
if(los%==&&los){
ss+='.';
}
ss+=(dns+'');
a/=;
los++;
}
int ll=ss.length();
reverse(ss.begin(),ss.end());
cout<<ss<<endl;
}else{
int los=;
while(a){
long long dns=a%;
if(los%==&&los){
ss+='.';
}
ss+=(dns+'');
a/=;
los++;
}
int ll=ss.length();
reverse(ss.begin(),ss.end());
if(b<){
cout<<ss<<".0"<<b<<endl;
}else{
string ls="";
while(b){
long long dns=b%;
ls+=(dns+'');
b/=;
}
reverse(ls.begin(),ls.end());
cout<<ss<<"."<<ls<<endl;
}
}
return ;
}

Technocup 2017 - Elimination Round 1 (Unofficially Open for Everyone, Rated for Div. 2) B的更多相关文章

  1. Technocup 2017 - Elimination Round 1 (Unofficially Open for Everyone, Rated for Div. 2) D

    The organizers of a programming contest have decided to present t-shirts to participants. There are ...

  2. Technocup 2017 - Elimination Round 1 (Unofficially Open for Everyone, Rated for Div. 2) C

    This is an interactive problem. You should use flush operation after each printed line. For example, ...

  3. Technocup 2017 - Elimination Round 1 (Unofficially Open for Everyone, Rated for Div. 2) A

    Vasily has a number a, which he wants to turn into a number b. For this purpose, he can do two types ...

  4. Codeforces Round #389 (Div. 2, Rated, Based on Technocup 2017 - Elimination Round 3) C

    Description Santa Claus has Robot which lives on the infinite grid and can move along its lines. He ...

  5. Codeforces Round #389 (Div. 2, Rated, Based on Technocup 2017 - Elimination Round 3) B

    Description Santa Claus decided to disassemble his keyboard to clean it. After he returned all the k ...

  6. Codeforces Round #389 (Div. 2, Rated, Based on Technocup 2017 - Elimination Round 3) A

    Description Santa Claus is the first who came to the Christmas Olympiad, and he is going to be the f ...

  7. Codeforces Round #389 (Div. 2, Rated, Based on Technocup 2017 - Elimination Round 3) D. Santa Claus and a Palindrome STL

    D. Santa Claus and a Palindrome time limit per test 2 seconds memory limit per test 256 megabytes in ...

  8. Codeforces Round #389 (Div. 2, Rated, Based on Technocup 2017 - Elimination Round 3) E. Santa Claus and Tangerines

    E. Santa Claus and Tangerines time limit per test 2 seconds memory limit per test 256 megabytes inpu ...

  9. Codeforces Round #380 (Div. 1, Rated, Based on Technocup 2017 - Elimination Round 2)

    http://codeforces.com/contest/737 A: 题目大意: 有n辆车,每辆车有一个价钱ci和油箱容量vi.在x轴上,起点为0,终点为s,中途有k个加油站,坐标分别是pi,到每 ...

随机推荐

  1. Windows程序设计(1)——Win32运行原理(一)

    CPU保护模式与Windows系统 1 Windows多任务 2 虚拟内存 3 处理器的特权级别 内核对象 1 内核对象有什么用 2 对象句柄 3 使用计数 1 CPU保护模式与Windows系统 8 ...

  2. mtk6589显示子系统笔记(一)

    拿到MT6589的版本不久,发现显示系统代码结构改变很大.做些备忘,后续不忙的时候可以继续看. MT6589之前的MTK的Android系统显示系统同featurePhone基本一致. 先来回顾下MT ...

  3. Consul环境搭建

    大家在玩的时候 一定要使用ningx 1.9以上版本啊! 下载:wget https://releases.hashicorp.com/consul/0.7.5/consul_0.7.5_linux_ ...

  4. Nginx的Location正则表达式

    location的作用 location指令的作用是根据用户请求的URI来执行不同的应用,也就是根据用户请求的网站URL进行匹配,匹配成功即进行相关的操作. location的语法 已=开头表示精确匹 ...

  5. nltk: Tokenizing text into sentences

    安装 nltk pip install nltk 下载nltk_data 方法一: 通过客户端下载 import nltk nltk.download() 出现如下客户端,选择所需的包下载.(但由于网 ...

  6. MTK HDMI 流程

    一.HDMI初始化 1. kernel-3.18/drivers/misc/mediatek/ext_disp/mtk_extd_mgr.c static int __init mtk_extd_mg ...

  7. ubuntu16.04 + cuda9.0(deb版)+Cudnn7.1

    https://blog.csdn.net/Umi_you/article/details/80268983

  8. MVC中为自动生成实体类添加验证

    将额外的基于特性的元数据(象验证特性)施加到由VS设计器自动生成/维护的类的一个方法是,采用一个我们称之为“伙伴类(buddy classes)”的技术. 基本上来说,你创建另外一个类,包含你的验证特 ...

  9. 爬虫库之BeautifulSoup学习(二)

    BeautifulSoup官方介绍文档:https://www.crummy.com/software/BeautifulSoup/bs4/doc/index.zh.html 四大对象种类: Beau ...

  10. URI is not registered (Settings | Languages & Frameworks | Schemas and DTDs)

    URI is not registered (Settings | Languages & Frameworks | Schemas and DTDs) 有时候在IDEA中配置spring文件 ...