Lê Thị Thanh Nhàn

Tổng số bài gửi : 91 Join date : 08/10/2022

Day1bai1

Code:

#include <bits/stdc++.h>

using namespace std;
float toado(int x1,int y1,int x2,int y2)
{
float l=sqrt((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2));
return l;
}
int main()
{
freopen("DISTAN.inp","r",stdin);
freopen("DISTAN.out","w",stdout);
int x1,y1,x2,y2,x3,y3;
cout<<"Toa do cua diem A:";cin>> x1>>y1;
cout<<"Toa do cua diem B:";cin>>x2>>y2;
cout<<"Toa do cua diem A:";cin>>x3>>y3;
cout<<"Do dai AB la:";cout<<fixed<<setprecision(3)<<toado(x1,y1,x2,y2)<<endl;
cout<<"Do dai BC la:";cout<<fixed<<setprecision(3)<<toado(x2,y2,x3,y3)<<endl;
cout<<"Do dai CD la:";cout<<fixed<<setprecision(3)<<toado(x1,y1,x3,y3)<<endl;

return 0;

}

Tổng số bài gửi : 91 Join date : 08/10/2022

Day1 bai2

Code:

#include <bits/stdc++.h>

using namespace std;

int main()
{
freopen("SPECIAL.inp","r",stdin);
freopen("SPECIAL.out","w",stdout);
int n;
cin>>n;
cout<<1.0*n*(n+2)/((n+1)*(n+1));
return 0;
}

Tổng số bài gửi : 91 Join date : 08/10/2022

Day1bai3
#include <bits/stdc++.h>

using namespace std;

int main()
{
freopen("MERGEN.inp","r",stdin);
freopen("MERGEN.out","w",stdout);
string b,a,res1,res2,s;
cin>>a>>b;
res1=a+b;
res2=b+a;
if(res1>res2){s=res1;}
else s=res2;
cout<<s;
return 0;
}

Code:

Tổng số bài gửi : 91 Join date : 08/10/2022

DAY1 BAI4

Code:

#include <bits/stdc++.h>

using namespace std;

int main()
{
freopen("PERNUM.inp","r",stdin);
freopen("PERNUM.out","w",stdout);
int n,k=0,a[10];
cin>>n;
while(n>0)
{
k++;
a[k]=n%10;
n=n/10;
}
sort(a+1,a+k+1);
for(int i=k;i>=1;i--)cout<<a[i];
return 0;
}

Tổng số bài gửi : 91 Join date : 08/10/2022

DAY1BAI5

Code:

#include <bits/stdc++.h>

using namespace std;

int main()
{
freopen("DELNUM2.inp","r",stdin);
freopen("DELNUM2.out","w",stdout);
long long a;
cin>>a;
short int b[20],c[20];
int k=0;
while(a>0)
{
k++;
b[k]=a%10;
a=a/10;
}
short csmax=0;
for(int i=1;i<=k;i++)
{
if(b[i]>csmax) csmax=b[i];
}
int q=0,p=0;
for(int i=k;i>=1;i--)
{
if(b[i]==csmax)
{
q++;
if(q==1) continue;
else { p++; c[p]=b[i];}
}
else{p++; c[p]=b[i];}
}
for(int i=1;i<=p;i++) cout<<c[i];
return 0;
}

Tổng số bài gửi : 91 Join date : 08/10/2022

DAY1 BAI 6:

Code:: #include <bits/stdc++.h>
using namespace std;

int main()
{
freopen("NUMMOD.inp","r",stdin);
freopen("NUMMOD.out","w",stdout);
long long n;
long long a[1000];
cin>>n;
int k=0;
for(int i=1;i*i<=n;i++)
{
if(n%i==0)
{
k++;
a[k]=i;
if(i!=n/i){k++;a[k]=n/i;}
}
}
sort(a+1,a+k+1);
for(int i=1;i<=k;i++)cout<<a[i]<<" ";
return 0;
}

Tổng số bài gửi : 91 Join date : 08/10/2022

Day1bai9

Code:

