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
| uses crt;
const n=1000;
type setbool=array[0..n-1] of boolean;
procedure Reading(var inff:text; var s:setbool);
var i:integer;
x:byte;
begin
assign(inff,paramstr(1));
reset(inff);
s:=[];
while not eof(inff) do
begin
read(inff,x);
s:=s+[x];
end;
end;
procedure Inclusion(var z:setbool; r:byte);
begin
z[r]:=true;
end;
procedure Nulling(var z:setbool);
var i:integer;
begin
for i:=0 to n-1 do
z[i]:=false;
end;
procedure Union(var x,y,z:setbool);
var i:integer;
begin
for i:=0 to n-1 do
z[i]:=x[i] or y[i];
end;
procedure Intersection(var x,y,z:setbool);
var i:integer;
begin
for i:=0 to n-1 do
z[i]:=x[i] and y[i];
end;
procedure Difference(var x,y,z:setbool);
var i:integer;
begin
for i:=0 to n-1 do
z[i]:=x[i] and (not y[i]);
end;
procedure SymmetricDifference(var x,y,z:setbool);
var i:integer;
begin
for i:=0 to n-1 do
z[i]:=x[i] xor y[i];
end;
procedure Outputing(var outf:text; s:setbool);
var i:integer;
begin
for i:=0 to n-1 do
if s[i] then writeln(outf,i);
end;
var a,b,c:setbool;
f,ff:text;
g:integer;
begin
randomize;
reading(ff,c);
assign(f,paramstr(2));
rewrite(f);
nulling(a);
nulling(b);
for g:=1 to n do
Inclusion(a,random(n));
for g:=1 to n do
Inclusion(b,random(n));
writeln;
Union(a,b,c);
Outputing(f,c);
writeln(f);
Intersection(a,b,c);
Outputing(f,c);
writeln(f);
Difference(a,b,c);
Outputing(f,c);
writeln(f);
SymmetricDifference(a,b,c);
Outputing(f,c);
writeln(f);
close(f);
end. |
(
