Educational Codeforces Round 35 C - Three Garlands

最新推荐文章于 2022-07-24 20:49:14 发布

Joey丶sunk

最新推荐文章于 2022-07-24 20:49:14 发布

阅读量482

点赞数 1

分类专栏： codefoces

本文链接：https://blog.csdn.net/xiang_6/article/details/79129818

版权

codefoces 专栏收录该内容

178 篇文章 1 订阅

订阅专栏

#include<iostream>
#include<algorithm>
#include<iomanip>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<string>
#include<cmath>
#include<set>
#include<queue>
#include<stack>
#include<map>
#define PI acos(-1.0)
#define in freopen("in.txt", "r", stdin)
#define out freopen("out.txt", "w", stdout)
#define kuaidian ios::sync_with_stdio(0);

using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int maxn = 1e5 + 7, maxd = 1e5 + 7;
const ll mod = 1e9 + 7;
const int INF = 0x7f7f7f7f;

int a, b, c;
int vis[1555] = {0};

int main() {

    kuaidian;
    cin >> a >> b >> c;
    vis[a]++;
    vis[b]++;
    vis[c]++;

    if(vis[1] > 0) {
        cout << "YES" << endl;
    }
    else if(vis[2] >= 2 || (vis[2] > 0 && vis[4] >= 2)) {
        cout << "YES" << endl;
    }
    else if(vis[3] >= 3) {
        cout << "YES" << endl;
    }
    else cout << "NO" << endl;

    return 0;
}