Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- uses crt;
- var
- a:array[1..100000000] of longint;
- i,n,c:longint;
- function priNum(x:longint):boolean;
- var
- i:longint;
- tmp:boolean;
- begin
- tmp:=true;
- if x=1 then tmp:=false
- else
- for i:=2 to x div 2 do
- if x mod i = 0 then tmp:=false;
- priNum:=tmp;
- end;
- function divNum(x,c:longint):boolean;
- var
- i:longint;
- tmp:boolean;
- begin
- tmp:=false;
- for i:=c-1 downto 1 do
- if a[i] mod x = 0 then
- tmp:=true;
- divNum:=tmp;
- end;
- procedure solve();
- begin
- write(n,' ');
- a[1]:=n;
- c:=2;
- for i:=n-1 downto 1 do
- if (priNum(i) or divNum(i,c)) then
- begin
- write(i,' ');
- a[c]:=i;
- inc(c);
- end;
- end;
- begin
- clrscr();
- readln(n);
- solve();
- readln();
- end.
Advertisement
Add Comment
Please, Sign In to add comment