dnmc_21_new

#include <iostream>
#include <stdio.h>

using namespace std;

struct list{
    int inf;
    list* next;
    list* prev;
};

void init(list *&h, list *&t){
    h = t = NULL;
}

void print(list *&h, list *&t){
    list* p = h;
    while(p){
        cout << p->inf << " ";
        p = p->next;
    }
}

void add_back(list *&h, list *&t, int x){
    list* p = new list;
    p->next = h;
    p->inf = x;
    if(!h){
        p->prev = p;
        p->next = p;
        h = t = p;
    }
    else{
        t->next = p;
        p->prev = t;
        t = p;
        h->prev = t;
    }
}

void erase(list *&h, list *&t, list *&r){
    if(r == h && r == t)
        h = t = NULL;
     else if(r == h){
            h = h->next;
            t->next = h;
            h->prev = t;
        }
        else if(r == t){
            t = t->prev;
            t->next = h;
            h->prev = t;
        }
        else{
            (r->prev)->next = r->next;
            (r->next)->prev = r->prev;
        }
    delete r;
}
//release the Iosif's task
int main()
{
#ifdef _DEBUG
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif
    printf("Enter the number of elements and value of K, then array of numbers\n");
    int n, k; scanf("%d%d", &n, &k);
    list *h, *t;
    init(h, t);
    for(int i = 0; i < n; i++){
        int cur; scanf("%d", &cur);
        add_back(h, t, cur);
    }
    list *p = t;

    for(int i = 0; i < n-1; i++){
        for(int i = 0; i < k; i++)
          p = p->next;
        list* aux = p;
        p = p->prev;
        erase(h, t, aux);
    }

    printf("Here is answer: %d\n", p->inf);

    return 0;
}