51nod 1079:http://www.51nod.com/Challenge/Problem.html#!#problemId=1079
#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int maxn=1e2+7;
int main()
{
int n;
ll p[maxn], m[maxn], ans=0, gg=1;
scanf("%d", &n);
for(int i=0; i<n; i++)
{
scanf("%lld%lld", &m[i], &p[i]);
}
ans=p[0];
for(int i=0; i<n-1; i++)
{
gg*=m[i];
while(ans%m[i+1]!=p[i+1])
{
ans+=gg;
}
}
printf("%lld\n", ans);
return 0;
}