-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path1060 Are They Equal.cpp
56 lines (56 loc) · 1.06 KB
/
1060 Are They Equal.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
# include <iostream>
# include <functional>
# include <vector>
# include <algorithm>
#include<math.h>
#include<string>
#include<cstring>
#include<iterator>
#include<iomanip>
#include<numeric>
#include<map>
#include<unordered_map>
#include<set>
#include<limits.h>
#include<queue>
#include<stack>
using namespace std;
int n;
bool allzero(string &s) {
for (auto &c : s) {
if (c != '.' && c != '0') return false;
}
return true;
}
int trans(string & s) {
string rv = "0.";
if (allzero(s)) {
rv += string(n, '0');
s = rv;
return 0;
}
int dotpos = 0, f, ct = 0, i = 0;
while (dotpos < s.size() && s[dotpos] != '.')++dotpos;
while (s[i]=='.' || s[i] == '0') ++i;
f = dotpos - i;
if (f < 0) f++;
for (; ct < n && i < s.size(); ++i) {
if (s[i] != '.') {
rv.push_back(s[i]);
ct++;
}
}
s = rv;
return f;
}
int main()
{
string s1, s2;
cin >> n >> s1 >> s2;
int f1, f2;
f1 = trans(s1);
f2 = trans(s2);
if (s1 == s2 && f1 == f2) cout << "YES" << ' ' << s1 << "*10^" << f1;
else cout << "NO" << ' ' << s1 << "*10^" << f1 << ' ' << s2 << "*10^" << f2;
return 0;
}