1. 程式人生 > >Codeforces Round #512(Technocup 2019 Elimination Round 1) A. In Search of an Easy (Codeforces 1030A)

Codeforces Round #512(Technocup 2019 Elimination Round 1) A. In Search of an Easy (Codeforces 1030A)

題意:給出一個01串,如果全0則輸出EASY,否則輸出HARD。

思路:入門題……迴圈下就好

程式碼:

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

#define ll long long
#define inf (1<<30)
#define read(x) scanf("%d",&x)
#define maxn 200000

int n;
int a[maxn+5];

bool readin() {
	read(n);
	for(int i=1; i<=n; i++) {
		read(a[i]);
		if(a[i]
) return true; } return false; } int main() { int ans=readin(); if(ans) printf("HARD"); else printf("EASY"); return 0; }