A kiválasztott változat és az aktuális verzió közötti különbségek a következők.
|
inf-prog-fszi:tesztverseny [2017/06/23 11:58] beistvan létrehozva |
inf-prog-fszi:tesztverseny [2017/06/23 16:58] (aktuális) beistvan |
||
|---|---|---|---|
| Sor 1: | Sor 1: | ||
| + | <code pascal tesztverseny.pas> | ||
| + | program tesztverseny; | ||
| + | const valaszok_max = 500; | ||
| + | type | ||
| + | valasz = record | ||
| + | kod: string[5]; | ||
| + | felelet: | ||
| + | pont: byte; | ||
| + | end; | ||
| + | var | ||
| + | a: | ||
| + | i, | ||
| + | helyes_felelet: | ||
| + | versenyzo_id: | ||
| + | versenyzo_valasz: | ||
| + | csak_helyes_valasz: | ||
| + | feladat_sorszama: | ||
| + | db_helyes: word; | ||
| + | pontszam, pont: byte; | ||
| + | cs: valasz; | ||
| + | f: text; | ||
| + | begin | ||
| + | //1. feladat | ||
| + | write(' | ||
| + | assign(f, ' | ||
| + | reset(f); | ||
| + | readln(f, | ||
| + | // | ||
| + | i:=0; | ||
| + | while not eof(f) do | ||
| + | begin | ||
| + | i:=i+1; | ||
| + | readln(f, sor); | ||
| + | a[i].kod: | ||
| + | a[i].felelet: | ||
| + | // | ||
| + | end; | ||
| + | n:=i; | ||
| + | writeln(' | ||
| + | writeln; | ||
| + | close(f); | ||
| + | //2. feladat | ||
| + | write(' | ||
| + | writeln(' | ||
| + | writeln; | ||
| + | //3. feladat | ||
| + | write(' | ||
| + | write(' | ||
| + | readln(versenyzo_id); | ||
| + | //a versenyzo keresese | ||
| + | i:=1; | ||
| + | while (i< | ||
| + | inc(i); | ||
| + | if i<=n then | ||
| + | versenyzo_valasz: | ||
| + | writeln(versenyzo_valasz, | ||
| + | writeln; | ||
| + | //4. feladat | ||
| + | writeln(' | ||
| + | writeln(helyes_felelet, | ||
| + | csak_helyes_valasz: | ||
| + | for i:=1 to length(helyes_felelet) do | ||
| + | if helyes_felelet[i] = versenyzo_valasz[i] then | ||
| + | csak_helyes_valasz[i]: | ||
| + | else | ||
| + | csak_helyes_valasz[i]: | ||
| + | writeln(csak_helyes_valasz, | ||
| + | writeln; | ||
| + | //5. feladat | ||
| + | write(' | ||
| + | write(' | ||
| + | readln(feladat_sorszama); | ||
| + | db_helyes: | ||
| + | for i:=1 to n do | ||
| + | if a[i].felelet[feladat_sorszama]=helyes_felelet[feladat_sorszama] | ||
| + | then | ||
| + | inc(db_helyes); | ||
| + | writeln(' | ||
| + | db_helyes/ | ||
| + | writeln; | ||
| + | //6. feladat | ||
| + | writeln(' | ||
| + | assign(f,' | ||
| + | rewrite(f); | ||
| + | for i:=1 to n do | ||
| + | begin | ||
| + | pontszam: | ||
| + | for j:=1 to length(helyes_felelet) do | ||
| + | if helyes_felelet[j] = a[i].felelet[j] then | ||
| + | begin | ||
| + | case j of | ||
| + | 1..5 : pont:=3; | ||
| + | 6..10 : pont:=4; | ||
| + | 11..13: pont:=5; | ||
| + | 14 : pont:=6; | ||
| + | end; | ||
| + | pontszam := pontszam + pont; | ||
| + | a[i].pont: | ||
| + | end; | ||
| + | writeln(f, | ||
| + | // | ||
| + | end; | ||
| + | close(f); | ||
| + | writeln; | ||
| + | //7. feladat | ||
| + | writeln(' | ||
| + | for i:=1 to n-1 do | ||
| + | for j:=i+1 to n do | ||
| + | if a[i].pont< | ||
| + | begin | ||
| + | cs:=a[i]; | ||
| + | a[i]:=a[j]; | ||
| + | a[j]:=cs; | ||
| + | end; | ||
| + | i:=1; | ||
| + | k:=1; | ||
| + | while (k< | ||
| + | begin | ||
| + | j:=i; | ||
| + | while a[i].pont=a[j].pont do | ||
| + | begin | ||
| + | writeln(k,' | ||
| + | j:=j+1; | ||
| + | end; | ||
| + | inc(k); | ||
| + | i:=j; | ||
| + | end; | ||
| + | readln; | ||
| + | end. | ||
| + | |||
| + | |||
| + | </ | ||