제출 #1007971

#제출 시각아이디문제언어결과실행 시간메모리
1007971vjudge1Magnus (COCI18_magnus)Cpython 3
20 / 50
26 ms3164 KiB
def HONI(n): x,Honi=0,[] for c in n: if c not in Honi and c in ["H","O","N","I"]: Honi.append(c) if len(Honi)==4: x+=1 Honi.clear() return x inp=input() print(HONI(inp))
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...