Codeforces697B Barnicle 模拟_barney is standing in a bar and starring at a pret-优快云博客

Barney is standing in a bar and starring at a pretty girl. He wants to shoot her with his heart arrow but he needs to know the distance between him and the girl to make his shot accurate.

$\text{[math]}$

Barney asked the bar tender Carl about this distance value, but Carl was so busy talking to the customers so he wrote the distance value (it's a real number) on a napkin. The problem is that he wrote it in scientific notation. The scientific notation of some real number x is the notation of form AeB, whereA is a real number and B is an integer and x = A × 10B is true. In our case A is between 0 and 9 and Bis non-negative.

Barney doesn't know anything about scientific notation (as well as anything scientific at all). So he asked you to tell him the distance value in usual decimal representation with minimal number of digits after the decimal point (and no decimal point if it is an integer). See the output format for better understanding.

Input

The first and only line of input contains a single string of form a.deb where a, d and b are integers and eis usual character 'e' (0 ≤ a ≤ 9, 0 ≤ d < 10100, 0 ≤ b ≤ 100) — the scientific notation of the desired distance value.

a and b contain no leading zeros and d contains no trailing zeros (but may be equal to 0). Also, b can not be non-zero if a is zero.

Output

Print the only real number x (the desired distance value) in the only line in its decimal notation.

Thus if x is an integer, print it's integer value without decimal part and decimal point and without leading zeroes.

Otherwise print x in a form of p.q such that p is an integer that have no leading zeroes (but may be equal to zero), and q is an integer that have no trailing zeroes (and may not be equal to zero).

Examples

input
8.549e2

output
854.9

input
8.549e3

output
8549

input
0.33e0

output
0.33
题意很简单，将一个数的科学记数法表达还原。简单模拟即可，不过有坑点，题中已作提示，即1.0e0,0.0e0这种数据也是存在的，对于这些数据，单独判断即可。




#include <iostream>
#include <cstdio>
#include <map>
#include <cmath>
#include <algorithm>
#include <cstring>
#include <string>
using namespace std;
#define LL long long
#define maxn 1000100
char b[505];
void f(int p,int q)
{
    int flag=1;
    for(int m=p;m<q;m++){
        if(b[m]!='0'){
            flag=0;
        }
        if(flag!=1||b[m]!='0'){
            printf("%c",b[m]);
        }
    }
}
void fff(int p,int q)
{
    for(int m=p;m<q;m++){
        printf("%c",b[m]);
    }
}
void ff(int n)
{
    while(n--){
        printf("0");
    }
}
void change(char *a)
{
    char c[200];
    char p;
    int l=strlen(a);
    p=a[0];
    int j=2;
    while(a[j]!='e'){
        b[j-2]=a[j];
        j++;
    }
    int ss=j-2;
    j++;
    int k=0;
    while(j<l){
        c[k++]=a[j];
        j++;
    }
    int t=0;
    int temp=1;
    for(int s=k-1;s>=0;s--){
        t+=temp*(c[s]-'0');
        temp*=10;
    }
    if(p=='0'){
        if(ss==1&&b[0]=='0'){
            printf("0\n");
        }else{
            if(t<ss){
                int flag=1,fa=1;
                for(int m=0;m<t;m++){
                    if(b[m]!='0'){
                        flag=0;
                    }
                    if(flag!=1||b[m]!='0'){
                        printf("%c",b[m]);
                        fa=0;
                    }
                }
                if(fa==1) printf("0");
                printf(".");
                fff(t,ss);
                printf("\n");
            }else{
                f(0,ss);
                ff(t-ss);
                printf("\n");
            }
        }
    }else{
        printf("%c",p);
        if(ss==1&&b[0]=='0'&&t==0){
            printf("\n");
        }else{
        if(t<ss){
            fff(0,t);
            printf(".");
            fff(t,ss);
            printf("\n");
        }else{
            fff(0,ss);
            ff(t-ss);
            printf("\n");
        }
        }
    }
}

int   main()
{
    char a[505];
    while(~scanf("%s",a)){
        change(a);
        memset(a,0,sizeof(a));
        memset(b,0,sizeof(b));
    }
    return   0;
}