Submission #3022601

---

Source Code Expand

#include<iomanip>
#include<limits>
#include<thread>
#include<utility>
#include<iostream>
#include<string>
#include<algorithm>
#include<set>
#include<map>
#include<vector>
#include<stack>
#include<queue>
#include<cmath>
#include<math.h>
#include<numeric>
#include<cassert>
#include<random>
#include<deque>
#include<chrono>
#include<unordered_map>
#include<list>
#include<fstream>
using namespace std;
typedef unsigned long long int ull;
typedef long long int ll;
typedef pair<ll,ll> pll;
typedef pair<int,int> pi;
typedef pair<double,double> pd;
const ll E=1e18+7;
#define F first
#define S second
#define MK make_pair
const ll MOD=1000000007;




int main(){
    ll n;
    cin>>n;
    vector<ll> a;
    for(int i=0;i<n;i++){
        ll b;
        cin>>b;
        a.push_back(b);
    }
    reverse(a.begin(),a.end());
    bool j=true;
    ll mi=1,mx=1;
    if(a[0]!=2){j=false;}
    for(int i=1;i<n && j;i++){
        ll s=mi*a[i-1];
        ll b=(mx+1)*a[i-1]-1;
        mi=(s+a[i]-1)/a[i];
        mx=b/a[i];
        //cout<<s<<" "<<b<<" "<<mi<<" "<<mx<<endl;
        if(mi>mx){j=false;}
        if(mx==0 || mi==0){j=false;}
    }
    if(!j){cout<<-1<<endl;}
    else{
        //cout<<mi<<" "<<mx<<endl;
        reverse(a.begin(),a.end());
        cout<<a[0]*mi<<" "<<(mx+1)*a[0]-1<<endl;
    }
    
    return 0;
}

Submission Info

Judge Result