Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <iomanip>
- #include <algorithm>
- #include <string>
- #include <cmath>
- #include <vector>
- #define ll long long
- #define ull unsigned long long
- #define PI 3.141592653
- #define Mod 1'000'000'007
- #define EPS 1e-9
- #define endl "\n"
- #define fixed(n) cout << fixed << setprecision(n)
- #define read(arr, n) for(int i=0; i<n && cin >> arr[i]; i++)
- #define print(arr, n) for(int i=0; i<n && cout << arr[i] << " "; i++)
- #define read_2d(matrix, r, c) for(int i=1; i<=r; i++) for(int j=1; j<=c && cin >> matrix[i][j]; j++);
- #define cout_2d(matrix, r, c) for(int i=1; i<=r; i++, cout << "\n") for(int j=1; j<=c && cout << matrix[i][j] << " "; j++);
- #define FAST ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
- using namespace std;
- int max(vector <int> v){
- return *max_element(v.begin(), v.end());
- }
- int min(vector <int> v){
- return *min_element(v.begin(), v.end());
- }
- bool isprime(int n){
- if(n == 1) return false;
- for(int i=2; i<=sqrt(n); i++)
- if(n%i == 0) return false;
- return true;
- }
- int prime(vector <int> v){
- int cnt_prime = 0;
- for(int i=0; i<v.size(); i++)
- if(isprime(v[i])) cnt_prime++;
- return cnt_prime;
- }
- int palindrome(vector <int> v){
- int cnt_pldrm = 0;
- for(auto i : v)
- if(i < 10 || i%10 == i/10 )
- cnt_pldrm++;
- return cnt_pldrm;
- }
- int max_divisor(vector <int> v){
- vector <int> v2(v.size(), 2);
- for(int i=0; i<v.size(); i++)
- for(int j=2; j<=v[i]/2; j++)
- if(v[i]%j == 0) v2[i]++;
- int M = *max_element(v2.begin(), v2.end());
- vector <int> Max(0);
- for(int m=0; m<v2.size(); m++)
- if(v2[m] == M) Max.push_back(v[m]);
- return *max_element(Max.begin(), Max.end());
- }
- int main()
- { FAST
- int n; cin >> n;
- vector <int> vec(n); read(vec, n);
- cout << "The maximum number : " << max(vec) << "\n";
- cout << "The minimum number : " << min(vec) << "\n";
- cout << "The number of prime numbers : " << prime(vec) << "\n";
- cout << "The number of palindrome numbers : " << palindrome(vec) << "\n";
- cout << "The number that has the maximum number of divisors : " << max_divisor(vec) << "\n";
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement