P1495 【模板】中国剩余定理(CRT)/曹冲养猪 一定别忘记加引用!!服了
#include
#define ll long long
using namespace std;
const int N=1e5+5;
ll n,a[15],b[15];
ll ex_gcd(ll a,ll b,ll &x,ll &y)
{
if(b==0)
{
x=1,y=0;return a;
}
ll d=ex_gcd(b,a%b,x,y);
ll tmp=x;
x=y;
y=tmp-(a/b)*y;
return d;
}
ll ex_crt()
{
ll aa=b[1],rr=a[1],x,y;
for(int i=2;i>n;
for(int i=1;i>b[i]>>a[i];
cout
关注
打赏