Tiêu đề: Re: Giang Quang Thắng Mon Dec 05, 2022 2:23 am
Day4Bai5
Code:
#include <bits/stdc++.h>
using namespace std;
bool prime(long long a) { if (a < 2) return false;
for (int i = 2; i*i <= a; i ++) { if (a%i==0) { return false; } } return true; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); freopen("NUMBERC.inp","r",stdin); freopen("NUMBERC.out","w",stdout); long long p; cin >> p; int dem=0; p=p/10; while(p>0 && prime(p)==false) { p=p/10; } if (p==0) cout << -1; else cout << p; return 0; }
Được sửa bởi GiangThang ngày Mon Dec 05, 2022 7:53 pm; sửa lần 3.
GiangThang
Tổng số bài gửi : 67 Join date : 04/10/2022
Tiêu đề: Re: Giang Quang Thắng Mon Dec 05, 2022 2:26 am
Day4Bai6
Code:
#include <bits/stdc++.h>
using namespace std;
int n, a[100005];
void sapxep(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) sapxep(L, j); if (i < R) sapxep(i, R); } int main() { ios_base::sync_with_stdio(0); cin.tie(0); freopen("QSORT.inp","r",stdin); freopen("QSORT.out","w",stdout); cin >> n; for (int i=1;i<=n;i++) cin >> a[i]; sapxep(1,n); for (int i=1;i<=n;i++) cout << 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 Mon Dec 05, 2022 2:36 am
Day4Bai7
Code:
#include <bits/stdc++.h>
using namespace std;
int binarySearch(int arr[100005], int x, int low, int high) { if (low > high) return -1; int mid = (low + high)/2; if (x == arr[mid]) return mid; else if (x > arr[mid]) return binarySearch(arr,x, mid+1,high); else return binarySearch(arr,x,low, mid-1); } int main() { ios_base::sync_with_stdio(0); cin.tie(0); freopen("BINS.inp","r",stdin); freopen("BINS.out","w",stdout); int n,p,a[100005]; cin >> n >> p; for(int i=1;i<=n;i++) cin >> a[i]; cout << binarySearch(a,p,1,n); return 0; }
GiangThang
Tổng số bài gửi : 67 Join date : 04/10/2022
Tiêu đề: Re: Giang Quang Thắng Mon Dec 05, 2022 2:39 am
Day4Bai8
Code:
#include <bits/stdc++.h>
using namespace std;
int main() { ios_base::sync_with_stdio(0); cin.tie(0); freopen("UPSEQ.inp","r",stdin); freopen("UPSEQ.out","w",stdout); int a[100000]; int i,n,j,maxi,dem; cin >> n; for (i=1;i<=n;i++) { cin >> a[i]; } dem=1; maxi=1; for (i=1;i<=n;i++) { if(a[i]<=a[i+1]) { dem+=1; j=i+1; while(a[j]<=a[j+1]) { dem +=1; j+=1; } if (dem > maxi) {maxi = dem;} dem=1; } } cout << maxi; return 0; }
GiangThang
Tổng số bài gửi : 67 Join date : 04/10/2022
Tiêu đề: Re: Giang Quang Thắng Tue Dec 06, 2022 12:54 am
using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); freopen("ARR2HVS1.inp","r", stdin); freopen("ARR2HVS1.out","w", stdout); int a[305][305]; int m, n, hi = 0; long long sum, p, s[305][305]; cin >> m >> n >> sum; for (int i = 1; i <= m; i++) for (int j = 1; j <= n; j++) cin >> a[i][j]; for (int i = 1; i <= m; i++) for (int j = 1; j <= n; j++) s[i][j] = s[i][j-1] + s[i-1][j] - s[i-1][j-1] + a[i][j]; for (int k = 1; k <= min(m,n); k++) for (int i = 1; i <= m; i++) for (int j = 1; j <= n; j++){ p = s[i+k-1][j+k-1] - s[i-1][j+k-1] - s[i+k-1][j-1] + s[i-1][j-1]; if (p == sum) { cout << i << " " << j << " " << k << endl; hi = 1; } } if (hi == 0) cout << -1; return 0; }
using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); freopen("ARR2HVS2.inp","r", stdin); freopen("ARR2HVS2.out","w", stdout); int a[305][305]; int m, n, hi = 0, res=-trunc(1e9); long long sum, p, s[305][305]; cin >> m >> n >> sum; for (int i = 1; i <= m; i++) for (int j = 1; j <= n; j++) cin >> a[i][j]; for (int i = 1; i <= m; i++) for (int j = 1; j <= n; j++) s[i][j] = s[i][j-1] + s[i-1][j] - s[i-1][j-1] + a[i][j]; for (int k = min(m,n); k >= 1; k--) for (int i = 1; i <= m; i++) for (int j = 1; j <= n; j++){ p = s[i+k-1][j+k-1] - s[i-1][j+k-1] - s[i+k-1][j-1] + s[i-1][j-1]; if (p == sum) { res = max(res,k); hi = 1; break; } } if (hi == 0) cout << -1; else cout << res; return 0; }
using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); freopen("ARR2HCN1.inp","r", stdin); freopen("ARR2HCN1.out","w", stdout); int a[305][305]; int m, n, hi = 0; long long sum, p, s[305][305]; cin >> m >> n >> sum; for (int i = 1; i <= m; i++) for (int j = 1; j <= n; j++) cin >> a[i][j]; for (int i = 1; i <= m; i++) for (int j = 1; j <= n; j++) s[i][j] = s[i][j-1] + s[i-1][j] - s[i-1][j-1] + a[i][j]; for (int i1 = 1; i1 <= m; i1++) for (int j1 = 1; j1 <= n; j1++) for (int i = i1; i <= m; i++) for (int j = j1; j <= n; j++){ p = s[i][j] - s[i1-1][j] - s[i][j1-1] + s[i1-1][j1-1]; if (p == sum) { cout << i1 << " " << j1 << " " << i << " " << j << endl; hi = 1; } } if (hi == 0) cout << -1; return 0; }
using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); freopen("ARR2HCN2.inp","r", stdin); freopen("ARR2HCN2.out","w", stdout); int a[305][305]; int m, n, hi = 0, k; long long p, s[305][305]; cin >> m >> n >> k; for (int i = 1; i <= m; i++) for (int j = 1; j <= n; j++) { cin >> x; a[i][j] = x % k; } for (int i = 1; i <= m; i++) for (int j = 1; j <= n; j++) s[i][j] = s[i][j-1] + s[i-1][j] - s[i-1][j-1] + a[i][j]; for (int i1 = 1; i1 <= m; i1++) for (int j1 = 1; j1 <= n; j1++) for (int i = i1; i <= m; i++) for (int j = j1; j <= n; j++){ p = s[i][j] - s[i1-1][j] - s[i][j1-1] + s[i1-1][j1-1]; if (p % k == 0) hi++; } cout << hi; return 0; }
GiangThang
Tổng số bài gửi : 67 Join date : 04/10/2022
Tiêu đề: Re: Giang Quang Thắng Tue Dec 13, 2022 1:31 am
Day5Bai9
Code:
#include <bits/stdc++.h>
using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); freopen("ARR2REC1.inp","r", stdin); freopen("ARR2REC1.out","w", stdout); int a[305][305]; int m, n, res = -trunc(1e9); long long p, s[305][305]; cin >> m >> n; for (int i = 1; i <= m; i++) for (int j = 1; j <= n; j++) { cin >> a[i][j]; } for (int i = 1; i <= m; i++) for (int j = 1; j <= n; j++) s[i][j] = s[i][j-1] + s[i-1][j] - s[i-1][j-1] + a[i][j]; for (int i1 = 1; i1 <= m; i1++) for (int j1 = 1; j1 <= n; j1++) for (int i = i1; i <= m; i++) for (int j = j1; j <= n; j++){ p = s[i][j] - s[i1-1][j] - s[i][j1-1] + s[i1-1][j1-1]; if (p == (i - i1 + 1)*(j - j1 + 1)) res = max(res, (i - i1 + 1)*(j - j1 + 1)); } 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 Tue Dec 13, 2022 1:41 am
Day5Bai10
Code:
#include <bits/stdc++.h>
using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); freopen("ARR2REC2.inp","r", stdin); freopen("ARR2REC2.out","w", stdout); int a[305][305]; int m, n, tam, res = -trunc(1e9); long long c[305], h[305], p; cin >> m >> n; for (int i = 1; i <= m; i++) for (int j = 1; j <= n; j++) { cin >> a[i][j]; } for (int i = 1; i <= m; i++) { tam = 0; for (int j = 1; j <= n; j++) tam += a[i][j]; h[i] = tam; } for (int j = 1; j <= n; j++) { tam = 0; for (int i = 1; i <= m; i++) tam += a[i][j]; c[j] = tam; } for (int i = 1; i <= m; i++) for (int j = 1; j <= n; j++) { p = h[i] + c[j] - a[i][j]; if (res < p) res = p; } 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 Sat Dec 17, 2022 9:25 pm
Day6Bai1
Code:
#include<bits/stdc++.h>
using namespace std; int n; int a[20]; void xuli() { for(int i = 1; i <= n; i++) cout << a[i] << " "; cout << "\n"; } void thu(int i) { for (int j = 0; j <= 1; j++) { a[i] = j; if (i == n) xuli(); else thu(i + 1); } } int main() { cin >> n; thu(1); return 0; }
GiangThang
Tổng số bài gửi : 67 Join date : 04/10/2022
Tiêu đề: Re: Giang Quang Thắng Sat Dec 17, 2022 9:30 pm
Day6Bai2
Code:
#include<bits/stdc++.h>
using namespace std; int n, p = 0; int a[20]; void xuli() { int dem = 0; for (int i = 1; i <= n; i++) if (a[i] == 0) dem++; else dem--; if (dem == 0){ p = 1; for(int i = 1; i <= n; i++) cout << a[i] << " "; cout << "\n";} } void thu(int i) { for (int j = 0; j <= 1; j++) { a[i] = j; if (i == n) xuli(); else thu(i + 1); } } int main() { cin >> n; thu(1); if (p == 0) cout << "NONE"; return 0; }