Tag: josephus

用链表解决约瑟夫斯

我已经尝试了一段时间，但是我无法弄清楚如何使下面的程序将N作为输入并生成一个M，以便最后一个死亡的士兵是第13个（N> 13）; int main() { int N, M; struct node { int player_id; struct node *next; }; struct node *p, *q; int i, count; printf(“Enter N (number of players): “); scanf(“%d”, &N); printf(“Enter M (every M-th payer gets eliminated): “); scanf(“%d”, &M); // Create circular linked list containing all the players: p = q = […]