OJ Board

Code: Select all

#include<stdio.h>
#include<math.h>
#include<stdlib.h>

# define M_PI		3.14159265358979323846	/* pi */

double sqrt(double );
double atan(double );
double fabs(double );

int main()
{
       int i,a,b,no,k;
       double  m,n,z;

       scanf(" %d",&no);
       while(no--)
       {
               scanf(" %d %d",&a,&b);

               z=sqrt(a*a + b*b);

               if(a==0)
                       m=M_PI/2;
               else
                       m=atan((double)b/(double)a);

               if(m==0)
               {
                       printf("1\n");
                       continue;
               }

               k=fabs(M_PI/m);

               if (fabs(fabs(k*m ) - M_PI) < 0.00009)
		{
			if(pow(z,k) <= pow(2,30))
                       printf("%d\n",k);
		else
                       printf("TOO COMPLICATED\n");
		}
               else
                       printf("TOO COMPLICATED\n");
       }
       return 0;
}

Code: Select all

5
0 0
-153 -265
-153 265
-97 -168
97 168

Code: Select all

Suppose a and b given...
I considered x=1 and y=0

1. I have two complex numbers -

P = x + iy
Q = a + ib

2. Every time multiply P and Q and update x, y (x, y to srore the multiplication results. x contains real part and y contains complex part) .

3. If abs (x) > 2^30 then TOO COMPLICATED. End.

4. If y = 0, Got the Solution. End.

5. Goto step 1.