A kiválasztott változat és az aktuális verzió közötti különbségek a következők.
— |
inf-prog-fszi:latin_tancok [2017/06/19 09:40] (aktuális) beistvan létrehozva |
||
---|---|---|---|
Sor 1: | Sor 1: | ||
+ | ====== Latin táncok ====== | ||
+ | <code pascal latintancok.pas> | ||
+ | program latintancok; | ||
+ | const m=140; | ||
+ | type latinos=record | ||
+ | | ||
+ | end; | ||
+ | var i, | ||
+ | tancnev{, | ||
+ | van: | ||
+ | vilma: | ||
+ | a:array [1..m] of latinos; | ||
+ | fiuindex, | ||
+ | lany, | ||
+ | t:text; | ||
+ | begin | ||
+ | Assign(t,' | ||
+ | reset(t); | ||
+ | i:=0; | ||
+ | while not eof(t) do | ||
+ | begin | ||
+ | inc(i); | ||
+ | readln(t, | ||
+ | readln(t, | ||
+ | readln(t, | ||
+ | end; | ||
+ | close(t); | ||
+ | n:=i; | ||
+ | writeln(' | ||
+ | writeln(' | ||
+ | writeln(' | ||
+ | writeln(' | ||
+ | writeln(a[1].tanc,',', | ||
+ | writeln(' | ||
+ | samba:=0; | ||
+ | for i:=1 to n do | ||
+ | if a[i].tanc=' | ||
+ | writeln(samba,' | ||
+ | writeln(' | ||
+ | writeln(' | ||
+ | for i:=1 to n do | ||
+ | if a[i].lany=' | ||
+ | writeln(' | ||
+ | van:=false; | ||
+ | readln(tancnev); | ||
+ | k:=0; | ||
+ | for i:=1 to n do | ||
+ | if (a[i].tanc=tancnev) and (a[i].lany=' | ||
+ | begin | ||
+ | inc(k); | ||
+ | vilma[k]: | ||
+ | van:=true; | ||
+ | end; | ||
+ | if van=false then writeln(' | ||
+ | for i:=1 to k do | ||
+ | writeln(a[vilma[i]].tanc,' | ||
+ | writeln(' | ||
+ | l:=1; | ||
+ | f:=1; | ||
+ | lany[l]: | ||
+ | fiu[f]: | ||
+ | for i:=2 to n do | ||
+ | begin | ||
+ | k:=1; | ||
+ | while (k< | ||
+ | inc(k); | ||
+ | |||
+ | if k>l then | ||
+ | begin | ||
+ | inc(l); | ||
+ | lany[l]: | ||
+ | end; | ||
+ | |||
+ | k:=1; | ||
+ | while (k< | ||
+ | inc(k); | ||
+ | |||
+ | if k>f then | ||
+ | begin | ||
+ | inc(f); | ||
+ | fiu[f]: | ||
+ | end; | ||
+ | |||
+ | end; | ||
+ | |||
+ | write(' | ||
+ | for i:=1 to l-1 do | ||
+ | write(lany[i],', | ||
+ | writeln(lany[l],' | ||
+ | |||
+ | write(' | ||
+ | for i:=1 to f-1 do | ||
+ | write(fiu[i],', | ||
+ | writeln(fiu[l],' | ||
+ | |||
+ | { | ||
+ | for i:=1 to n-1 do | ||
+ | begin | ||
+ | ref1: | ||
+ | ref2: | ||
+ | for j:=i+1 to n do | ||
+ | begin | ||
+ | if a[j].lany=ref1 then a[j].lany: | ||
+ | if a[j].fiu=ref2 then a[j].fiu: | ||
+ | end; | ||
+ | end; | ||
+ | |||
+ | writeln(' | ||
+ | |||
+ | for i:=1 to n do | ||
+ | if a[i].lany<>'' | ||
+ | write(a[i].lany,', | ||
+ | } | ||
+ | writeln(' | ||
+ | |||
+ | for i:=1 to n do | ||
+ | begin | ||
+ | j:=1; | ||
+ | while a[i].fiu<> | ||
+ | inc(j); | ||
+ | inc(fiuindex[j]); | ||
+ | j:=1; | ||
+ | while a[i].lany<> | ||
+ | inc(j); | ||
+ | inc(lanyindex[j]); | ||
+ | end; | ||
+ | |||
+ | {for i:=1 to f do | ||
+ | write(fiuindex[i],' | ||
+ | writeln;} | ||
+ | maxk: | ||
+ | for k:=2 to f do | ||
+ | if fiuindex[k]> | ||
+ | // | ||
+ | write(' | ||
+ | for k:=1 to f do | ||
+ | if fiuindex[k]=maxk then | ||
+ | write(fiu[k],' | ||
+ | writeln; | ||
+ | |||
+ | {for i:=1 to l do | ||
+ | write(lanyindex[i],' | ||
+ | writeln;} | ||
+ | maxk: | ||
+ | for k:=2 to l do | ||
+ | if lanyindex[k]> | ||
+ | // | ||
+ | write(' | ||
+ | for k:=1 to l do | ||
+ | if lanyindex[k]=maxk then | ||
+ | write(lany[k],' | ||
+ | |||
+ | readln; | ||
+ | end. | ||
+ | |||
+ | |||
+ | </ |