Divisors of Two Integers

Author: Ismail Hosen

Daffodil International University

Problem Link

//Please follow from main function

#include<bits/stdc++.h>
using namespace std;
#define mx 10000
int cnt[mx];
int main()
{
    int n;
    cin>>n;
    int ar[n];
    for(int i=0; i<n; i++){
        cin>>ar[i];
        cnt[ar[i]]++;
    }
    sort(ar, ar+n);
    cout<<ar[n-1]<<' ';
    for(int i=n-2; i>=0; i--){
        if(ar[n-1]%ar[i]){
            cout<<ar[i]<<endl;
            return 0;
        }
        else if(cnt[ar[i]]==2){
            cout<<ar[i]<<endl;
            return 0;
        }
    }
    return 0;
}