单链表

#include<bits/stdc++.h>
using namespace std;

struct node
{
	int data;  //数据域
	node *next;  
};
int n, k;
int main(){
    cin >> n >> k;
    node *head, *r, *p;
    head = new node();
    head->next = NULL;
    r = head;
    for(int i=1; i<=n; i++){
    	p = new node();
    	p->data = i;
    	p->next = NULL;
    	r->next = p;
    	r = p;
    }
    r->next = head->next;
    p = head;
    for(int i=1; i<=n-1; i++){
    	for(int j=1; j<=k-1; j++) p = p->next;
    	cout << p->next->data << " ";
    	p->next = p->next->next;
    }
    cout << p->data;
    return 0;
}