Codeforces Round #512 (Div 2) - A. In Search of an Easy Problem

http://codeforces.com/contest/1058/problem/A

1. 문제

단 한명이라도 문제가 어렵다는 사람이 있으면 HARD 를 출력 하는 문제

2. 알고리즘

키워드 - 구현

3. 코드

#include <iostream>
#include <sstream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <stack>
#include <math.h>
#include <memory.h>
using namespace std;
 
#define MAX_SIZE 100
#define INF 0x7fffffff
#define CENDL "\n"
#define ll long long
 
#define c_reverse(s) reverse(s.begin(), s.end())
#define c_sort(s) sort(s.begin(), s.end())
 
#define print_vector(v) for(int i=0; i<v.size(); i++) cout << v[i];
 
 
int main() {
 
    cin.tie(0);
    std::ios::sync_with_stdio(false);
 
    int n; cin >> n;
 
    bool check = false;
    for (int i = 0; i < n; i++) {
        int d; cin >> d;
        if (d == 1) {
            check = true;
            break;
        }
    }
 
    if (check) {
        cout << "HARD" << endl;
    }
    else {
        cout << "EASY" << endl;
    }
    return 0;
}