| 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 Sat Jul 30, 2022 3:51 pm | |
| d6b8 - Code:
-
#include <iostream>
using namespace std;
int gcd(int a, int b) { while (a != b) { if (a > b) a -= b; else b -= a; } return a; }
int main() { int a, b; cout << "Enter two numbers: "; cin >> a >> b; cout << "Result: " << gcd(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 Sat Jul 30, 2022 3:57 pm | |
| d6b8 - Code:
-
#include <iostream>
using namespace std;
int gcd(int a, int b) { while (b > 0) { int r = a % b; a = b; b = r; } return a; }
int main() { int a, b; cout << "Enter two numbers: "; cin >> a >> b; cout << "Result: " << gcd(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 Sat Jul 30, 2022 4:28 pm | |
| d6b9 - Code:
-
#include <iostream>
using namespace std;
void phantich(int u) { int i = 2; while (i * i <= u) { if (u % i == 0) { cout << i << " "; u = u / i; } else i++; } if (u > 1) cout << u; }
int main() { 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 Sat Jul 30, 2022 4:39 pm | |
| d6b10 - Code:
-
#include <iostream>
using namespace std;
bool prime(int n) { if (n <= 1) return false; for (int i = 2; i * i <= n; i++) if (n % i == 0) return false; return true; }
int main() { cout << "Enter N: "; int n; cin >> n; n++; while(!prime(n)) n++; cout << "Result: " << 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 Sat Jul 30, 2022 4:44 pm | |
| d6b11 - Code:
-
#include <iostream>
using namespace std;
int main() { int n, s = 0; cout << "Enter N: "; cin >> n; while (n > 0) { s += n % 10; n /= 10; } cout << "Result: " << 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 Sat Jul 30, 2022 4:56 pm | |
| d6b12 - Code:
-
#include <iostream>
using namespace std;
bool prime(int n) { if (n <= 1) return false; for (int i = 2; i * i <= n; i++) if (n % i == 0) return false; return true; }
int main() { int n; cin >> n; n /= 10; while (n > 0 && !prime(n)) { n /= 10; } if (!prime(n)) { cout << "No value found"; } else cout << "Result: " << 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 Sun Jul 31, 2022 5:05 pm | |
| - Code:
-
#include <iostream>
using namespace std;
int dsum(int n) { int s = 0; while (n > 0) { s += n % 10; n /= 10; } return s; }
int dcnt(int n) { int s = 0; while (n > 0) { s++; n /= 10; } return s; }
void submain(int u) { int i = 1, v = 1; while (i < u) { v++; if (dsum(v) % dcnt(v) == 0) i++; } cout << v << endl; }
int main() { freopen("beauty.inp","r",stdin); freopen("beauty.out","w",stdout); int n; while (cin >> n) { submain(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 Aug 01, 2022 5:46 pm | |
| - Code:
-
#include <iostream> #include <math.h>
using namespace std;
void submain(int k, int l) { int c = l - k + 1, b = l - 2 * k + 2; int d = b * b - 4 * c; float x1, x2; if (d < 0) cout << "NONE" << endl; else if (d == 0) { x1 = 1.0 * b / 2.0; if (x1 == (int) x1) { cout << (int) x1 << " " << (int) x1 << endl; } else { cout << "NONE" << endl; } } else { x1 = (1.0 * b + sqrt(d)) / 2.0; x2 = 1.0 * b - x1; if (x1 == (int) x1 && x2 == (int) x2) { cout << (int) x2 << " " << (int) x1 << endl; } else { cout << "NONE" << endl; } } }
int main() { freopen("rect.inp","r",stdin); freopen("rect.out","w",stdout); int k, l; while (cin >> k >> l) { submain(k, l); } 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 10, 2022 4:51 pm | |
| day7b1 - Code:
-
#include <iostream> #define NMAX 100000
using namespace std;
int arr[NMAX];
int main() { int n; cin >> n; for (int i = 0; i <= n - 1; i++) cin >> arr[i]; for (int i = 0; i <= n - 1; i++) cout << arr[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 Wed Aug 10, 2022 5:06 pm | |
| day7b2 - Code:
-
#include <iostream> #define NMAX 100000
using namespace std;
int arr[NMAX];
int main() { int n; cin >> n; for (int i = 0; i <= n - 1; i++) cin >> arr[i]; for (int i = 0; i <= n - 1; i++) if (arr[i] % 2 == 0) cout << arr[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 Wed Aug 10, 2022 5:07 pm | |
| day7b3 - Code:
-
#include <iostream> #include <math.h> #define NMAX 100001
using namespace std;
int arr[NMAX];
int main() { int n; cin >> n; for (int i = 1; i <= n; i++) cin >> arr[i]; for (int i = 1; i <= n; i++) { int v = arr[i]; if (sqrt(v) == (int) sqrt(v)) cout << 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 Wed Aug 10, 2022 5:15 pm | |
| day7b4 - Code:
-
#include <iostream> #define NMAX 100000
using namespace std;
int arr[NMAX];
int main() { int n; cin >> n; int counter = 0; for (int i = 0; i <= n - 1; i++) cin >> arr[i]; for (int i = 0; i <= n - 1; i++) if (arr[i] % 2 == 0 && arr[i] % 3 != 0) counter++; cout << "Result: " << counter; 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 10, 2022 5:26 pm | |
| day7b5 - Code:
-
#include <iostream> #define NMAX 10000
using namespace std;
int arr[NMAX];
int main() { cout << "Enter number of elements: "; int n; cin >> n; cout << "Enter divisor: "; int k; cin >> k; while (k == 0) { cout << "Enter divisor again: "; cin >> k; } int counter = 0; for (int i = 0; i <= n - 1; i++) { cout << "Enter the value of arr[" << i << "]:"; cin >> arr[i]; } for (int i = 0; i <= n - 1; i++) if (arr[i] % k == 0) counter++; cout << "Result: " << counter; 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 10, 2022 5:37 pm | |
| day7b6 - Code:
-
#include <iostream> #define NMAX 10000
using namespace std;
int arr[NMAX];
int main() { cout << "Enter number of elements: "; int n; cin >> n; for (int i = 0; i < n; i++) { cout << "Enter the value of arr[" << i << "]:"; cin >> arr[i]; } int rmin = arr[0]; for (int i = 1; i < n; i++) if (arr[i] < rmin) rmin = arr[i]; cout << "Result: " << rmin; 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 10, 2022 5:57 pm | |
| day7b7 - Code:
-
#include <iostream> #define NMAX 10000
using namespace std;
int arr[NMAX];
int main() { cout << "Enter number of elements: "; int n; cin >> n; for (int i = 0; i < n; i++) { cout << "Enter the value of arr[" << i << "]:"; cin >> arr[i]; } int rmax = arr[0]; for (int i = 1; i < n; i++) if (arr[i] > rmax) rmax = arr[i]; int counter = 0; for (int i = 0; i < n; i++) if (arr[i] == rmax) counter++; cout << "Result: " << counter; 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 10, 2022 6:06 pm | |
| day7b8 - Code:
-
#include <iostream> #include <cstdio> #define NMAX 10000
using namespace std;
int arr[NMAX];
int main() { cout << "Enter number of elements: "; int n; cin >> n; for (int i = 0; i < n; i++) { cout << "Enter the value of arr[" << i << "]:"; cin >> arr[i]; } long long rsum = 0; for (int i = 0; i < n; i++) rsum += arr[i]; float ravg = 1.0 * rsum / n; cout << "Sum: " << rsum << "\n"; printf("Average: %0.3f\n", ravg); 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 10, 2022 6:14 pm | |
| day7b9 - Code:
-
#include <iostream> #define NMAX 10000
using namespace std;
int arr[NMAX];
int main() { cout << "Enter number of elements: "; int n; cin >> n; for (int i = 0; i < n; i++) { cout << "Enter the value of arr[" << i << "]:"; cin >> arr[i]; } long long rsum = 0; for (int i = 0; i < n; i++) rsum += arr[i]; float ravg = 1.0 * rsum / n; int counter = 0; for (int i = 0; i < n; i++) if (arr[i] >= ravg) counter++; cout << "Result: " << counter; 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 10, 2022 6:25 pm | |
| day7b10 - Code:
-
#include <iostream> #define NMAX 10000
using namespace std;
int arr[NMAX];
int main() { cout << "Enter number of elements: "; int n; cin >> n; for (int i = 0; i < n; i++) { cout << "Enter the value of arr[" << i + 1 << "]:"; cin >> arr[i]; } cout << "Enter value to search: "; int k; cin >> k; int res = -1; for (int i = 0; i < n; i++) if (arr[i] == k) { res = i; break; } cout << "Result: "; if (res < 0) cout << "NONE"; else cout << res + 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 Sun Aug 14, 2022 6:06 pm | |
| day7b11 - Code:
-
#include <iostream> #define NMAX 10000
using namespace std;
int arr[NMAX];
int main() { cout << "Enter n:"; int n; cin >> n; int i; for (i = 0; i < n; i++) { cout << "arr[" << i << "]="; cin >> arr[i]; } int rmin = arr[0], rmax = arr[0]; for (i = 1; i < n; i++) { if (arr[i] < rmin) rmin = arr[i]; if (arr[i] > rmax) rmax = arr[i]; } cout << "Result: " << rmax - rmin; return 0; }
| |
|
| |
lequanglamyb2007
Tổng số bài gửi : 304 Join date : 25/07/2022
| Tiêu đề: Re: Lê Quang Lâm - TK33 Sun Aug 14, 2022 7:39 pm | |
| day8b1 - Code:
-
#include <iostream> #define NMAX 100000
using namespace std;
int arr[NMAX]; int n; int main() { cin >> n; for (int i = 0; i < n; i++) { cin >> arr[i]; } int rsum = arr[0] + arr[1] + arr[2]; for (int i = 1; i <= n - 3; i++) { int cur = arr[i] + arr[i + 1] + arr[i + 2]; if (rsum < cur) rsum = cur; } cout << "Result: " << rsum; return 0; }
| |
|
| |
lequanglamyb2007
Tổng số bài gửi : 304 Join date : 25/07/2022
| Tiêu đề: Re: Lê Quang Lâm - TK33 Sun Aug 14, 2022 7:52 pm | |
| day8b2 - Code:
-
#include <iostream> #define NMAX 100000
using namespace std;
int arr[NMAX]; int n;
int main() { cin >> n;
for (int i = 0; i < n; i++) { cin >> arr[i]; } bool p = true; for (int i = 0; i < n - 1; i++) { if (arr[i] > arr[i + 1]) { p = false; break; } } if (p) cout << "YES"; else cout << "NO"; return 0; }
| |
|
| |
lequanglamyb2007
Tổng số bài gửi : 304 Join date : 25/07/2022
| Tiêu đề: Re: Lê Quang Lâm - TK33 Sun Aug 14, 2022 8:00 pm | |
| day8b3 - Code:
-
#include <iostream> #define NMAX 100001
using namespace std;
long long arr[NMAX]; int n;
int main() { cin >> n; arr[1] = 1; arr[2] = 1; for (int i = 3; i <= n; i++) { arr[i] = arr[i - 1] + arr[i - 2];/*cout << arr[i] << " ";*/ } cout << "Result:" << arr[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 Sun Aug 14, 2022 8:25 pm | |
| day8b4 - Code:
-
#include <iostream> #define NMAX 100000
using namespace std;
int arr[NMAX]; int n;
int main() { cin >> n; for (int i = 0; i < n; i++) cin >> arr[i]; for (int i = 0; i < n / 2; i++) { int t = arr[i]; arr[i] = arr[n - 1 - i]; arr[n - 1 - i] = t; } for (int i = 0; i < n; i++) cout << arr[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 Sun Aug 14, 2022 8:37 pm | |
| day8b5 - Code:
-
#include <iostream> #define NMAX 100000 #define NMAX2 200000
using namespace std;
int a[NMAX]; int b[NMAX2]; int n;
int main() { cin >> n; for (int i = 0; i < n; i++) cin >> a[i]; int j = 0; for (int i = 0; i < n; i++) { b[j] = a[i]; j++; } for (int i = 0; i < n; i++) { b[j] = a[i]; j++; } for (int i = 0; i < 2 * n; i++) cout << b[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 Sun Aug 14, 2022 9:02 pm | |
| day8b6 - Code:
-
#include <iostream>
using namespace std;
int a[2000][2000]; int m, n;
int main() { freopen("data.inp","r",stdin); freopen("data.out","w",stdout); cin >> m >> n; for (int i = 0; i < m; i++) for (int j = 0; j < n; j++) cin >> a[i][j]; for (int i = 0; i < m; i++) { for (int j = 0; j < n; j++) cout << a[i][j] << " "; cout << endl; } return 0; }
| |
|
| |
Sponsored content
| Tiêu đề: Re: Lê Quang Lâm - TK33 | |
| |
|
| |
| Lê Quang Lâm - TK33 | |
|