当前位置: 代码迷 >> 综合 >> Parallel/Orthogonal Aizu - CGL_2_A
  详细解决方案

Parallel/Orthogonal Aizu - CGL_2_A

热度:5   发布时间:2024-03-08 14:13:56.0

Parallel/Orthogonal Aizu - CGL_2_A

题意:

判断直线平行,垂直,或者其他
注意:这里重合也算平行

AC代码:

#include <bits/stdc++.h>
using namespace std;
int q;
struct point {
    int x, y;
};
struct line {
    int x, y;
};
int X(line A, line B) {
    return A.x * B.y - A.y * B.x;
}
int pmul(line A, line B) {
    return A.x * B.x + A.y * B.y;
}
int main() {
    cin >> q;point p0, p1, p2, p3;line s1, s2, s3, s4;while (q--) {
    cin >> p0.x >> p0.y >> p1.x >> p1.y >> p2.x >> p2.y >> p3.x >> p3.y;s1.x = p1.x - p0.x, s1.y = p1.y - p0.y;s2.x = p3.x - p2.x, s2.y = p3.y - p2.y;s3.x = p3.x - p0.x, s3.y = p3.y - p0.y;s4.x = p2.x - p1.x, s4.y = p2.y - p1.y;//cout << pmul(s1, s2) << endl;if (X(s1, s2) == 0) cout << 2 << endl;else if (pmul(s1, s2) == 0) cout << 1 << endl;else cout << 0 << endl;}return 0;
}
  相关解决方案