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 | |
| | Lê Quang Lâm - TK33 | |
| | |
Tác giả | Thông điệp |
---|
lequanglamyb2007
Tổng số bài gửi : 304 Join date : 25/07/2022
| Tiêu đề: Re: Lê Quang Lâm - TK33 Tue Sep 13, 2022 6:22 pm | |
| - Code:
-
#include <iostream> #include <cstdio>
using namespace std;
bool prime(int u) { if (u <= 1) return false; for (int i = 2; i * i <= u; i++) if (u % i == 0) return false; return true; }
void xuli(int n) { bool p = false; while (n > 0) { if (prime(n)) { p = true; break; } n /= 10; } if (p) cout << n; else cout << -1; }
int main() { freopen("numberc.inp","r",stdin); freopen("numberc.out","w",stdout); int n; cin >> n; xuli(n); return 0; }
| |
| | | lequanglamyb2007
Tổng số bài gửi : 304 Join date : 25/07/2022
| Tiêu đề: Re: Lê Quang Lâm - TK33 Tue Sep 13, 2022 6:33 pm | |
| - Code:
-
#include <iostream> #include <cstdio> #define NMAX 100000
using namespace std;
int a[NMAX]; int b[NMAX]; int n, k;
void xuli() { k = 0; for (int i = 0; i < n - 1; i++) { if (a[i] != a[i + 1]) { b[k] = a[i]; k++; } } b[k] = a[n - 1]; k++; for (int i = 0; i < k; i++) cout << b[i] << " "; }
int main() { freopen("arrdel.inp","r",stdin); freopen("arrdel.out","w",stdout); cin >> n; for (int i = 0; i < n; i++) cin >> a[i]; xuli(); return 0; }
| |
| | | lequanglamyb2007
Tổng số bài gửi : 304 Join date : 25/07/2022
| Tiêu đề: Re: Lê Quang Lâm - TK33 Tue Sep 13, 2022 6:57 pm | |
| - Code:
-
#include <iostream> #include <cstdio> #define NMAX 100000
using namespace std;
int a[NMAX];
void quicksort(int l, int r) { int i = l, j = r; int p = a[(l + r) / 2]; while (i <= j) { while (a[i] < p) i++; while (a[j] > p) j--; if (i <= j) { swap(a[i], a[j]); i++; j--; } } if (i < r) quicksort(i, r); if (l < j) quicksort(l, j); }
void xuli(int n) { quicksort(0, n - 1); for (int i = 0; i < n; i++) cout << a[i] << " "; }
int main() { freopen("qsort.inp","r",stdin); freopen("qsort.out","w",stdout); int n; cin >> n; for (int i = 0; i < n; i++) cin >> a[i]; xuli(n); return 0; }
| |
| | | lequanglamyb2007
Tổng số bài gửi : 304 Join date : 25/07/2022
| Tiêu đề: Re: Lê Quang Lâm - TK33 Thu Sep 15, 2022 6:05 pm | |
| - Code:
-
#include <iostream> #include <cstdio> #define NMAX 100000
using namespace std;
int a[NMAX]; int n, s;
void xuli() { bool p = false; int s1 = 0; for (int i = 0; i < n; i++) { s1 += a[i]; if (2 * s1 == s) { cout << i + 1 << " "; p = true; } } if (!p) cout << -1; }
int main() { freopen("ilucky.inp","r",stdin); freopen("ilucky.out","w",stdout); cin >> n; s = 0; for (int i = 0; i < n; i++) { cin >> a[i]; s += a[i]; } xuli(); return 0; }
| |
| | | lequanglamyb2007
Tổng số bài gửi : 304 Join date : 25/07/2022
| Tiêu đề: Re: Lê Quang Lâm - TK33 Thu Sep 15, 2022 6:20 pm | |
| - Code:
-
#include <iostream> #include <cstdio> #define NMAX 100000
using namespace std;
int a[NMAX]; long long s[NMAX + 1]; int n;
void xuli() { s[0] = 0; bool p = false; for (int i = 0; i < n; i++) s[i + 1] = s[i] + a[i]; for (int i = 1; i <= n; i++) if (2 * s[i] == s[n]) { cout << i; p = true; } if (!p) cout << -1; }
int main() { freopen("ilucky2.inp","r",stdin); freopen("ilucky2.out","w",stdout); cin >> n; for (int i = 0; i < n; i++) cin >> a[i]; xuli(); return 0; }
| |
| | | lequanglamyb2007
Tổng số bài gửi : 304 Join date : 25/07/2022
| Tiêu đề: Re: Lê Quang Lâm - TK33 Thu Sep 15, 2022 6:37 pm | |
| - Code:
-
#include <iostream> #include <cstdio> #define NMAX 100000
using namespace std;
int a[NMAX]; int n;
void xuli() { int rmin = a[0]; for (int i = 0; i < n; i++) if (a[i] < rmin) rmin = a[i]; for (int i = 0; i < n; i++) if (a[i] == rmin) cout << i + 1 << " "; }
int main() { freopen("pmin.inp","r",stdin); freopen("pmin.out","w",stdout); cin >> n; for (int i = 0; i < n; i++) cin >> a[i]; xuli(); return 0; }
| |
| | | lequanglamyb2007
Tổng số bài gửi : 304 Join date : 25/07/2022
| Tiêu đề: Re: Lê Quang Lâm - TK33 Thu Sep 15, 2022 6:52 pm | |
| - Code:
-
#include <iostream> #include <cstdio> #define NMAX 1000000
using namespace std;
int a[NMAX]; int n;
void xuli() { int rmin = a[0], rmax = a[0]; for (int i = 0; i < n; i++) { if (a[i] < rmin) rmin = a[i]; if (a[i] > rmax) rmax = a[i]; } int rmin2 = rmax; bool p = false; for (int i = 0; i < n; i++) { if (a[i] > rmin && a[i] < rmin2) { rmin2 = a[i]; p = true; } } if (p) { cout << rmin2 << "\n"; for (int i = 0; i < n; i++) if (a[i] == rmin2) cout << i + 1 << " "; } else cout << -1; }
int main() { freopen("psecond.inp","r",stdin); freopen("psecond.out","w",stdout); cin >> n; for (int i = 0; i < n; i++) cin >> a[i]; xuli(); return 0; }
| |
| | | lequanglamyb2007
Tổng số bài gửi : 304 Join date : 25/07/2022
| Tiêu đề: Re: Lê Quang Lâm - TK33 Thu Sep 29, 2022 2:34 pm | |
| - Code:
-
#include <iostream> #include <cstdio>
// gcd.*
using namespace std;
int gcd(int a, int b) { if (a < b) swap(a, b); while (b > 0) { int r = a % b; a = b; b = r; } return a; }
int xuli(int a, int b, int c) { int r1 = gcd(a, b); return gcd(r1, c); }
int main() { freopen("gcd.inp","r",stdin); freopen("gcd.out","w",stdout); int a, b, c; cin >> a >> b >> c; cout << xuli(a, b, c) << endl; return 0; }
| |
| | | lequanglamyb2007
Tổng số bài gửi : 304 Join date : 25/07/2022
| Tiêu đề: Re: Lê Quang Lâm - TK33 Thu Sep 29, 2022 3:01 pm | |
| - Code:
-
#include <iostream> #include <cstdio> #define NMAX 100000
// arradd2.*
using namespace std;
int a[NMAX]; int n; int b[NMAX]; int m; int c[2 * NMAX];
void xuli() { int i = 0, j = 0, k = 0; while (i < n && j < m) { if (a[i] <= b[j]) { c[k] = a[i]; i++; } else { c[k] = b[j]; j++; } k++; } while (i < n) { c[k] = a[i]; i++; k++; } while (j < m) { c[k] = b[j]; j++; k++; } }
int main() { freopen("arradd2.inp","r",stdin); freopen("arradd2.out","w",stdout); cin >> n; for (int i = 0; i < n; i++) cin >> a[i]; cin >> m; for (int i = 0; i < m; i++) cin >> b[i]; xuli(); for (int i = 0; i < m + n; i++) cout << c[i] << " "; return 0; }
| |
| | | lequanglamyb2007
Tổng số bài gửi : 304 Join date : 25/07/2022
| Tiêu đề: Re: Lê Quang Lâm - TK33 Thu Sep 29, 2022 3:31 pm | |
| - Code:
-
#include <iostream> #include <cstdio> #define NMAX 100000
// arrcount.*
using namespace std;
int a[NMAX]; int c[NMAX]; int d[NMAX]; int n;
void quicksort(int l, int r) { int i = l, j = r; int p = a[(l + r) / 2]; while (i <= j) { while (a[i] < p) i++; while (a[j] > p) j--; if (i <= j) { swap(a[i], a[j]); i++; j--; } } if (i < r) quicksort(i, r); if (l < j) quicksort(l, j); }
void xuli() { quicksort(0, n - 1); int k = 0, counter = 1; for (int i = 0; i < n - 1; i++) { if (a[i] == a[i + 1]) counter++; else { c[k] = counter; d[k] = a[i]; k++; counter = 1; } } c[k] = counter; d[k] = a[n - 1]; k++; for (int i = 0; i < k; i++) cout << d[i] << " " << c[i] << endl; }
int main() { freopen("arrcount.inp","r",stdin); freopen("arrcount.out","w",stdout); cin >> n; for (int i = 0; i < n; i++) cin >> a[i]; xuli(); return 0; }
| |
| | | lequanglamyb2007
Tổng số bài gửi : 304 Join date : 25/07/2022
| Tiêu đề: Re: Lê Quang Lâm - TK33 Thu Sep 29, 2022 3:50 pm | |
| - Code:
-
#include <iostream> #include <cstdio> #define NMAX 1000000
// arrcount.* (method 2)
using namespace std;
int a[NMAX]; int c[NMAX]; int n; int rmax;
void xuli() { for (int i = 0; i <= rmax; i++) c[i] = 0; for (int i = 0; i < n; i++) c[a[i]]++; for (int i = 0; i <= rmax; i++) if (c[i] > 0) cout << i << " " << c[i] << endl; }
int main() { freopen("arrcount.inp","r",stdin); freopen("arrcount.out","w",stdout); rmax = 0; cin >> n; for (int i = 0; i < n; i++) { cin >> a[i]; rmax = max(rmax, a[i]); } xuli(); return 0; }
| |
| | | lequanglamyb2007
Tổng số bài gửi : 304 Join date : 25/07/2022
| Tiêu đề: Re: Lê Quang Lâm - TK33 Thu Sep 29, 2022 4:09 pm | |
| - Code:
-
#include <iostream> #define NMAX 100000
// bins.*
using namespace std;
int a[NMAX]; int n;
int bsearch(int x) { int lt = 0, rt = n - 1; while (lt <= rt) { int m = (lt + rt) / 2; if (a[m] == x) return m + 1; else if (a[m] > x) rt = m - 1; else lt = m + 1; } return -1; }
int main() { freopen("bins.inp","r",stdin); freopen("bins.out","w",stdout); int x; cin >> n >> x; for (int i = 0; i < n; i++) cin >> a[i]; cout << bsearch(x); return 0; }
| |
| | | lequanglamyb2007
Tổng số bài gửi : 304 Join date : 25/07/2022
| Tiêu đề: Re: Lê Quang Lâm - TK33 Tue Oct 04, 2022 5:13 pm | |
| - Code:
-
#include <iostream> #define NMAX 100000
// upseq.*
using namespace std;
int a[NMAX]; int n;
bool kiemtra(int l, int r) { for (int i = l; i < r; i++) { if (a[i] > a[i + 1]) return false; } return true; }
void sub1() { int rlen = 0; for (int i = 0; i < n; i++) for (int j = i; j < n; j++) if (kiemtra(i, j)) rlen = max(rlen, j - i + 1); cout << rlen; }
int main() { freopen("upseq.inp","r",stdin); freopen("upseq.out","w",stdout); cin >> n; for (int i = 0; i < n; i++) { cin >> a[i]; } sub1(); return 0; }
| |
| | | lequanglamyb2007
Tổng số bài gửi : 304 Join date : 25/07/2022
| Tiêu đề: Re: Lê Quang Lâm - TK33 Tue Oct 04, 2022 5:15 pm | |
| - Code:
-
#include <iostream> #include <cmath> #define NMAX 100000
// upseq.*
using namespace std;
int a[NMAX]; int n;
void xuli() { // a[n+1] = -trunc(1e9); int d = 1, res = 0; for (int i = 1; i <= n; i++) { if ( i + 1 <= n && a[i] <= a[i + 1]) d++; else { res = max(res, d); d = 1; } } cout << res; }
int main() { freopen("upseq.inp","r",stdin); freopen("upseq.out","w",stdout); cin >> n; for (int i = 1; i <= n; i++) cin >> a[i]; xuli(); return 0; } | |
| | | lequanglamyb2007
Tổng số bài gửi : 304 Join date : 25/07/2022
| Tiêu đề: Re: Lê Quang Lâm - TK33 Tue Oct 04, 2022 5:35 pm | |
| - Code:
-
#include <iostream>
// arr2d.*
using namespace std;
const size_t NMAX = 3000;
int a[NMAX][NMAX]; long long h[NMAX], c[NMAX]; int m, n;
void xuli() { for (int i = 0; i < m; i++) { // h[i]: tong hang thu i long long t = 0; for (int j = 0; j < n; j++) t += a[i][j]; h[i] = t; } for (int j = 0; j < n; j++) { // c[j]: tong cot thu j long long t = 0; for (int i = 0; i < m; i++) t += a[i][j]; c[j] = t; } for (int i = 0; i < m; i++) cout << h[i] << " "; cout << endl; for (int j = 0; j < n; j++) cout << c[j] << " "; }
int main() { freopen("arr2d.inp","r",stdin); freopen("arr2d.out","w",stdout); cin >> m >> n; for (int i = 0; i < m; i++) for (int j = 0; j < n; j++) cin >> a[i][j]; xuli(); return 0; }
| |
| | | lequanglamyb2007
Tổng số bài gửi : 304 Join date : 25/07/2022
| Tiêu đề: Re: Lê Quang Lâm - TK33 Tue Oct 04, 2022 6:01 pm | |
| - Code:
-
#include <iostream>
// arr2dpri.*
using namespace std;
const size_t NMAX = 3000, NMAX2 = 1000001;
int a[NMAX][NMAX]; bool f[NMAX2]; int m, n; int vmax;
void eratos(int u) { for (int i = 2; i <= u; i++) f[i] = true; for (int i = 2; i * i <= u; i++) if (f[i]) for (int j = i * i; j <= u; j += i) f[j] = false; }
int main() { freopen("arr2dpri.inp","r",stdin); freopen("arr2dpri.out","w",stdout); cin >> m >> n; vmax = 0; for (int i = 0; i < m; i++) for (int j = 0; j < n; j++) { cin >> a[i][j]; vmax = max(vmax, a[i][j]); } eratos(vmax); bool p = false; for (int i = 0; i < m; i++) for (int j = 0; j < n; j++) if (f[a[i][j]]) { cout << i + 1 << " " << j + 1 << endl; p = true; } if (!p) cout << -1; return 0; }
| |
| | | lequanglamyb2007
Tổng số bài gửi : 304 Join date : 25/07/2022
| Tiêu đề: Re: Lê Quang Lâm - TK33 Tue Oct 04, 2022 6:54 pm | |
| - Code:
-
#include <iostream>
// arr2dsqu.*
using namespace std; const size_t NMAX = 3001;
int a[NMAX][NMAX]; long long s[NMAX][NMAX]; int m, n; int k;
long long tong(int rl, int cl, int rr, int cr) { long long res = 0; for (int i = rl; i <= rr; i++) for (int j = cl; j <= cr; j++) res += a[i][j]; return res; }
void sub1() { int res = 0, p; for (int i = 0; i < m - k; i++) for (int j = 0; j < n - k; j++) { p = tong(i, j, i + k - 1, j + k - 1); res = max(res, p); } cout << res << endl; for (int i = 0; i < m - k; i++) for (int j = 0; j < n - k; j++) { p = tong(i, j, i + k - 1, j + k - 1); if (p == res) cout << i + 1 << " " << j + 1 << endl; } }
void sub2() { int res = 0, p; s[0][0] = 0; for (int i = 0; i < m; i++) { s[i + 1][0] = 0; } for (int j = 0; j < n; j++) { s[0][j + 1] = 0; } 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 - 1][j - 1]; for (int i = 1; i <= m - k; i++) for (int j = 1; j <= n - k; 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]; res = max(res, p); } cout << res << endl; for (int i = 1; i <= m - k; i++) for (int j = 1; j <= n - k; 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 == res) cout << i << " " << j << endl; } }
int main() { freopen("arr2dsqu.inp","r",stdin); freopen("arr2dsqu.out","w",stdout); cin >> m >> n >> k; for (int i = 0; i < m; i++) for (int j = 0; j < n; j++) cin >> a[i][j]; sub1(); return 0; }
| |
| | | lequanglamyb2007
Tổng số bài gửi : 304 Join date : 25/07/2022
| Tiêu đề: Re: Lê Quang Lâm - TK33 Thu Oct 06, 2022 6:06 pm | |
| - Code:
-
#include <iostream>
// arr2hvs1.*
using namespace std;
const size_t NMAX = 1001;
int a[NMAX][NMAX]; long long s[NMAX][NMAX]; int m, n; long long vsum;
void xuli() { long long p; bool found = false; s[0][0] = 0; for (int i = 0; i < m; i++) { s[i + 1][0] = 0; } for (int j = 0; j < n; j++) { s[0][j + 1] = 0; } 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 - 1][j - 1]; int t = min(m, n); for (int k = 1; k <= t; k++) for (int i = 1; i <= m - k + 1; i++) for (int j = 1; j <= n - k + 1; 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]; // cout << p << endl; if (p == vsum) { found = true; cout << i << " " << j << " " << k << endl; } } if (!found) cout << -1 << endl; }
int main() { freopen("arr2hvs1.inp","r",stdin); freopen("arr2hvs1.out","w",stdout); cin >> m >> n >> vsum; for (int i = 0; i < m; i++) for (int j = 0; j < n; j++) cin >> a[i][j]; xuli(); return 0; }
| |
| | | lequanglamyb2007
Tổng số bài gửi : 304 Join date : 25/07/2022
| Tiêu đề: Re: Lê Quang Lâm - TK33 Thu Oct 06, 2022 6:14 pm | |
| - Code:
-
#include <iostream>
// arr2hvs2.*
using namespace std;
const size_t NMAX = 1001;
int a[NMAX][NMAX]; long long s[NMAX][NMAX]; int m, n; long long vsum;
void xuli() { long long p; // int res = -1; s[0][0] = 0; for (int i = 0; i < m; i++) { s[i + 1][0] = 0; } for (int j = 0; j < n; j++) { s[0][j + 1] = 0; } 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 - 1][j - 1]; int t = min(m, n); for (int k = t; k >= 1; k--) for (int i = 1; i <= m - k + 1; i++) for (int j = 1; j <= n - k + 1; 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]; // cout << p << endl; if (p == vsum) { cout << k << endl; return; } } cout << -1 << endl; }
int main() { freopen("arr2hvs2.inp","r",stdin); freopen("arr2hvs2.out","w",stdout); cin >> m >> n >> vsum; for (int i = 0; i < m; i++) for (int j = 0; j < n; j++) cin >> a[i][j]; xuli(); return 0; }
| |
| | | lequanglamyb2007
Tổng số bài gửi : 304 Join date : 25/07/2022
| Tiêu đề: Re: Lê Quang Lâm - TK33 Thu Oct 06, 2022 6:27 pm | |
| - Code:
-
#include <iostream>
// arr2hcn1.*
using namespace std;
const size_t NMAX = 1001;
int a[NMAX][NMAX]; long long s[NMAX][NMAX]; int m, n; long long vsum;
void xuli() { long long p; bool found = false; s[0][0] = 0; for (int i = 0; i < m; i++) { s[i + 1][0] = 0; } for (int j = 0; j < n; j++) { s[0][j + 1] = 0; } 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 - 1][j - 1]; // int t = min(m, n); for (int i1 = 1; i1 <= m; i1++) for (int j1 = 1; j1 <= n; j1++) for (int i2 = i1; i2 <= m; i2++) for (int j2 = j1; j2 <= n; j2++) { p = s[i2][j2] - s[i1 - 1][j2] - s[i2][j1 - 1] + s[i1 - 1][j1 - 1]; // cout << p << endl; if (p == vsum) { found = true; cout << i1 << " " << j1 << " " << i2 << " " << j2 << endl; } } if (!found) cout << -1 << endl; }
int main() { freopen("arr2hcn1.inp","r",stdin); freopen("arr2hcn1.out","w",stdout); cin >> m >> n >> vsum; for (int i = 0; i < m; i++) for (int j = 0; j < n; j++) cin >> a[i][j]; xuli(); return 0; }
| |
| | | lequanglamyb2007
Tổng số bài gửi : 304 Join date : 25/07/2022
| Tiêu đề: Re: Lê Quang Lâm - TK33 Thu Oct 06, 2022 6:36 pm | |
| - Code:
-
#include <iostream>
// arr2hcn2.*
using namespace std;
const size_t NMAX = 1001;
int a[NMAX][NMAX]; long long s[NMAX][NMAX]; int m, n; long long vdiv;
void xuli() { long long p;
int cnt = 0; s[0][0] = 0; for (int i = 0; i < m; i++) { s[i + 1][0] = 0; } for (int j = 0; j < n; j++) { s[0][j + 1] = 0; } 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 - 1][j - 1]; // int t = min(m, n); for (int i1 = 1; i1 <= m; i1++) for (int j1 = 1; j1 <= n; j1++) for (int i2 = i1; i2 <= m; i2++) for (int j2 = j1; j2 <= n; j2++) { p = s[i2][j2] - s[i1 - 1][j2] - s[i2][j1 - 1] + s[i1 - 1][j1 - 1]; // cout << p << endl; if (p % vdiv == 0) {
cnt++; } } if (cnt == 0) cout << -1 << endl; else cout << cnt << endl; }
int main() { freopen("arr2hcn2.inp","r",stdin); freopen("arr2hcn2.out","w",stdout); cin >> m >> n >> vdiv; for (int i = 0; i < m; i++) for (int j = 0; j < n; j++) { cin >> a[i][j]; a[i][j] %= vdiv; } xuli(); return 0; }
| |
| | | lequanglamyb2007
Tổng số bài gửi : 304 Join date : 25/07/2022
| Tiêu đề: Re: Lê Quang Lâm - TK33 Thu Oct 06, 2022 6:54 pm | |
| - Code:
-
#include <iostream>
// arr2rec1.*
using namespace std;
const size_t NMAX = 1001;
int a[NMAX][NMAX]; long long s[NMAX][NMAX]; int m, n; long long vsum;
void xuli() { long long p, res = 0, t; s[0][0] = 0; for (int i = 0; i < m; i++) { s[i + 1][0] = 0; } for (int j = 0; j < n; j++) { s[0][j + 1] = 0; } 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 - 1][j - 1]; // int t = min(m, n); for (int i1 = 1; i1 <= m; i1++) for (int j1 = 1; j1 <= n; j1++) for (int i2 = i1; i2 <= m; i2++) for (int j2 = j1; j2 <= n; j2++) { p = s[i2][j2] - s[i1 - 1][j2] - s[i2][j1 - 1] + s[i1 - 1][j1 - 1]; t = (i2 - i1 + 1) * (j2 - j1 + 1); // cout << p << endl; if (p == t) { res = max(res, t); } } cout << res; }
int main() { freopen("arr2rec1.inp","r",stdin); freopen("arr2rec1.out","w",stdout); cin >> m >> n; for (int i = 0; i < m; i++) for (int j = 0; j < n; j++) cin >> a[i][j]; xuli(); return 0; }
| |
| | | lequanglamyb2007
Tổng số bài gửi : 304 Join date : 25/07/2022
| Tiêu đề: Re: Lê Quang Lâm - TK33 Thu Oct 06, 2022 10:08 pm | |
| - Code:
-
#include <iostream> #include <string>
// str1num.*
using namespace std;
const size_t NMAX = 100000;
int rtmp[NMAX];
void numseprstr(string s) { string t = ""; int k = 0; for (size_t i = 0; i < s.size(); i++) { if (s[i] >= '0' && s[i] <= '9') t = t + s[i]; else if (t != "") { //cout << t << endl; rtmp[k] = stoi(t, nullptr, 10); k++; t = ""; } } if (t.size() > 0) { //cout << t << endl; rtmp[k] = stoi(t, nullptr, 10); k++; } for (int i = 0; i < k; i++) cout << rtmp[i] << endl; }
int main() { freopen("str1num.inp","r",stdin); freopen("str1num.out","w",stdout); string s; getline(cin, s); numseprstr(s); return 0; }
| |
| | | lequanglamyb2007
Tổng số bài gửi : 304 Join date : 25/07/2022
| Tiêu đề: Re: Lê Quang Lâm - TK33 Thu Oct 06, 2022 10:36 pm | |
| - Code:
-
#include <iostream>
// str2num.*
using namespace std;
const size_t NMAX = 100000;
int rtmp[NMAX];
void numfmaxstr(string s) { string t = ""; int k = 0; for (size_t i = 0; i < s.size(); i++) { if (s[i] >= '0' && s[i] <= '9') t = t + s[i]; else if (t != "") { //cout << t << endl; rtmp[k] = stoi(t, nullptr, 10); k++; t = ""; } } if (t.size() > 0) { //cout << t << endl; rtmp[k] = stoi(t, nullptr, 10); k++; } if (k > 0) { int rmax = rtmp[0]; for (int i = 1; i < k; i++) if (rtmp[i] > rmax) rmax = rtmp[i]; cout << rmax; } }
int main() { freopen("str2num.inp","r",stdin); freopen("str2num.out","w",stdout); string s; getline(cin, s); numfmaxstr(s); return 0; }
| |
| | | lequanglamyb2007
Tổng số bài gửi : 304 Join date : 25/07/2022
| Tiêu đề: Re: Lê Quang Lâm - TK33 Thu Oct 06, 2022 10:50 pm | |
| - Code:
-
#include <iostream>
// str22num.*
using namespace std;
const size_t NMAX = 100000;
char b[NMAX]; int c[NMAX];
void submain(string s) { int counter = 1; int k = 0; size_t n = s.size(); for (size_t i = 0; i < n - 1; i++) { if (s[i] == s[i + 1]) counter++; else { b[k] = s[i]; c[k] = counter; k++; counter = 1; } } b[k] = s[n - 1]; c[k] = counter; k++; for (int i = 0; i < k; i++) cout << b[i] << c[i]; }
int main() { freopen("str22num.inp","r",stdin); freopen("str22num.out","w",stdout); string s; // cout << "Enter string: "; getline(cin, s); submain(s); return 0; }
| |
| | | Sponsored content
| Tiêu đề: Re: Lê Quang Lâm - TK33 | |
| |
| | | | Lê Quang Lâm - TK33 | |
|
Similar topics | |
|
| Permissions in this forum: | Bạn không có quyền trả lời bài viết
| |
| |
| |