This documentation is automatically generated by competitive-verifier/competitive-verifier
#include "src/geometry/int/line_normalized.hpp"#include "../../template.hpp"
array<long,3> line_normalized(long sy,long sx,long ty,long tx){
long a=sy-ty;
long b=tx-sx;
long c=-(sx*a+sy*b);
long g=gcd(gcd(a,b),c);
if(a<0) g*=-1;
a/=g,b/=g,c/=g;
return {a,b,c};
}
#line 2 "src/template.hpp"
#include <bits/stdc++.h>
using namespace std;
#define si(a) (long)a.size()
#define fi first
#define se second
#define all(x) x.begin(),x.end()
#define rep(i,n) for(int i=0;i<(int)(n);++i)
template<typename S,typename F> bool chmin(S&a,F b){return b<a?(a=b,1):0;}
template<typename S,typename F> bool chmax(S&a,F b){return b>a?(a=b,1):0;}
bool _=(ios::sync_with_stdio(0),cin.tie(0),cout<<fixed<<setprecision(16),0);
#line 2 "src/geometry/int/line_normalized.hpp"
array<long,3> line_normalized(long sy,long sx,long ty,long tx){
long a=sy-ty;
long b=tx-sx;
long c=-(sx*a+sy*b);
long g=gcd(gcd(a,b),c);
if(a<0) g*=-1;
a/=g,b/=g,c/=g;
return {a,b,c};
}