Submission #3422065

---

Source Code Expand

#include <iostream>
#include <string>
#include <algorithm>
#include <cstdio>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <numeric>
#include <cmath>

using namespace std;

typedef long long int ll;

#define all(x) x.begin(),x.end()

const ll mod = 1e9+7;
const ll INF = 1e9;
const ll MAXN = 1e9;

int main()
{
  ll k;
  cin >> k;
  vector<ll> a(k);
  for(int i = 0; i < k; i++){
    cin >> a[i];
  }

  vector<ll> l(k),r(k);

  l[k-1] = 2,r[k-1] = 2;
  for(int i = k-2; i >= -1; i--){
    ll x = ceil((double)l[i+1]/a[i+1]) * a[i+1];
    ll y = (r[i+1]/a[i+1])*a[i+1];

    //cout << x << " " << y << endl;

    if((l[i+1]/a[i+1])*a[i+1] + a[i+1] > r[i+1] && l[i+1] % a[i+1] != 0){
      cout << -1 << endl;
      return 0;
    }

    if(i == -1){
      cout << x << " " << y + a[i+1] - 1 << endl;
      return 0;
    }

    l[i] = x;
    r[i] = y + a[i+1] - 1;

    //cout << l[i] << " " << r[i] << endl;
  }

  //cout << l[0] << " " << r[0] << endl;

  return 0;
}

Submission Info

Judge Result