[10] type qq=record
[11] m:longint;
[12] s:byte;
[13] t:longint;
[14] end;
[15] type q=array [1..100000] of qq;
[18]
[19] function prov(f,g:qq):boolean;
[20] begin
[21] prov:=false;
[22] if f.s>g.s then prov:=true;
[23] if f.s=g.s then
[24] if f.t<g.t then prov:=true
[25] else
[26] if f.t=g.t then
[27] if f.m<g.m then prov:=true;
[28] end;
|
[10] type Team=record
[11] id:longint;
[12] solved:byte;
[13] penalty:longint;
[14] end;
[15] type Teams=array [1..100000] of Team;
[18]
[19] function less(var A,B:Team):boolean;
[20] begin
less:= (A.solved>B.solved)
or (A.solved=B.solved) and (A.penalty<B.penalty)
or (A.solved=B.solved) and (A.penalty=B.penalty) and (A.id<B.id);
[28] end;
|
[1] var
[2] n: longint;
[3] function IsPrime(n: longint): boolean;
[4] var
[5] result: boolean;
[6] i: longint;
[7] begin
[8] result:=true;
[9] for i:=2 to round(sqrt(n)) do
[10] if n mod i=0 then begin
[11] result:=false;
[12] break;
[13] end;
[14] if result<>false then result:=true;
[15] isprime:=result;
[16] end;
[17] begin
[18] assign(input,'prime.in');
[19] assign(output, 'prime.out');
[20] reset(input);
[21] rewrite(output);
[22] read(n);
[23] if IsPrime(n)=false then write('composite') else write('prime');
[24] close(input);
[25] close(output);
[26] end.
|
[1] var
[2] n: longint;
[3] function IsPrime(n: longint): boolean;
[4] var
[5] result: boolean;
[6] i: longint;
[7] begin
[8] result:=true;
[9] for i:=2 to round(sqrt(n)) do
[10] if n mod i=0 then
begin
[11] result:=false;
[12] break;
[13] end;
[14] if result<>false then
result:=true;
[15] isprime:=result;
[16] end;
[17] begin
[18] assign(input,'prime.in');
[19] assign(output, 'prime.out');
[20] reset(input);
[21] rewrite(output);
[22] read(n);
[23] if IsPrime(n)=false then
write('composite')
else
write('prime');
[24] close(input);
[25] close(output);
[26] end.
|