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.
uses crt;
var i,j,kt:integer;
begin
clrscr;
for i:=10 to 99 do
begin
kt:=0;
for j:=2 to trunc(sqrt(i)) do
if i mod j=0 then kt:=1;
if kt=0 then write(i:4);
end;
readln;
end.
uses crt;
var a:array[1..100]of integer;
i,n,j:integer;
kt:boolean;
begin
clrscr;
readln(n);
for i:=1 to n do readln(a[i]);
for i:=1 to n do
if trunc(sqrt(a[i]))=sqrt(a[i]) then write(a[i]:4);
writeln;
for i:=1 to n do
if a[i]>1 then
begin
kt:=true;
for j:=2 to trunc(sqrt(a[i])) do
if a[i] mod j=0 then kt:=false;
if kt=true then write(a[i]:4);
end;
writeln;
readln;
end.
Bài 1:
uses crt;
var n,i,kt:integer;
begin
clrscr;
write('Nhap n='); readln(n);
kt:=0;
for i:=2 to n-1 do
if n mod i=0 then kt:=1;
if (kt=0) and (n>1) then writeln(n,' la so nguyen to')
else writeln(n,' khong la so nguyen to');
readln;
end.
Bài 2:
uses crt;
var n,i:integer;
begin
clrscr;
write('Nhap n='); readln(n);
for i:=1 to n do
if n mod i=0 then write(i:4);
readln;
end.
#include <iostream>
#include <algorithm>
using namespace std;
int main()
{
int n,k;
cin >> n >> k;
int a[n];
for (int i=0;i<n;i++)
cin >> a[i];
sort(a,a+n);
cout << a[k-1];
return 0;
}
#include <bits/stdc++.h>
using namespace std;
long long a[5],i;
int main()
{
for (i=1; i<=5; i++) cin>>a[i];
sort(a+1,a+5+1);
cout<<"Tong nho nhat la: "<<a[1]+a[2]+a[3]+a[4]<<endl;
cout<<"Tong lon nhat la: "<<a[5]+a[4]+a[3]+a[2];
return 0;
}
#include <bits/stdc++.h>
using namespace std;
long long x;
//chuongtrinhcon
bool ktnt(long long n)
{
for (int i=2; i*i<=n; i++)
if (n%i==0) return(false);
return(true);
}
//chuongtrinhcon
bool ktso(long long n)
{
int a=n%10;
int b=n/10; b=b%10;
int c=n/100; c=c%10;
int d=n/1000; d=d%10;
if (a+b==c+d) return(true);
else return(false);
}
//chuongtrinhchinh
int main()
{
for (x=1000; x<=9999; x++)
if ((ktnt(x)==true) and (ktso(x)==true)) cout<<x<<" ";
return 0;
}