CodeForces 21B Intersection

Description

You are given two set of points. The first set is determined by the equation A₁x + B₁y + C₁ = 0, and the second one is determined by the equation A₂x + B₂y + C₂ = 0.

Write the program which finds the number of points in the intersection of two given sets.

Input

The first line of the input contains three integer numbers A₁, B₁, C₁ separated by space. The second line contains three integer numbersA₂, B₂, C₂ separated by space. All the numbers are between -100 and 100, inclusive.

Output

Print the number of points in the intersection or -1 if there are infinite number of points.

Sample Input

Input

1 1 0
2 2 0

Output

-1

Input

1 1 0
2 -2 0

Output

1

判断两条方程的交点个数，注意不是简单的直线，有可能是整个平面或者空集

#include<cstdio>
#include<stack>
#include<cstring>
#include<algorithm>
using namespace std;
const int maxn = 1e5 + 10;
int a[3], b[3];

int main()
{
	for (int i = 0; i < 3; i++) scanf("%d", &a[i]);
	for (int i = 0; i < 3; i++) scanf("%d", &b[i]);
	if (!a[0] && !a[1] && a[2] || !b[0] && !b[1] && b[2]) { printf("0\n"); return 0; }
	if (a[0] * b[1] == a[1] * b[0])
	{
		if (!a[0] && !b[0]) printf("%d\n", a[1] * b[2] == a[2] * b[1] ? -1 : 0);
		else printf("%d\n", a[0] * b[2] == a[2] * b[0] ? -1 : 0);
	}
	else printf("1\n");
	return 0;
}