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 Thu Oct 06, 2022 10:57 pm | |
| - Code:
-
#include <iostream> #include <string>
// str3num.*
using namespace std;
const size_t NMAX = 100000;
char c[NMAX]; int rtmp[NMAX];
void submain(string s) { string t = ""; size_t i = 0; int k = 0; while(i < s.size()) { if (s[i] >= 'a' && s[i] <= 'z') c[k] = s[i]; while (s[i] >= '0' && s[i] <= '9') { t = t + s[i]; i++; } if (t != "") { //cout << t << endl; rtmp[k] = stoi(t, nullptr, 10); k++; t = ""; } else i++; } if (t.size() > 0) { //cout << t << endl; rtmp[k] = stoi(t, nullptr, 10); k++; } for (int i = 0; i < k; i++) for (int j = 0; j < rtmp[i]; j++) cout << c[i]; }
int main() { freopen("str3num.inp","r",stdin); freopen("str3num.out","w",stdout); string s; // cout << "Enter string: "; cin >> s; submain(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 Tue Oct 11, 2022 5:15 pm | |
| - Code:
-
#include <iostream>
// arr2rec2.*
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++) { long long rsum = 0; for (int j = 0; j < n; j++) rsum += a[i][j]; h[i] = rsum; } for (int j = 0; j < n; j++) { long long csum = 0; for (int i = 0; i < m; i++) csum += a[i][j]; c[j] = csum; } long long res = 0, p; for (int i = 0; i < m; i++) for (int j = 0; j < n; j++) { p = h[i] + c[j] - a[i][j]; res = max(res, p); } for (int i = 0; i < m; i++) for (int j = 0; j < n; j++) { p = h[i] + c[j] - a[i][j]; if (p == res) cout << i + 1 << " " << j + 1 << endl; } }
int main() { freopen("arr2rec2.inp","r",stdin); freopen("arr2rec2.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 11, 2022 5:57 pm | |
| - Code:
-
#include <iostream> #include <cstring>
// arr2rec3.*
using namespace std;
const size_t NMAX = 3000;
int a[NMAX + 4][NMAX + 4]; int x[8] = {-1, 1, 2, 2, 1, -1, -2, -2}; int y[8] = {2, 2, 1, -1, -2, -2, -1, 1}; int m, n;
void xuli() { long long res = 0, p; for (int i = 0; i < m; i++) for (int j = 0; j < n; j++) { p = 0; for (int k = 0; k < 7; k++) p += a[i + 2 + y[k]][j + 2 + x[k]]; res = max(res, p); } for (int i = 0; i < m; i++) for (int j = 0; j < n; j++) { p = 0; for (int k = 0; k < 7; k++) p += a[i + 2 + y[k]][j + 2 + x[k]]; if (p == res) cout << i + 1 << " " << j + 1 << endl; } }
int main() { freopen("arr2rec3.inp","r",stdin); freopen("arr2rec3.out","w",stdout); cin >> m >> n; for (int i = 0; i < m; i++) memset(a[i], 0, (n + 4) * sizeof(int)); for (int i = 0; i < m; i++) for (int j = 0; j < n; j++) cin >> a[i + 2][j + 2]; 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 11, 2022 6:11 pm | |
| - Code:
-
#include <iostream>
// dqbit01.*
using namespace std;
const size_t NMAX = 100000;
int a[NMAX]; int n;
void xuli(int i) { for (int j = 0; j <= 1; j++) { a[i] = j; if (i == n - 1) { for (int k = 0; k < n; k++) cout << a[k]; cout << endl; } else xuli(i + 1); } }
int main() { freopen("dqbit01.inp","r",stdin); freopen("dqbit01.out","w",stdout); cin >> n; xuli(0); 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 11, 2022 6:22 pm | |
| - Code:
-
#include <iostream>
// dqbit02.*
using namespace std;
const size_t NMAX = 100000;
int a[NMAX]; int n;
void print_result() { int cnt = 0; for (int k = 0; k < n; k++) if (a[k] == 0) cnt++; if (cnt != n - cnt) return; for (int k = 0; k < n; k++) cout << a[k]; cout << endl; }
void xuli(int i) { for (int j = 0; j <= 1; j++) { a[i] = j; if (i == n - 1) print_result(); else xuli(i + 1); } }
int main() { freopen("dqbit02.inp","r",stdin); freopen("dqbit02.out","w",stdout); cin >> n; xuli(0); 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 11, 2022 6:27 pm | |
| - Code:
-
#include <iostream>
// dqbit03.*
using namespace std;
const size_t NMAX = 100000;
int a[NMAX]; int n;
void print_result() { for (int k = 0; k < n - 2; k++) if (a[k] + a[k + 1] + a[k + 2] == 3) return; for (int k = 0; k < n; k++) cout << a[k]; cout << endl; }
void xuli(int i) { for (int j = 0; j <= 1; j++) { a[i] = j; if (i == n - 1) print_result(); else xuli(i + 1); } }
int main() { freopen("dqbit03.inp","r",stdin); freopen("dqbit03.out","w",stdout); cin >> n; xuli(0); 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 11, 2022 6:33 pm | |
| - Code:
-
#include <iostream>
// dqbit04.*
using namespace std;
const size_t NMAX = 100000;
int a[NMAX]; int n, k;
void print_result() { int cnt = 0; for (int i = 0; i < n; i++) if (a[i] == 1) cnt++; if (cnt != k) return; for (int i = 0; i < n; i++) cout << a[i]; cout << endl; }
void xuli(int i) { for (int j = 0; j <= 1; j++) { a[i] = j; if (i == n - 1) print_result(); else xuli(i + 1); } }
int main() { freopen("dqbit04.inp","r",stdin); freopen("dqbit04.out","w",stdout); cin >> n >> k; xuli(0); 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 11, 2022 6:35 pm | |
| - Code:
-
#include <iostream>
// dqbit05.*
using namespace std;
const size_t NMAX = 100000;
int a[NMAX]; int n, k;
void print_result() { int cnt = 0; for (int i = 0; i < n; i++) if (a[i] == 1) cnt++; if (cnt > k) return; for (int i = 0; i < n; i++) cout << a[i]; cout << endl; }
void xuli(int i) { for (int j = 0; j <= 1; j++) { a[i] = j; if (i == n - 1) print_result(); else xuli(i + 1); } }
int main() { freopen("dqbit05.inp","r",stdin); freopen("dqbit05.out","w",stdout); cin >> n >> k; xuli(0); return 0; }
| |
| | | lequanglamyb2007
Tổng số bài gửi : 304 Join date : 25/07/2022
| Tiêu đề: Re: Lê Quang Lâm - TK33 Wed Oct 12, 2022 8:36 pm | |
| - Code:
-
#include <iostream>
// dqbit07.*
using namespace std;
const size_t NMAX = 100000;
int a[NMAX], b[NMAX]; int n; long long s; bool p;
void print_result() { long long s1 = 0; int dem = 0; for (int i = 0; i < n; i++) if (b[i] == 1) { s1 += a[i]; dem++; } if (s1 == s - s1) { p = true; for (int i = 0; i < n; i++) if (b[i] == 1) cout << a[i] << " "; cout << ", "; for (int i = 0; i < n; i++) if (b[i] == 0) cout << a[i] << " "; cout << endl; } }
void xuli(int i) { for (int j = 0; j <= 1; j++) { b[i] = j; if (i == n - 1) print_result(); else xuli(i + 1); } }
int main() { freopen("dqbit07.inp","r",stdin); freopen("dqbit07.out","w",stdout); cin >> n; s = 0; for (int i = 0; i < n; i++) { cin >> a[i]; s += a[i]; } p = false; xuli(0); if (!p) cout << -1 << endl; return 0; }
Được sửa bởi lequanglamyb2007 ngày Thu Oct 13, 2022 6:09 pm; sửa lần 1. | |
| | | lequanglamyb2007
Tổng số bài gửi : 304 Join date : 25/07/2022
| Tiêu đề: Re: Lê Quang Lâm - TK33 Wed Oct 12, 2022 9:30 pm | |
| - Code:
-
#include <iostream>
// perfectn.*
using namespace std;
long long sumdivs(int n) { long long s = 0; for (int i = 1; i * i <= n; i++) { if (n % i == 0) { s += i; if (i != n / i) { s += n / i; } } } return s; }
void xuli() { int n; cin >> n; if (sumdivs(n) == n * 2LL) cout << 1; else cout << 0; }
int main() { freopen("perfectn.inp","r",stdin); freopen("perfectn.out","w",stdout); 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 Wed Oct 12, 2022 10:09 pm | |
| - Code:
-
#include <iostream> #include <string>
// npalin.*
using namespace std;
string str_reverse(string s) { size_t n = s.size(); string s1; s1 = ""; for (size_t i = 0; i < n; i++) { s1 = s[i] + s1; } return s1; }
bool palin(int u) { string s = to_string(u); return s == str_reverse(s); }
void xuli(int n) { int v = -1, i = 0; while (i < n) { v++; if (palin(v)) i++;
} cout << v; }
int main() { freopen("npalin.inp","r",stdin); freopen("npalin.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 Wed Oct 12, 2022 10:29 pm | |
| - Code:
-
#include <iostream>
// lastnum.*
using namespace std;
long long amub(int a, int b) { if (b == 0) return 1; if (b == 1) return a; long long t = amub(a, b / 2); return (t * t * amub(a, b % 2)) % 10; }
int main() { freopen("lastnum.inp","r",stdin); freopen("lastnum.out","w",stdout); int a, n; cin >> a >> n; cout << amub(a, 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 Wed Oct 12, 2022 11:10 pm | |
| - Code:
-
#include <iostream>
// fibprime.*
using namespace std;
long long arr[104];
int m, n;
bool prime(long long u) { if (u <= 1) return false; for (long long i = 2; i * i <= u; i++) if (u % i == 0) return false; return true; }
void xuli() { bool p = false; for (int i = m; i <= n; i++) if (prime(arr[i])) { p = true; cout << arr[i] << endl; } if (!p) cout << -1 << endl; }
int main() { freopen("fibprime.inp","r",stdin); freopen("fibprime.out","w",stdout); arr[1] = 1; arr[2] = 1; for (int i = 3; i <= 103; i++) { arr[i] = arr[i - 1] + arr[i - 2];/*cout << arr[i] << " ";*/ } cin >> m >> n; 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 13, 2022 5:58 pm | |
| - Code:
-
#include <iostream>
// dqbit06.*
using namespace std;
const size_t NMAX = 100000;
int a[NMAX], b[NMAX], d[NMAX]; int n, res; long long k;
void print_result() { long long s = 0; int dem = 0; for (int i = 0; i < n; i++) if (b[i] == 1) { s += a[i]; dem++; } if (s == k && dem > res) { for (int i = 0; i < n; i++) d[i] = b[i]; res = dem; } }
void xuli(int i) { for (int j = 0; j <= 1; j++) { b[i] = j; if (i == n - 1) print_result(); else xuli(i + 1); } }
int main() { freopen("dqbit06.inp","r",stdin); freopen("dqbit06.out","w",stdout); cin >> n >> k; for (int i = 0; i < n; i++) cin >> a[i]; res = 0; xuli(0); cout << res << endl; for (int i = 0; i < n; i++) if (d[i] == 1) cout << a[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 Oct 13, 2022 6:25 pm | |
| - Code:
-
#include <iostream>
// dqbit08.*
using namespace std;
const size_t NMAX = 100000;
int a[NMAX], b[NMAX], d[NMAX]; int n; long long s, res; bool p;
void print_result() { for (int k = 0; k < n - 2; k++) if (b[k] + b[k + 1] + b[k + 2] == 3) return; long long s1 = 0; int dem = 0; for (int i = 0; i < n; i++) if (b[i] == 1) { s1 += a[i]; dem++; } if (s1 > res) { p = true; res = s1; for (int i = 0; i < n; i++) d[i] = b[i]; } }
void xuli(int i) { for (int j = 0; j <= 1; j++) { b[i] = j; if (i == n - 1) print_result(); else xuli(i + 1); } }
int main() { freopen("dqbit08.inp","r",stdin); freopen("dqbit08.out","w",stdout); cin >> n; s = 0; for (int i = 0; i < n; i++) { cin >> a[i]; s += a[i]; } res = LONG_MIN; p = false; xuli(0); if (p) { for (int i = 0; i < n; i++) if (d[i] == 1) cout << a[i] << " "; } else cout << -1 << 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 Oct 13, 2022 6:47 pm | |
| - Code:
-
#include <iostream>
// gcd.*
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) { for (int i = 1; i * i <= n; i++) { if (n % i == 0) { if (prime(i)) cout << i << " "; if (i != n / i && prime(n / i)) { cout << i << " "; } } } }
int main() { freopen("gcd.inp","r",stdin); freopen("gcd.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 Mon Oct 17, 2022 4:52 pm | |
| - Code:
-
#include <iostream>
// cdiv.*
using namespace std;
int divcnt(int n) { int cnt = 0; for (int i = 1; i * i <= n; i++) { if (n % i == 0) { cnt++; if (i != n / i) { cnt++; } } } return cnt; }
void xuli(int n, int k) { bool p = false; for (int i = 1; i < n; i++) if (divcnt(i) == k) { cout << i << " "; p = true; } if (!p) cout << -1; }
int main() { freopen("cdiv.inp","r",stdin); freopen("cdiv.out","w",stdout); int n, k; cin >> n >> k; xuli(n, k); return 0; }
| |
| | | lequanglamyb2007
Tổng số bài gửi : 304 Join date : 25/07/2022
| Tiêu đề: Re: Lê Quang Lâm - TK33 Mon Oct 17, 2022 5:24 pm | |
| - Code:
-
#include <iostream>
// nprime.*
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) { int n1 = n, n2 = n; do { n1--; } while (!prime(n1)); do { n2++; } while (!prime(n2)); cout << n1 << " " << n2; }
int main() { freopen("nprime.inp","r",stdin); freopen("nprime.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 Oct 18, 2022 5:46 pm | |
| - Code:
-
#include <iostream>
// divprime.*
using namespace std;
const size_t NMAX = 100000;
int arr[NMAX]; int k;
void phantich(int u) { k = 0; int i = 2; while (i * i <= u) { if (u % i == 0) { arr[k] = i; k++; u /= i; } else i++; } if (u > 1) { arr[k] = u; k++; } }
int gcd(int a, int b) { while (b > 0) { int r = a % b; a = b; b = r; } return a; }
void xuli(int a, int b, int c) { int r = gcd(gcd(a, b), c); if (r == 1) cout << -1; else { phantich(r); cout << arr[k - 1]; } }
int main() { freopen("divprime.inp","r",stdin); freopen("divprime.out","w",stdout); int a, b, c; cin >> a >> b >> c; xuli(a, b, c); 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 18, 2022 5:55 pm | |
| - Code:
-
#include <iostream> #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 Oct 18, 2022 6:12 pm | |
| - Code:
-
#include <iostream> #include <cstdio> #define NMAX 100000
// nfind.*
using namespace std;
int arr[NMAX]; int arr2[NMAX]; int k;
void phantich(int u) { k = 0; int i = 2; while (i * i <= u) { if (u % i == 0) { arr[k] = i; k++; u /= i; } else i++; } if (u > 1) { arr[k] = u; k++; } }
void xuli(int m) { phantich(m); for (int i = 0; i < k; i++) if (arr[i] >= 10) { cout << -1; return; } int t = 1, i = k - 1, q = 0; while (i >= 0) { t *= arr[i]; if (t >= 10) { arr2[q] = t / arr[i]; q++; t = 1; } else i--; } if (t > 1) { arr2[q] = t; q++; } for (int i1 = q - 1; i1 >= 0; i1--) cout << arr2[i1]; }
int main() { freopen("nfind.inp","r",stdin); freopen("nfind.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 Oct 18, 2022 6:19 pm | |
| - Code:
-
#include <iostream> #include <cstdio> #define NMAX 1000000
// psecond.*
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 Tue Oct 18, 2022 10:05 pm | |
| - Code:
-
#include <iostream> #include <vector> #include <queue>
// tsnt.*
using namespace std;
void xuli(int u) { vector<int> a; int i = 2; while (i * i <= u) { if (u % i == 0) { a.push_back(i); u /= i; } else i++; } if (u > 1) a.push_back(u); size_t n = a.size(); queue<pair<int, int>> q; int d = 1; for (size_t i1 = 0; i1 < n - 1; i1++) { if (a[i1] == a[i1 + 1]) d++; else { q.push(make_pair(a[i1], d)); d = 1; } } q.push(make_pair(a[n - 1], d)); while (!q.empty()) { pair<int, int> p = q.front(); cout << p.first << " " << p.second << endl; q.pop(); } }
int main() { freopen("tsnt.inp","r",stdin); freopen("tsnt.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 Oct 18, 2022 10:40 pm | |
| - Code:
-
#include <iostream>
// lcm.*
using namespace std;
long long lcm(long long a, long long b) { long long a1 = a, b1 = b; while (b > 0) { long long r = a % b; a = b; b = r; } return a1 / a * b1; }
int main() { freopen("lcm.inp","r",stdin); freopen("lcm.out","w",stdout); long long a, b, c; cin >> a >> b >> c; cout << lcm(lcm(a, b), c); return 0; }
| |
| | | lequanglamyb2007
Tổng số bài gửi : 304 Join date : 25/07/2022
| Tiêu đề: Re: Lê Quang Lâm - TK33 Wed Oct 19, 2022 2:26 pm | |
| - Code:
-
#include <iostream> #include <vector> #include <queue>
// lcmlist.*
using namespace std;
int lcm(int a, int b) { int a1 = a, b1 = b; while (b > 0) { int r = a % b; a = b; b = r; } return a1 / a * b1; }
void xuli() { int u = 1; int n1; cin >> n1; int i; for (i = 0; i < n1; i++) { int u1; cin >> u1; u = lcm(u, u1); } vector<int> a; i = 2; while (i * i <= u) { if (u % i == 0) { a.push_back(i); u /= i; } else i++; } if (u > 1) a.push_back(u); size_t n = a.size(); queue<pair<int, int>> q; int d = 1; for (size_t i1 = 0; i1 < n - 1; i1++) { if (a[i1] == a[i1 + 1]) d++; else { q.push(make_pair(a[i1], d)); d = 1; } } q.push(make_pair(a[n - 1], d)); while (!q.empty()) { pair<int, int> p = q.front(); cout << p.first << " " << p.second << endl; q.pop(); } }
int main() { freopen("lcmlist.inp","r",stdin); freopen("lcmlist.out","w",stdout); xuli(); 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
| |
| |
| |