Advertisement
TAHMID37

Arrays

May 28th, 2022
1,124
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
  1. /*  TAHMID RAHMAN
  2.     DAMIAN FOREVER
  3.      MATH LOVER
  4.     NEVER GIVE UP
  5. */
  6. #include<bits/stdc++.h>
  7. using namespace std;
  8. #define pi acos(-1.0)
  9. #define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
  10. #define ll long long
  11. #define pb push_back
  12. #define fi first
  13. #define se second
  14. #define in insert
  15. #define mp make_pair
  16. #define GCD(a,b) __gcd(a,b);
  17. #define endl "\n"
  18. #define FRU freopen("out.txt","w",stdout)
  19. #define FRO freopen("in.txt","r",stdin)
  20. #define INFLL 9223372036854775807
  21. #define all(x) (x).begin(),(x).end()
  22. #define MAXN   100001
  23. #define ar array
  24. #define lb lower_bound
  25. #define ub upper_bound
  26. #define minpq priority_queue<ll, vector<ll>, greater<ll>>
  27. #define maxpq priority_queue<ll>
  28. const int mxN=1e5+10;
  29. const int MOD=1e9+7;
  30. template<typename ForwardIterator, typename T>
  31. ForwardIterator first_less_than (ForwardIterator first, ForwardIterator last, T value)
  32. {auto it = std::lower_bound (first, last, value);
  33. return (it == first ? last : --it);}
  34. bool sortbysec(const pair<ll,ll> &a,const pair<ll,ll> &b)
  35. {
  36.     return (a.second < b.second);
  37. }
  38. #define debugxx(v) {for(auto x:v){cout<<x.fi<<" "<<x.se<<endl;}cout<<endl;}
  39. #define debugx(v){for(auto y:v) {cout<<y<<" ";}cout<<endl;}
  40. #define debug(x) cout<<#x<<" ";_print(x); cout<<endl;
  41. typedef unsigned long long ull;
  42. typedef long double lld;
  43. void _print(ll t) {cout << t;}
  44. void _print(int t) {cout << t;}
  45. void _print(string t) {cout << t;}
  46. void _print(char t) {cout << t;}
  47. void _print(lld t) {cout << t;}
  48. void _print(double t) {cout << t;}
  49. void _print(ull t) {cout << t;}
  50.  
  51. template <class T, class V> void _print(pair <T, V> p);
  52. template <class T> void _print(vector <T> v);
  53. template <class T> void _print(set <T> v);
  54. template <class T, class V> void _print(map <T, V> v);
  55. template <class T> void _print(multiset <T> v);
  56. template <class T, class V> void _print(pair <T, V> p) {cout << "{"; _print(p.fi); cout << ","; _print(p.se); cout << "}";}
  57. template <class T> void _print(vector <T> v) {cout << "[ "; for (T i : v) {_print(i); cout << " ";} cout << "]";}
  58. template <class T> void _print(set <T> v) {cout << "[ "; for (T i : v) {_print(i); cout << " ";} cout << "]";}
  59. template <class T> void _print(multiset <T> v) {cout << "[ "; for (T i : v) {_print(i); cout << " ";} cout << "]";}
  60. template <class T, class V> void _print(map <T, V> v) {cout << "[ "; for (auto i : v) {_print(i); cout << " ";} cout << "]";}
  61. //Don't hesitate to ask me if you don't understand my code.......Happy coding,Tahmid...;
  62.  
  63.  
  64.  
  65.  
  66. int main()
  67. {
  68.  
  69.     int n;
  70.     cin>>n;
  71.  
  72.     int arr[n];
  73.  
  74.     int i;
  75.  
  76.     for(i=0;i<n;i++)
  77.     {
  78.         cin>>arr[i];
  79.     }
  80.  
  81.     int mul=1;
  82.  
  83.  
  84.     for(i=0;i<n;i++)
  85.     {
  86.         cout<<arr[i]<<" ";
  87.         mul*=arr[i];
  88.         /// mul*=arr[i];
  89.         /// mul=mul*arr[i]
  90.     }
  91.     cout<<endl;
  92.  
  93.     cout<<"Multiple -> " << mul<<endl;
  94.  
  95.     int mx=arr[0];
  96.  
  97.     /// 4 3 10 12 1 100
  98.     /// mx=4;
  99.     /// mx=4;
  100.     /// mx=10;
  101.     /// mx=12;
  102.     /// mx=12;
  103.     /// mx=100;
  104.     for(i=1;i<n;i++)
  105.     {
  106.         if(arr[i]>mx)
  107.         {
  108.             mx=arr[i];
  109.         }
  110.     }
  111.  
  112.     cout<<mx<<endl;
  113.  
  114.     int mn=arr[0];
  115.  
  116.     for(i=1;i<n;i++)
  117.     {
  118.         if(arr[i]<mn)
  119.         {
  120.             mn=arr[i];
  121.         }
  122.     }
  123.  
  124.     cout<<mn<<endl;
  125.  
  126.  
  127.  
  128.  
  129.  
  130.  
  131.  
  132.  
  133.  
  134.  
  135.  
  136.  
  137.  
  138.  
  139.  
  140.  
  141. }
  142.  
Advertisement
RAW Paste Data Copied
Advertisement