Lê Đình Nguyên

Tổng số bài gửi : 18 Join date : 05/11/2022

Day 1 Bai 1
#include <bits/stdc++.h>
using namespace std;
int i,x,y,k,l;
int x11,x2,x3,y11,y2,y3;
float toado(int x,int y,int k,int l)
{
i = sqrt((x-y)*(x-y)-(k-l)*(k-l));
return i;
}
int main ()
{
cout<<"Toa do cua diem A: ";
cin >> x11 >> y11;
cout<<"Toa do cua diem B: ";
cin >> x2 >> y2;
cout<<"Toa do cua diem C: ";
cin >> x3 >> y3;
cout<<"Do dai AB: "<<toado(x11,x2,y11,y2)<<endl;
cout<<"Do dai BC: "<<toado(x2,x3,y2,y3)<<endl;
cout<<"Do dai AC: "<<toado(x11,x3,y11,y3);
return 0;
}

Tổng số bài gửi : 18 Join date : 05/11/2022

Day 1 Bai 7
#include <bits/stdc++.h>
using namespace std;
int main ()
{
int i, j, k;
int n;
int dem =0;
cin>>n;
for (i = 0; i <= n/500; i ++)
{
for (j = 0; j <= n/200; j ++)
{
for (k = 0; k <= n/100; k ++)
{
if (500 * i + 200 * j + 100 * k == n)
{
dem++;
}
}
}
}
if (dem == 0) cout<<"NONE";
else cout<<dem;
return 0;
}

Tổng số bài gửi : 18 Join date : 05/11/2022

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

bool f[1000];

void nt(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 (i * k <= u)
{
f[i*k] = false;
k ++;
}
i++;
}
else i++;
}

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

Tổng số bài gửi : 18 Join date : 05/11/2022

Day1Bai9

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

int gcd(int u, int v)
{
int r;
while (v >0)
{
r = u%v;
u=v;
v=r;
}
return u;
}

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

Tổng số bài gửi : 18 Join date : 05/11/2022

Code:: Day1Bai10
#include <bits/stdc++.h>
using namespace std;
int b[100];int k;int n;
void pt(int a)
{
k = 0;
int i = 2;
while (i * i <= a)
if (a % i ==0)
{
k++;
b[k] = i;
a = a/i;
}
else i++;
if (a > 1)
{
k++;
b[k] = a;
}
}
int main ()
{
cin>>n;
pt(n);
for (int i = 1; i <= k; i ++) cout<<b[i]<<" ";
return 0;
}

Tổng số bài gửi : 18 Join date : 05/11/2022

Code:: Day2Bai3
#include <bits/stdc++.h>
using namespace std;
int c[100];int k;

void pt(int u)
{
k =0;
int i=2;
while (i*i<=u)
if(u%i==0)
{
k++;
c[k] = i;
u=u/i;
}
else i++;
if (u>1)
{
k++;
c[k] = u;
}
}

int main ()
{
int n;
cin>>n;
pt(n);
for (int i = 1; i <= k; i ++)
{
cout<<c[i];
}
}

Tổng số bài gửi : 18 Join date : 05/11/2022

Code:: Day2Bai4
#include <bits/stdc++.h>
using namespace std;
int main ()
{
int n;
cin>>n;
int dem = sqrt(n);
cout<<dem;
}

Tổng số bài gửi : 18 Join date : 05/11/2022

Code:: Day2Bai5
#include <bits/stdc++.h>
using namespace std;
int c[100];int k;

void pt(int u)
{
k =0;
int i=2;
while (i*i<=u)
if(u%i==0)
{
k++;
c[k] = i;
u=u/i;
}
else i++;
if (u>1)
{
k++;
c[k] = u;
}
}

int main ()
{
int n;int p=1;
cin>>n;
for (int i = 1; i <= n; i ++)
{
p=p*i;
}
cout<<p<<endl;
pt(p);
for (int i = 1; i <= k; i ++)
{
if (c[i] != c[i+1]) cout<<c[i]<<" ";
}
}

Tổng số bài gửi : 18 Join date : 05/11/2022

Code:: Day3Bai1
#include <bits/stdc++.h>
using namespace std;
int n, k;
int c[1000];
void pt(int u)
{
k = 0;
int i = 2;
while (i*i <= u)
if (u % i == 0)
{
k++;
c[k] = i;
u = u / i;
}
else
i++;
if (u > 1)
{
k++;
c[k] = u;
}
}
int main()
{
cin >> n;
pt(n);
cout<<c[k];
return 0;
}

Tổng số bài gửi : 18 Join date : 05/11/2022

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

Tổng số bài gửi : 18 Join date : 05/11/2022

