#include <iostream> using namespace std; int main() { int n, p; cin >> n >> p; if (n == 0) { cout << 0; return 0; } string ans = ""; int sgn = 1; if (n < 0) sgn = -1; n = abs(n); while (n > 0) { ans += ('0' + n % p); n /= p; } if (sgn == -1) { ans += '-'; } for (int i = 0; i < ans.size(); i++) { cout << ans[ans.size() - 1 - i]; } return 0;}
Var a,b,d,K,kp:integer; P:boolean; Begin kp:=0; ReadLn(a,b); if (a = 1)or(a = 2) then Begin kp:=2; Write(2,' ',3) end else if a = 3 then Begin kp:=1; Write(3); End; if a < 5 then a:=5 else if a mod 2 = 0 then a:=a+1; While a<=b do Begin K:=Trunc(Sqrt(A)); d:=3; P:=true; While d <= K do Begin if A mod d = 0 then P:=false; d:=d+2 End; if P then Begin kp:=kp+1; Write(' ',a); End; a:=a+2 End; if kp = 0 then Write(0) End.
Function IsPrime(n: Longint): Boolean; var i, sqrtn, delta: Word; begin if (n >= 5) and ((n - 1) mod 6 = 0) or ((n + 1) mod 6 = 0) then begin i := 5; delta := 2; sqrtn := Trunc(sqrt(n)); IsPrime := False; while i <= sqrtn do begin if n mod i = 0 then Exit; Inc(i, delta); delta := delta xor 6; {смена шага, то 2, то 4} end; IsPrime := True; end else IsPrime := (n = 2) or (n = 3); end; Var A,B,i : Integer; Begin Readln(A,B); For i:=A to B do If IsPrime(i) then Writeln(i); end.
using namespace std;
int main() { int n, p; cin >> n >> p; if (n == 0) { cout << 0; return 0; } string ans = ""; int sgn = 1; if (n < 0) sgn = -1; n = abs(n); while (n > 0) { ans += ('0' + n % p); n /= p; } if (sgn == -1) { ans += '-'; } for (int i = 0; i < ans.size(); i++) { cout << ans[ans.size() - 1 - i]; } return 0;}