题目描述:
Vasya likes everything infinite. Now he is studying the properties of a sequence s, such that its first element is equal to a (s1 = a), and the difference between any two neighbouring elements is equal to c (si - si - 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 si = b. Of course, you are the person he asks for a help.
输入描述:
The first line of the input contain three integers a, b and c ( - 109 ≤ a, b, c ≤ 109) — the first element of the sequence, Vasya’s favorite number and the difference between any two neighbouring elements of the sequence, respectively.
输出描述:
If b appears in the sequence s print “YES” (without quotes), otherwise print “NO” (without quotes).
输入:
1 7 3
10 10 0
1 -4 5
0 60 50
输出:
YES
YES
NO
NO
题意:
给出首项a,给出公差c,问b是否在这个等差数列里。
题解:
暴力模拟即可
代码:
#include<cstdio>
#include<cstring>
#include<iostream>
#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 if(a == b){
printf("YES\n");
}
else{
if(c > 0){
bool flag = false;
for(;;){
a += c;
if(a == b){
flag = true;
break;
}
else if(a > b){
break;
}
}
if(flag) printf("YES\n");
else printf("NO\n");
}
else{
bool flag = false;
for(;;){
a += c;
if(a == b){
flag = true;
break;
}
else if(a < b){
break;
}
}
if(flag) printf("YES\n");
else printf("NO\n");
}
}
}
return 0;
}