forked from sitz/UVa-Online-Judge
-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy path10875.cpp
135 lines (133 loc) · 2.19 KB
/
10875.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
#include <bits/stdc++.h>
using namespace std;
char B[6][1000], L[32768], E[250] = "0123456789+-*/";
char C[6][60] = {"000 .0. 000 000 0.0 000 0.. 000 000 000 .0. ... 0.0 .0. ",
"0.0 .0. ..0 ..0 0.0 0.. 0.. ..0 0.0 0.0 .0. ... 0.0 ... ",
"0.0 .0. 000 000 000 000 000 ..0 000 000 000 000 .0. 000 ",
"0.0 .0. 0.. ..0 ..0 ..0 0.0 ..0 0.0 ..0 .0. ... 0.0 ... ",
"000 .0. 000 000 ..0 000 000 ..0 000 ..0 .0. ... 0.0 .0. ",
""};
int S[100], ptr;
int main()
{
int i, j, k, hash, n, len;
len = strlen(C[0]);
for (n = 0; n < len; n += 4)
{
for (i = hash = 0; i < 5; i++)
{
for (j = 0; j < 3; j++)
{
hash <<= 1;
if (C[i][n + j] == '0')
{
hash |= 1;
}
}
}
L[hash] = E[n >> 2];
}
while (1)
{
for (i = 0; i < 6; i++)
{
gets(B[i]);
}
len = strlen(B[0]);
for (n = 0; n < len; n += 4)
{
for (i = hash = 0; i < 5; i++)
{
for (j = 0; j < 3; j++)
{
hash <<= 1;
if (B[i][n + j] == '0')
{
hash |= 1;
}
}
}
E[n >> 2] = L[hash];
}
n >>= 2;
E[n] = '\0';
if (strcmp(E, "0") == 0)
{
break;
}
S[0] = 0;
for (i = ptr = 0; E[i]; i++)
{
switch (E[i])
{
case '+':
S[++ptr] = -1, S[++ptr] = 0;
break;
case '-':
S[++ptr] = -2, S[++ptr] = 0;
break;
case '*':
S[++ptr] = -3, S[++ptr] = 0;
break;
case '/':
S[++ptr] = -4, S[++ptr] = 0;
break;
default:
S[ptr] = 10 * S[ptr] + E[i] - '0';
break;
}
}
for (i = 0, j = 1; j < ptr; j += 2)
{
switch (S[j])
{
case -3:
S[i] *= S[j + 1];
break;
case -4:
S[i] /= S[j + 1];
break;
default:
S[++i] = S[j], S[++i] = S[j + 1];
break;
}
}
for (j = 1; j < i; j += 2)
{
if (S[j] == -1)
{
S[0] += S[j + 1];
}
else
{
S[0] -= S[j + 1];
}
}
sprintf(E, "%d", S[0]);
for (ptr = 0; E[ptr]; ptr++)
{
if (E[ptr] == '-')
{
k = 44;
}
else
{
k = (E[ptr] - '0') * 4;
}
for (i = 0; i < 5; i++)
{
for (j = 0; j < 4; j++)
{
B[i][ptr * 4 + j] = C[i][k + j];
}
}
}
for (i = 0; i < 5; i++)
{
B[i][4 * ptr - 1] = '\0';
printf("%s\n", B[i]);
}
printf("\n");
}
return 0;
}