#include <bits/stdc++.h>

using namespace std;
int a,b;
int ucln(int m,int n)
{
int tg;
while(n!=0)
{tg=m%n;
m=n;
n=tg;}
return m;
}

int main()
{
cin>>a>>b;
cout<<ucln(a,b);
return 0;
}

Tổng số bài gửi : 91 Join date : 08/10/2022

Day1 bài 10

Code:

#include <bits/stdc++.h>

using namespace std;

int main()
{
freopen("ANAPRI.inp","r",stdin);
freopen("ANAPRI.out","w",stdout);
long long n;
cin>>n;
for(int i=2;i<=n;i++)
{
while(n%i==0)
{
cout<<i<<" ";
n=n/i;
}
}
return 0;
}

Tổng số bài gửi : 91 Join date : 08/10/2022

Day1 bai7

Code:

#include <bits/stdc++.h>

using namespace std;

int main()
{
freopen("XCHANGE1.inp","r",stdin);
freopen("XCHANGE1.out","w",stdout);
int n,x=0;
cin>>n;
if(n==0){cout<<1;return 0;}
if(n%100!=0){cout<<"NONE"; return 0;}
else
{
for(int i=0;i*500<=n;i++)
{
for(int j=0;j*200+i*500<=n;j++)
{
x++;
}
}
}
cout<<x;
return 0;
}

Tổng số bài gửi : 91 Join date : 08/10/2022

Day 1 bai8

Code:: #include <bits/stdc++.h>
const int N= 1E8+2;
using namespace std;
int kt[N];
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);cout.tie(0);
freopen("LPRIME.inp","r",stdin);
freopen("LPRIME.out","w",stdout);
int a,b;
cin>>a>>b;
for(int i=2;i*i<=b;i++)
{
if(kt[i]==0)
{
for( int j=a/i;j<=b/i;j++)kt[i*j]=1;
}
}
if (a==1)a++;
for(int i=a;i<=b;i++)
{
if(kt[i]==0) cout<<i<<" ";
}

return 0;
}

Tổng số bài gửi : 91 Join date : 08/10/2022

Day2bai1:

Code:

#include <bits/stdc++.h>
using namespace std;
int main()
{
freopen("SOLVES3.INP","r",stdin);
freopen("SOLVES3.OUT","w",stdout);
long long S;
int n,p;
cin>>n>>p;
S=0;
if(p==1)
{
for(int i=1;i<=n+1;i++)S=S+i;
}
else S=(n+1)*pow(p,n+1)/(p-1)-(pow(p,n+1)-1)/((p-1)*(p-1));
cout<<S;
return 0;
}

Tổng số bài gửi : 91 Join date : 08/10/2022

day2bai3:

Code:

#include <bits/stdc++.h>
using namespace std;
int main()
{
freopen("FACTORIA.INP","r",stdin);
freopen("FACTORIA.OUT","w",stdout);
int n;
long long x=1;
cin>>n;
for(int i=2;i<=n;i++)x*=i;
if(x==1){cout<<"1";return 0;}
while(n)
for(int i=2;i<=x;i++)
{
while(x%i==0)
{
cout<<i<<" ";
x=x/i;
}
}
return 0;
}

Tổng số bài gửi : 91 Join date : 08/10/2022

day2bai4:

Code:

#include <bits/stdc++.h>
using namespace std;
int main()
{
freopen("NSQUARE.INP","r",stdin);
freopen("NSQUARE.OUT","w",stdout);
int N,res=0;
cin>>N;
for(int i=1;i*i<=N;i++)res++;
cout<<res;
return 0;
}

Tổng số bài gửi : 91 Join date : 08/10/2022

day1bai8subtask1:

Code:

#include <bits/stdc++.h>
using namespace std;
int a,b;
bool prime(int n)
{
if(n<=1)return false;
for(int i=2;i*i<=n;i++)
{
if(n%i==0)return false;
}
return true;
}
int main()
{
cin>>a>>b;
for(int i=a;i<=b;i++)
{
if(prime(i))cout<<i<<" ";
}
return 0;
}

