ural 1132

题目：http://acm.timus.ru/problem.aspx?space=1&num=1132

很无奈的一个题，看解题报告没看懂怎么回事，问的队友，然后不知道他怎么找的那些资料，然后我就是直接看的链接，

http://en.wikipedia.org/wiki/Tonelli%E2%80%93Shanks_algorithm 

再加上 n == 2时特判，然后就是 r == n - r 时，输出一个，然后就是按照那个算法步骤算了

typedef long long ll;
ll tmod;
ll mod(ll n,ll p)
{
    ll temp = 1;
    while(p > 0)
    {
        if(p & 1) temp = temp * n % tmod;
        n = n * n % tmod;
        p /= 2;
    }
    return temp;
}
ll pows(ll n)
{
    ll i;
    ll temp = 1;
    for(i = 0; i < n; i++)
    temp *= 2;
    return temp;
}

int main()
{
    int n,p,cs;
    ll z,q,s,c;
    ll r,t,m,b,i;
    ll minx;
    scanf("%d",&cs);
    while(cs--)
    {
        scanf("%d%d",&n,&p);
        if(p == 2)
        {
            if(n % p == 1)printf("1\n");
            else printf("No root\n");
            continue;
        }
        tmod = p;
        if(mod(n,(p - 1) / 2) != 1) {printf("No root\n"); continue;}
        q = p - 1;
        s = 0;
        while(q % 2 == 0)
        {
            q /= 2;
            s ++;
        }
        if(s == 1)
        {
            r = mod(n,(p + 1) / 4);
        }
        else
        {
            while(1)
        {
            z = 1 + rand() % (p - 1);
            if(mod(z,(p - 1) / 2) == (p - 1)) break;
        }
        c = mod(z,q);
        r = mod(n,(1 + q) / 2);
        t = mod(n,q);
        m = s;
        while(1)
        {
            if(t % p == 1) break;
            for(i = 1; i < m; i++)
            {
                if(mod(t,pows(i)) == 1) break;
            }
            b = mod(c, pows(m - i - 1));
            r = r * b % p;
            t = t * b * b % p;
            c = b * b % p;
            m = i;
        }
        }
        r = (r % p + p) % p;
        if(r == p - r)cout<<r<<endl;
        else
        {
            minx = Min(r,p - r);
            cout<<minx<<" "<<(p - minx)<<endl;
        }
    }
    return 0;
}