1.
program ll1;
var A: array[1..20] of integer;
i: integer;
begin
Randomize;
for i:=1 to 20 do
begin
A[i]:=random();
if A[i] mod 2 = 0 then writeln(A[i]);
end;
end.
2 .
program ll1;
const N = 20;
var A: array[1..20, 1..20] of integer;
i, j, k: integer;
begin
for i:=1 to N do
for j:=1 to N do
begin
readln(A[i, j]);
if (A[i, j] >= 0) and (A[i, j] < 10) then
k:=k+1;
end;
writeln(k);
end.
3.
program ll1;
var A: array[1..20] of integer;
k, x, y: integer;
begin
Randomize;
readln(x);
readln(y);
for k:=1 to 20 do
begin
A[k]:=random();
if A[k] >= 0 then
A[k]:=x;
else
A[k]:=y;
end;
end.
// PascalABC.NET 3.6.3
uses School;
function Divizors(n: integer): List<integer>;
begin
var L := new List<integer>;
L.Add(1);
L.Add(n);
if n > 3 then
begin
var k := 2;
while (k * k <= n) and (k < 46341) do
begin
if n mod k = 0 then
begin
var t := n div k;
L.Add(k);
if k < t then L.Add(t)
else break
end;
Inc(k)
end;
L.Sort;
end;
Result := L
end;
begin
// 1
if ReadInteger.IsPrime then Println('YES')
else Println('NO');
// 2
ReadInteger.Factorize.First.Println;
// 3
var a := Divizors(ReadInteger);
Print(a.Count, a.Sum)
end.