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
|
/*
* This code is based on the original source code of Lord Avalot d'Argent version 1.3.
* Copyright (c) 1994-1995 Mike, Mark and Thomas Thurman.
*/
/* regname's name starts at $7D1 (2001). */
const array<1,56,char> padding =
"For all the Etruscan armies were ranged beneath his eye";
text txi,txo;
string x,y;
word fv;
file<byte> f;
byte sum,n;
string name,number;
string chkname,chknum,regname,regnum;
char decode1(char c)
{
byte b;
char decode1_result;
b=ord(c)-32;
decode1_result=chr(( (b & 0xf) << 3) + ((cardinal)(b & 0x70) >> 4));
return decode1_result;
}
char encode1(char c)
{
byte b;
char encode1_result;
b=ord(c);
b=( (cardinal)(b & 0x78) >> 3) + ((b & 0x7) << 4);
encode1_result=chr(b+32);
return encode1_result;
}
char encode2(char c)
{
char encode2_result;
encode2_result=chr((((ord(c) & 0xf) << 2)+0x43));
return encode2_result;
}
string enc1(string x)
{
string y; byte fv;
string enc1_result;
y=x; for( fv=1; fv <= length(y); fv ++) y[fv]=encode1(y[fv]);
enc1_result=y;
return enc1_result;
}
string enc2(string x)
{
string y; byte fv;
string enc2_result;
y=x; for( fv=1; fv <= length(y); fv ++) y[fv]=encode2(y[fv]);
enc2_result=y;
return enc2_result;
}
boolean checker(string proper,string check)
{
byte fv; boolean ok;
boolean checker_result;
ok=true;
for( fv=1; fv <= length(proper); fv ++)
if ((ord(proper[fv]) & 0xf)!=((cardinal)(ord(check[fv])-0x43) >> 2))
ok=false;
checker_result=ok;
return checker_result;
}
void unscramble()
{
byte namelen,numlen;
namelen=107-ord(x[1]); numlen=107-ord(x[2]);
regname=copy(x,3,namelen);
regnum=copy(x,4+namelen,numlen);
chkname=copy(x,4+namelen+numlen,namelen);
chknum=copy(x,4+namelen+numlen+namelen,numlen);
for( fv=1; fv <= namelen; fv ++) regname[fv]=decode1(regname[fv]);
for( fv=1; fv <= numlen; fv ++) regnum[fv]=decode1(regnum[fv]);
if ((! checker(regname,chkname)) || (! checker(regnum,chknum)))
{
output << "CHECK ERROR: " << regname << '/' << chkname << ';' << regnum << '/' << chknum << '.' << NL;
exit(0);
} else output << "--- Passed both checks. ---" << NL;
}
int main(int argc, const char* argv[])
{
pio_initialize(argc, argv);
output << "Name? "; input >> name >> NL;
output << "Number? "; input >> number >> NL;
x=string(chr(107-ord(name[0])))+chr(107-ord(number[0]));
x=x+enc1(name)+'J'+enc1(number)+enc2(name)+enc2(number);
number=""; fv=1;
while ((length(number)+length(x))<57)
{
number=number+padding[fv-1]; fv=fv+1;
}
x=x+enc1(number);
output << x << NL; output << NL;
unscramble();
assign(txi,"v:register.raw"); reset(txi);
assign(txo,"a:register.dat"); rewrite(txo);
for( fv=1; fv <= 53; fv ++)
{
txi >> y >> NL; txo << y << NL;
}
txi >> y >> NL; txo << x << NL;
while (! eof(txi))
{
txi >> y >> NL; txo << y << NL;
}
close(txi); close(txo);
return EXIT_SUCCESS;
}
|
