[백준] 1592번_영식이와친구들

문제 링크 : https://www.acmicpc.net/problem/1592

1592번: 영식이와 친구들

n,m,l = map(int,input().split())

people = {}
for i in range(1,n+1):
    people[i] = 0

cnt = 0
p = people[1] = 1
while people[p]!=m:
    # 홀수
    if people[p]%2!=0:
        p = n if (p+l)%n == 0 else (p+l)%n
    # 짝수
    else:
        p = (p-l)
        if p<=0:
            p += n

    people[p] += 1
    cnt+=1
print(cnt)

처음에 딕셔너리를 이용해 풀었는데 리스트로 푼게 더 깔끔한 것 같다.

n,m,l = map(int,input().split())
people = [0 for _ in range(n)]

cnt = 0
p = 0
while True:
    people[p] += 1
    if people[p] == m:
        print(cnt)
        break
    elif people[p]%2!=0:
        p = (p+l)%n
    else:
        p = (p+n-l) % n
    cnt += 1