CF761 A. Dasha and Stairs (水题)
来源:互联网 发布:企业erp软件 编辑:程序博客网 时间:2024/06/05 18:17
传送门
解题思路:傻逼题,注意0 0 输出是No,hack点。
/* ***********************************************┆ ┏┓ ┏┓ ┆┆┏┛┻━━━┛┻┓ ┆┆┃ ┃ ┆┆┃ ━ ┃ ┆┆┃ ┳┛ ┗┳ ┃ ┆┆┃ ┃ ┆┆┃ ┻ ┃ ┆┆┗━┓ 马 ┏━┛ ┆┆ ┃ 勒 ┃ ┆ ┆ ┃ 戈 ┗━━━┓ ┆┆ ┃ 壁 ┣┓┆┆ ┃ 的草泥马 ┏┛┆┆ ┗┓┓┏━┳┓┏┛ ┆┆ ┃┫┫ ┃┫┫ ┆┆ ┗┻┛ ┗┻┛ ┆************************************************ *///#pragma comment(linker, "/STACK:102400000,102400000")#include <stdio.h>#include <string.h>#include <iostream>#include <algorithm>#include <vector>#include <queue>#include <stack>#include <set>#include <map>#include <string>#include <math.h>#include <stdlib.h>#include <bitset>using namespace std;#define rep(i,a,b) for (int i=(a),_ed=(b);i<=_ed;i++)#define per(i,a,b) for (int i=(b),_ed=(a);i>=_ed;i--)#define pb push_back#define mp make_pairconst int inf_int = 2e9;const long long inf_ll = 2e18;#define inf_add 0x3f3f3f3f#define mod 1000000007#define LL long long#define ULL unsigned long long#define MS0(X) memset((X), 0, sizeof((X)))#define SelfType intSelfType Gcd(SelfType p,SelfType q){return q==0?p:Gcd(q,p%q);}SelfType Pow(SelfType p,SelfType q){SelfType ans=1;while(q){if(q&1)ans=ans*p;p=p*p;q>>=1;}return ans;}#define Sd(X) int (X); scanf("%d", &X)#define Sdd(X, Y) int X, Y; scanf("%d%d", &X, &Y)#define Sddd(X, Y, Z) int X, Y, Z; scanf("%d%d%d", &X, &Y, &Z)#define reunique(v) v.resize(std::unique(v.begin(), v.end()) - v.begin())#define all(a) a.begin(), a.end()#define mem(x,v) memset(x,v,sizeof(x))typedef pair<int, int> pii;typedef pair<long long, long long> pll;typedef vector<int> vi;typedef vector<long long> vll;inline int read(){int ra,fh;char rx;rx=getchar(),ra=0,fh=1;while((rx<'0'||rx>'9')&&rx!='-')rx=getchar();if(rx=='-')fh=-1,rx=getchar();while(rx>='0'&&rx<='9')ra*=10,ra+=rx-48,rx=getchar();return ra*fh;}int Abs(int a,int b){ if(a>b)return a-b; else return b-a;}int main(){//freopen("in.txt","r",stdin);//freopen("out.txt","w",stdout);//ios::sync_with_stdio(0);//cin.tie(0);int a,b;a = read(), b = read();if(a==0 && b==0) { puts("No"); return 0; }if(Abs(a,b)>=2) puts("No"); else puts("Yes");return 0;}
0 0
- CF761 A. Dasha and Stairs (水题)
- CF761 B. Dasha and friends(水题)
- A. Dasha and Stairs
- CF761 C. Dasha and Password (DP)
- CodeForces 761A Dasha and Stairs【水题】
- CodeForces-761A-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 753 A. Dasha and Stairs
- 【codeforces 761A】Dasha and Stairs
- Codeforces-Round 394#A-Dasha and Stairs
- Codeforces 761A-Dasha and Stairs
- poj 761A Dasha and Stairs
- Codeforcrs 761 A Dasha and Stairs
- codeforces 761A Dasha and Stairs
- Codeforces761A. Dasha and Stairs
- Codeforces761A Dasha and Stairs
- Dasha and Stairs
- 基于阿里开源yugong工具类,动态编译Java源文件
- Maven学习记录(三)--实战引入Spring支持
- 35、二进制转换
- Maven学习记录(四)--多模块开发配置
- 历届试题 分糖果
- CF761 A. Dasha and Stairs (水题)
- this/super比较
- LEETCODE--Sum of Two Integers
- 使用arm-2008q3-72-arm-none-linux-gnueabi-i686-pc-linux-gnu交叉编译成功在板子上运行
- opencv光流Optical Flow
- Codeforces Round #394 (Div. 2) D. Dasha and Very Difficult Problem
- CF761 B. Dasha and friends(水题)
- myeclipse下复制目录不包含svn目录
- 下一代 Web 应用模型 —— Progressive Web App