codeforces 675A Infinite Sequence
来源:互联网 发布:怎么看自己的淘宝联盟i 编辑:程序博客网 时间:2024/04/24 17:21
点击打开链接
就一个数学题,仔细分析它的每一种,就行了。可惜错了好几次。。。
#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;}
阅读全文
0 0
- 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 622A Infinite Sequence
- CodeForces 622A Infinite Sequence
- CodeForces 622A Infinite Sequence
- CodeForces 622A Infinite Sequence
- CodeForces 622A-Infinite Sequence
- CodeForces 622A Infinite Sequence
- CodeForces-622A.Infinite Sequence
- CodeForces - 675A Infinite Sequence (模拟)水
- CodeForces 675A Infinite Sequence(等差数列求项)
- Educational Codeforces Round 7--A. Infinite Sequence
- 测试博客
- block copy字符修饰
- 频道管理
- 展示数据,上拉加载,下拉刷新,一定要导入library.
- bzoj 2818(欧拉函数)
- codeforces 675A Infinite Sequence
- mtk-2017 GPS Training
- 设计模式之备忘录模式
- 设计模式-适配器模式
- JSP基础(三)
- Geosoft Oasis.Montaj.v6.4.2
- Hive内置函数
- angularjs实现分页和搜索
- 【设计模式】IO中使用到的设计模式