1010111₂ = 127₈
4576₈ = 2430₁₀
16AC₁₆ = 1011010101100₂
11101₂ * 110₂ = 10101110₂
1011110₂ - 101₂ = 1011001₂
1001₂ + 1010₂ = 10011₂
Объяснение:
1010111₂ = 1*2⁰ + 1*2¹ + 1*2² + 0*2³ + 1*2⁴ + 0*2⁵ + 1*2⁶ = 87₁₀
87₁₀ = 7*8⁰ + 2*8¹ + 1*8² = 127₈
4576₈ = 6*8⁰ + 7*8¹ + 5*8² + 4*8³ = 2430₁₀
16AC₁₆ = C*16⁰ + A*16¹ + 6*16² + 1*16³ = 5804₁₀
5804₁₀ = 0*2⁰ + 0*2¹ + 1*2² + 1*2³ + 0*2⁴ + 1*2⁵ + 0*2⁶ + 1*2⁷ + 0*2⁸ + 1*2⁹ + 1*2¹⁰ + 0*2¹¹ + 1*2¹² = 1011010101100₂
11101₂ = 1*2⁰ + 0*2¹ + 1*2² + 1*2³ + 1*2⁴ = 29₁₀
110₂ = 0*2⁰ + 1*2¹ + 1*2² = 6₁₀
174₁₀ = 0*2⁰ + 1*2¹ + 1*2² + 1*2³ + 0*2⁴ + 1*2⁵ + 0*2⁶ + 1*2⁷ = 10101110₂
1011110₂ = 0*2⁰ + 1*2¹ + 1*2² + 1*2³ + 1*2⁴ + 0*2⁵ + 1*2⁶ = 94₁₀
101₂ = 1*2⁰ + 0*2¹ + 1*2² = 5₁₀
89₁₀ = 1*2⁰ + 0*2¹ + 0*2² + 1*2³ + 1*2⁴ + 0*2⁵ + 1*2⁶ = 1011001₂
1001₂ = 1*2⁰ + 0*2¹ + 0*2² + 1*2³ = 9₁₀
1010₂ = 0*2⁰ + 1*2¹ + 0*2² + 1*2³ = 10₁₀
19₁₀ = 1*2⁰ + 1*2¹ + 0*2² + 0*2³ + 1*2⁴ = 10011₂
// PascalABC.NET 3.1, сборка 1200 от 13.03.2016
function IsPrime(n:integer):boolean;
begin
if n<4 then Result:=True
else begin
var found:= (n mod 2 = 0);
var p:=3;
while (not found) and (sqr(p)<=n) do
begin
found:=(n mod p = 0);
p+=2
end;
Result:=not found
end
end;
begin
Writeln('k=',ArrRandom(ReadInteger('n='),1,999).Println.
Where(x->IsPrime(x)).Count)
end.
Тестовое решение:
n= 10
401 828 780 444 694 965 23 341 673 875
k=3
2. А вот так это пишется с процедурой
// PascalABC.NET 3.1, сборка 1200 от 13.03.2016
procedure IsPrime(n:integer; var res:boolean);
begin
if n<4 then res:=True
else begin
var found:= (n mod 2 = 0);
var p:=3;
while (not found) and (sqr(p)<=n) do
begin
found:=(n mod p = 0);
p+=2
end;
res:=not found
end
end;
begin
var a:=ArrRandom(ReadInteger('n='),1,999); a.Println;
var k:=0;
var prime:boolean;
foreach var e in a do begin
IsPrime(e,prime);
if Prime then Inc(k)
end;
Writeln('k=',k)
end.
Тестовое решение:
n= 12
199 43 71 365 417 904 170 212 694 103 161 689
k=4