2011百校联动“菜鸟杯”程序设计公开赛_A A Simple Problem

A Simple Problem

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65535/32768 K (Java/Others)
Total Submission(s): 5749    Accepted Submission(s): 1516

Problem Description

For a given positive integer n, please find the smallest positive integer x that we can find an integer y such that y^2 = n +x^2.

 

Input

The first line is an integer T, which is the the number of cases.
Then T line followed each containing an integer n (1<=n <= 10^9).

 

Output

For each integer n, please print output the x in a single line, if x does not exit , print -1 instead.

 

Sample Input

2 2 3

 

Sample Output

-1 1

 

Author

HIT

#include <stdio.h>
#include <math.h>
int main()
{
	int n,i,j;
	long t,x;
	scanf("%d",&n);
	while(n--)
	{
		scanf("%d",&t);
		j=0;
		for(i=sqrt(t);i>=1;i--){
			if(t%i==0&&(i+t/i)%2==0&&i!=(t/i))
			{
				x=fabs(t/i-i)/2;j=1;break;}
				
				}
				if(j==1&&x!=0)printf("%ld\n",x);
				else
					printf("-1\n");
				
			}
			return 0;
		
	}