PAT(A)1060 Are They Equal (25分)(模拟)

Sample Input

3 12300 12358.9

Sample Output

YES 0.123*10^5

思路：
这题模拟的情况式真的多！！！
小数
前导0
负指数
简直了。
代码

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
#define endl '\n'

int n;
string a, b;

int main()
{
    cin >> n >> a >> b;

    int f = 0;
    int i = 0, j = 0;
    int anum = 0, bnum = 0;
    int cnt = 0;

    while (a[0] == '0' && a.size() > 0)
        a.erase(a.begin());
    while (b[0] == '0' && b.size() > 0)
        b.erase(b.begin());
        
    string x = "0.";
    string y = "0.";

    while (cnt < n)
    {
        if (a[i] == '.')
        {
            i++;
            continue;
        }
        cnt++;
        if (i < a.size())
            x += a[i++];
        else
            x += '0';
    }
    cnt = 0;
    while (cnt < n)
    {
        if (b[j] == '.')
        {
            j++;
            continue;
        }
        cnt++;
        if (j < b.size())
            y += b[j++];
        else
            y += '0';
    }
    for (int k = 0; k < a.size(); ++k)
    {
        if (a[k] == '.')
            break;
        anum++;
    }
    if (a[0] == '.')
    {
        int nnn = 0;
        for (int k = 1; k < a.size(); ++k)
        {
            if (a[k] == '0')
                anum--;
            else
            {
                nnn = k;
                break;
            }
        }
        if (!nnn) anum = 0;
        x = "0.";
        cnt = 0;
        while (cnt < n)
        {
            if (a[nnn] == '.')
            {
                nnn++;
                continue;
            }
            cnt++;
            if (nnn < a.size())
                x += a[nnn++];
            else
                x += '0';
        }
    }
    for (int k = 0; k < b.size(); ++k)
    {
        if (b[k] == '.')
            break;
        bnum++;
    }
    if (b[0] == '.')
    {
        int nn = 0;
        for (int k = 1; k < b.size(); ++k)
        {
            if (b[k] == '0')
                bnum--;
            else
            {
                nn = k;
                break;
            }
        }
        if (!nn) bnum = 0;
        y = "0.";
        cnt = 0;
        while (cnt < n)
        {
            if (b[nn] == '.')
            {
                nn++;
                continue;
            }
            cnt++;
            if (nn < b.size())
                y += b[nn++];
            else
                y += '0';
        }
    }
    x += "*10^";
    y += "*10^";

    // cout << y << endl;

    if (x != y)
        f = 1;

    if (!f)
    {
        cout << "YES" << " ";
        cout << x << anum;
    }
    else
    {
        cout << "NO ";
        cout << x << anum << " ";
        cout << y << bnum;
    }

    return 0;
}