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
168
169
170
171
172
|
program slegpbte;
uses
iom,
sle,
typ;
const
c = 0;
d = 100;
e = 0;
f = 10;
var
l, i, p, q, n, term, ind, rw, vb, nvb: ArbInt;
ca: ArbFloat;
a: array[c..d] of ArbFloat;
b, x: array[e..f] of ArbFloat;
begin
Write(' program results slegpbte');
case sizeof(ArbFloat) of
4: writeln('(single)');
6: writeln('(real)');
8: writeln('(double)');
end;
Read(randseed);
writeln;
writeln(' randseed =', randseed: 6);
writeln;
Read(nvb);
writeln(' number of examples:', nvb: 3);
writeln;
for vb := 1 to nvb do
begin
writeln('example', vb: 2);
Read(p, q, n, l);
ind := p;
writeln;
writeln(' n=', n: 1, ' l=', l: 1);
for i := 1 to n do
begin
if i <= l + 1 then
rw := i
else
rw := l + 1;
iomrev(input, a[ind], rw);
ind := ind + rw;
end;
iomrev(input, b[q], n);
slegpb(n, l, a[p], b[q], x[q], ca, term);
ind := p;
writeln;
writeln(' left-under part of A = ');
writeln;
for i := 1 to n do
begin
if i <= l + 1 then
rw := i
else
begin
rw := l + 1;
Write('': (i - l - 1) * (numdig + 2));
end;
iomwrv(output, a[ind], rw, numdig);
ind := ind + rw;
end;
writeln;
writeln('b=');
iomwrv(output, b[q], n, numdig);
writeln;
writeln('term=', term: 2);
case term of
1:
begin
writeln;
writeln('x=');
iomwrv(output, x[q], n, numdig);
writeln;
writeln(' ca=', ca: 12);
end;
2: writeln('solution not possible');
3: writeln(' wrong input (l<0 or l>n-1)')
end;
writeln('---------------------------------------------');
end; {vb}
end.
program slegpbte;
uses
iom,
sle,
typ;
const
c = 0;
d = 100;
e = 0;
f = 10;
var
l, i, p, q, n, term, ind, rw, vb, nvb: ArbInt;
ca: ArbFloat;
a: array[c..d] of ArbFloat;
b, x: array[e..f] of ArbFloat;
begin
Write(' program results slegpbte');
case sizeof(ArbFloat) of
4: writeln('(single)');
6: writeln('(real)');
8: writeln('(double)');
end;
Read(randseed);
writeln;
writeln(' randseed =', randseed: 6);
writeln;
Read(nvb);
writeln(' number of examples:', nvb: 3);
writeln;
for vb := 1 to nvb do
begin
writeln('example', vb: 2);
Read(p, q, n, l);
ind := p;
writeln;
writeln(' n=', n: 1, ' l=', l: 1);
for i := 1 to n do
begin
if i <= l + 1 then
rw := i
else
rw := l + 1;
iomrev(input, a[ind], rw);
ind := ind + rw;
end;
iomrev(input, b[q], n);
slegpb(n, l, a[p], b[q], x[q], ca, term);
ind := p;
writeln;
writeln(' left-under part of A = ');
writeln;
for i := 1 to n do
begin
if i <= l + 1 then
rw := i
else
begin
rw := l + 1;
Write('': (i - l - 1) * (numdig + 2));
end;
iomwrv(output, a[ind], rw, numdig);
ind := ind + rw;
end;
writeln;
writeln('b=');
iomwrv(output, b[q], n, numdig);
writeln;
writeln('term=', term: 2);
case term of
1:
begin
writeln;
writeln('x=');
iomwrv(output, x[q], n, numdig);
writeln;
writeln(' ca=', ca: 12);
end;
2: writeln('solution not possible');
3: writeln(' wrong input (l<0 or l>n-1)')
end;
writeln('---------------------------------------------');
end; {vb}
end.
|
