A kiválasztott változat és az aktuális verzió közötti különbségek a következők.
| — |
inf-prog-fszi:helyjegy [2017/06/19 10:30] (aktuális) beistvan létrehozva |
||
|---|---|---|---|
| Sor 1: | Sor 1: | ||
| + | ====== Helyjegy ====== | ||
| + | <code pascal helyjegy.pas> | ||
| + | program helyjegy; | ||
| + | type busz=record | ||
| + | | ||
| + | end; | ||
| + | var i, | ||
| + | utolso_szamjegy, | ||
| + | // | ||
| + | cs:busz; | ||
| + | t:text; | ||
| + | a, | ||
| + | felleszallas: | ||
| + | uleshely: | ||
| + | begin | ||
| + | //1.feladat | ||
| + | assign(t,' | ||
| + | reset(t); | ||
| + | readln(t, | ||
| + | i:=0; | ||
| + | while not eof(t) do | ||
| + | begin | ||
| + | inc(i); | ||
| + | readln(t, | ||
| + | end; | ||
| + | n:=i; | ||
| + | writeln(' | ||
| + | writeln(' | ||
| + | close(t); | ||
| + | //2.feladat | ||
| + | writeln(' | ||
| + | writeln(' | ||
| + | ', a tavolsag, amit utazott: ', | ||
| + | //3.fealadt | ||
| + | writeln(' | ||
| + | for i:=1 to n do | ||
| + | if (a[i].lesz-a[i].felsz)=vonhosz then write(i,' | ||
| + | writeln(); | ||
| + | //4.feladat | ||
| + | writeln(' | ||
| + | (*writeln(frac(5.9): | ||
| + | i:=1; | ||
| + | x: | ||
| + | writeln(' | ||
| + | x:=9995; | ||
| + | str(x,ert); | ||
| + | writeln(' | ||
| + | case ert[length(ert)] of | ||
| + | ' | ||
| + | ' | ||
| + | ' | ||
| + | | ||
| + | | ||
| + | | ||
| + | | ||
| + | end; | ||
| + | end; | ||
| + | val(ert, | ||
| + | osszeg: | ||
| + | writeln(' | ||
| + | x:=9999; | ||
| + | writeln(' | ||
| + | writeln(' | ||
| + | *) | ||
| + | osszeg:=0; | ||
| + | for i:=1 to n do begin | ||
| + | x: | ||
| + | if x mod 10 = 0 then x:=(x div 10 )*fiz else x:=(x div 10 +1)*fiz; //hiba??? | ||
| + | utolso_szamjegy: | ||
| + | case utolso_szamjegy of | ||
| + | 3,4,6,7: x:=x - utolso_szamjegy + 5; | ||
| + | 1,2: x:=x - utolso_szamjegy; | ||
| + | 8,9: x:=x - utolso_szamjegy + 10; | ||
| + | end; | ||
| + | // | ||
| + | osszeg: | ||
| + | end; | ||
| + | writeln(' | ||
| + | //5.feladat | ||
| + | writeln(' | ||
| + | b:=a; | ||
| + | for i:=1 to n-1 do | ||
| + | for j:=1 to n-i do | ||
| + | if b[j].felsz> | ||
| + | begin | ||
| + | | ||
| + | | ||
| + | | ||
| + | end; | ||
| + | //for i:=1 to n do | ||
| + | // writeln(b[i].hely,' | ||
| + | |||
| + | i:=n-1; | ||
| + | while (i> | ||
| + | dec(i); | ||
| + | felszallo: | ||
| + | writeln(' | ||
| + | leszallo: | ||
| + | for i:=1 to n do | ||
| + | if(b[i].lesz=b[n].felsz) then | ||
| + | inc(leszallo); | ||
| + | writeln(' | ||
| + | //6.feladat | ||
| + | writeln(' | ||
| + | for i:=1 to n do | ||
| + | begin | ||
| + | felleszallas[a[i].felsz]: | ||
| + | felleszallas[a[i].lesz]: | ||
| + | end; | ||
| + | megalloszam: | ||
| + | for i:=0 to 200 do | ||
| + | if felleszallas[i] then begin | ||
| + | write(i:4, ' '); | ||
| + | inc(megalloszam); | ||
| + | end; | ||
| + | writeln; | ||
| + | writeln(' | ||
| + | megalloszam-2); | ||
| + | //7.feladat | ||
| + | writeln(' | ||
| + | writeln(' | ||
| + | for i:=1 to n do | ||
| + | if (a[i].felsz< | ||
| + | uleshely[a[i].hely]: | ||
| + | assign(t,' | ||
| + | rewrite(t); | ||
| + | for i:=1 to 48 do | ||
| + | begin | ||
| + | write(t, | ||
| + | if uleshely[i]> | ||
| + | writeln(t, | ||
| + | else | ||
| + | writeln(t,' | ||
| + | end; | ||
| + | close(t); | ||
| + | writeln(' | ||
| + | readln; | ||
| + | end. | ||
| + | |||
| + | </ | ||