C/Visual C - ayuda con el programa josephus

#include <stdio.h>

#include <stdlib.h>

#define N 5

#define M 0

struct cel {

	int info;

	struct cel *prox;

};

typedef struct cel Celula;

void insere (int, Celula **);

void mostra_vencedor (Celula *);

void josephus (Celula **);

void encontra (Celula **p);

void elimina (Celula **p);

int main () {

	int cont;

	Celula *pessoa = NULL;

	printf("%d pessoas.\n", N);

	printf("%d passes.\n", M);

	for (cont = 1; cont <= N; ++cont)

		insere (cont, &pessoa);

	josephus (&pessoa);

	mostra_vencedor (pessoa);

	return EXIT_SUCCESS;

}

void insere (int num, Celula **p) {

	Celula *nova;

	nova = (Celula *) malloc (sizeof (Celula));

	nova->info = num;

	if (*p == NULL) {

		*p = nova;

		(**p).prox = *p;

	}

	else {

		Celula *temp = *p;

		while ((**p).prox != temp) {

			*p = (**p).prox;

		}

		(**p).prox = nova;

		nova->prox = temp;

		*p = temp;

	}

}

void josephus (Celula **p) {

	if (*p != NULL) {

		while (*p != (**p).prox) {

			encontra (p);

			elimina (p);

		}

	}

}

void encontra (Celula **p) {

	int cont = M;

	while (cont) {

		*p = (**p).prox;

		cont--;

	}

}

void elimina (Celula **p) {

	Celula *morta = *p;

	while ((**p).prox !=	morta) {

		*p = (**p).prox;

	}

	(**p).prox = (**p).prox->prox;

	*p = (**p).prox;

	free(morta);

}

void mostra_vencedor (Celula *p) {

	if (p != NULL)

		printf ("vencedor : %d\n", p->info);

}

#include <iostream>

#include <iomanip>

#include <cstring>

using namespace std;

struct node	{

int position;

node * next;

node * prev;

};

class circularll {

public:

void create (int, int);

void run (int, int, int);

node * head;

node * tail;

private:

};

void circularll::create (int people, int startPos) {

int x, y = 1;

head = tail = NULL;

for (x = startPos; x < (people + startPos); x++) {

if (x == startPos) {

node * temp = new node;

temp -> prev = NULL;

temp -> next = NULL;

temp -> position = x;

head = tail = temp;

}

else {

node * temp = new node;

node * curr = head = tail;

while(curr -> next != NULL) {

curr = curr -> next;

}

if (x > people) {

temp -> position = y;

temp -> next = NULL;

temp -> prev = curr;

curr -> next = temp;

}

else {

temp -> position = x;

temp -> next = NULL;

temp -> prev = curr;

curr -> next = temp;

}

}

y++;

}

node * end = head = tail;

while (end -> next != NULL) {

end = end -> next;

}

end -> next = head = tail;

head -> prev = end;

tail -> prev = end;

}

void circularll::run (int people, int passBy, int startPos) {

int x, i;

node * curr = head = tail;

for (x = 1; x < people; x++) {

for (i = 1; i <= passBy; i++) {

curr = curr -> next;

}

node * out = curr;

node * before = curr -> prev;

node * after = curr -> next;

cout << "La persona que estaba sentada en el asiento" << out -> position << " fue asesinado." << endl;

before -> next = after;

after -> prev = before;

curr = after;

delete out;

}

cout << endl;

cout << "Josephus estaba sentado en el asiento: " << curr -> position << endl << endl;

}

int main() {

int people, passBy, startPos;

menu: // start of menu

cout << "¿Cuántas personas hay? (Máximo de 50) ";

cin >> people;

if (people > 50) {

cout << "entrada no válida" << endl;

goto menu; // returns you to the beginning of the menu

}

cout << endl << endl;

cout << "¿Qué posición le gustaría empezar? " ;

cin >> startPos;

cout << endl << endl;

cout << "¿Cuánta gente quiere saltar cada ronda? ";

cin >> passBy;

cout << endl << endl;

circularll josephus;

josephus.create (people, startPos);

josephus.run (people, passBy, startPos);

cin >> people;

return 0;

}