讲解:http://blog.csdn.net/clove_unique/article/details/54571216
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
using namespace std;
typedef long long LL;
const int N=15;
LL n,l,r;
LL m[N],a[N],M=1;
LL exgcd(LL a,LL b,LL &x,LL &y)
{
if(!b) {x=1;y=0;return a;}
LL ret=exgcd(b,a%b,y,x);
y-=a/b*x;
return ret;
}
LL inv(LL a,LL mod)
{
LL x,y;
LL ret=exgcd(a,mod,x,y);
return ret==1?((x%mod)+mod)%mod:-1;
}
LL CRT(LL n,LL a[],LL m[])
{
LL x=0;
for(int i=1;i<=n;i++)
{
LL w=M/m[i];
x=(x+a[i]*w%M*inv(w,m[i]))%M;
}
return x;
}
int main()
{
scanf("%lld%lld%lld",&n,&l,&r);
for(int i=1;i<=n;i++)
{
scanf("%lld%lld",&m[i],&a[i]);
M*=m[i];
}
LL x=CRT(n,a,m),sum=0,mn=0;
if(x<l) x+=((l-x-1)/M+1)*M;
if(x<=r) sum=(r-x)/M+1,mn=x;
printf("%lld\n%lld",sum,mn);
}