YEAAAAAH, I got AC!!!

You had WA1 on this problem earlier. In what there was a mistake? Can at me same....
And please post some tests for this problem

program Ural_1132;
var
  i,j,x,p,q,n:longint;

function power(a,b,c:longint):longint;
var
  d,s:longint;
begin
  d:=a;s:=1;
  while b>0 do
  begin
    if odd(b) then s:=(s*d) mod c;
    b:=b div 2;d:=(d*d) mod c;
  end;
  exit(s);
end;

begin
  read(n);
  for i:=1 to n do
  begin
    read(q,p);q:=q mod p;
    if (p=2) and (q=1) or (p<>2) and (power(q,(p-1) div 2,p)=p-1) then
    begin
      writeln('No root');
      continue;
    end;
    if trunc(sqrt(q))=0 then
    begin
      x:=trunc(sqrt(q));
      write(x);
      if p-x<>x then write(' ',p-x);
      writeln;
      continue;
    end;
    for j:=1 to (p-1) div 2 do
    begin
      x:=(j*j) mod p;
      if x=q then
      begin
        write(j);
        if p-j<>j then write(' ',p-j);
        writeln;
        break;
      end;
    end;
  end;
end.

Edited by author 07.03.2007 18:27

I think that there is a simple formula that is going to
work....

I know the answer when (n mod 4)=3

The answer is +a^((n+1)/4), -a^((n+1)/4)

But I don't know the answer when (n mod 4)=1

>

>

>

I try to solve it with C++ too, Thank you very much I will translation it to
Pascal.
I hope I will got accepted.

if 19 appears, so 32 must do the same.
In this prob, we must understand to output all the X
satisfy the rule AND X <= N, that what i think about it :)

QH@