SHOW:
|
|
- or go back to the newest paste.
| 1 | Program AddNums(output); | |
| 2 | var i,j,k,M,N, pocet:integer; | |
| 3 | var Q: boolean; | |
| 4 | A: array [1..4] of integer; | |
| 5 | B: array [1..3] of integer; | |
| 6 | C: array [1..10] of integer; | |
| 7 | begin | |
| 8 | ||
| 9 | A[1]:=1; | |
| 10 | A[2]:=4; | |
| 11 | A[3]:=6; | |
| 12 | A[4]:=8; | |
| 13 | ||
| 14 | B[1]:=2; | |
| 15 | B[2]:=3; | |
| 16 | B[3]:=8; | |
| 17 | ||
| 18 | M:=3; | |
| 19 | N:=4; | |
| 20 | pocet:= 0; | |
| 21 | ||
| 22 | ||
| 23 | i:=0; | |
| 24 | j:=0; | |
| 25 | k:=1; | |
| 26 | Q:= False; | |
| 27 | repeat begin | |
| 28 | i:=i+1; | |
| 29 | j:=0; | |
| 30 | repeat j:= j+1; | |
| 31 | if A[i] = B[j] then Q:=True; | |
| 32 | until j=M; | |
| 33 | end; | |
| 34 | ||
| 35 | if Q=False then begin C[k]:=A[i]; | |
| 36 | k:=k+1; | |
| 37 | end; | |
| 38 | pocet:=k-1; | |
| 39 | until i=N; | |
| 40 | k:=0; | |
| 41 | repeat k:=k+1; | |
| 42 | writeln(C[k]); | |
| 43 | until k=pocet; | |
| 44 | ||
| 45 | ||
| 46 | end. |
