X问题(hdu1573线性同余方程)

题意：求在小于等于N的正整数中有多少个X满足：X mod a[0] = b[0], X mod a[1] = b[1], X mod a[2] = b[2], …, X mod a[i] = b[i], … (0 < a[i] <= 10)

思路：解线性同余方程组求出满足上面等式最小的x是多少,因为他们的通解为 x+ lcm(a0,a1,a2,a3...an)，所以求出最小的解，计算M-x之间有多少个 lcm(a0,a1,a2,a3...an)

再加上x本身+1，因为题目是正整数，所以x = 0 的时候不算就不加1

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
using namespace std;
typedef long long int64;
int64 A[15];
int64 R[15];

int64 Exgcd(int64 a,int64 b,int64& x,int64& y)
{
    if(b == 0)
    {
        x = 1,y = 0;
        return a;
    }
    else
    {
        int64 r = Exgcd(b,a%b,x,y);
        int64 temp = x;
        x = y;y = temp - a/b*y;
        return r;
    }
}
int main()
{
    int t;
    scanf("%d",&t);
    while(t--)
    {
        int64 M,N;
        scanf("%I64d%I64d",&M,&N);
        for(int64 i = 0; i < N; i++)
        {
            scanf("%I64d",&A[i]);
        }
        for(int64 i = 0; i < N; i++)
        {
            scanf("%I64d",&R[i]);
        }
        int64 a1 = A[0],r1 = R[0];
        int64 x,y;
        bool flag = 1;
        for(int64 i = 1; i < N; i++)
        {
            int64 a = a1,b = A[i],c = R[i] - r1,d;
            d = Exgcd(a,b,x,y);
            if(c % d != 0)
            {
                flag = 0;break;
            }
            x = x * (c / d);
            b = b / d;
            x = (x % b + b) % b;
            r1 = x * a1 + r1;
            a1 = a1*(A[i]/d);
        }
        if(flag)
        {
             if(r1 > M)
                printf("0\n");
            else if(r1 != 0)
                printf("%I64d\n",(M-r1)/a1+1);
            else
                printf("%I64d\n",(M-r1)/a1);
        }
        else
        {
            printf("0\n");
        }


    }
    return 0;
}