『算法-ACM竞赛-CodeForces』 1058A. In Search of an Easy Proble

『算法-ACM 竞赛-CodeForces』 1058A. In Search of an Easy Proble


这题,全零是 esay 有 1 是 hard,真难呀。

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,i,x,flag=0;
cin>>n;
for(int i=1;i<=n;i++)
{
cin>>x;
if(x==1)
flag=1;
}
if(flag)
cout<<"HARD";
else cout<<"EASY";
return 0;
}
CPP

『算法-ACM竞赛-CodeForces』 1058A. In Search of an Easy Proble
https://chiamzhang.github.io/2024/06/29/『算法-ACM竞赛-CodeForces』 1058A. In Search of an Easy Problem/
Author
Chiam
Posted on
June 29, 2024
Licensed under
Powered By Valine
v1.5.1