2019牛客暑期多校训练营（第九场）B Quadratic equation （二次剩余模板）

 题目链接：https://ac.nowcoder.com/acm/contest/889/B

题意：给你b，c，p = 1e9 + 7，满足以下方程的x，y，如果没解输出  -1 -1

(x + y)mod p = b

(x * y)mod p = c

已知x+y = b 或 x+y = b + p， xy = c + kp ;

则

通过二次剩余定理，求出（x-y） 

x = (x-y)+(x+y) >> 1

y = x + y - x;

 

 

#include <bits/stdc++.h>
#define ll long long
using namespace std;
struct node{
	ll x,y;
	node(ll a=0,ll b=0){
		x=a;y=b;
	}
};
const ll p = 1e9 + 7;
ll w;
node operator*(node a,node b){return node(a.x*b.x%p+a.y*b.y%p*w%p,a.x*b.y%p+a.y*b.x%p);}

ll ran(){
	static ll seed=23333;
	return seed=((((((ll)seed^20030927)%p+330802)%p*9410)%p-19750115+p)%p^730903)%p;
}

ll ksm(ll a,ll b){
	ll base=1;
	while(b){
		if(b&1) base=base*a%p;
		a=a*a%p;b/=2;
	}
	return base;
}

node mul(node a,ll b){
	node base=node(1,0);
	while(b){
		if(b&1) base=base*a;
		a=a*a;b/=2;
	}
	return base;
}

ll legander(ll x){
	ll a=ksm(x,(p-1)/2);
	if(a+1==p) return -1;
	return a;
}

ll solve(ll x){
	ll a;
    if(x % p == 0) return 0;
    if(p == 2) return x;
	if(legander(x) == -1) return -1;
	while(1){
		a = ran() % p;
		w = ((a * a - x) % p + p) % p;
		if(legander(w) == -1) break;
	}
	node b = node(a, 1);
	b = mul(b, (p + 1) / 2);
	return b.x;
}

int main()
{
    int T;
    ll b, c;
    scanf("%d", &T);
    while(T--) {
        scanf("%lld %lld", &b, &c);
        ll a = (b * b - 4ll * c) % p + p  ;
        ll del = solve(a);//x - y
        if(del == -1) {
            puts("-1 -1");
        }
        else{
            ll x = (b + del) % p * ksm(2, p - 2) % p;
            x %= p;
            ll y = (b - x + p) % p;
            if(x > y) swap(x, y);
            printf("%lld %lld\n", x, y);
        }
    }
    return 0;
}