Josephu问题的解决
Josephu
C++代码
|
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
|
#include
void
main()
{
int
Josephu[1000],m,n,i,j=0,c1=0,c2=1,t;
printf
(
"请输入总人数n:"
);
scanf
(
"%d"
,&n);
printf
(
"请输入m:"
);
scanf
(
"%d"
,&m);
t=n;
for
(i=0;i
{
Josephu[i]=i+1;
}
while
(c1
{
if
((c2)%m==0)
{
printf
(
"%dt"
,Josephu[j]);
c1++;
n=n-1;
for
(i=j;i
{
if
(Josephu[i+1]!=0)
Josephu[i]=Josephu[i+1];
}
j=j-1;
}
c2++;
j++;
if
(j==n)
j=0;
}
}
******************************************************************************************
#include
void
main()
{
int
AR[30],m,n;
int
i,j=0;
int
c1=0,c2=1,t;
printf
(
"请输入总人数n:"
);
scanf
(
"%d"
,&n);
printf
(
"请输入m:"
);
scanf
(
"%d"
,&m);
t=n;
for
(i=0;i
while
(c1
{
if
((c2)%m==0)
{
printf
(
"%d\t"
,AR[j]);
//print out
c1++;
n=n-1;
for
(i=j;i
{
if
(AR[i+1]!=0)
AR[i]=AR[i+1];
//if the next is not null,the delete the called one
}
j=j-1;
//cause there is one number ruled out
}
c2++;
//signifying the total number
j++;
if
(j==n)
//when the circle ends(8), come to zero
j=0;
}
}
************************************************************************************
#include
#include
struct
Link
// the struct with a point
{
int
num;
struct
Link *next;
};
void
main()
{
int
i=1;
int
m,n;
int
count=1;
struct
Link *head,*s,*t;
// three points
head=(
struct
Link *)
malloc
(
sizeof
(
struct
Link));
//the room setting of the heading point
head->num=1;
head->next=NULL;
//initializing
printf
(
"请输入总人数n:"
);
//the testing number input
scanf
(
"%d"
,&n);
printf
(
"请输入循环数m:"
);
scanf
(
"%d"
,&m);
t=head;
while
(i
{
s=(
struct
Link*)
malloc
(
sizeof
(
struct
Link));
s->num=i+1;
//this three steps is common
t->next=s;
t=s;
i++;
}
t->next=head;
//to create a cycling linklist
t=head;
while
(t!=NULL)
{
if
(count%m==0)
{
printf
(
"%d\t"
,t->num);
//output of the called one
if
(t->next!=t)
{
s->next=t->next;
//to delete the knot t
t=t->next;
count+=1;
}
else
t=NULL;
}
else
//count is used to simplify the total number
{
s=t;
t=t->next;
count++;
}
}
}
|