Codeforces Round #394 (Div. 2) A. Dasha and Stairs 易错
来源:互联网 发布:淘宝销量信誉互刷平台 编辑:程序博客网 时间:2024/05/17 23:28
On her way to programming school tiger Dasha faced her first test — a huge staircase!
The steps were numbered from one to infinity. As we know, tigers are very fond of all striped things, it is possible that it has something to do with their color. So on some interval of her way she calculated two values — the number of steps with even and odd numbers.
You need to check whether there is an interval of steps from the l-th to the r-th (1 ≤ l ≤ r), for which values that Dasha has found are correct.
In the only line you are given two integers a, b (0 ≤ a, b ≤ 100) — the number of even and odd steps, accordingly.
In the only line print "YES", if the interval of steps described above exists, and "NO" otherwise.
2 3
YES
3 1
NO
In the first example one of suitable intervals is from 1 to 5. The interval contains two even steps — 2 and 4, and three odd: 1, 3 and 5.
Source
Codeforces Round #394 (Div. 2)
My Solution
易错
对于 0 0 这组数据要进行特殊的判断,比赛的时候用这组数据hack了十几个人,
当时这个有趣的题忘了记录下来了,现在补上,^_^
#include <iostream>#include <cstdio>#include <cmath>using namespace std;typedef long long LL;const int maxn = 1e6 + 8;int main(){ #ifdef LOCAL freopen("a.txt", "r", stdin); //freopen("a.out", "w", stdout); int T = 4; while(T--){ #endif // LOCAL ios::sync_with_stdio(false); cin.tie(0); LL a, b; cin >> a >> b; if(a == 0 && b == 0) cout << "NO" << endl; else if(abs(a - b) <= 1) cout << "YES" << endl; else cout << "NO" << endl; #ifdef LOCAL cout << endl; } #endif // LOCAL return 0;}
------from ProLights
- Codeforces Round #394 (Div. 2) A. Dasha and Stairs 易错
- Codeforces Round #394(Div. 2)A.Dasha and Stairs【水题】
- Codeforces Round #394 (Div. 2)(A. Dasha and Stairs,B. Dasha and friends,C. Dasha and Password)
- Codeforces-Round 394#A-Dasha and Stairs
- Codeforces Round #394 (Div. 2)Dasha and Stairs
- Codeforces Round #394 (Div. 2) C. Dasha and Password
- Codeforces Round #394 (Div. 2) Dasha and Password
- Codeforces Round #394 (Div. 2)Dasha and friends
- Codeforces Round #394 (Div. 2)Dasha and Very Difficult Problem
- Codeforces Round #394 (Div. 2)C. Dasha and Password【暴力】
- Codeforces Round #394 (Div. 2) C. Dasha and Password
- Codeforces Round #394 (Div. 2) Dasha and Very Difficult Problem
- Codeforces Round #394 (Div. 2)-E. Dasha and Puzzle(dfs)
- Codeforces Round #394 (Div. 2) E. Dasha and Puzzle(构造)
- Codeforces Round #272 (Div. 2) A Dreamoon and Stairs
- Codeforces Round #272 (Div. 2) A. Dreamoon and Stairs
- codeforces 753 A. Dasha and Stairs
- 【codeforces 761A】Dasha and Stairs
- java中for(a b:c){}是什么意思?如何执行的?
- Project Euler Problem 2: Even Fibonacci numbers
- 如何配置Linux网卡
- 在POM配置Maven plugin提示错误“Plugin execution not covered by lifecycle configuration”的解决方案
- sun.misc.BASE64Encoder找不到jar包的解决方法
- Codeforces Round #394 (Div. 2) A. Dasha and Stairs 易错
- spoj XXXXXXXX
- 博客
- Maven私服Nexus3.x环境构建操作记录
- Spring Boot 框架介绍和使用
- OpenGL ES总结(四)OpenGL 渲染视频画面
- 不要使用sun.misc.BASE64Encoder
- 001-使用OpenVR开发时,VR头显无法正常工作
- ACMpoj 1953斐波拉契数列