-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path1060.cpp
101 lines (101 loc) · 1.16 KB
/
1060.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
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
#include<stdio.h>
#include<string.h>
class Number{
public:
char a[120];
char b[120];
int count;
int k;
void process()
{
count=0;
k=0;
int i=0;
for(i=0;i<120;i++)
b[i]='0';
i=0;
while(a[i]=='0')
{
i++;
}
while(a[i]!='.' && a[i]!='\0')
{
b[count]=a[i];
count++;
k++;
i++;
}
if(a[i]=='.')
i++;
else
return;
if(k != 0 )
{
while(a[i]!='\0')
{
b[count]=a[i];
count++;
i++;
}
}
else
{
while(a[i]=='0' && a[i]!='\0')
{
i++;
k--;
}
if(a[i]=='\0')
{
//0.0 case
k=0;
return;
}
while(a[i]!='\0')
{
b[count]=a[i];
count++;
i++;
}
}
}
bool equal(int n, Number & right)
{
if(k != right.k)
return false;
int i=0;
for(i=0;i<n;i++)
if(b[i]!=right.b[i])
return false;
return true;
}
void show(int n)
{
int i;
printf("0.");
for(i=0;i<n;i++)
printf("%c",b[i]);
printf("*10^%d",k);
}
};
int main()
{
int n;
Number a,b;
scanf("%d%s%s",&n,a.a,b.a);
a.process();
b.process();
if(a.equal(n,b) == true)
{
printf("YES ");
a.show(n);
}
else
{
printf("NO ");
a.show(n);
printf(" ");
b.show(n);
}
return 0;
}