Code:: Day3Bai3
#include <bits/stdc++.h>
using namespace std;
int main ()
{
int n;
cin >> n;
int a[100000];int b[100000];
for (int i = 1; i <= n; i ++)
cin>>a[i];
for (int i = 1; i <= n; i ++)
{
b[i] = a[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 : 18 Join date : 05/11/2022

Code:: Day3Bai4
#include <bits/stdc++.h>
using namespace std;
int main ()
{
int n; cin>>n;
int k = 0; int b[100000];
for (int i = 1; i <= n; i++) cin >> b[i];
for (int i = 1; i <= n; i ++)
{
for (int j = 1; j <= n; j ++)
{
if (b[i] > b[j])
{
int temp = b[i];
b[i] = b[j];
b[j] = temp;
}
}
}
int p = b[n] - b[1];
cout<<abs(p);
return 0;
}

Tổng số bài gửi : 18 Join date : 05/11/2022

Code:: Bai1Day4
#include <bits/stdc++.h>
using namespace std;
int a[1000000]; int c[1000000];
void nhap(int a[], int m)
{
   for (int i = 1; i <= m; i++)
   cin>>a[i];
}
int main()
{
   freopen ("ARRDEL.inp","r", stdin);
   freopen ("ARRDEL.out","w", stdout);
   int n;int k=0;
   cin>>n;
   nhap(a,n);
   for (int i = 1; i <= n; i++)
   {
   if (a[i] != a[i+1])
   {
   k++;
   c[k] = a[i];
   }
   }
   for (int i = 1; i <= k; i ++)
   {
   cout<<c[i]<<" ";
   }
   return 0;
}

Tổng số bài gửi : 18 Join date : 05/11/2022

Code:: Day4Bai2
#include <bits/stdc++.h>
using namespace std;
int n;
int rmin;
int a[100000];
int vt[100000];
void nhap (int a[], int m)
{
for (int i = 1; i<= m; i ++)
cin>>a[i];
}
void xuat (int a[], int k)
{
for (int i = 1; i<= k; i ++)
cout<<a[i]<<" ";
}
void qs (int l, int r)
{
int i = l;
int j = r;
int giua = a[(i + j) / 2];
while (i <= j)
{
while (a[i] < giua) i ++;
while (a[j] > giua) j --;
if (i <= j)
{
swap (a[i], a[j]);
swap (vt[i], vt[j]);
i++;
j--;
}
}
if (l <= j) qs(l, j);
if (i <= r) qs(i, r);
}
void st1 ()
{
for (int i = 1; i <= n; i ++)
vt[i] = i;
qs(1, n);
int p = 0;
int res;
for (int i = 2; i <= n; i ++)
{
if (a[i] != a[1])
{
res = a[i];
p = 1;
break;
}
}
if (p == 0) cout<< -1;
if (p == 1)
{
cout<<res<<" ";
for (int i = 1; i <= n; i ++)
if (a[i] == res)
cout<<vt[i];
}
}
void st2 ()
{
int p = 0;
int rmin2 = trunc(1e9);
for (int i = 1; i <= n; i++)
{
if (rmin2 > a[i] && rmin != a[i])
{
p = 1;
rmin2 = a[i];
}
}
if (p == 0) cout<< -1;
else
{
cout << rmin2;
for (int i = 1; i <= n; i ++)
if (a[i] == rmin2)
cout<<i<<" ";
}
}
int main()
{
cin>>n;
nhap (a, n);
rmin = trunc(1e9);
for (int i = 1; i <= n; i++)
rmin = min (rmin, a[i]);
st1();
st2();
return 0;
}

Tổng số bài gửi : 18 Join date : 05/11/2022

Code:: Bai4Day4
#include <bits/stdc++.h>
using namespace std;
int a[100000];
void qs(int m, int n)
{
int l = m;
int r = n;
int giua = a[(l + r)/ 2];
while (l <= r)
{
while (a[l] < giua) l++;
while (a[r] > giua) r--;
if (l <= r)
{
swap (a[l], a[r]);
l++;
r--;
}
}
if (m <= r) qs(m, r);
if (l <= n) qs (l, n);
}
int main()
{
int n;
cin >> n;
for (int i = 1; i <= n; i++)
cin>>a[i];
qs(1, n);
int d = 1;
for (int i = 1; i <= n; i ++)
{
if (a[i] == a[i + 1]) d++;
else
{
cout << a[i] << " " << d << endl;
d = 1;
}
}
return 0;
}

Tổng số bài gửi : 18 Join date : 05/11/2022

Code:: B5D4
#include <bits/stdc++.h>
using namespace std;
bool nto (int u)
{
if (u < 2) return false;
for (int i = 2; i*i <= u; i ++)
if (u % i == 0)
return false;
return true;
}
int main()
{
int n;
cin >> n;
n = n/10;
while (n > 0 && nto(n) == false)
n = n/10;
if (n == 0) cout << -1;
else cout << n;
return 0;
}

Tổng số bài gửi : 18 Join date : 05/11/2022

Code:: B6D4
#include <bits/stdc++.h>
using namespace std;
int n;
int a[1000000];
void qs(int l, int r)
{
int i = l;
int j = r;
int chot = a[(i+j)/2];
while (i <= j)
{
while (a[i] < chot) i ++;
while (a[j] > chot) j --;
if (i <= j)
{
swap (a[i], a[j]);
i ++;
j --;
}
}
if (l <= j) qs (l, j);
if (i <= r) qs (i, r);
}
int main()
{
cin >> n;
for (int i = 1; i <= n; i ++)
cin >> a[i];
qs(1, n);
for (int i = 1; i <= n; i ++)
cout << a[i] <<" ";
return 0;
}

Tổng số bài gửi : 18 Join date : 05/11/2022

Code:: B7D4
#include <bits/stdc++.h>
using namespace std;
int n, k;
int a[10000];
int tknp (int u)
{
int dau = 1;
int cuoi = n;
while (dau <= cuoi)
{
int giua = (dau + cuoi) / 2;
if (a[giua] == u)
return giua;
else if (a[giua] < u)
dau = giua + 1;
else
cuoi = giua - 1;
}
return -1;
}
int main()
{
cin >> n >> k;
for (int i = 1; i <= n; i ++)
cin >> a[i];
cout<<tknp(k);
return 0;
}