AC通道:http://codevs.cn/problem/3990/
【题解】
用中国剩余定理求出最小的k,然后k+M*y都是可能的值,所以个数就是(b-k)/M+1
注意在统计答案时,由于模数M可能过大,要使用快速乘。
/*************
CODEVS 3990
by chty
2016.11.1
*************/
#include<iostream>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<cmath>
#include<ctime>
#include<algorithm>
using namespace std;
typedef long long ll;
ll n,l,r,ans,M(1),a[15],m[15];
inline ll read()
{
ll x=0,f=1; char ch=getchar();
while(!isdigit(ch)) {if(ch=='-') f=-1; ch=getchar();}
while(isdigit(ch)) {x=x*10+ch-'0'; ch=getchar();}
return x*f;
}
void exgcd(ll a,ll b,ll &x,ll &y)
{
if(b==0) {x=1; y=0; return;}
exgcd(b,a%b,x,y);
ll t=x;x=y;y=t-a/b*y;
}
ll mul(ll x,ll y){return ((x*y-(ll)(((long double)x*y+0.5)/M)*M)%M+M)%M;}//一行快速乘
int main()
{
freopen("cin.in","r",stdin);
freopen("cout.out","w",stdout);
n=read(); l=read(); r=read();
for(ll i=1;i<=n;i++) m[i]=read(),a[i]=read(),M*=m[i];
for(ll i=1;i<=n;i++)
{
ll x,y,Mi=M/m[i];
exgcd(Mi,m[i],x,y);
ans=(ans+mul(mul(x,Mi),a[i]))%M;
}
if(ans<l||ans>r) printf("0\n0\n");
else printf("%lld\n%lld\n",(r-ans)/M+1,ans);
}