poj——1496——Equations

1123 단어 해시 시계
Problem Description Consider equations having the following form:  a*x1^2+b*x2^2+c*x3^2+d*x4^2=0 a, b, c, d are integers from the interval [-50,50] and any of them cannot be 0. It is consider a solution a system ( x1,x2,x3,x4 ) that verifies the equation, xi is an integer from [-100,100] and xi != 0, any i ∈{1,2,3,4}. Determine how many solutions satisfy the given equation.   Input The input consists of several test cases. Each test case consists of a single line containing the 4 coefficients a, b, c, d, separated by one or more blanks. End of file.   Output For each test case, output a single line containing the number of the solutions.   Sample Input 1 2 3 -4 1 1 1 1   Sample Output 39088 0  풀이: 방정식 의 풀이
#include 
#include 
#include 
using namespace std;
int hash[2000005];
int main()
{
	int a,b,c,d;
	while(cin>>a>>b>>c>>d)
	{
		if((a>0&&b>0&&c>0&&d>0)||(a<0&&b<0&&c<0&&d<0))
		{
			cout<

좋은 웹페이지 즐겨찾기