﻿PAT(A) 1073. Scientific Notation (20)-Ocrosoft

# PAT(A) 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 file 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
```

```#include <set>
#include <map>
#include <list>
#include <cmath>
#include <stack>
#include <queue>
#include <ctime>
#include <string>
#include <cstdio>
#include <vector>
#include <cctype>
#include <climits>
#include <sstream>
#include <cstring>
#include <cstdlib>
#include <iostream>
#include <algorithm>
#include <functional>
#define strend string::npos
#define ms(a) memset(a,0,sizeof(a))
#define rep(a,v,b) for(int a=v;a<b;a++)
#define repe(a,v,b) for(int a=v;a<=b;a++)
#define pre(a,v,b) for(int a=v;a>b;a--)
#define pree(a,v,b) for(int a=v;a>=b;a--)
#define lowbit(x) x&-x
typedef long long LL;
const LL LINF = LLONG_MAX / 2;
const int INF = INT_MAX / 2;
const int MAXN = 27 + 10;
const int MOD = 1000000007;
int gcd(int a, int b)
{
if (!b)return a;
return gcd(b, a%b);
}
/*(◕‿‿◕) (◕‿‿◕) (◕‿‿◕) (◕‿‿◕) (◕‿‿◕)*/
/*(◕‿‿◕) 跟我签订契约，成为马猴烧酒吧! (◕‿‿◕)*/
/*(◕‿‿◕) (◕‿‿◕) (◕‿‿◕) (◕‿‿◕) (◕‿‿◕)*/
using namespace std;
int main()
{
string s; cin >> s;
string ss;
for (int i = 1; i < s.size(); i++)
{
if (s[i] == '.'||s[i]=='E')continue;
if (s[i] == '+')
{
int ex = 0;
for (int j = i + 1; j < s.size(); j++)
ex = ex * 10 + (s[j] - '0');
if (ex - i + 4 < 0)
{
ss.insert(ss.begin() + 3, '.');
break;
}
for (int j = 0; j < ex-i+4; j++)
ss.push_back('0');
break;
}
if (s[i] == '-')
{
int ex = 0;
for (int j = i + 1; j < s.size(); j++)
ex = ex * 10 + (s[j] - '0');
for (int j = 0; j < ex - 1; j++)
ss.insert(ss.begin(), '0');
ss = "0." + ss;
break;
}
ss.push_back(s[i]);
}
if (s[0] == '+')cout << ss << endl;
else cout << "-" << ss << endl;
return 0;
}```