Barnicle【Codeforces 697 B】【模拟科学计数法】

Codeforces Round #362 (Div. 2) B

---

  就是给你一个科学计数法，让你转换成为一般的数。

注意一点，0.001000e1 = 0.01这类的细节，其他倒是没什么了。

#include <iostream>
#include <cstdio>
#include <cmath>
#include <string>
#include <cstring>
#include <algorithm>
#include <limits>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#define lowbit(x) ( x&(-x) )
#define pi 3.141592653589793
#define e 2.718281828459045
#define INF 0x3f3f3f3f
#define HalF (l + r)>>1
#define lsn rt<<1
#define rsn rt<<1|1
#define Lson lsn, l, mid
#define Rson rsn, mid+1, r
#define QL Lson, ql, qr
#define QR Rson, ql, qr
#define myself rt, l, r
using namespace std;
typedef unsigned long long ull;
typedef unsigned int uit;
typedef long long ll;
int a, b, lend = 0;
char d[105], s;
int main()
{
    scanf("%d.", &a);
    while(s = getchar())
    {
        if(s == 'e') break;
        d[lend++] = s;
    }
    while(lend > 0 && d[lend-1] == '0') { lend--; d[lend] = '\0'; }
    scanf("%d", &b);
//    printf("%d\n%s\n%d\n", a, d, b);
    if(a == 0)
    {
        int real=0;
        while(d[real] == '0' && real < lend) real++;
        if(real == lend) { printf("0\n"); return 0; }
        if(real + 1 <= b)
        {
            for(int i=real; i<min(lend, b); i++) printf("%c", d[i]);
            if(b >= lend) for(int i=1; i<=b-lend; i++) printf("0");
            else
            {
                printf(".");
                for(int i=b; i<lend; i++) printf("%c", d[i]);
            }
            puts("");
        }
        else
        {
            printf("0.");
            for(int i=1; i<=real - b; i++) printf("0");
            for(int i=real; i<lend; i++) printf("%c", d[i]);
            printf("\n");
        }
    }
    else
    {
        if(lend <= b)
        {
            printf("%d", a);
            printf("%s", d);
            int tmp = b - lend;
            while(tmp--) printf("0");
            printf("\n");
        }
        else
        {
            printf("%d", a);
            for(int i=0; i<b; i++) printf("%c", d[i]);
            printf(".");
            for(int i=b; i<lend; i++) printf("%c", d[i]);
            printf("\n");
        }
    }
    return 0;
}