Bạn cần đăng nhập mới có thể xem nội dung này
Tìm thấy 219 kết quả
| Thời gian | Nội dung | Điểm thực lực | Điểm cảm ơn |
| 02/08/2025 13:31:51 |  | 2 | |
| 02/08/2025 13:27:55 | ![]( "Do ảnh kh đủ nên source code mình để ở đây<br />#include <iostream><br />#include <vector><br />#include <cmath><br />using namespace std;<br /><br />bool isPrime(int n) {<br /> if (n < 2) return false;<br /> for (int i = 2; i <= sqrt(n); ++i)<br /> if (n % i == 0) return false;<br /> return true;<br />}<br />int main() {<br /> int n;<br /> cout <<") cin >> n;
while (n <= 0) {
cout << "n phai lon hon 0. Nhap lai: ";
cin >> n;
}
vector<int> arr(n);
cout << "Nhap " << n << " so nguyen:\n";
for (int i = 0; i < n; ++i) {
cin >> arr[i];
}
// a
cout << "\na. Day so vua nhap: ";
for (int num : arr) cout << num << " ";
cout << "\n";
// b
int x;
cout << "\nb. Nhap x: ";
cin >> x;
int count_x = 0;
cout << "x xuat hien tai vi tri: ";
for (int i = 0; i < arr.size(); ++i) {
if (arr[i] == x) {
cout << i << " ";
++count_x;
}
}
cout << "\nSo lan xuat hien cua x: " << count_x << "\n";
// c
cout << "\nc. Day sau khi xoa so 0: ";
vector<int> arr_no_zero;
for (int num : arr) {
if (num != 0) arr_no_zero.push_back(num);
}
arr = arr_no_zero;
for (int num : arr) cout << num << " ";
cout << "\n";
// d
vector<int> primes, non_primes;
for (int num : arr) {
if (isPrime(num)) primes.push_back(num);
else non_primes.push_back(num);
}
arr.clear();
arr.insert(arr.end(), primes.begin(), primes.end());
arr.insert(arr.end(), non_primes.begin(), non_primes.end());
cout << "\nd. Day sau khi dua so nguyen to len dau: ";
for (int num : arr) cout << num << " ";
cout << "\n";
// e
int sum = 0, count = 0;
for (int num : arr) {
if (num % 3 == 0) {
sum += num;
++count;
}
}
cout << "\ne. Trung binh cong cac so chia het cho 3: ";
if (count == 0) cout << "Khong co so chia het cho 3.\n";
else cout << (double)sum / count << "\n";
return 0;
}
" alt="Do ảnh kh đủ nên source code mình để ở đây
#include <iostream>
#include <vector>
#include <cmath>
using namespace std;
bool isPrime(int n) {
if (n < 2) return false;
for (int i = 2; i <= sqrt(n); ++i)
if (n % i == 0) return false;
return true;
}
int main() {
int n;
cout << "Nhap so phan tu n (n > 0): ";
cin >> n;
while (n <= 0) {
cout << "n phai lon hon 0. Nhap lai: ";
cin >> n;
}
vector<int> arr(n);
cout << "Nhap " << n << " so nguyen:\n";
for (int i = 0; i < n; ++i) {
cin >> arr[i];
}
// a
cout << "\na. Day so vua nhap: ";
for (int num : arr) cout << num << " ";
cout << "\n";
// b
int x;
cout << "\nb. Nhap x: ";
cin >> x;
int count_x = 0;
cout << "x xuat hien tai vi tri: ";
for (int i = 0; i < arr.size(); ++i) {
if (arr[i] == x) {
cout << i << " ";
++count_x;
}
}
cout << "\nSo lan xuat hien cua x: " << count_x << "\n";
// c
cout << "\nc. Day sau khi xoa so 0: ";
vector<int> arr_no_zero;
for (int num : arr) {
if (num != 0) arr_no_zero.push_back(num);
}
arr = arr_no_zero;
for (int num : arr) cout << num << " ";
cout << "\n";
// d
vector<int> primes, non_primes;
for (int num : arr) {
if (isPrime(num)) primes.push_back(num);
else non_primes.push_back(num);
}
arr.clear();
arr.insert(arr.end(), primes.begin(), primes.end());
arr.insert(arr.end(), non_primes.begin(), non_primes.end());
cout << "\nd. Day sau khi dua so nguyen to len dau: ";
for (int num : arr) cout << num << " ";
cout << "\n";
// e
int sum = 0, count = 0;
for (int num : arr) {
if (num % 3 == 0) {
sum += num;
++count;
}
}
cout << "\ne. Trung binh cong cac so chia het cho 3: ";
if (count == 0) cout << "Khong co so chia het cho 3.\n";
else cout << (double)sum / count << "\n";
return 0;
}
" src="https://cdn.lazi.vn/timthumb.php?src=storage/uploads/edu/answer/1754116075_lazi_124136.jpeg&w=100" /> | | |
| 02/08/2025 13:21:44 |  | 2 | |
| 02/08/2025 13:06:49 |  | 2 | |
| 02/08/2025 11:42:37 |  | 2 | |
| 02/08/2025 11:33:44 |  | 2 | 10 |
| 02/08/2025 11:24:54 |  | 1 | |
| 02/08/2025 11:19:55 |  | 1 | 7 |
| 02/08/2025 11:12:10 |  | 1 | 4 |
| 02/08/2025 11:08:38 |  | 2 | 7 |
|
cin >> n;
