题目来源:码蹄集
https://matiji.net/exam/brushquestion/179/778/B3FCFEC101BD05189BB74D522E019504
参考程序:
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <string>
#include <cmath>
using namespace std;
#define N 1000
#define ll long long
int a[10] , b[10] ;
int main(){
//scanf("(%d,%d",&a[1],&a[2]);
//cout << a[1] <<" " << a[2] << endl;
scanf("(%d,%d) (%d,%d)\n",&a[1],&a[2],&a[3],&a[4]);
scanf("(%d,%d) (%d,%d)",&b[1],&b[2],&b[3],&b[4]);
if (a[2] - a[4] == 0 || b[2] - b[4] == 0){
if (a[1] == a[3] && b[1] == b[3] || a[2] == a[4] && b[2] == b[4])
cout << "YES" ;
else cout << "NO" ;
}
else if (a[1] == a[3] && b[1] == b[3] || a[2] == a[4] && b[2] == b[4] || (a[1]-a[3])/(a[2]-a[4]) == (b[1]-b[3])/(b[2]-b[4]))
cout << "YES" ;
else cout << "NO" ;
return 0;
}
/*
(0,0) (1,0)
(0,1) (-1,1)
*/