题目1188:约瑟夫环
import java.io.BufferedReader;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;
import java.util.StringTokenizer;
public class Main {
public static void main(String[] args) {
new Task().solve() ;
}
}
class Task{
InputReader in = new InputReader(System.in) ;
PrintWriter out = new PrintWriter(System.out) ;
class Node{
int val ;
Node next ;
Node(int val){
this.val = val ;
next = null ;
}
}
Node build(int n){
Node head = new Node(1) ;
Node now = head ;
for(int i = 2 ; i <= n ; i++){
Node node = new Node(i) ;
now.next = node ;
now = now.next ;
}
now.next = head ;
return head ;
}
Node remove(Node head , int k , List<Integer>res){
Node now = head ;
Node pre = now ;
for(int i = 2 ; i <= k ; i++){
pre = now ;
now = now.next ;
}
res.add(now.val) ;
pre.next = now.next ;
return now.next ;
}
void solve(){
while(in.hasNext()){
int n = in.nextInt() ;
int k = in.nextInt() ;
Node node = build(n) ;
List<Integer> res = new ArrayList<Integer>() ;
for(int i = 0 ; i < n ; i++){
node = remove(node, k , res) ;
}
for(int i = 0 ; i < n ; i++){
out.print((i > 0 ? " " : "") + res.get(i)) ;
}
out.println();
out.flush();
}
out.flush();
}
}
class InputReader {
public BufferedReader reader;
public StringTokenizer tokenizer;
public InputReader(InputStream stream) {
reader = new BufferedReader(new InputStreamReader(stream), 32768);
tokenizer = new StringTokenizer("");
}
private void eat(String s) {
tokenizer = new StringTokenizer(s);
}
public String nextLine() {
try {
return reader.readLine();
} catch (Exception e) {
return null;
}
}
public boolean hasNext() {
while (!tokenizer.hasMoreTokens()) {
String s = nextLine();
if (s == null)
return false;
eat(s);
}
return true;
}
public String next() {
hasNext();
return tokenizer.nextToken();
}
public int nextInt() {
return Integer.parseInt(next());
}
public long nextLong() {
return Long.parseLong(next());
}
public double nextDouble() {
return Double.parseDouble(next());
}
public BigInteger nextBigInteger() {
return new BigInteger(next());
}
}