?? 約瑟夫環(huán).cpp
字號:
#include<stdlib.h>
#include<iostream.h>
typedef struct LNode
{
int num,pwd;
struct LNode *next;
}LNode, *LinkList;
void main()
{
int j,i,m,n,pass;
cout << "請輸入報數(shù)的上限: ";
cin >> m;
cout << "請輸入人數(shù): ";
cin >> n;
LinkList head,p,pt;
cout << "請輸入" << n << "個人的密碼:";
head = (LinkList)malloc(sizeof(LNode));
p = head;
cin >> pass;
p->num = 1;
p->pwd = pass;
for(i=2;i<=n;i++){
pt = (LinkList)malloc(sizeof(LNode));
p->next = pt;
p = pt;
cin >> pass;
p->num = i;
p->pwd = pass;
}
pt->next = head;
cout << "出列順序為: ";
for(i=1;i<=n;i++)
{
for(j=1;j<m;j++)
{
p = p->next;
}
pt = p->next;
m = pt->pwd;
if (i == n)
cout << pt->num << "." << endl;
else
cout << pt->num << ", ";
p->next = pt->next;
free(pt);
pt = p;
}
}
?? 快捷鍵說明
復(fù)制代碼
Ctrl + C
搜索代碼
Ctrl + F
全屏模式
F11
切換主題
Ctrl + Shift + D
顯示快捷鍵
?
增大字號
Ctrl + =
減小字號
Ctrl + -