CodeForces 675A Infinite Sequence(等差数列求项)
来源:互联网 发布:怎么制作淘宝店招 编辑:程序博客网 时间:2024/04/26 03:41
http://codeforces.com/problemset/problem/675/A
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.
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
YES
10 10 0
YES
1 -4 5
NO
0 60 50
NO
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.
题意:
看懂的话就知道这是等差数列求值问题。
思路:
等差数列通项公式 an = a1 + ( n - 1 ) * d ;
对应题目求出的 n 如果是正整数就满足要求。
参考 AC code:
#include<cstdio>#include<cstring>const int MYDD=1103;int main() {int a,b,c;while(scanf("%d%d%d",&a,&b,&c)!=EOF) {if(a==b) {puts("YES");continue;}if(c!=0) {// c!= 0int dd2;double dd1;dd2=(b-a)/c;dd1=(b-a)*1.0/(c*1.0);if((double)dd2!=dd1) puts("NO");else {if(dd2>0) puts("YES");elseputs("NO");}} else {//防止编译错误if(a==b) puts("YES");elseputs("NO");}}return 0;}/*By: Shyazhut10 10 42YES*/
- CodeForces 675A Infinite Sequence(等差数列求项)
- 【CodeForces】675A - Infinite Sequence(易错)
- codeforces 675A Infinite Sequence
- CodeForces 675 A Infinite Sequence
- 【CodeForces】675A - Infinite Sequence
- 【CodeForces】[675A]Infinite Sequence
- CodeForces 675 A Infinite Sequence
- [CodeForces]-675A-Infinite Sequence
- codeforces 675A Infinite Sequence
- CodeForces - 675A Infinite Sequence (模拟)水
- CodeForces 622 A. Infinite Sequence(水~)
- Codeforces--622A--Infinite Sequence(数学)
- Codeforces #353 (div2)A. Infinite Sequence
- Codeforces 622A Infinite Sequence
- CodeForces 622A Infinite Sequence
- CodeForces 622A Infinite Sequence
- CodeForces 622A Infinite Sequence
- CodeForces 622A-Infinite Sequence
- 1605 棋盘问题
- 《VR入门系列教程》之18---Oculus代码剖析
- 如何在物理隔离的服务器(red hat)中安装Jenkins
- 如何做一个简单的Guide(引导)页面
- DOM Ready探究
- CodeForces 675A Infinite Sequence(等差数列求项)
- 【杭电oj1513】Palindrome
- python爬虫实现网盘资源搜索
- 《VR入门系列教程》之19---GearVR开发初识
- POJ 3276:Face The Right Way (开关问题)
- GOF之观察者模式(2)
- python 字典(dict)按键和值排序
- spark常用函数:transformation和action
- 关于CGImageCreateWithImageInRect