Text Practice Mode
nguyen ngoc tin
created Dec 9th 2021, 06:21 by ngotin
0
363 words
2 completed
0
Rating visible after 3 or more votes
saving score / loading statistics ...
00:00
#include<iostream>
#include<math.h>
using namespace std;
void nhap(int &n);
void caua(int n);
void caub(int n);
void cauc(int n);
void caud(int n);
void caue(int n);
void cauf(int n);
void caug(int n);
void cauh(int n);
void caui(int n);
int main(){
int n;
nhap(n);
caua(n);
caub(n);
cauc(n);
caud(n);
caue(n);
cauf(n);
caug(n);
cauh(n);
caui(n);
return 0;
}
void nhap(int &n){
cout<<"nhap n: ";cin>>n;
}
int chinhphuong(int n)
{
return sqrt(n)==int(sqrt(n));
}
void caua(int n)
{
cout<<"Ket qua cau a: ";
for(int i=1;i<=n;i++)
if(chinhphuong(i))
cout<<i<<" ";
cout<<endl;
}
int hoanchinh(int n)
{
int s=0;
for (int i=1;i<=n/2;i++)
if (n%i==0)
s+=i;
return s==n;
}
void caub(int n)
{
cout<<"Ket qua cau b: ";
for(int i=1;i<=n;i++)
if(hoanchinh(i))
cout<<i<<" ";
cout<<endl;
}
int canxung(int n)
{
int m=0,t=n;
while (t>0)
{
m=m*10+t%10;
t=t/10;
}
return m==n;
}
void cauc(int n)
{
cout<<"Ket qua cau c: ";
for(int i=1;i<=n;i++)
if(canxung(i))
cout<<i<<" ";
cout<<endl;
}int nguyento(int n)
{
int d=0;
for (int i=1;i<=n;i++)
if (n%i==0) d++;
return d==2;
}
void caud(int n)
{
cout<<"Ket qua cau d: ";
for(int i=1;i<=n;i++)
if(nguyento(i))
cout<<i<<" ";
cout<<endl;
}
void caue(int n)
{
cout<<"Ket qua cau e: ";
int dem = 0;
int i = 2;
while (dem < n) {
if (nguyento(i)) {
cout<<i<<" ";
dem++;
}
i++;
}
cout<<endl;
}
int daonguoc(int n)
{
int m=0;
while (n>0)
{
m=m*10+n%10;
n=n/10;
}
return m;
}
void cauf(int n)
{
cout<<"Ket qua cau f: ";
for (int i=1;i<=n;i++)
if(nguyento(i)&&nguyento(daonguoc(i)))
cout<<i<<" ";
cout<<endl;
}
int nguyentodoixung(int n)
{
if (!nguyento(n)) return 0;
int u=n+1;
while (!nguyento(u)) u++;
int v=n-1;
while (!nguyento(v) && v>0) v--;
return u+v==2*n;
}
void caug(int n)
{
cout<<"Ket qua cau g: ";
for(int i=1;i<=n;i++)
if(nguyentodoixung(i))
cout<<i<<" ";
cout<<endl;
}
int amrstrong(int n)
{
int d=0,t1=n;
while (t1>0)
{
d++;
t1=t1/10;
}
float s=0;int t2=n;
while (t2>0)
{
s=s+pow(t2%10,d);
t2=t2/10;
}
return s==n;
}
void cauh(int n)
{
cout<<"Ket qua cau h: ";
for(int i=1;i<=n;i++)
if(amrstrong(i))
cout<<i<<" ";
cout<<endl;
}
int Mersenne(int n){
int i = 0;
n += 1;
while (n > pow(2, i))
{
i++;
}
if (n == pow(2, i))
return 1;
else return 0;
}
void caui(int n)
{
cout<<"Ket qua cau i: ";
for(int i=1;i<=n;i++)
if(nguyento(i)&&Mersenne(i))
cout<<i<<" ";
cout<<endl;
}
#include<math.h>
using namespace std;
void nhap(int &n);
void caua(int n);
void caub(int n);
void cauc(int n);
void caud(int n);
void caue(int n);
void cauf(int n);
void caug(int n);
void cauh(int n);
void caui(int n);
int main(){
int n;
nhap(n);
caua(n);
caub(n);
cauc(n);
caud(n);
caue(n);
cauf(n);
caug(n);
cauh(n);
caui(n);
return 0;
}
void nhap(int &n){
cout<<"nhap n: ";cin>>n;
}
int chinhphuong(int n)
{
return sqrt(n)==int(sqrt(n));
}
void caua(int n)
{
cout<<"Ket qua cau a: ";
for(int i=1;i<=n;i++)
if(chinhphuong(i))
cout<<i<<" ";
cout<<endl;
}
int hoanchinh(int n)
{
int s=0;
for (int i=1;i<=n/2;i++)
if (n%i==0)
s+=i;
return s==n;
}
void caub(int n)
{
cout<<"Ket qua cau b: ";
for(int i=1;i<=n;i++)
if(hoanchinh(i))
cout<<i<<" ";
cout<<endl;
}
int canxung(int n)
{
int m=0,t=n;
while (t>0)
{
m=m*10+t%10;
t=t/10;
}
return m==n;
}
void cauc(int n)
{
cout<<"Ket qua cau c: ";
for(int i=1;i<=n;i++)
if(canxung(i))
cout<<i<<" ";
cout<<endl;
}int nguyento(int n)
{
int d=0;
for (int i=1;i<=n;i++)
if (n%i==0) d++;
return d==2;
}
void caud(int n)
{
cout<<"Ket qua cau d: ";
for(int i=1;i<=n;i++)
if(nguyento(i))
cout<<i<<" ";
cout<<endl;
}
void caue(int n)
{
cout<<"Ket qua cau e: ";
int dem = 0;
int i = 2;
while (dem < n) {
if (nguyento(i)) {
cout<<i<<" ";
dem++;
}
i++;
}
cout<<endl;
}
int daonguoc(int n)
{
int m=0;
while (n>0)
{
m=m*10+n%10;
n=n/10;
}
return m;
}
void cauf(int n)
{
cout<<"Ket qua cau f: ";
for (int i=1;i<=n;i++)
if(nguyento(i)&&nguyento(daonguoc(i)))
cout<<i<<" ";
cout<<endl;
}
int nguyentodoixung(int n)
{
if (!nguyento(n)) return 0;
int u=n+1;
while (!nguyento(u)) u++;
int v=n-1;
while (!nguyento(v) && v>0) v--;
return u+v==2*n;
}
void caug(int n)
{
cout<<"Ket qua cau g: ";
for(int i=1;i<=n;i++)
if(nguyentodoixung(i))
cout<<i<<" ";
cout<<endl;
}
int amrstrong(int n)
{
int d=0,t1=n;
while (t1>0)
{
d++;
t1=t1/10;
}
float s=0;int t2=n;
while (t2>0)
{
s=s+pow(t2%10,d);
t2=t2/10;
}
return s==n;
}
void cauh(int n)
{
cout<<"Ket qua cau h: ";
for(int i=1;i<=n;i++)
if(amrstrong(i))
cout<<i<<" ";
cout<<endl;
}
int Mersenne(int n){
int i = 0;
n += 1;
while (n > pow(2, i))
{
i++;
}
if (n == pow(2, i))
return 1;
else return 0;
}
void caui(int n)
{
cout<<"Ket qua cau i: ";
for(int i=1;i<=n;i++)
if(nguyento(i)&&Mersenne(i))
cout<<i<<" ";
cout<<endl;
}
saving score / loading statistics ...