Function prime(x:integer):boolean; var t:boolean; d:integer; begin t := true; d := 2; while t and (d*d <= x) do begin if x mod d = 0 then t := false; d := d + 1 end; prime := t end;
function order(x:integer):boolean; var t:boolean; d:integer; begin d := -1; repeat t := x mod 10 > d; d := x mod 10; x := x div 10 until not t or (x = 0); order := t end;
var t:boolean; i,k,n:integer; begin t := false; read(k,n); for i := k to n do if prime(i) then if order(i) then begin write(i,' '); t := true end; if not t then write(0) end.
1Мб = 1024Кб ; 1/512 от 1024 = 2Кб*1024 = 2048Байт*8=16384бит
N = 2^i ; M = K*i ; i = M/K ; M = 16384бит ; K = 2048 ;
i = 16384/2048 = 8 бит - обьем одного символа
N = 2^8 = 256