#include <iostream> using namespace std; long long n,i; bool prime(long long u) { if (u<=1) return false; for (int i=2; i*i <= u; i++) if (u%i==0) return false; return true; } int main() { cin >> n; i=n; while ((i!=0) && ((n%i!=0) || (prime(i)==false))) i--; if (i==0) cout<<"NONE"; else cout<<i; return 0; }
thnhhai3010
Tổng số bài gửi : 35 Join date : 08/11/2022
Tiêu đề: Re: Nguyễn Thanh Hải Sat Dec 03, 2022 8:42 pm
Day 4(NC) - Bai 1
Code:
#include <iostream> using namespace std; int n,k = 0; int a[100005], c[100005]; int main() { cin >> n; for (int i = 1; i <= n; i++) cin >> a[i]; for (int i = 1; i <= n; i++) if (a[i]!=a[i+1]) { k++; c[k]=a[i]; } for (int i = 1; i <= k; i++) cout << c[i] <<" "; return 0; }
#include <iostream> using namespace std; long long a[10000][10000]; int k, x, m, n; int main() { cin >> m >> n >> k; for(int i = 1; i <= m; i++) for(int j = 1; j <= n; j++) { cin >> x; a[i][j] = x % k; } for(int i = 1; i <= m; i++) for(int j = 1; j <= n; j++) { if (a[i][j] == 0) if (a[i][j]%k == 0) cout <<"a["<< i <<"]["<< j <<"]"<< endl; } }
#include <iostream> using namespace std; long long a[10000][10000]; long long m, n, res = 0; int main() { cin >> m >> n; for (int i = 1; i <= m; i++) for (int j = 1; j <= n; j++) cin >> a[i][j]; for (int i = 1; i <= m; i++) { res = a[i][1]; for (int j = 1; j <= n; j++) res = max (res, a[i][j]); cout << res << endl; } return 0; }
#include <iostream> using namespace std; long long a[10000][10000]; long long h[10000]; long long c[10000]; long long m, n; int main() { cin >> m >> n; for (int i = 1; i <= m; i++) for (int j = 1; j <= n; j++) cin >> a[i][j]; for (int i = 1; i <= m; i++) { long long tam = 0; for (int j = 1; j <= n; j++) tam += a[i][j]; h[i] = tam; } for (int j = 1; j <= n; j++) { long long tam = 0; for (int i = 1; i <= m; i++) tam += a[i][j]; c[j] = tam; } for (int i = 1; i <= m; i++) cout << h[i] <<" "; cout << endl; for (int j = 1; j <= n; j++) cout << c[j] <<" "; return 0; }
#include <bits/stdc++.h> using namespace std; long long a[10000][10000]; bool f[100005]; long long m, n, rmax = 0; int p = 0; void Eratosthenes(long long u) { for (int i = 1; i <= u; i++) f[i] = true; f[1] = false; int i = 2; while (i*i <= u) if (f[i]) { int k = 2; while (k*i <= u) { f[k*i] = false; k++; } i++; } else i++; } int main() { cin >> m >> n; for (int i = 1; i <= m; i++) for (int j = 1; j <= n; j++) { cin >> a[i][j]; rmax = max(rmax, a[i][j]); } Eratosthenes(rmax); for (int i = 1; i <= m; i++) for (int j = 1; j <= n; j++) if (f[a[i][j]]) { cout <<"a["<<i<<"]["<< j <<"]"<< endl; p++; } if (p == 0) cout << -1; return 0; }
#include <bits/stdc++.h> using namespace std; long long c[100005], n, k = 0; void phantich (long long u) { int i = 2; while (i*i <= u) if (u % i == 0) { k++; c[k] = i; u = u/i; } else i++; if (u > 1) { k++; c[k] = u; } } int main() { cin >> n; phantich(n); cout << c[k]; return 0; }
#include <iostream> #define nmax 500 using namespace std; int a[nmax][nmax]; int m, n, res = -(1e9+7); int main() { freopen("arr2b5.inp", "r", stdin); freopen("arr2b5.out", "w", stdout); cin >> m >> n; for (int i = 1; i <= m; i++) for (int j = 1; j <= n; j++) cin >> a[i][j]; for (int i = 1; i <= m; i++) for (int j = 1; j <= n; j++) res = max(res, a[i][j]); cout << res; return 0; }
#include <iostream> #define nmax 500 using namespace std; int a[nmax][nmax]; int m, n, rmin = 1e9+7, res = 0; int main() { freopen("arr2b6.inp", "r", stdin); freopen("arr2b6.out", "w", stdout); cin >> m >> n; for (int i = 1; i <= m; i++) for (int j = 1; j <= n; j++) cin >> a[i][j]; for (int i = 1; i <= m; i++) for (int j = 1; j <= n; j++) rmin = min(rmin, a[i][j]); for (int i = 1; i <= m; i++) for (int j = 1; j <= n; j++) if (a[i][j] == rmin) res++; cout << rmin << res; return 0; }