fork download
copy 
  1. #include<bits/stdc++.h>
  2. #define ll long long int
  3. #define vll vector<ll>
  4. using namespace std;
  5.  
  6. ll gcd(ll x, ll y){
  7.     if(y == 0){
  8.         return x;
  9.     }
  10.  
  11.     return gcd(y, x%y);
  12. }
  13.  
  14. ll lcm(ll x, ll y){
  15.     return (x*y)/gcd(x, y);
  16. }
  17.  
  18. int main(){
  19.     ios_base::sync_with_stdio(false);
  20.     cin.tie(NULL);
  21.     ll n, a, p=1;
  22.     cin >> n;
  23.     vll x;
  24.     for(ll i=0; i<n; i++){
  25.         cin >> a;
  26.         x.push_back(a);
  27.         p *= a;
  28.     }
  29.  
  30.     ll g=x[0], l=x[0];
  31.  
  32.     for(ll i=1; i<n; i++){
  33.         g = gcd(g, x[i]);
  34.         if(g == 1){
  35.             break;
  36.         }
  37.     }
  38.     cout << p << endl;
  39.     if(g != 1){
  40.         cout << "not coprime" << endl;
  41.     }
  42.  
  43.     else{
  44.         for(ll i=1; i<n; i++){
  45.             l = lcm(l, x[i]);
  46.         }
  47.  
  48.         if(l == p){
  49.             cout << "pairwise coprime" << endl;
  50.         }
  51.  
  52.         else{
  53.             cout << "setwise coprime" << endl;
  54.         }
  55.     }
  56.     return 0;
  57. }
Success #stdin #stdout 0s 4192KB
comments (?)
stdin
copy 
3
3 4 5
stdout
copy 
60
pairwise coprime
https://ideone.com/CUJSSt
language:
C++14 (gcc 8.3)
created:
3 years ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!