408003: GYM102961 Q Josephus Problem II
Memory Limit：256 MB
Time Limit：0 S
Judge Style：Text Compare
Creator：
Submit：0
Solved：0
Description
Q. Josephus Problem IItime limit per test2.0 smemory limit per test256 megabytesinputstandard inputoutputstandard output
Consider a game where there are $$$n$$$ children (numbered $$$1,2,\dots,n$$$) in a circle. During the game, repeatedly $$$k$$$ children are skipped and one child is removed from the circle. In which order will the children be removed?
InputThe only input line has two integers $$$n$$$ and $$$k$$$.
Constraints:
- $$$1 \le n \le 2\cdot 10^5$$$
- $$$1 \le k \le 10^9$$$
Print $$$n$$$ integers: the removal order.
ExampleInput7 2Output
3 6 2 7 5 1 4