AcWing 3654. 容易的题
原题链接
简单
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int,int>;
const int N = 1e6+10;
int t,n,m,k,l,r,op,x,y;
int f[N];
string str;
const string st = "EASY";
void solve(){
while(cin>>str){
m = 0;
for(char ch:str){
if(ch==st[m]){
m++;
}
if(m==(int)st.size()){
break;
}
}
if(m==(int)st.size()){
cout<<"easy";
}else{
cout<<"difficult";
}
cout<<"\n";
}
}
int main(){
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
solve();
return 0;
}