【Educational Codeforces Round 35 C】Two Cakes
2017-12-29 11:17
309 查看
【链接】 我是链接,点我呀:)
【题意】
在这里输入题意
【题解】
直觉题。
感觉情况会很少。
毕竟间隔太大了。中间肯定有一些数字达不到。
有1肯定可以
2 2 x肯定可以
3 3 3也可以
2 4 4也可以。
就这样
【代码】
#include <bits/stdc++.h> using namespace std; vector <int> v; int main(){ #ifdef LOCAL_DEFINE freopen("rush_in.txt", "r", stdin); #endif ios::sync_with_stdio(0),cin.tie(0); v.resize(3); cin >> v[0] >> v[1] >> v[2]; sort(v.begin(),v.end()); if (v[0]==v[1] && v[0]==2){ cout <<"YES"<<endl; }else if (v[0]==1){ cout <<"YES"<<endl; }else if (v[0]==v[1] && v[1]==v[2] && v[0]==3){ cout <<"YES"<<endl; }else if (v[0]==2 && v[1]==4 && v[2]==4) cout <<"YES"<<endl;else cout <<"NO"<<endl; return 0; }
相关文章推荐
- 【Educational Codeforces Round 35 B】Two Cakes
- Educational Codeforces Round 35 (Rated for Div. 2) F. Tree Destruction
- Educational Codeforces Round 35 (Rated for Div. 2) - (A,B,C,D)
- Educational Codeforces Round 35 Stack Sorting
- Educational Codeforces Round 35 Div.2 A. Nearest Minimums
- 【Educational Codeforces Round 35 D】Inversion Counting
- Educational Codeforces Round 35 (Rated for Div. 2) F. Tree Destruction(dfs)
- Educational Codeforces Round 35
- Educational Codeforces Round 35 (Rated for Div. 2) A B C D
- Educational Codeforces Round 35 (Rated for Div. 2) A——C
- Educational Codeforces Round 35
- Educational Codeforces Round 35 (Rated for Div. 2) A-D
- Educational Codeforces Round 35 A - Nearest Minimums
- Educational Codeforces Round 35 A B C D题解
- Educational Codeforces Round 35 (Rated for Div. 2) D. Inversion Counting
- Educational Codeforces Round 35 (Rated for Div. 2) A
- Educational Codeforces Round 35 C - Three Garlands
- Educational Codeforces Round 35 (Rated for Div. 2) E Stack Sorting
- Educational Codeforces Round 35 (Rated for Div.2)
- Educational Codeforces Round 35 (Rated for Div. 2)