codeforces 675A Infinite Sequence
2017-09-20 16:27
260 查看
点击打开链接
A. Infinite Sequence
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
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 bappears 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.
Input
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.
Output
If b appears in the sequence s print
"YES" (without quotes), otherwise print "NO" (without
quotes).
Examples
input
output
input
output
input
output
input
output
Note
In the first sample, the sequence starts from integers 1, 4, 7,
so 7 is its element.
In the second sample, the favorite integer of Vasya is equal to the first element of the sequence.
In the third sample all elements of the sequence are greater than Vasya's favorite integer.
In the fourth sample, the sequence starts from 0, 50, 100,
and all the following elements are greater than Vasya's favorite integer.
就一个数学题,仔细分析它的每一种,就行了。可惜错了好几次。。。
A. Infinite Sequence
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
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 bappears 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.
Input
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.
Output
If b appears in the sequence s print
"YES" (without quotes), otherwise print "NO" (without
quotes).
Examples
input
1 7 3
output
YES
input
10 10 0
output
YES
input
1 -4 5
output
NO
input
0 60 50
output
NO
Note
In the first sample, the sequence starts from integers 1, 4, 7,
so 7 is its element.
In the second sample, the favorite integer of Vasya is equal to the first element of the sequence.
In the third sample all elements of the sequence are greater than Vasya's favorite integer.
In the fourth sample, the sequence starts from 0, 50, 100,
and all the following elements are greater than Vasya's favorite integer.
就一个数学题,仔细分析它的每一种,就行了。可惜错了好几次。。。
#include<bits/stdc++.h> using namespace std; typedef long long ll; int main() { ll a,b,c; cin>>a>>b>>c; if(c==0) { if(a==b) cout<<"YES"<<endl; else cout<<"NO"<<endl; return 0; } else if(c>0) { if(a>b) cout<<"NO"<<endl; else { ll z=b-a; if(z%c==0) cout<<"YES"<<endl; else cout<<"NO"<<endl; } } else//c<0 { if(b>a) cout<<"NO"<<endl; else { int z=a-b; c=-c; if(z%c==0) cout<<"YES"<<endl; else cout<<"NO"<<endl; } } return 0; }
相关文章推荐
- CodeForces - 675A Infinite Sequence (模拟)水
- 【CodeForces】[675A]Infinite Sequence
- 【CodeForces】675A - Infinite Sequence
- 【CodeForces】675A - Infinite Sequence(易错)
- CodeForces 675A Infinite Sequence(等差数列求项)
- [CodeForces]-675A-Infinite Sequence
- codeforces 675A Infinite Sequence
- Codeforces 697A. Pineapple Incident (模拟)
- Codeforces 747D Winter is Coming 贪心(从最坏解开始优化)
- 【CodeForces】906 D. Power Tower 扩展欧拉定理
- Codeforces 814D An overnight dance in discotheque【思维】
- CodeForces - 782A Andryusha and Socks
- codeforces 333B - Chips
- codeforces 544D Destroying Roads (最短路)
- Codeforces 602A Two Bases
- codeforces 747C Servers
- CodeForces - div1 -650D:Zip-line(主席树 占位)
- codeforces 787A the monster(扩展欧几里得做法+暴力做法)
- codeforces 734e(连通分量缩点)
- codeforces 13A. Numbers