Algorithm/0710_Josephus2.py at master · junha6316/Algorithm · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
# import sys
# import queue
# N, k = map(int, sys.stdin.readline().split())
# answer=queue.Queue()
# arr=[]
# for i in range(N):
#     answer.put(i+1)
#
#
# while(answer.empty()== False):
#     for i in range(k-1):
#         answer.put(answer.get())
# #
# #     arr.append(str(answer.get()))
# #
# #
# # print(f"<{', '.join(arr)}>")
#
# # if k ==1:
# #     answer = arr
# # else:
# #     while(len(arr) > 0):
# #         for i in range(k-1):
# #             arr=  arr+[arr.pop(0)]
# #         answer.append(str(arr.pop(0)))
# #
# # print(f"<{', '.join(answer)}>")
#
# import sys
# import queue
#
# N, k = map(int, sys.stdin.readline().split())
# answer = queue.Queue()
# arr = []
# for i in range(N):
#     answer.put(i + 1)
#
# while (answer.empty() == False):
#     for i in range(k - 1):
#         a=answer.get()
#         answer.put(a)
#
#     arr.append(str(answer.get()))
#
# answer ='<' + ', '.join(arr) +'>'
# print(answer)
#
# from collections import deque
#
# def solution(N,k):
#     per =deque()
#     i=0
#     for i in range(1,N+1): per.append(i)
#     result='<'
#     while(len(per) !=0):
#         for i in range(k):
#             if i == k-1: result += str(per.popleft()) +', '
#             else:per.append(per.popleft())
#
#     return result[:-2] +'>'
#
# N, k = map(int, input().split())
# print(solution(N,k))

import sys
class SegTree:
    def __init__(self, n):
        size = 1
        while size < n: size <<= 1 #2의 제곱수로 증
        self.arr = [0] * (size * 2);
        self.size = size

    def construct(self, L):
        for i in range(len(L)):
            self.arr[self.size + i] = L[i]
        for i in range(self.size - 1, -1, -1):
            self.arr[i] = self.arr[2 * i] + self.arr[2 * i + 1]

    def update(self, i, val):
        i += self.size;
        self.arr[i] = val
        while i > 1: i //= 2; self.arr[i] = self.arr[i * 2] + self.arr[i * 2 + 1]

    def __getitem__(self, i):
        return self._kth(i, 1)

    def _kth(self, k, node=1):
        if node >= self.size: return node - self.size
        if k >= self.arr[node]: raise IndexError
        if k < self.arr[2 * node]: return self._kth(k, 2 * node)
        return self._kth(k - self.arr[2 * node], 2 * node + 1)

#
# n, m = map(int, input().split())
# game = SegTree(n)
# print(game.arr)
# game.construct([1] * n)
# print(game.arr)
# i = 0
# res = []
# for s in range(n, 0, -1):
#     i = (i + m - 1) % s
#     dead = game[i]
#     game.update(dead, 0)
#     res.append(dead + 1)
# print("<" + ", ".join(map(str, res)) + ">")


#
# from collections import deque
#
# def solution(N,k):
#     per =deque()
#     i=0
#     for i in range(1,N+1): per.append(i)
#     result='<'
#     while(len(per) !=0):
#         for i in range(k):
#             if i == k-1: result += str(per.popleft()) +', '
#             else:per.append(per.popleft())
#
#     return result[:-2] +'>'
#
# N, k = map(int, input().split())
# print(solution(N,k))


import sys

N, K = map(int, sys.stdin.readline().split())
circular_list = [i + 1 for i in range(N)]
answer = []
popNum = 0
answer = '<'
while len(circular_list) > 0:
    popNum = (popNum + (K - 1)) % len(circular_list)
    print(popNum)
    answer += str(circular_list.pop(popNum)) + ', '

print(answer[:-2] + '>')