zoukankan      html  css  js  c++  java
  • Technocup 2017

    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=0;
        while(i<len){
            if(s[i]>='a'&&s[i]<='z'){
                i++;
            }
            if(s[i]>='0'&&s[i]<='9'){
                int f=0;
                long long ans=0;
                long long pos=0;
                long long num=0;
                while(s[i]>='0'&&s[i]<='9'){
                    pos*=10;
                    pos+=(s[i]-'0');
                    i++;
                }
                if(s[i]=='.'){
                    f++;
                    i++;
                    int x=1;
                    while(s[i]>='0'&&s[i]<='9'){
                        ans*=10;
                        ans+=(s[i]-'0');
                        i++;
                        x*=10;
                    }
                    if(x>=1000){
                        pos*=x;
                        pos+=(ans);
                    }else{
                        b+=ans;
                       // cout<<b<<"A"<<endl;
                       // cout<<"A"<<endl;
                    }
                }
                if(s[i]=='.'&&f==1){
                    i++;
                    long long x=1;
                    while(s[i]>='0'&&s[i]<='9'){
                        num*=10;
                        num+=(s[i]-'0');
                        i++;
                        x*=10;
                    }
                    if(x>=1000){
                        pos*=x;
                        pos+=num;
                    }else{
                       b+=num;
                    }
                }else{
                    i++;
                }
               // cout<<pos<<" "<<b<<endl;
                a+=pos;
            }
        }
    
        a+=(b/100);
        b%=100;
        //cout<<a<<" "<<b<<endl;
        string ss="";
        if(a==0&&b==0){
            cout<<"0.0"<<endl;
            return 0;
        }
        if(a==0&&b){
            if(b<10){
                cout<<"0.0"<<b<<endl;
            }else{
                string ls="";
                while(b){
                    long long dns=b%10;
                    ls+=(dns+'0');
                    b/=10;
                }
                reverse(ls.begin(),ls.end());
                cout<<"0."<<ls<<endl;
            }
            return 0;
        }
        if(a&&b==0){
            int los=0;
            while(a){
                long long dns=a%10;
                if(los%3==0&&los){
                    ss+='.';
                }
                ss+=(dns+'0');
                a/=10;
                los++;
            }
            int ll=ss.length();
            reverse(ss.begin(),ss.end());
            cout<<ss<<endl;
        }else{
            int los=0;
            while(a){
                long long dns=a%10;
                if(los%3==0&&los){
                    ss+='.';
                }
                ss+=(dns+'0');
                a/=10;
                los++;
            }
            int ll=ss.length();
            reverse(ss.begin(),ss.end());
            if(b<10){
                cout<<ss<<".0"<<b<<endl;
            }else{
                string ls="";
                    while(b){
                        long long dns=b%10;
                        ls+=(dns+'0');
                        b/=10;
                    }
                reverse(ls.begin(),ls.end());
                cout<<ss<<"."<<ls<<endl;
            }
        }
        return 0;
    }


  • 相关阅读:
    django-form表单
    django-登录页面添加验证码
    opensatck误删除service项目
    运维脚本
    大数据平台架构组件选择与运用场景
    HDP2.4安装(五):集群及组件安装
    Spark(三): 安装与配置
    Spark(二): 内存管理
    Spark(一): 基本架构及原理
    ElasticSearch基本使用
  • 原文地址:https://www.cnblogs.com/yinghualuowu/p/7242460.html
Copyright © 2011-2022 走看看