SHOW:
|
|
- or go back to the newest paste.
1 | - | const n=3;m=4; |
1 | + | const |
2 | - | type mas=array[1..n,1..m] of integer; |
2 | + | n=3; |
3 | - | var z,v,g:mas; f2:text; |
3 | + | m=4; |
4 | ||
5 | type | |
6 | mas=array[1..n,1..m] of integer; | |
7 | ||
8 | - | assign(f2,'laba6.txt'); |
8 | + | var |
9 | - | reset(f2); |
9 | + | z,v,g:mas; |
10 | - | for i:=1 to n do |
10 | + | f2:text; |
11 | ||
12 | - | for j:=1 to m do |
12 | + | |
13 | - | readln(f2,a[i,j]); |
13 | + | |
14 | - | readln(f2); |
14 | + | |
15 | assign(f2,'laba6.txt'); | |
16 | - | readln(f2); |
16 | + | reset(f2); |
17 | - | for i:=1 to n do |
17 | + | for i:=1 to n do |
18 | begin | |
19 | - | for j:=1 to m do |
19 | + | for j:=1 to m do |
20 | - | readln(f2,b[i,j]); |
20 | + | readln(f2,a[i,j]); |
21 | - | readln(f2); |
21 | + | readln(f2); |
22 | end; | |
23 | readln(f2); | |
24 | - | readln(f2); |
24 | + | for i:=1 to n do |
25 | - | for i:=1 to n do |
25 | + | begin |
26 | for j:=1 to m do | |
27 | - | for j:=1 to m do |
27 | + | readln(f2,b[i,j]); |
28 | - | readln(f2,c[i,j]); |
28 | + | readln(f2); |
29 | - | readln(f2); |
29 | + | end; |
30 | readln(f2); | |
31 | for i:=1 to n do | |
32 | begin | |
33 | for j:=1 to m do | |
34 | - | var i,j,ii,jj:integer; |
34 | + | readln(f2,c[i,j]); |
35 | - | f:boolean; |
35 | + | readln(f2); |
36 | end; | |
37 | - | f:=false; |
37 | + | |
38 | - | ii:=1; |
38 | + | |
39 | - | while (ii<=n)and(not f) do |
39 | + | |
40 | var | |
41 | - | jj:=1; |
41 | + | i,j,ii,jj:integer; |
42 | - | while (jj<=m)and(not f) do |
42 | + | f:boolean; |
43 | begin | |
44 | - | i:=1; |
44 | + | f:=false; |
45 | - | while (i<=n) do |
45 | + | ii:=1; |
46 | while (ii<=n)and(not f) do | |
47 | - | j:=1; |
47 | + | begin |
48 | - | while (j<=m) do |
48 | + | jj:=1; |
49 | while (jj<=m)and(not f) do | |
50 | - | if (x[ii,jj]=x[i,j])and((ii<>i)and(jj<>1)) then f:=true; |
50 | + | begin |
51 | - | inc(j) |
51 | + | i:=1; |
52 | while (i<=n) do | |
53 | - | inc(i) |
53 | + | begin |
54 | j:=1; | |
55 | - | inc(jj) |
55 | + | while (j<=m) do |
56 | begin | |
57 | - | inc(ii) |
57 | + | if (x[ii,jj]=x[i,j])and((ii<>i)and(jj<>1)) then f:=true; |
58 | inc(j) | |
59 | - | od:=f |
59 | + | end; |
60 | inc(i) | |
61 | end; | |
62 | inc(jj) | |
63 | - | vv(z,v,g); |
63 | + | end; |
64 | - | append(f2); |
64 | + | inc(ii) |
65 | - | writeln(f2,od(z)); |
65 | + | end; |
66 | od:=f | |
67 | - | writeln(f2,od(v)); |
67 | + | |
68 | ||
69 | - | writeln(f2,od(g)); |
69 | + | |
70 | - | close(f2); |
70 | + | vv(z,v,g); |
71 | append(f2); | |
72 | writeln(f2,od(z)); | |
73 | ||
74 | writeln(f2,od(v)); | |
75 | ||
76 | writeln(f2,od(g)); | |
77 | close(f2); | |
78 | end. |