2013 - ECJTU 暑期训练赛第七场-problem-H

H - O.O

Crawling in process... Crawling failed Time Limit:1000MS     Memory Limit:65536KB     64bit IO Format:%I64d & %I64u

Submit Status Practice CodeForces 21B

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 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 numbers A₂, 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

这题就是给出两条条直线的方程（即点集）的例如：Ax+By+C=0的A、B、C判断这两个方程有几个公共解（或者几个点集是公共的）

AC代码+解释：

#include<iostream>//判断两条条直线的方程（即点集）的例如：Ax+By+C=0的A、B、C判断这两个方程有几个公共解
#include<cstdio>
#include<cstring>
#include<string>
#include<cstdlib>
#include<algorithm>
#include<cmath>
#include<queue>
#include<stack>
#include<iomanip>
using namespace std;
int panduan(double x,double y,double z)
{
    if(x==0&&y==0)
    {
        if(z==0)return 1;
        else return 2;
    }
    return 3;
}
int main()
{
    double a1,a2,b1,b2,c1,c2;
    int k1,k2;
    while(cin>>a1>>b1>>c1>>a2>>b2>>c2)
    {
        k1=panduan(a1,b1,c1);//如果两直线其中有一条A,B,C全为0，那么那条直线就不存在，那么另一条直线就有无数解或者两条直线都不存在也是无数解
        k2=panduan(a2,b2,c2);
        if((k1==1&&k2!=2)||(k1!=2&&k2==1))
        {
            cout<<-1<<endl;
            continue;
        }
        if(a1==0&&a2==0&&b1!=0&&b2!=0)//当A等于0，此时方程可以写成：y=(-C)/B
        {
            if(c1/b1==c2/b2)//如果相等即两条直线共线
            {
                cout<<-1<<endl;
                continue;
            }
            else
            {
                cout<<0<<endl;//否则就平行
                continue;
            }
        }
        if(a1!=0&&a2!=0&&b1==0&&b2==0)//同理，当B=0，此时方程可以写成：x=(-C)/A;
        {
            if(c1/a1==c2/a2)//如果相等则两直线共线
            {
                cout<<-1<<endl;
                continue;
            }
            else//否则两直线平行
            cout<<0<<endl;
            continue;
        }
        if(a1!=0&&b1!=0&&a2!=0&&b2!=0)//如果A和B都不为0，那么方程可以化成：y=(-A/B)*x+(-C/B)
        {
            if(a1/b1==a2/b2&&c1/b1==c2/b2)//如果都相等则还是两直线共线
            {
                cout<<-1<<endl;
                continue;
            }
            else if(a1/b1==a2/b2)//否则如果只有斜率(即（-A/B）)相等，那么就是平行了
            {
                cout<<0<<endl;
                continue;
            }
        }
        if((a1==0&&b1==0&&c1!=0)||(a2==0&&b2==0&&c2!=0))//如果A和B都等于0，而C不为0，那么这两直线就不是两直线即不合法
        {
            cout<<0<<endl;
            continue;
        }
        cout<<1<<endl;//除此之外就只能相交了
    }
    return 0;
}