Tổng số bài gửi : 91 Join date : 08/10/2022

day2bai8subtask2

Code:: #include <bits/stdc++.h>
using namespace std;
int a,b;
bool f[1000000];
void eratosthenes(int u)
{
for(int i=1;i<=u;i++)f[i]=true;
f[1]=false;
int i=2;
while(i*i<=u)
{
if(f[i])
{
int k=2;
while(k*i<=u)
{
f[k*i]=false;
k++;
}
i++;
}
else i++;
}

}
int main()
{
cin>>a>>b;
int p=0;
eratosthenes(b);
for(int i=a;i<=b;i++)
{
if(f[i])
{
cout<<i<<" ";
p=1;
}
}
if(p==0){cout<<"NONE";}
}

Tổng số bài gửi : 91 Join date : 08/10/2022

day2bai2:

Code:: #include <bits/stdc++.h>
using namespace std;

int dodai(int xA,int yA,int xB,int yB)
{
float l=sqrt((xA-xB)*(xA-xB)+(yA-yB)*(yA-yB));
return l;
}
int dientich(float a,float b,float c)
{
float p=(a+b+c)/2;
float s=sqrt(p*(p-a)*(p-b)*(p-c));
return s;
}
int main()
{
freopen("TRIANGLE3.inp","r",stdin);
freopen("TRIANGLE3.out","w",stdout);
int x1,y1,x2,y2,x3,y3,x,y;
cin >>x1>>y1>>x2>>y2>>x3>>y3>>x>>y;
float ab=dodai(x1,y1,x2,y2);
float bc=dodai(x3,y3,x2,y2);
float ac=dodai(x1,y1,x3,y3);
float ma=dodai(x1,y1,x,y);
float mb=dodai(x2,y2,x,y);
float mc=dodai(x3,y3,x,y);
float s1=dientich(ab,ma,mb);
float s2=dientich(bc,mb,mc);
float s3=dientich(ac,ma,mc);
float s=dientich(ab,bc,ac);
if(s1+s2+s3<=s)cout<<"TRUE";
else cout<<"FALSE";

return 0;
}

Tổng số bài gửi : 91 Join date : 08/10/2022

day2 bai3:

Code:: #include <bits/stdc++.h>

using namespace std;
int a[10000];
int res=0;
void phantich(int u)
{
int i=2;
while(i*i<=u)
{
if(u%i==0)
{
res++;
a[res]=i;
u=u/i;
}
else i++;
}
if(u>1)
{
res++;
a[res]=u;
;
}
}
int main()
{
freopen("FACTORIA.inp","r",stdin);
freopen("FACTORIA.out","w",stdout);
int n;
cin>>n;
if(n==1){cout<<1;return 0;}
for(int j=2;j<=n;j++)phantich(j);
sort(a+1,a+res+1);
for(int x=1;x<=res;x++)cout<<a[x]<<" ";
return 0;
}

Tổng số bài gửi : 91 Join date : 08/10/2022

day2 bai5:

Code:: #include <bits/stdc++.h>

using namespace std;

int main()
{
freopen("DIVSOPRI.inp","r",stdin);
freopen("DIVSOPRI.out","w",stdout);
int res=0;
int T[1000];
int n;
cin>>n;
for(int i=2;i*i<=n;i++)
{
while(n%i==0)
{
res++;
T[res]=i;
n=n/i;
}
if(n>1){res++;T[res]=n;}
}
sort(T+1,T+res+1);
for(int i=1;i<=res-1;i++)
{
if(T[i]!=T[i+1])cout<<T[i]<<" ";
}
cout<<T[res];
return 0;
}

Tổng số bài gửi : 91 Join date : 08/10/2022

day2 bai6:

Code:: #include <bits/stdc++.h>

