Codeforces #512 (Div. 2)A In Search of an Easy P

#include<stdio.h>
#include<stdlib.h>
#include<math.h>
#include<string.h>
#define LL long long

int main()
{
    int n, t, judge = 0;
    scanf("%d", &n);
    for(int i = 0; i < n; i++){
        scanf("%d", &t);
        judge += t;
    }
    if(judge == 0){
        printf("EASY\n");
    }
    else{
        printf("HARD\n");
    }
  	return 0;
}

思路
题意是只要出现一个1，就输出HARD，所以用一个judge统计输入数的和，若超过0，则为HARD。