Submission #928284

---

Source Code Expand

#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
#include<utility>
#include<set>
#include<stack>
#include<list>
#include<deque>
#include<bitset>
#include<iomanip>
#include<cstring>
#include<sstream>
#include<cstdio>
#include<cstdlib>
#include<climits>
#include<cmath>
#include<cctype>


#define pb push_back
#define mp make_pair
#define rep(i,a,b) for(int i=a;i<=b;i++)
#define ren(i,a,b) for(int i=a;i>=b;i--)
#define ff first
#define ss second
#define pll pair<long long int,long long int>
#define pii pair<int,int>
#define vll vector<long long int>
#define vii vector<int>
#define gi(n) scanf("%d",&n)
#define gll(n) scanf("%lld",&n)
#define gstr(n) scanf("%s",n)
#define gl(n) cin >> n
#define oi(n) printf("%d",n)
#define oll(n) printf("%lld",n)
#define ostr(n) printf("%s",n)
#define ol(n) cout << n
#define os cout<<" "
#define on cout<<"\n"
#define o2(a,b) cout<<a<<" "<<b
#define all(n) n.begin(),n.end()
#define present(s,x) (s.find(x) != s.end())
#define cpresent(s,x) (find(all(s),x) != s.end())
#define tr(container, it) for(__typeof(container.begin()) it = container.begin(); it != container.end(); it++)
using namespace std;

typedef unsigned long long int ull;
typedef long long int ll;
typedef vector<vector<ll> > mat;

int of(ll a,ll b)
{
	if((a*b)/b!=a)
	return 1;
	return 0;
}

int main()
{ios_base::sync_with_stdio(false);
ll a=1,b=1;
int t;
gl(t);
while(t--)
{
	ll x,y;
	cin>>x>>y;
	ll c,d,lo=1,hi=1e18+7,mid;
	while(lo<hi)
	{
		mid=(lo+hi)/2;
		if(of(mid,x)||of(mid,y))
		hi=mid;
		else if(mid*x>=a&&mid*y>=b)
		hi=mid,c=mid*x,d=mid*y;
		else lo=mid+1;
	}
	a=c;b=d;
}
ol(a+b);
return 0;
}

Submission Info

Judge Result