using namespace std;
int oclit_gcd(int u, int v)
{
int r;
while (v > 0)
{
r = u % v;
u = v;
v = r;
}
return u;
}
int main()
{
freopen("OCLITS.inp","r",stdin);
freopen("OCLITS.out","w",stdout);
int a[100],b[100],kq[100],n;
cin>>n;
for(int i=1;i<=n;i++)
{
cin>>a[i]>>b[i];
kq[i]=oclit_gcd(a[i],b[i]);
}
for(int i=1;i<=n;i++)cout<<kq[i]<<" ";
return 0;
}

Tổng số bài gửi : 91 Join date : 08/10/2022

day2bai7:

Code:: #include <bits/stdc++.h>
using namespace std;
int a[100];
int n;
int k=0;
int s;
void phantich()
{
while(n!=0)
{
k++;
a[k]=n%10;
n=n/10;
}
}
bool nguyento(int x)
{
if(x==0||x==1)return false;
for(int i=2;i*i<=x;i++)
{
if(x%i==0)return false;
}
return true;
}
int main()
{
freopen("CUTPRIME.inp","r",stdin);
freopen("CUTPRIME.out","w",stdout);
cin>>n;
int max=0;
phantich();
for(int i=k;i>=1;i--)
{
s=0;
for(int j=k;j>=1;j--)
{
if(j!=i){s=s*10+a[j];}
}
if(nguyento(s))
{
if(s>max){max=s;}
}
}
if(max==0)cout<<"NONE";
else cout<<max;
return 0;
}

Tổng số bài gửi : 91 Join date : 08/10/2022

day2bai1

Code:: #include <bits/stdc++.h>

using namespace std;
int a[1000],n,res=0;

void phantich(int u)
{
int i=2;
while(i*i<=u)
{
if(u%i==0)
{
res++;
a[res]=i;
u=u/i;
}
else i++;
}
if(u>1)
{
res++;
a[res]=u;
}
}
int main()
{
cin>>n;
phantich(n);
cout<<a[res];
return 0;
}

Tổng số bài gửi : 91 Join date : 08/10/2022

day3bai2

Code:: #include <bits/stdc++.h>

using namespace std;
int a[1000];

int main()
{
cin>>n;
for(int i=1;i<=n;i++)cin>>a[i];
for( int i=1;i*2<=n;i++)
{
swap(a[i],a[n-i+1]);
}
for(int i=1;i<=n;i++)cout<<a[i]<<" ";
return 0;
}

Tổng số bài gửi : 91 Join date : 08/10/2022

day3bai3:

Code:: #include <bits/stdc++.h>
using namespace std;
int a[1000],b[2000],n;
int main()
{
cin>>n;
for(int i=1;i<=n;i++)cin>>a[i];
for( int i=1;i<=n;i++)
{
b[i]=a[i];
}
for( int i=1;i<=n;i++)
{
b[n+i]=a[i];
}
for(int i=1;i<=2*n;i++)cout<<b[i]<<" ";
return 0;
}

Tổng số bài gửi : 91 Join date : 08/10/2022

day3bai3:

Code:: #include <bits/stdc++.h>
using namespace std;
int a[1000],b[2000],n;
int main()
{
   cin>>n;
   for(int i=1;i<=n;i++)cin>>a[i];
   for( int i=1;i<=n;i++)
   {
   b[i]=a[i];
   }
   for( int i=1;i<=n;i++)
   {
   b[n+i]=a[i];
   }
   for(int i=1;i<=2*n;i++)cout<<b[i]<<" ";
   return 0;
}

Tổng số bài gửi : 91 Join date : 08/10/2022

day3bai4

Code:: #include <bits/stdc++.h>
using namespace std;
int a[1000],n,l,b;
int main()
{
cin>>n;
for(int i=1;i<=n;i++)cin>>a[i];
l=a[1];
b=a[1];
for( int i=2;i<=n;i++)
{
if(a[i]>l) l=a[i];
if(a[i]<b) b=a[i];
}
cout<<l-b;
return 0;
}

» Lê Thị Thanh Nhàn
» Nguyễn Thanh Hải
» Đỗ Thị Thanh Tâm - CVA
» KTLT4. Thành luỹ
» Nguyễn Thanh Tú