Codeforces Round #362 (Div. 2) B 模拟

B. Barnicle

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

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.

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, where A is a real number and B is an integer and x = A × 10^B is true. In our case A is between 0 and 9 and B is 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 e is usual character 'e' (0 ≤ a ≤ 9, 0 ≤ d < 10¹⁰⁰, 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

题意：x = A × 10B 将科学计数法 转为为普通实数  不能有前导零  不能有后置零  
 hack数据 
 0.0e0
 0 
 2.40000e2
 240

题解：模拟  注重细节处理 考虑要细致

 #include<bits/stdc++.h>
 #define ll __int64
 #define mod 1e9+7
 #define PI acos(-1.0)
 #define bug(x) printf("%%%%%%%%%%%%%",x);
 using namespace std;
 char a[];
 char b[];
 int main()
 {
     cin>>a;
     int len=strlen(a);
     int wei=;
     int flag;
     for(int i=;i<len;i++)//找到小数点
     {
         if(a[i]=='.')
             flag=i;
     }
     int gg=;
     int zha=;
     for(int j=len-;j>flag;j--)//进多少位
     {
         if(a[j]=='e')
           {
               a[j]='\0';
               break;
           }
         wei=wei+(a[j]-'')*gg;
         gg*=;
         a[j]='\0';
     }

      len=strlen(a);
     int weishu=len-(flag+);//现有小数位数
     if(wei==&&weishu==&&a[]=='')//特判数据
     {
         cout<<a[]<<endl;
         return ;
     }
     if(wei<weishu)
     {
         for(int j=flag;j<flag+wei;j++)
             a[j]=a[j+];
         a[flag+wei]='.';
     }
     if(wei==weishu)
     {
          for(int j=flag;j<flag+wei;j++)
             a[j]=a[j+];
             a[flag+wei]='\0';
     }
     if(wei>weishu)
     {
         for(int j=flag;j<flag+weishu;j++)
             a[j]=a[j+];
         for(int j=flag+weishu;j<flag+wei;j++)
             a[j]='';
         a[flag+wei]='\0';
     }
     int len1=strlen(a);
     int aaa=;
     int zzz=;
     if(wei<weishu)//去掉后置零
     {
         for(int j=len1-;j>;j--)
       {
         if(zzz)
         break;
         if(a[j]!='')
             zzz=;
         if(a[j]==''||a[j]=='.')
             a[j]='\0';

       }
     }
     for(int i=;i<len1;i++)//去掉前导零
     {
         if(a[i]!=''||a[i+]=='.')
             aaa=;
         if(aaa)
         {
             cout<<a[i];
         }
     }
     cout<<endl;
     return ;
 }