May 2024 | Mon | Tue | Wed | Thu | Fri | Sat | Sun |
---|
| | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 14 | 15 | 16 | 17 | 18 | 19 | 20 | 21 | 22 | 23 | 24 | 25 | 26 | 27 | 28 | 29 | 30 | 31 | | | Calendar |
|
Top posting users this week | |
| | Giang Quang Thắng | |
| | Tác giả | Thông điệp |
---|
GiangThang
Tổng số bài gửi : 67 Join date : 04/10/2022
| Tiêu đề: Giang Quang Thắng Mon Nov 07, 2022 10:42 pm | |
| Day1Bai1 - Code:
-
#include <bits/stdc++.h>
using namespace std;
int main() { ios_base::sync_with_stdio(0); cin.tie(0); freopen("TINHS.inp","r",stdin); freopen("TINHS.out","w",stdout); float S; int n; cin >> n; S=1.0*(n*(n+3))/(4*(n+1)*(n+2)); cout << fixed << setprecision(2) << S; return 0; }
| |
| | | GiangThang
Tổng số bài gửi : 67 Join date : 04/10/2022
| Tiêu đề: Re: Giang Quang Thắng Mon Nov 07, 2022 10:43 pm | |
| Day1Bai2 - Code:
-
#include <bits/stdc++.h>
using namespace std;
int main()
{ ios_base::sync_with_stdio(0); cin.tie(0); freopen("MERGES.inp","r",stdin); freopen("MERGES.out","w",stdout); string a,b,s,res1,res2; int i; cin >> a >> b; res1 =a+b; res2 = b+a; s=max(res1,res2); cout << s; return 0; } | |
| | | GiangThang
Tổng số bài gửi : 67 Join date : 04/10/2022
| Tiêu đề: Re: Giang Quang Thắng Mon Nov 07, 2022 11:02 pm | |
| Day1Bai3 - Code:
-
#include <bits/stdc++.h>
using namespace std;
float kc(int a,int b,int c,int d) { float s=sqrt(pow(a-c,2)+pow(b-d,2)); return s; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); freopen("TRIAS.inp","r",stdin); freopen("TRIAS.out","w",stdout); int x1,x2,x3,y1,y2,y3; float ab,bc,ac,ncv,s; cin >> x1 >> y1 >> x2 >> y2 >> x3 >> y3; ab = kc(x1,y1,x2,y2); bc = kc(x2,y2,x3,y3); ac = kc(x1,y1,x3,y3); ncv=(ab+bc+ac)/2; s=sqrt(ncv*(ncv-ab)*(ncv-bc)*(ncv-ac)); if ((ab+bc>ac) & (bc+ac>ab) & (ab+ac>bc)) { cout << fixed << setprecision(2) << s; } else cout <<"NONE"; return 0; } | |
| | | GiangThang
Tổng số bài gửi : 67 Join date : 04/10/2022
| Tiêu đề: Re: Giang Quang Thắng Mon Nov 07, 2022 11:14 pm | |
| Day1Bai4 - Code:
-
#include <bits/stdc++.h>
using namespace std;
int main() { ios_base::sync_with_stdio(0); cin.tie(0); freopen("PERMAX.inp","r",stdin); freopen("PERMAX.out","w",stdout); int s[100000]; int a,cd,i,j,tg; cin >> a; i=0; cd=0; while (a>0) { cd++; i++; s[i]=a%10; a/=10; } sort(i+1,i+cd+1); for(i=1;i<=cd;i++) cout << s[i]; return 0; }
| |
| | | GiangThang
Tổng số bài gửi : 67 Join date : 04/10/2022
| Tiêu đề: Re: Giang Quang Thắng Mon Nov 07, 2022 11:17 pm | |
| Day1Bai5 - Code:
-
#include <bits/stdc++.h>
using namespace std;
int main() { ios_base::sync_with_stdio(0); cin.tie(0); freopen("DELNMAX.inp","r",stdin); freopen("DELNMAX.out","w",stdout); long long a; //10^18 int p,i,cd,nmax,j; int s[100]; p=1; cd=0; i=0; cin >> a; while (a>0) { cd++; i++; s[i]=a%10; a/=10; nmax=max(nmax,s[i]); } for (i=1;i<=cd;i++) { j=cd-i+1; if (s[j]==nmax){ if (p==1) p=0; else cout << s[j]; } else cout << s[j];
} return 0; } | |
| | | GiangThang
Tổng số bài gửi : 67 Join date : 04/10/2022
| Tiêu đề: Re: Giang Quang Thắng Mon Nov 07, 2022 11:23 pm | |
| Day1Bai6 - Code:
-
#include <bits/stdc++.h>
using namespace std;
int main() { ios_base::sync_with_stdio(0); cin.tie(0); freopen("COUMOD.inp","r",stdin); freopen("COUMOD.out","w",stdout); long long n; int i,k; k=0; cin >> n; for (i=1;i<=sqrt(n);i++) { if (n%i==0) { k++; if (i!=n/i) k++; } } cout << k; return 0; }
| |
| | | GiangThang
Tổng số bài gửi : 67 Join date : 04/10/2022
| Tiêu đề: Re: Giang Quang Thắng Tue Nov 08, 2022 1:26 am | |
| Day1Bai7 - Code:
-
#include <bits/stdc++.h>
using namespace std;
int main() { ios_base::sync_with_stdio(0); cin.tie(0); freopen("COUPRIME.inp","r",stdin); freopen("COUPRIME.out","w",stdout); int N = 1000; bool check[N + 1]; for (int i = 2; i <= N; i++) { check[i] = true; } for (int i = 2; i <= N; i++) { if (check[i] == true) { for (int j = 2 * i; j <= N; j += i){ check[j] = false;}}} //SangNT int bmax,amax,amin,i,n,j; int dem[100000],a[100000],b[100000]; bmax=0; amax=0; dem[0]=0; cin >> n; cin >> a[1] >> b[1]; for(i=1;i<=b[1];i++) if (check[i]==true) dem[i]= dem[i-1]+1; else dem[i]=dem[i-1]; if ((check[a[1]]==true) && (check[b[1]]==true)) cout <<(dem[b[1]]-dem[a[1]]+1) << endl; else cout << (dem[b[1]]-dem[a[1]]) << endl; bmax = max(bmax,b[1]); amin = min(amin,a[1]); amax = max(amax,a[1]); for (i=2;i<=n;i++) { cin >> a[i] >> b[i]; if ((b[i]<=bmax) && (a[i]>amin)) { if ((check[a[i]]==true) && (check[b[i]]==true))cout << (dem[b[i]]-dem[a[i]]+1) << endl; else cout << (dem[b[i]]-dem[a[i]]) << endl;} if ((b[i]<=bmax) && (a[i]<amin)) { for (j=a[i];j<=amin;j++){ if (check[j]==true) dem[j]= dem[j-1]+1; else dem[j]=dem[j-1];} if ((check[a[i]]==true) && (check[b[i]]==true)) cout << (dem[b[i]]-dem[a[i]]+1) << endl; else cout << (dem[b[i]]-dem[a[i]]) << endl; } if ((b[i] > bmax) && (a[i]<amin)) { for (j=a[i];j<=amin;j++){ if (check[j]==true) { dem[j]= dem[j-1]+1;} else {dem[j]=dem[j-1];} for (j=bmax;j<=b[i];j++){ if (check[j]==true) { dem[j]= dem[j-1]+1;} else {dem[j]=dem[j-1];}} if ((check[a[i]]==true) & (check[b[i]]==true)) cout << (dem[b[i]]-dem[a[i]]+1) << endl; else cout << (dem[b[i]]-dem[a[i]]) << endl ; }} if ((b[i] > bmax) && (a[i]>=amin)) { for (j=bmax;j<=b[i];j++){ if (check[j]==true) { dem[j]= dem[j-1]+1;} else {dem[j]=dem[j-1];}} if ((check[a[i]]==true) & (check[b[i]]==true)) cout << (dem[b[i]]-dem[a[i]]+1) << endl; else cout << (dem[b[i]]-dem[a[i]]) << endl ; } if (b[i]<amin) { for (j=a[i];j<=b[i];j++){ if (check[j]==true) dem[j]= dem[j-1]+1; else dem[j]= dem[j-1];} if ((check[a[i]]==true) & (check[b[i]]==true)) cout << (dem[b[i]]-dem[a[i]]+1) << endl; else cout << (dem[b[i]]-dem[a[i]]) << endl; } bmax = max(bmax,b[i]); amin = min(amin,a[i]); amax = max(amax,a[i]); } return 0; } | |
| | | GiangThang
Tổng số bài gửi : 67 Join date : 04/10/2022
| Tiêu đề: Re: Giang Quang Thắng Tue Nov 08, 2022 9:49 pm | |
| Day1Bai8 - Code:
-
#include <bits/stdc++.h>
using namespace std;
int soNguyenTo(int soA) { if (soA < 2) return 0;
for (int i = 2; i <= sqrt((float)soA); i ++) { if (soA%i==0) { return 0; } } return 1; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); freopen("ALAPRIME.inp","r",stdin); freopen("ALAPRIME.out","w",stdout); unsigned long long n; int i,p,k; int dem[100000]; cin >> n; i=2; p=2; k=0; while (n!=0) { if ((p!=i) && (k==0)) { if (dem[p]!=0) cout << p << " "<< dem[p] << endl; k=1;} if ((n%i==0) && (soNguyenTo(i)==1)) { p=i; dem[p]++; n=n/i; k=0; } else i++; if(n==1) {cout << p <<" "<<dem[p]; n=0;} } return 0; } | |
| | | GiangThang
Tổng số bài gửi : 67 Join date : 04/10/2022
| Tiêu đề: Re: Giang Quang Thắng Tue Nov 08, 2022 10:59 pm | |
| Day1Bai9 - Code:
-
#include <bits/stdc++.h>
using namespace std;
int soNguyenTo(int soA) { if (soA < 2) return 0;
for (int i = 2; i <= sqrt((float)soA); i ++) { if (soA%i==0) { return 0; } } return 1; } int UNT(long long n) { int i; if (soNguyenTo(n)==1) return n; for (i=int(sqrt(1.0*n));i>=2;i--) if (n%i==0) { if (((n/i)>i) && (soNguyenTo(n/i)==1)) return n/i; else if (soNguyenTo(i)==1) return i; } } int main() { ios_base::sync_with_stdio(0); cin.tie(0); freopen("MODMA.inp","r",stdin); freopen("MODMA.out","w",stdout); long long a[100]; int i,n; cin >> n; for (i=1 ; i <= n ; i++ ) { cin >> a[i]; cout << UNT(a[i]) << endl; } return 0; } | |
| | | GiangThang
Tổng số bài gửi : 67 Join date : 04/10/2022
| Tiêu đề: Re: Giang Quang Thắng Wed Nov 16, 2022 5:53 pm | |
| Day3Bai1 - Code:
-
#include <bits/stdc++.h>
using namespace std;
int vt[100005]; int k=1,dem=0;
int sodep(int a) { int k=0,s=0,cs,b=a; while (b>0) { k++; cs=b%10; s=s+cs; b=b/10; } if (s%k==0) return 2; else return 1; } void xuli(int b) { while (dem<=b) { if (sodep(k)==2) { dem++; vt[dem]=k; } k++; } cout << vt[b] << endl; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); freopen("BEAUTY.inp","r",stdin); freopen("BEAUTY.out","w",stdout); int n; while (cin >> n) { xuli(n); } return 0; } | |
| | | GiangThang
Tổng số bài gửi : 67 Join date : 04/10/2022
| Tiêu đề: Re: Giang Quang Thắng Wed Nov 16, 2022 6:27 pm | |
| Day3Bai2 - Code:
-
#include <bits/stdc++.h>
using namespace std;
int ucln(int u,int v) { int r; while (v>0) { r=u%v; u=v; v=r; } return u; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); freopen("SUBSEQ.inp","r",stdin); freopen("SUBSEQ.out","w",stdout); int n,res,i,j,tam,k; int a[10005]; cin >> n; res=0; for (i=1;i<=n;i++) cin >> a[i]; for (i=1;i<=n;i++) { for (j=i+1;j<=n;j++) { tam=a[i]; for(k=i;k<=j;k++) tam=ucln(tam,a[k]); if (tam>1) {res=max(res,j-i+1); cout << res<< ";" <<i<<" "<< j<< endl;} } } cout << res; return 0; } | |
| | | GiangThang
Tổng số bài gửi : 67 Join date : 04/10/2022
| Tiêu đề: Re: Giang Quang Thắng Thu Nov 17, 2022 9:58 pm | |
| Day3Bai3 - Code:
-
#include <bits/stdc++.h>
using namespace std;
bool f[10005]; int dem=0,k=0; int gt[10005];
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 sodep(int a) { int k,s=0; while (a>0) { k=a%10; a=a/10; s=s+pow(k,2); } if (f[s]==true) return 1; else return 0; } void xuli(int b) { while(dem<=b) { k++; if(sodep(k)==1) { dem++; gt[dem]=k; } } cout << gt[b] << endl; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); freopen("BEAUTY2.inp","r",stdin); freopen("BEAUTY2.out","w",stdout); int n; Eratosthenes(10000); while (cin >> n) { xuli(n); } return 0; } | |
| | | GiangThang
Tổng số bài gửi : 67 Join date : 04/10/2022
| Tiêu đề: Re: Giang Quang Thắng Sun Dec 18, 2022 3:41 pm | |
| Day4Bai7 - Code:
-
#include <bits/stdc++.h>
using namespace std;
int dem[15]; void fastio() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); } void nhap() { freopen("COUNTING.inp","r",stdin); freopen("COUNTING.out","w",stdout); } void xuli(int m, int n) { if (m <= n){ for (int i = m; i <= n; i++) { int j = i; while(j > 0) { int d = j % 10; j = j / 10; dem[d]++; } } for (int i = 0; i <= 9; i++) { cout << dem[i] <<" "; dem[i] = 0; } cout << "\n";} else{for (int i = n; i <= m; i++) { int j = i; while(j > 0) { int d = j % 10; j = j / 10; dem[d]++; } } for (int i = 0; i <= 9; i++) { cout << dem[i] <<" "; dem[i] = 0; } cout << "\n";} } int main() { fastio(); nhap(); int a,b; while( cin >> a >> b) xuli(a,b); return 0; } | |
| | | Sponsored content
| Tiêu đề: Re: Giang Quang Thắng | |
| |
| | | | Giang Quang Thắng | |
|
Trang 1 trong tổng số 1 trang | |
Similar topics | |
|
| Permissions in this forum: | Bạn không có quyền trả lời bài viết
| |
| |
| |