[字符串] PAT 1073. Scientific Notation 笔记

#include <iostream>
#include <algorithm>
#include <stdio.h>
#include <string>
#include <sstream>

using namespace std;
int main() {
    string s;
    stringstream ss;
    cin>>s;
    int h=0,q;
    while(h<s.size()&&s[h]!='E')h++;
    string subs = s.substr(1,h-1);
    string tails = s.substr(h+1);
    ss<<tails;
    ss>>q;
    subs.erase(1,1);
    int size = subs.size()-1;
    if(q>=0){
        if(q<size){
            subs.insert(q+1,".");
        }else if(q>size){
            int t = q-size;
            while(t--)subs+="0";
        }
    }else{
        while(q++)subs="0"+subs;
        subs.insert(1,".");
    }
    if(s[0]=='-')cout<<"-";
    cout<<subs;
    return 0;
}

柳神代码：

#include <iostream>
using namespace std;
int main() {
    string s;
    cin >> s;
    int i = 0;
    while (s[i] != 'E') i++;
    string t = s.substr(1, i-1);
    int n = stoi(s.substr(i+1));
    if (s[0] == '-') cout << "-";
    if (n < 0) {
        cout << "0.";
        for (int j = 0; j < abs(n) - 1; j++) cout << '0';
        for (int j = 0; j < t.length(); j++)
            if (t[j] != '.') cout << t[j];
    } else {
        cout << t[0];
        int cnt, j;
        for (j = 2, cnt = 0; j < t.length() && cnt < n; j++, cnt++) cout << t[j];
        if (j == t.length()) {
            for (int k = 0; k < n - cnt; k++) cout << '0';
        } else {
            cout << '.';
            for (int k = j; k < t.length(); k++) cout << t[k];
        }
    }
    return 0;
}

总结：ACM选手写的代码就是不一样，思路清晰，很少用封装好的库函数，显的简洁清晰