-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path1393.cpp
47 lines (40 loc) · 940 Bytes
/
1393.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
#include <bits/stdc++.h>
#pragma GCC optimize ("O3")
#pragma GCC optimize ("Ofast")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target("avx,avx2,fma")
using namespace std;
typedef long long ll;
int xxxx[]={-1,0,1,0,-1,1,1,-1};
int yyyy[]={0,1,0,-1,-1,1,-1,1};
void solve(){
int x,y; cin >> x >> y;
int sx, sy; cin >> sx >> sy;
int dx, dy; cin >> dx >> dy;
int result = 1e9;
int g = gcd(dx,dy);
dx /= g;
dy /= g;
int rx, ry;
for (int i = 0; i < 100; i++) {
if ((x-sx)*(x-sx)+(y-sy)*(y-sy) < result) {
rx = sx;
ry = sy;
result = (x-sx)*(x-sx)+(y-sy)*(y-sy);
}
sx += dx;
sy += dy;
}
cout << rx << ' ' << ry;
}
int main()
{
cin.tie(0)->sync_with_stdio(false);
int T=1;
// cin >>T;
while (T--) {
solve();
cout << '\n';
}
return 0;
}