Uses graphabc;
begin
line(300,100,600,100);
line(200,400,500,400);
line(500,400,600,100);
line(200,400,300,100);
//
line(700,250,583,150);
line(700,250,532,300);
//
circle(520,150,30);
circle(520,150,20);
//
line(300,300,350,300);
line(300,300,200,200);
line(200,200,200,150);
line(200,150,250,150);
line(250,150,400,200);
line(400,200,400,250);
line(400,250,350,300);
//
line(225,320,150,300);
line(225,320,150,350);
line(150,350,150,300);
//
floodfill(520,150,clblack);
floodfill(600,250,clblack);
floodfill(350,250,clblack);
floodfill(210,199,clblack);
floodfill(450,350,clgray);
floodfill(155,303,clblack);
end.
Program Jopascal;
Var
i, A: longint;
x,
u, j,
N, m : longint;
Function FDiv (A, left : LongInt) : LongInt;
var
d,
i : longint;
begin
d := 1;
for i := left to Trunc (Sqrt (A)) do
if (A mod i = 0)
then
begin
d := i;
Break;
end;
if (d <> 1)
then
FDiv := d
else
FDiv := A;
end;
Function g (N, u : longint) : longint;
var
i : longint;
begin
i := 0;
while (N mod u = 0)
do
begin
Inc (i);
N := N div u;
end;
g := i;
end;
Begin
Assign (Input, 'input.txt');
Assign (Output, 'output.txt');
Reset (Input);
Read (A);
Close (Input);
m := 0;
N := 1;
i := FDiv (A, 2);
u := 2;
while (A > 1)
do
begin
N := N * i;
j := 0;
while (A mod i = 0)
do
begin
Inc (j);
A := A div i;
end;
if (j > m)
then
begin
m := j;
u := i;
end;
i := FDiv (A, i + 2);
end;
x := 1;
while (g (N * x, u) * N * x < m)
do
Inc (x);
N := N * x;
ReWrite (Output);
Write (N);
Close (Output);
End.
Параграф почитай. Элементарно ж все... Во школьнки пошли