Problem 1030A In Search of an Easy Problem (Codeforces 800)

协调者在准备比赛时尽力让第一个问题尽可能简单。如果询问的n个人中有至少一个人认为问题困难,就会更换问题。输入n(1≤n≤100)和n个0或1的整数,表示每个人的意见。如果所有人的回答都是0,则输出"EASY",否则输出"HARD"。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

In Search of an Easy Problem

When preparing a tournament, Codeforces coordinators try treir best to make the first problem as easy as possible. This time the coordinator had chosen some problem and asked nnn people about their opinions. Each person answered whether this problem is easy or hard.

If at least one of these nnn people has answered that the problem is hard, the coordinator decides to change the problem. For the given responses, check if the problem is easy enough.

Input

The first line contains a single integer nnn (1≤n≤1001≤n≤1001n100) — the number of people who were asked to give their opinions.

The second line contains nnn integers, each integer is either 000 or 111. If iii-th integer is 000, then iii-th person thinks that the problem is easy; if it is 111, then iii-th person thinks that the problem is hard.

Output

Print one word: “EASY” if the problem is easy according to all responses, or “HARD” if there is at least one person who thinks the problem is hard.

You may print every letter in any register: “EASY”, “easy”, “EaSY” and “eAsY” all will be processed correctly.

Examples

input
3
0 0 1
output
HARD
input
1
0
output
EASY

Simplified Question 题目大意

输入若干数字, 全部是000输出EASY, 有一个111就输出HARD.

Accepted Answer AC 代码

#include <bits/stdc++.h>
using namespace std;

int main(){
	int n, a; cin>>n;
	while (n--){
		cin>>a;
		if (a==1){
			cout<<"Hard"; return 0; //这里要return 0 结束程序
		}
	}
	cout<<"Easy";
	return 0;
}

AC 证明

在这里插入图片描述

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值