제출 #1007828

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1007828		vjudge1	Magnus (COCI18_magnus)	Cpython 3	25 / 50	57 ms	65536 KiB

magnus

import sys
sys.setrecursionlimit(10 ** 9)

def switch(current):
    if current == 'H':
        return 'O'
    elif current == 'O':
        return 'N'
    elif current == 'N':
        return 'I'
    elif current == 'I':
        return 'H'

def solve(start, s, current):
    if start >= len(s):
        return 0
    
    if s[start] == current and current == 'I':
        return 1 + solve(start + 1, s, switch(current))
    elif s[start] == current:
        return solve(start + 1, s, switch(current))
    else:
        return solve(start + 1, s, current)
    
s = input()
print(solve(0, s, 'H'))

• Subtask 1: 5 / 5
• Subtask 2: 5 / 5
• Subtask 3: 5 / 5
• Subtask 4: 5 / 5
• Subtask 5: 5 / 5
• Subtask 6: 0 / 5
• Subtask 7: 0 / 5
• Subtask 8: 0 / 5
• Subtask 9: 0 / 5
• Subtask 10: 0 / 5