zoukankan      html  css  js  c++  java
  • 1073 Scientific Notation (20 分)

    Scientific notation is the way that scientists easily handle very large numbers or very small numbers. The notation matches the regular expression [+-][1-9].[0-9]+E[+-][0-9]+ which means that the integer portion has exactly one digit, there is at least one digit in the fractional portion, and the number and its exponent's signs are always provided even when they are positive.

    Now given a real number A in scientific notation, you are supposed to print A in the conventional notation while keeping all the significant figures.

    Input Specification:

    Each input contains one test case. For each case, there is one line containing the real number A in scientific notation. The number is no more than 9999 bytes in length and the exponent's absolute value is no more than 9999.

    Output Specification:

    For each test case, print in one line the input number A in the conventional notation, with all the significant figures kept, including trailing zeros.

    Sample Input 1:

    +1.23400E-03
     

    Sample Output 1:

    0.00123400
     

    Sample Input 2:

    -1.2E+10
     

    Sample Output 2:

    -12000000000

    题解:找到E的位置,分别处理尾数和指数即可
    #include<bits/stdc++.h>
    using namespace std;
    
    int main(){
        string s,s1,s2;
        cin>>s;
        int pos;
        if(s[0]=='-'){
            printf("-");
            s.erase(s.begin());
        }
        else{
            s.erase(s.begin());
        }
        for(int i=0;i<s.length();i++){
            if(s[i]!='E'){
                s1+=s[i];
            }
            else{
                pos=i;
                s2=s.substr(i+1);
                break;
            }
        }
        
        int sum=0;
        for(int i=1;i<s2.length();i++){
            sum=sum*10+(s2[i]-'0');
        }
        if(sum==0){
            cout<<s1<<endl;
            return 0;
        }
        if(s2[0]=='+'){
            cout<<s1[0];
            if(s1.length()-2>sum){
                for(int i=2,j=1;i<s1.length();i++,j++){
                    if(j==sum){
                        printf("%c",s1[i]);
                        printf(".");
                    }
                    else{
                        printf("%c",s1[i]);
                    }
                }
                printf("
    ");
            }
            else{
                cout<<s1.substr(2);
                for(int i=0;i<sum-s1.length()+2;i++){
                    printf("0");
                }
                printf("
    ");
            }
        }
        else{
            printf("0.");
            for(int i=0;i<sum-1;i++){
                printf("0");
            }
            for(int i=0;i<s1.length();i++){
                if(s1[i]=='.'){
                    continue;
                }
                else{
                    printf("%c",s1[i]);
                }
            }
            printf("
    ");
        }
        return 0;
    }
    #include<bits/stdc++.h>
    using namespace std;
    
    int main(){
        string s,s1,s2;
        cin>>s;
        int pos;
        if(s[0]=='-'){
            printf("-");
            s.erase(s.begin());
        }
        else{
            s.erase(s.begin());
        }
        for(int i=0;i<s.length();i++){
            if(s[i]!='E'){
                s1+=s[i];
            }
            else{
                pos=i;
                s2=s.substr(i+1);
                break;
            }
        }
        
        int sum=0;
        for(int i=1;i<s2.length();i++){
            sum=sum*10+(s2[i]-'0');
        }
        if(sum==0){
            cout<<s1<<endl;
            return 0;
        }
        if(s2[0]=='+'){
            cout<<s1[0];
            if(s1.length()-2>sum){
                for(int i=2,j=1;i<s1.length();i++,j++){
                    if(j==sum){
                        printf("%c",s1[i]);
                        printf(".");
                    }
                    else{
                        printf("%c",s1[i]);
                    }
                }
                printf("
    ");
            }
            else{
                cout<<s1.substr(2);
                for(int i=0;i<sum-s1.length()+2;i++){
                    printf("0");
                }
                printf("
    ");
            }
        }
        else{
            printf("0.");
            for(int i=0;i<sum-1;i++){
                printf("0");
            }
            for(int i=0;i<s1.length();i++){
                if(s1[i]=='.'){
                    continue;
                }
                else{
                    printf("%c",s1[i]);
                }
            }
            printf("
    ");
        }
        return 0;
    }

    注:测试点2,3考察点:

    当指数与小数部分相等时,注意“.”,例如:+1.234E+03 ===> 1234(T) 1234.(F)

    易错数据:

    +3.1415E+004   //3.1415

    -3.1415926E+4    //-3.1415.926

    +3.1415926E-01   //0.31415926

    -3.1415926E-0005  //-0.000031415926

     
  • 相关阅读:
    selenium与表格的二三事
    ABP使用Mysql数据库
    Asp.net Mvc 使用EF6 code first 方式连接MySQL总结
    MVC后台数据赋值给前端JS对象
    Entity Framework 6 Code First 实践系列(1):实体类配置总结
    用git extensions clone项目时提示此主机的指纹不是由putty注册的解决办法
    AutoMapper5.0的用法
    StackExchange.Redis helper访问类封装
    Github上十大c#开源项目排行榜
    vs2015使用GIt连接git.oschina.net/
  • 原文地址:https://www.cnblogs.com/dreamzj/p/14995302.html
Copyright © 2011-2022 走看看