(№ 1328) 1
(№ 1327) -45
Объяснение:
(№ 1328) 1010101_2 - 201_8 + 2D_16
1010101_2 = 1 * 2^6 + 0 * 2^5 + 1 * 2^4 + 0 * 2^3 + 1 * 2^2 + 0 * 2^2 + 1 * 2^0 = 64 + 0 + 16 + 0 + 4 + 0 + 1 = 85_10
201_8 = 2 * 8^2 + 0 * 8^1 + 1 * 8^0 = 128 + 0 + 1 = 129_10
2D_16 = 2 * 16^1 + 13 * 16^0 =32 + 13 = 45_10
85 - 129 + 45 = 1
(№ 1327) 1001101_2 - 261_8 + 37_16
1001101_2 = 1 * 2^6 + 0 * 2^5 + 0 * 2^4 + 1 * 2^3 + 1 * 2^2 + 0 * 2^2 + 1 * 2^0 = 64 + 0 + 0 + 8 + 4 + 0 + 1 = 77_10
261_8 = 2 * 8^2 + 6 * 8^1 + 1 * 8^0 = 128 + 48 + 1 = 177_10
37_16 = 3 * 16^1 + 7 * 16^0 = 48 + 7 = 55_10
77 - 177 + 55 = -45
// 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.
