互质版:
#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
typedef __int64 int64;
int64 a[15],b[15];
int64 Extend_Euclid(int64 a, int64 b, int64&x, int64& y)
{
if(b==0)
{
x=1,y=0;
return a;
}
int64 d = Extend_Euclid(b,a%b,x,y);
int64 t = x;
x = y;
y = t - a/b*y;
return d;
}
//求解模线性方程组x=ai(mod ni)
int64 China_Reminder(int len, int64* a, int64* n)
{
int i;
int64 N = 1;
int64 result = 0;
for(i = 0; i < len; i++)
N = N*n[i];
for(i = 0; i < len; i++)
{
int64 m = N/n[i];
int64 x,y;
Extend_Euclid(m,n[i],x,y);
x = (x%n[i]+n[i])%n[i];
result = (result + m*a[i]*x%N)%N;
}
return result;
}
int main()
{
int n;
while(scanf("%d",&n)!=EOF)
{
for(int i = 0; i < n; i++)
scanf("%I64d %I64d",&a[i],&b[i]);
printf("%I64d\n",China_Reminder(n,b,a));
}
return 0;
}
非互质版:
/**
中国剩余定理(不互质)
*/
#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
typedef __int64 int64;
int64 Mod;
int64 gcd(int64 a, int64 b)
{
if(b==0)
return a;
return gcd(b,a%b);
}
int64 Extend_Euclid(int64 a, int64 b, int64&x, int64& y)
{
if(b==0)
{
x=1,y=0;
return a;
}
int64 d = Extend_Euclid(b,a%b,x,y);
int64 t = x;
x = y;
y = t - a/b*y;
return d;
}
//a在模n乘法下的逆元,没有则返回-1
int64 inv(int64 a, int64 n)
{
int64 x,y;
int64 t = Extend_Euclid(a,n,x,y);
if(t != 1)
return -1;
return (x%n+n)%n;
}
//将两个方程合并为一个
bool merge(int64 a1, int64 n1, int64 a2, int64 n2, int64& a3, int64& n3)
{
int64 d = gcd(n1,n2);
int64 c = a2-a1;
if(c%d)
return false;
c = (c%n2+n2)%n2;
c /= d;
n1 /= d;
n2 /= d;
c *= inv(n1,n2);
c %= n2;
c *= n1*d;
c += a1;
n3 = n1*n2*d;
a3 = (c%n3+n3)%n3;
return true;
}
//求模线性方程组x=ai(mod ni),ni可以不互质
int64 China_Reminder2(int len, int64* a, int64* n)
{
int64 a1=a[0],n1=n[0];
int64 a2,n2;
for(int i = 1; i < len; i++)
{
int64 aa,nn;
a2 = a[i],n2=n[i];
if(!merge(a1,n1,a2,n2,aa,nn))
return -1;
a1 = aa;
n1 = nn;
}
Mod = n1;
return (a1%n1+n1)%n1;
}
int64 a[1000],b[1000];
int main()
{
int i;
int k;
while(scanf("%d",&k)!=EOF)
{
for(i = 0; i < k; i++)
scanf("%I64d %I64d",&a[i],&b[i]);
printf("%I64d\n",China_Reminder2(k,b,a));
}
return 0;
}
/*接下来介绍乘法逆元:
若m≥1,gcd(a,m)=1,则存在c使得 ca≡1(mod m) 我们把c称为是a对模m的逆,记为 a-1(mod m)或a-1 可以用扩展欧几里德算法求a-1
应用: 求(a/b)%c时,若a为大整数时可以写成 ((a%c)*((b-1)%c))%c,注意:这里(b-1)是b%c的乘法逆元,不是b减 1!!!
还可以使用扩展欧几里德算法求乘法逆元:*/
//a在模n乘法下的逆元,没有则返回-1(a * b % n == 1,已知a,n,求b就是求a模n的乘法逆元)
int inv(int a, int n)///a在模n乘法下的逆元,没有则返回-1(a * b % n == 1,已知a,n,求b就是乘法逆元)
{
int x, y;
int t = Ext_gcd(a, n, x, y);///扩展欧几里得算法
if(t != 1)
return -1;
return (x % n + n) % n;
}
欧拉函数:(E(k) = [1,n-1]中与n互质的整数个数
递推求欧拉函数:
void Euler()
{
int i, j;
for (i = 1; i <= Max; i++)
num[i] = i;
for (i = 2; i <= Max; i += 2)
num[i] /= 2;
for (i = 3; i <= Max; i += 2)
{
if(num[i] == i)
{
for (j = i; j <= Max; j += i)
num[j] = num[j] / i * (i - 1);
}
}
}
单独求欧拉函数:
int Euler(int x)
{
int res = x;
for(int i = 2; i < (int)sqrt(x * 1.0) + 1; i++)
{
if(x % i == 0)
{
res = res / i * (i - 1);
while (x % i == 0)/// 保证i一定是素数
x /= i;
}
}
if(x > 1)
res = res / x * (x - 1);
return res;
}
先打素数表再判是否为素数:
const int N = 100005;
const int MOD = 9901;
LL n,ans;
bool prime[N];
int p[N];//保存素数
int cnt;
void isprime()//素数筛选
{
cnt = 0;
memset(prime,true,sizeof(prime));
for(int i=2; i<N; i++)
{
if(prime[i])
{
p[cnt++] = i;
for(int j=i+i; j<N; j+=i)
prime[j] = false;
}
}
}
bool Judge(LL A)//判断是否为素数,是素数则返回true
{
for(int i=0; p[i]*p[i] <= A; i++)
{
if(A % p[i] == 0)
{
return false;
}
}
return true;
}