【CodeForces】675A - Infinite Sequence

Description

Vasya likes everything infinite. Now he is studying the properties of a sequence s, such that its first element is equal to a (s₁ = a), and the difference between any two neighbouring elements is equal to c (s_i - s_i - 1 = c). In particular, Vasya wonders if his favourite integer b appears in this sequence, that is, there exists a positive integer i, such that s_i = b. Of course, you are the person he asks for a help.

Input

The first line of the input contain three integers a, b and c ( - 10⁹ ≤ a, b, c ≤ 10⁹) — the first element of the sequence, Vasya's favorite number and the difference between any two neighbouring elements of the sequence, respectively.

Output

If b appears in the sequence s print "YES" (without quotes), otherwise print "NO" (without quotes).

Sample Input

Input

1 7 3

Output

YES

Input

10 10 0

Output

YES

Input

1 -4 5

Output

NO

Input

0 60 50

Output

NO

题意：给出一个等差数列的第一个数a1及d,判断k是不是在这个等差数列内；

注意c==0的情况；

#include<stdio.h>#include<string.h>#include<algorithm>using namespace std;int main(){int a,b,c;while(scanf("%d%d%d",&a,&b,&c)!=EOF){      if(c==0)     {      if(a==b)      printf("YES\n");     else      printf("NO\n");  }  else  {  int m=b-a;  if(m%c==0&&((m>=0&&c>0)||(m<=0)&&(c<0)))  printf("YES\n");  else  printf("NO\n");  }}}