-
Notifications
You must be signed in to change notification settings - Fork 0
/
1060.cpp
167 lines (153 loc) · 2.28 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
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
#include <stdio.h>
#include <stdlib.h>
#define MAX_LENGTH 120
char A[MAX_LENGTH];
char B[MAX_LENGTH];
char stdA[MAX_LENGTH];
char stdB[MAX_LENGTH];
int N;
bool is_equal()
{
// 不用担心越界问题
int i;
for (i = 0; stdA[i] != '\0' && stdB[i] != '\0'; ++i)
{
if (stdA[i] != stdB[i])
{
return false;
}
}
if (stdA[i] != stdB[i])
{
return false;
}
return true;
}
void transform_std(const char *target, char *stdtar)
{
int first_nz_pos = -1;
int dot_pos = -1;
int i, j;
int length;
int k;
bool flag = false;
// 对全部输出相同的部分
stdtar[0] = '0';
stdtar[1] = '.';
// 找寻第一个非零的位置和小数点位置
for (length = 0; target[length] != '\0'; ++length)
{
if (-1 == first_nz_pos && '0' != target[length] && '.' != target[length])
{
first_nz_pos = length;
}
if (-1 == dot_pos && '.' == target[length])
{
dot_pos = length;
}
}
// 设定特殊情况下小数点位置
if (-1 == dot_pos)
{
dot_pos = length;
}
// 输入为0
if (-1 == first_nz_pos)
{
for (i = 2; i != 2+N; ++i)
{
stdtar[i] = '0';
}
stdtar[i++] = '*';
stdtar[i++] = '1';
stdtar[i++] = '0';
stdtar[i++] = '^';
stdtar[i++] = '0';
return ;
}
i = 2;
for (j = 0; j != N; ++j)
{
if (first_nz_pos+j == dot_pos)
{
flag = true;
}
if (!flag)
{
if (first_nz_pos+j < length)
{
stdtar[i++] = target[first_nz_pos+j];
}
else
{
stdtar[i++] = '0';
}
}
else
{
if (first_nz_pos+j+1 < length)
{
stdtar[i++] = target[first_nz_pos+j+1];
}
else
{
stdtar[i++] = '0';
}
}
}
stdtar[i++] = '*';
stdtar[i++] = '1';
stdtar[i++] = '0';
stdtar[i++] = '^';
// 确定指数k
if (dot_pos > first_nz_pos)
{
k = dot_pos - first_nz_pos;
}
else
{
k = dot_pos - first_nz_pos + 1;
}
if (k < 0)
{
stdtar[i++] = '-';
k = -k;
}
// k <= 100
flag = false;
if (0 != k/100)
{
stdtar[i++] = k/100 + '0';
k = k%100;
flag = true;
}
if (0 != k/10 || flag)
{
stdtar[i++] = k/10 + '0';
k = k%10;
flag = true;
}
stdtar[i++] = k + '0';
stdtar[i++] = '\0';
return ;
}
int main()
{
scanf("%d", &N);
scanf("%s", A);
scanf("%s", B);
transform_std(A, stdA);
transform_std(B, stdB);
if (is_equal())
{
printf("YES ");
printf("%s\n", stdA);
}
else
{
printf("NO ");
printf("%s %s\n", stdA, stdB);
}
system("pause");
return 0;
}