| 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 Mon Aug 22, 2022 3:29 pm | |
| day9btvn14 - Code:
-
#include <iostream> #include <string>
using namespace std;
int rtmp[100000];
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() { string s; cout << "Enter string: "; getline(cin, s); cout << "Result:" << endl; 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 Mon Aug 22, 2022 3:38 pm | |
| day9btvn15 - Code:
-
#include <iostream> #include <string>
using namespace std;
int rtmp[100000];
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() { string s; cout << "Enter string: "; getline(cin, s); cout << "Result:" << endl; 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 Mon Aug 22, 2022 3:59 pm | |
| day9btvn17 - Code:
-
#include <iostream>
using namespace std;
void submain(string s) { int counter = 0; for (size_t i = 0; i < s.size(); i++) if (s[i] == 'a') counter++; cout << "Result: " << counter; }
int main() { string s; 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 Mon Aug 22, 2022 4:28 pm | |
| day9btvn18 - Code:
-
#include <iostream>
using namespace std;
char b[100000]; int c[100000];
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() { string s; cout << "Enter string: "; getline(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 Aug 23, 2022 4:02 pm | |
| day9btvn20 - Code:
-
#include <iostream>
using namespace std;
string submain(string s, string s1) { string s2 = s; size_t pos = s2.find(s1); while (pos != string::npos) { s2.erase(pos, s1.size()); pos = s2.find(s1, pos); } return s2; }
int main() { string s, s1; cout << "Enter first string: "; cin >> s; cout << "Enter second string: "; cin >> s1; cout << "Result: " << submain(s, s1); 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 Aug 23, 2022 5:38 pm | |
| day9btvn19 - Code:
-
#include <iostream> #include <string>
using namespace std;
char c[100000]; int rtmp[100000]; string res;
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() { res = ""; 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 Wed Aug 24, 2022 4:52 pm | |
| day9btvn21 - Code:
-
#include <iostream> #include <string>
using namespace std;
int main() { string fm = "b", fm1 = "a", fm2 = ""; int n; cin >> n; for (int i = 3; i <= n; i++) { fm2 = fm1; fm1 = fm; fm = fm1 + fm2; } cout << fm; 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 Aug 24, 2022 4:58 pm | |
| day9btvn22 - Code:
-
#include <iostream> #define NMAX 100001
using namespace std;
long long ca[NMAX], cb[NMAX];
int main() { int n; cin >> n; ca[1] = 1; ca[2] = 0; cb[1] = 0; cb[2] = 1; for (int i = 3; i <= n; i++) { ca[i] = ca[i - 1] + ca[i - 2]; cb[i] = cb[i - 1] + cb[i - 2]; } cout << "Result: " << ca[n] << " " << cb[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 Aug 24, 2022 5:26 pm | |
| day9btvn23 - Code:
-
#include <iostream>
using namespace std;
string str_reverse(string s) { int n = s.size(); string s1; s1 = ""; for (int i = 0; i < n; i++) { s1 = s[i] + s1; } return s1; }
bool palin(string s) { return s == str_reverse(s); }
string xuli(string s) { string res = ""; string t = ""; size_t sz = s.size(); for (size_t i = 0; i < sz; i++) { bool found = false; for (size_t j = sz - 1; j >= i; j--) { t = s.substr(i, j - i + 1); if (palin(t)) { res = t; found = true; break; } } if (found) break; } return res; }
int main() { string s; cout << "Enter a string: "; getline(cin, s); cout << "Result: " << xuli(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 Wed Aug 24, 2022 6:26 pm | |
| day9btvn24 - Code:
-
#include <iostream> #include <string>
using namespace std;
string c[10000]; int d[10000];
void nsort(int n) { for (int i = 0; i < n - 1; i++) for (int j = i + 1; j < n; j++) if (d[i] > d[j]) std::swap(d[i], d[j]); }
void numseprstr(string s) { int nc = 0, nd = 0; string t = ""; bool p = s[0] >= '0' && s[0] <= '9'; 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; d[nd] = stoi(t, nullptr, 10); nd++; t = ""; } } if (t.size() > 0) { //cout << t << endl; d[nd] = stoi(t, nullptr, 10); nd++; } t = ""; 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; c[nc] = t; nc++; t = ""; } } if (t.size() > 0) { //cout << t << endl; c[nc] = t; nc++; } nsort(nd); int i1 = 0, i2 = 0; while (i1 < nc && i2 < nd) { if (p) { cout << d[i2]; i2++; } else { cout << c[i1]; i1++; } p = !p; } while (i2 < nd) { cout << d[i2]; i2++; } while (i1 < nc) { cout << c[i1]; i1++; }
}
int main() { string s; cout << "Enter string: "; getline(cin, s); cout << "Result:" << endl; 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 Aug 25, 2022 4:44 pm | |
| day9btvn25 - Code:
-
#include <iostream> #include <string>
using namespace std;
void xuli(string s, int k) { size_t n = s.size(); for (size_t i = 0; i < n; i++) { if (s[i] >= 'a' && s[i] <= 'z') { s[i] = (char)((s[i] - 0 + k) % 26 + 78); } } cout << "Result: " << s; }
int main() { string s; int k; cout << "Enter string: "; getline(cin, s); cout << "Enter a number: "; cin >> k; xuli(s, 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 Thu Aug 25, 2022 5:08 pm | |
| day9btvn26 - Code:
-
#include <iostream> #include <string>
using namespace std;
void xuli(string s, int k) { size_t n = s.size(); for (size_t i = 0; i < n; i++) { if (s[i] >= 'a' && s[i] <= 'z') { int tmp = s[i] - 0 - k; if (tmp >= 97) s[i] = (char)tmp; else s[i] = (char)(tmp + 26); } } cout << "Result: " << s; }
int main() { string s; int k; cout << "Enter string: "; getline(cin, s); cout << "Enter a number: "; cin >> k; xuli(s, 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 Thu Aug 25, 2022 5:33 pm | |
| day9btvn27 - Code:
-
#include <iostream> #include <string> #define NMAX 100000
using namespace std;
int a[NMAX]; size_t n;
bool compar(int u, int v) { string su = to_string(u); string sv = to_string(v); return su < sv; }
void xuli() { for (size_t i = 0; i < n - 1; i++) for (size_t j = i + 1; j < n; j++) if (compar(a[i], a[j])) swap(a[i], a[j]); for (size_t i = 0; i < n; i++) cout << a[i]; }
int main() { cout << "Enter number of elements: "; cin >> n; cout << "Enter " << n << " elements: " << endl; for (size_t 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 Aug 25, 2022 10:27 pm | |
| day9btvn28 - Code:
-
#include <iostream> #include <string>
using namespace std;
void xuli(string s1, string s2) { if (s1.size() < s2.size()) swap(s1, s2); size_t res = 0; size_t n1 = s1.size(); for (size_t i = 0; i < n1; i++) for (size_t j = i; j < n1; j++) { string u = s1.substr(i, j - i + 1); if (s2.find(u) != string::npos) res = max(res, u.size()); } cout << "Result: " << res; }
int main() { string s1, s2; cout << "Enter first string: "; getline(cin, s1); cout << "Enter second string: "; getline(cin, s2); xuli(s1, s2); 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 Aug 25, 2022 10:45 pm | |
| day9btvn28m2 - Code:
-
#include <iostream> #include <string> #define NMAX 3001
using namespace std;
size_t f[NMAX][NMAX];
void xuli(string s1, string s2) { f[0][0] = 0; f[0][1] = 0; f[1][0] = 0; s1 = " " + s1; s2 = " " + s2; size_t n1 = s1.size(); size_t n2 = s2.size(); size_t res = 0; for (size_t i = 1; i <= n1; i++) for (size_t j = 1; j <= n2; j++) { if (s1[i] == s2[j]) f[i][j] = f[i - 1][j - 1] + 1; else f[i][j] = 0; res = max(res, f[i][j]); } cout << "Result: " << res; }
int main() { string s1, s2; cout << "Enter first string: "; getline(cin, s1); cout << "Enter second string: "; getline(cin, s2); xuli(s1, s2); 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 06, 2022 5:46 pm | |
| ncount - Code:
-
#include <iostream> #include <cstdio>
using namespace std;
long long dsum(long long n) { long long s = 0; while (n > 0) { s += n % 10; n /= 10; } return s; }
int main() { freopen("ncount.inp","r",stdin); freopen("ncount.out","w",stdout); long long n; cin >> n; cout << dsum(n); return 0; }
Được sửa bởi lequanglamyb2007 ngày Tue Sep 06, 2022 6:10 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 Tue Sep 06, 2022 5:53 pm | |
| dcount - Code:
-
#include <iostream> #include <cstdio>
using namespace std;
int dcnt(int n) { int s = 0; while (n > 0) { s++; n /= 10; } return s; }
int main() { freopen("dcount.inp","r",stdin); freopen("dcount.out","w",stdout); int n; cin >> n; int s = 0; for (int i = 1; i <= n; i++) s += dcnt(i); cout << 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 Sep 06, 2022 6:20 pm | |
| - Code:
-
#include <iostream> #include <cstdio>
using namespace std;
int n, s;
void submain() { int t; t = n / 50; s += t; n -= t * 50; t = n / 20; s += t; n -= t * 20; t = n / 10; s += t; n -= t * 10; if (n > 0) cout << -1; else cout << s; }
int main() { freopen("xchange.inp","r",stdin); freopen("xchange.out","w",stdout); cin >> n; s = 0; submain(); 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 06, 2022 6:31 pm | |
| - Code:
-
#include <iostream> #include <cstdio>
using namespace std;
int dmax(long long u) { int r = 1; while (u > 0) { r = max(r, (int)(u % 10)); u /= 10; } return r; }
int main() { freopen("xmax.inp","r",stdin); freopen("xmax.out","w",stdout); long long n; cin >> n; cout << dmax(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 06, 2022 6:39 pm | |
| - Code:
-
#include <iostream> #include <cstdio>
using namespace std;
int xuli(int u) { int s = 0; for (int i = 1; i * i <= u; i++) { if (u % i == 0) { s += i; if (i != u / i) { s += u / i; } } } return s; }
int main() { freopen("sdiv.inp","r",stdin); freopen("sdiv.out","w",stdout); int n; cin >> n; cout << 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 06, 2022 6:56 pm | |
| - Code:
-
#include <iostream> #include <cstdio>
using namespace std;
const long long L = 1000000007;
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)) % L; }
int main() { freopen("amux.inp","r",stdin); freopen("amux.out","w",stdout); int a, b; cin >> a >> b; cout << amub(a, b); 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 06, 2022 7:25 pm | |
| - Code:
-
#include <iostream> #include <cmath> #include <cstdio>
using namespace std;
float cuberoot(long long x) { float dau = 1, cuoi = sqrt(x); float giua = (dau + cuoi) / 2.0; while (cuoi - dau > 0.001) { giua = (dau + cuoi) / 2.0; if (giua * giua * giua < x) dau = giua; else cuoi = giua; } return giua; }
int main() { freopen("squa.inp","r",stdin); freopen("squa.out","w",stdout); long long n; cin >> n; printf("%0.3f", cuberoot(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 06, 2022 7:40 pm | |
| - Code:
-
#include <iostream> #include <cstdio> #define NMAX 1000001
using namespace std;
bool f[NMAX];
void eratos(int n) { for (int i = 2; i <= n; i++) f[i] = true; for (int i = 2; i * i <= n; i++) if (f[i]) for (int j = i * i; j <= n; j += i) f[j] = false; }
void xuli(int n) { eratos(n); for (int i = 2; i <= n; i++) if (f[i]) cout << i << " "; }
int main() { freopen("eratos.inp","r",stdin); freopen("eratos.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 Sep 12, 2022 11:04 pm | |
| - Code:
-
#include <iostream> #include <cstdio> #define NMAX 100000
using namespace std;
void phantich(int u) { int i = 2; while (i * i <= u) { if (u % i == 0) { cout << i << " "; u /= i; } else i++; } if (u > 1) cout << u; }
int main() { freopen("tsnt.inp","r",stdin); freopen("tsnt.out","w",stdout); int n; cin >> n; phantich(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:06 pm | |
| - Code:
-
#include <iostream> #include <cstdio> #define NMAX 100000
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; }
| |
|
| |
Sponsored content
| Tiêu đề: Re: Lê Quang Lâm - TK33 | |
| |
|
| |
| Lê Quang Lâm - TK33 | |
|