x1, y1, x2, y2 = map(int, input().split(" "))
x, y = map(int, input().split(" "))
if abs(x2 - x1) % x == 0 and abs(y2 - y1) % y == 0:
if ((abs(x2 - x1) / x) % 2) == ((abs(y2 - y1) / y) % 2):
print("YES")
else:
print("NO")
else:
print("NO")
#include <bits/stdc++.h>
#define ll long long
using namespace std;
int main ()
{
std::ios::sync_with_stdio(false);
std::cin.tie(nullptr);
int x,y,a,b;
cin >> x >> y >> a >> b;
int t1 ,t2;
cin >> t1 >> t2;
int f = 0;
if(abs(a-x)%t1!=0||abs(b-y)%t2!=0)
f = 0;
else
{
int ans1 = abs(a-x) / t1;
int ans2 = abs(b-y) / t2;
if(ans1%2==0 && ans2%2==0)
f = 1;
if (ans1%2!=0 && ans2%2!=0 )
f = 1;
}
if(f)
cout << "YES";
else
cout << "NO";
}
2090. K Radius Subarray Averages | 2091. Removing Minimum and Maximum From Array |
6. Zigzag Conversion | 1612B - Special Permutation |
1481. Least Number of Unique Integers after K Removals | 1035. Uncrossed Lines |
328. Odd Even Linked List | 1219. Path with Maximum Gold |
1268. Search Suggestions System | 841. Keys and Rooms |
152. Maximum Product Subarray | 337. House Robber III |
869. Reordered Power of 2 | 1593C - Save More Mice |
1217. Minimum Cost to Move Chips to The Same Position | 347. Top K Frequent Elements |
1503. Last Moment Before All Ants Fall Out of a Plank | 430. Flatten a Multilevel Doubly Linked List |
1290. Convert Binary Number in a Linked List to Integer | 1525. Number of Good Ways to Split a String |
72. Edit Distance | 563. Binary Tree Tilt |
1306. Jump Game III | 236. Lowest Common Ancestor of a Binary Tree |
790. Domino and Tromino Tiling | 878. Nth Magical Number |
2099. Find Subsequence of Length K With the Largest Sum | 1608A - Find Array |
416. Partition Equal Subset Sum | 1446. Consecutive Characters |