A kiválasztott változat és az aktuális verzió közötti különbségek a következők.
Előző változat mindkét oldalon Előző változat | |||
inf-prog-fszi:egymasba_agyazott_ciklusok [2017/06/20 12:31] beistvan |
inf-prog-fszi:egymasba_agyazott_ciklusok [2017/06/21 09:38] (aktuális) beistvan |
||
---|---|---|---|
Sor 108: | Sor 108: | ||
[[https://ideone.com/6Lk2ch]] | [[https://ideone.com/6Lk2ch]] | ||
+ | |||
+ | <code pascal matrixszorzas1.pas> | ||
+ | program matrixszorzas1; | ||
+ | const n = 3; | ||
+ | type tomb_tipus = array[1..n, 1..n] of integer; | ||
+ | procedure kiir(t: tomb_tipus; h: byte); | ||
+ | var i, j: integer; | ||
+ | begin | ||
+ | for i := 1 to n do begin | ||
+ | for j := 1 to n do | ||
+ | write(t[i,j]:h); | ||
+ | writeln; | ||
+ | end; | ||
+ | writeln; | ||
+ | end; | ||
+ | const a: tomb_tipus = ((1,2,4),(5,6,7),(8,9,1)); | ||
+ | b: tomb_tipus = ((2,3,6),(2,3,7),(1,3,0)); | ||
+ | var i, j, k: integer; c: tomb_tipus; | ||
+ | begin | ||
+ | kiir(a, 3); | ||
+ | kiir(b, 3); | ||
+ | for i := 1 to n do | ||
+ | for j := 1 to n do | ||
+ | for k := 1 to n do | ||
+ | c[i,j] := c[i,j] + a[i,k] * b[k,j]; | ||
+ | kiir(c, 4); | ||
+ | readln; | ||
+ | end. | ||
+ | |||
+ | </code> | ||
+ | |||
+ | <code pascal gotos_program.pas> | ||
+ | program gotos_program; | ||
+ | uses crt; | ||
+ | const n = 3; | ||
+ | type tomb_tipus = array[1..n,1..n] of byte; | ||
+ | procedure kiir(x,y:integer; t: tomb_tipus); | ||
+ | var i,j:integer; | ||
+ | begin | ||
+ | for i:=1 to 3 do | ||
+ | for j:=1 to 3 do | ||
+ | begin | ||
+ | gotoxy(x+3*j,y+i); | ||
+ | write(t[i,j]); | ||
+ | end; | ||
+ | end; | ||
+ | var i,j:integer; | ||
+ | const a: tomb_tipus = ((1,2,4),(5,6,7),(8,9,1)); | ||
+ | b: tomb_tipus = ((2,3,6),(2,3,7),(1,3,0)); | ||
+ | begin | ||
+ | kiir(1,1,a); | ||
+ | kiir(12,1,b); | ||
+ | for i:=1 to 3 do | ||
+ | for j:=1 to 5 do | ||
+ | kiir(j*11+1,i*5+1,b); | ||
+ | readln; | ||
+ | end. | ||
+ | |||
+ | </code> | ||
+ | |||
+ |