Hãy nhập câu hỏi của bạn vào đây, nếu là tài khoản VIP, bạn sẽ được ưu tiên trả lời.
program KiemTraSoSieuNguyenTo;
uses crt;
function IsPrime(num: integer): boolean;
var
i: integer;
begin
if num < 2 then
IsPrime := false
else
begin
IsPrime := true;
for i := 2 to trunc(sqrt(num)) do
begin
if num mod i = 0 then
begin
IsPrime := false;
break;
end;
end;
end;
end;
function IsSuperPrime(num: integer): boolean;
var
i, temp: integer;
begin
IsSuperPrime := true;
while num > 0 do
begin
if not IsPrime(num) then
begin
IsSuperPrime := false;
break;
end;
temp := num mod 10;
num := num div 10;
end;
end;
var
n: integer;
inputFile, outputFile: text;
begin
assign(inputFile, 'SNT.INP');
assign(outputFile, 'SNT.OUT');
reset(inputFile);
rewrite(outputFile);
readln(inputFile, n);
if IsSuperPrime(n) then
writeln(outputFile, 1)
else
writeln(outputFile, 0);
close(inputFile);
close(outputFile);
end.
const fi='SNT.INP';
fo='SNT.OUT';
var n:qword;
function isPrimeNumber(n:qword):byte;
var i:longint;
begin
if n<2 then exit(0);
for i:=2 to trunc(sqrt(n))do
if n mod i=0 then exit(0);
exit(1);
end;
function isSuperPrimeNumber(n:qword):byte;
begin
while n<>0 do
begin
if isPrimeNumber(n)=0 then exit(0);
n:=n div 10;
end;
exit(1);
end;
begin
assign(input,fi);reset(input);
assign(output,fo);rewrite(output);
readln(n);
write(isSuperPrimeNumber(n));
close(output);
close(input);
end.
Bài 1:
uses crt;
var n,kt,d,i:longint;
st:string;
begin
clrscr;
write('nhap n='); readln(n);
str(n,st);
kt:=0;
d:=length(st);
for i:=1 to d do
if (st[i]<>'4') and (st[i]<>'7') then kt:=1;
if kt=0 then write(n,' la so may man')
else write(n,' khong la so may man');
readln;
end.
Bài 2:
Program hotrotinhoc_hoc24;
var vt,max,i,n,d: integer;
a: array[1..50] of longint;
t: longint;
function nt(x: longint): boolean;
var j: longint;
begin
nt:=true;
if (x=2) or (x=3) then exit;
nt:=false;
if (x=1) or (x mod 2=0) or (x mod 3=0) then exit;
j:=5;
while (j<=trunc(sqrt(x))) do
begin
if (x mod j=0) or (x mod (j+2)=0) then exit;
j:=j+6;
end;
nt:=true;
end;
begin
write('Nhap so nguyen duong n: '); readln(n);
max:=0;
for i:=1 to n do
begin
write('a[',i,']='); readln(a[i]);
if nt(a[i]) and (a[i]>=max) then
begin
max:=a[i];
vt:=i;
end;
end;
if vt=0 then write('-1') else write('Vi tri so nguyen to lon nhat cuoi cung trong day la : ',vt);
readln
end.
#include <iostream>
#include <string>
#include <algorithm>
int main() {
int n, k;
std::cin >> n >> k;
std::string number = std::to_string(n);
int numDigits = number.length();
if (k >= numDigits) {
std::cout << "0" << std::endl;
} else {
std::sort(number.begin(), number.end(), std::greater<char>());
number = number.substr(0, numDigits - k);
std::cout << number << std::endl;
}
return 0;
}
uses crt;
var a:int64;
begin
clrscr;
readln(a);
writeln(a*4);
readln;
end.
const
fi='sochinhphuong.inp';
fo='sochinhphuong.out';
var f,g:text;n:longint;
function scp(n:longint):boolean;
begin
if (sqr(trunc(sqrt(n)))=n) then exit (true);
exit (false);
end;
begin
assign(f,fi);reset(f);
assign(g,fo);rewrite(g);
readln(f,n);
if scp(n) then writeln(g,'yes') else
writeln(g,'no');
close(f);close(g);
end.
Tớ không hiểu.
Số may mắn là số gì?
6 = 3 + 2 + 1 hay sao?
số bn vừa nhập là số hoàn hảo