// 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.
// 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.
int main() { int n = 0; cin >> n; for (int i = 0; i < n; ++i) { cout << 2 * i << endl; } return 0; } 2) #include <iostream> #include <cmath> using namespace std;
int main() { int a = 0, b = 0; cin >> a >> b; for (int i = a; i <= b; ++i) { cout << pow(i, 2) << endl; } return 0; } 3) #include <iostream> #include <cmath> using namespace std;
int main() { int a = 0, b = 0, sum = 0; cin >> a >> b; for (int i = a; i <= b; ++i) { sum += pow(i, 2); } cout << sum << endl; return 0; }
1
Объяснение:
проверенно я проверят лично