hdoj 5615 Jam's math problem 【十字相乘】

Jam's math problem

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 912    Accepted Submission(s): 436

Problem Description

Jam has a math problem. He just learned factorization.
He is trying to factorize ax2+bx+c into the form of pqx2+(qk+mp)x+km=(px+k)(qx+m) .
He could only solve the problem in which p,q,m,k are positive numbers.
Please help him determine whether the expression could be factorized with p,q,m,k being postive.

 

Input

The first line is a number T , means there are T(1≤T≤100) cases

Each case has one line,the line has 3 numbers a,b,c(1≤a,b,c≤100000000)

 

Output

You should output the "YES" or "NO".

 

Sample Input

  
  

   
   2
1 6 5
1 6 4
  
  

 

Sample Output

  
  

   
   YES
NO


   
   

    
    

     
     Hint
    
    
The first case turn $x^2+6*x+5$ into $(x+1)(x+5)$
   
   
   
    
  
  

 

代码：

#include<stdio.h>
int main()
{
	int n;
	long long a,b,c,p,q,k,m,f;
	scanf("%d",&n);
	while(n--)
	{
		scanf("%lld%lld%lld",&a,&b,&c);
		f=0;
		for(q=1;q*q<=a;q++)
		{
			if(a%q==0)
			{
				p=a/q;
				for(k=1;k*k<=c;k++)
				{
					if(c%k==0)
					{
						m=c/k;
				    	if(q*k+p*m==b||p*k+q*m==b)
					    f=1;
					}
					if(f==1)
					break;
				}
			}
			if(f==1)
			break;
		}
		if(f==1)
		printf("YES\n");
		else
		printf("NO\n");
	}
	return 0;
}