BOJ / 1158번 / 요세푸스 문제 [Go][Python3]

👩🏻‍💻 문제

1158번: 요세푸스 문제

---

✍🏻 풀이

🎨 Go

// https://www.acmicpc.net/problem/1158
package main

import (
	"bufio"
	"fmt"
	"os"
)

func main() {
	reader := bufio.NewReader(os.Stdin)
	writer := bufio.NewWriter(os.Stdout)
	defer writer.Flush()

	var n, k int
	fmt.Fscanln(reader, &n, &k)

	result := Josephus(n, k)
	for i := 0; i < len(result); i++ {
		if i == 0 {
			fmt.Fprintf(writer, "<%d", result[i])
		} else {
			fmt.Fprintf(writer, ", %d", result[i])
		}
	}
	fmt.Fprintln(writer, ">")
}

func Josephus(n, k int) (result []int) {
	queue := []int{}
	for i := 1; i <= n; i++ {
		queue = append(queue, i)
	}

	index := 0
	for len(queue) > 0 {
		index = (index + k - 1) % len(queue)
		result = append(result, queue[index])
		queue = append(queue[:index], queue[index+1:]...)
	}
	return result
}

🎨 Python3

# https://www.acmicpc.net/problem/1158
import sys

def josephus(n, k):
    queue = [i for i in range(1, n+1)]
    index = 0
    result = []
    while len(queue) > 0:
        index = (index + k-1) % len(queue)
        result.append(queue[index])
        queue.pop(index)
    return result

if __name__ == "__main__":
    n, k = list(map(int, sys.stdin.readline().split()))
    result = josephus(n, k)
    for i in range(len(result)):
        if i == 0:
            print("<{}".format(result[i]), end='')
        else:
            print(", {}".format(result[i]), end='')
    print(">")