1 public class josephus { private static class node { int val; node next; } public static void...
TRANSCRIPT
![Page 1: 1 public class Josephus { private static class Node { int val; Node next; } public static void main(String[] args) { int M = Integer.parseInt(args[0]);](https://reader030.vdocument.in/reader030/viewer/2022031601/56649d8b5503460f94a7192b/html5/page/1.jpg)
1
public class Josephus { private static class Node { int val; Node next; }
public static void main(String[] args) { int M = Integer.parseInt(args[0]); int N = Integer.parseInt(args[1]);
Node head = new Node(); head.val = 1; head.next = head; Node tail = head;
for (int i = 2; i <= N; i++) { Node x = new Node(); x.val = i; x.next = head; tail.next = x; tail = x; }
Josephus Problem: Build the Circular Linked List
0
null
head
![Page 2: 1 public class Josephus { private static class Node { int val; Node next; } public static void main(String[] args) { int M = Integer.parseInt(args[0]);](https://reader030.vdocument.in/reader030/viewer/2022031601/56649d8b5503460f94a7192b/html5/page/2.jpg)
2
public class Josephus { private static class Node { int val; Node next; }
public static void main(String[] args) { int M = Integer.parseInt(args[0]); int N = Integer.parseInt(args[1]);
Node head = new Node(); head.val = 1; head.next = head; Node tail = head;
for (int i = 2; i <= N; i++) { Node x = new Node(); x.val = i; x.next = head; tail.next = x; tail = x; }
Josephus Problem: Build the Circular Linked List
1
null
head
![Page 3: 1 public class Josephus { private static class Node { int val; Node next; } public static void main(String[] args) { int M = Integer.parseInt(args[0]);](https://reader030.vdocument.in/reader030/viewer/2022031601/56649d8b5503460f94a7192b/html5/page/3.jpg)
3
public class Josephus { private static class Node { int val; Node next; }
public static void main(String[] args) { int M = Integer.parseInt(args[0]); int N = Integer.parseInt(args[1]);
Node head = new Node(); head.val = 1; head.next = head; Node tail = head;
for (int i = 2; i <= N; i++) { Node x = new Node(); x.val = i; x.next = head; tail.next = x; tail = x; }
Josephus Problem: Build the Circular Linked List
1
head
![Page 4: 1 public class Josephus { private static class Node { int val; Node next; } public static void main(String[] args) { int M = Integer.parseInt(args[0]);](https://reader030.vdocument.in/reader030/viewer/2022031601/56649d8b5503460f94a7192b/html5/page/4.jpg)
4
Josephus Problem: Build the Circular Linked List
1
head
tail
public class Josephus { private static class Node { int val; Node next; }
public static void main(String[] args) { int M = Integer.parseInt(args[0]); int N = Integer.parseInt(args[1]);
Node head = new Node(); head.val = 1; head.next = head; Node tail = head;
for (int i = 2; i <= N; i++) { Node x = new Node(); x.val = i; x.next = head; tail.next = x; tail = x; }
![Page 5: 1 public class Josephus { private static class Node { int val; Node next; } public static void main(String[] args) { int M = Integer.parseInt(args[0]);](https://reader030.vdocument.in/reader030/viewer/2022031601/56649d8b5503460f94a7192b/html5/page/5.jpg)
5
public class Josephus { private static class Node { int val; Node next; }
public static void main(String[] args) { int M = Integer.parseInt(args[0]); int N = Integer.parseInt(args[1]);
Node head = new Node(); head.val = 1; head.next = head; Node tail = head;
for (int i = 2; i <= N; i++) { Node x = new Node(); x.val = i; x.next = head; tail.next = x; tail = x; }
Josephus Problem: Build the Circular Linked List
1
head
tail
![Page 6: 1 public class Josephus { private static class Node { int val; Node next; } public static void main(String[] args) { int M = Integer.parseInt(args[0]);](https://reader030.vdocument.in/reader030/viewer/2022031601/56649d8b5503460f94a7192b/html5/page/6.jpg)
6
public class Josephus { private static class Node { int val; Node next; }
public static void main(String[] args) { int M = Integer.parseInt(args[0]); int N = Integer.parseInt(args[1]);
Node head = new Node(); head.val = 1; head.next = head; Node tail = head;
for (int i = 2; i <= N; i++) { Node x = new Node(); x.val = i; x.next = head; tail.next = x; tail = x; }
Josephus Problem: Build the Circular Linked List
1
head
tail
0null
x
![Page 7: 1 public class Josephus { private static class Node { int val; Node next; } public static void main(String[] args) { int M = Integer.parseInt(args[0]);](https://reader030.vdocument.in/reader030/viewer/2022031601/56649d8b5503460f94a7192b/html5/page/7.jpg)
7
public class Josephus { private static class Node { int val; Node next; }
public static void main(String[] args) { int M = Integer.parseInt(args[0]); int N = Integer.parseInt(args[1]);
Node head = new Node(); head.val = 1; head.next = head; Node tail = head;
for (int i = 2; i <= N; i++) { Node x = new Node(); x.val = i; x.next = head; tail.next = x; tail = x; }
Josephus Problem: Build the Circular Linked List
1
head
tail
2null
x
![Page 8: 1 public class Josephus { private static class Node { int val; Node next; } public static void main(String[] args) { int M = Integer.parseInt(args[0]);](https://reader030.vdocument.in/reader030/viewer/2022031601/56649d8b5503460f94a7192b/html5/page/8.jpg)
8
public class Josephus { private static class Node { int val; Node next; }
public static void main(String[] args) { int M = Integer.parseInt(args[0]); int N = Integer.parseInt(args[1]);
Node head = new Node(); head.val = 1; head.next = head; Node tail = head;
for (int i = 2; i <= N; i++) { Node x = new Node(); x.val = i; x.next = head; tail.next = x; tail = x; }
Josephus Problem: Build the Circular Linked List
1
head
tail
2
x
![Page 9: 1 public class Josephus { private static class Node { int val; Node next; } public static void main(String[] args) { int M = Integer.parseInt(args[0]);](https://reader030.vdocument.in/reader030/viewer/2022031601/56649d8b5503460f94a7192b/html5/page/9.jpg)
9
public class Josephus { private static class Node { int val; Node next; }
public static void main(String[] args) { int M = Integer.parseInt(args[0]); int N = Integer.parseInt(args[1]);
Node head = new Node(); head.val = 1; head.next = head; Node tail = head;
for (int i = 2; i <= N; i++) { Node x = new Node(); x.val = i; x.next = head; tail.next = x; tail = x; }
Josephus Problem: Build the Circular Linked List
1
head
tail
2
x
![Page 10: 1 public class Josephus { private static class Node { int val; Node next; } public static void main(String[] args) { int M = Integer.parseInt(args[0]);](https://reader030.vdocument.in/reader030/viewer/2022031601/56649d8b5503460f94a7192b/html5/page/10.jpg)
10
public class Josephus { private static class Node { int val; Node next; }
public static void main(String[] args) { int M = Integer.parseInt(args[0]); int N = Integer.parseInt(args[1]);
Node head = new Node(); head.val = 1; head.next = head; Node tail = head;
for (int i = 2; i <= N; i++) { Node x = new Node(); x.val = i; x.next = head; tail.next = x; tail = x; }
Josephus Problem: Build the Circular Linked List
1
head
tail
2
x
![Page 11: 1 public class Josephus { private static class Node { int val; Node next; } public static void main(String[] args) { int M = Integer.parseInt(args[0]);](https://reader030.vdocument.in/reader030/viewer/2022031601/56649d8b5503460f94a7192b/html5/page/11.jpg)
11
public class Josephus { private static class Node { int val; Node next; }
public static void main(String[] args) { int M = Integer.parseInt(args[0]); int N = Integer.parseInt(args[1]);
Node head = new Node(); head.val = 1; head.next = head; Node tail = head;
for (int i = 2; i <= N; i++) { Node x = new Node(); x.val = i; x.next = head; tail.next = x; tail = x; }
Josephus Problem: Build the Circular Linked List
1
head
tail
2
x
![Page 12: 1 public class Josephus { private static class Node { int val; Node next; } public static void main(String[] args) { int M = Integer.parseInt(args[0]);](https://reader030.vdocument.in/reader030/viewer/2022031601/56649d8b5503460f94a7192b/html5/page/12.jpg)
12
public class Josephus { private static class Node { int val; Node next; }
public static void main(String[] args) { int M = Integer.parseInt(args[0]); int N = Integer.parseInt(args[1]);
Node head = new Node(); head.val = 1; head.next = head; Node tail = head;
for (int i = 2; i <= N; i++) { Node x = new Node(); x.val = i; x.next = head; tail.next = x; tail = x; }
Josephus Problem: Build the Circular Linked List
1
head
tail
2
x
0
null
![Page 13: 1 public class Josephus { private static class Node { int val; Node next; } public static void main(String[] args) { int M = Integer.parseInt(args[0]);](https://reader030.vdocument.in/reader030/viewer/2022031601/56649d8b5503460f94a7192b/html5/page/13.jpg)
13
public class Josephus { private static class Node { int val; Node next; }
public static void main(String[] args) { int M = Integer.parseInt(args[0]); int N = Integer.parseInt(args[1]);
Node head = new Node(); head.val = 1; head.next = head; Node tail = head;
for (int i = 2; i <= N; i++) { Node x = new Node(); x.val = i; x.next = head; tail.next = x; tail = x; }
Josephus Problem: Build the Circular Linked List
1
head
tail
2
x
3
null
![Page 14: 1 public class Josephus { private static class Node { int val; Node next; } public static void main(String[] args) { int M = Integer.parseInt(args[0]);](https://reader030.vdocument.in/reader030/viewer/2022031601/56649d8b5503460f94a7192b/html5/page/14.jpg)
14
public class Josephus { private static class Node { int val; Node next; }
public static void main(String[] args) { int M = Integer.parseInt(args[0]); int N = Integer.parseInt(args[1]);
Node head = new Node(); head.val = 1; head.next = head; Node tail = head;
for (int i = 2; i <= N; i++) { Node x = new Node(); x.val = i; x.next = head; tail.next = x; tail = x; }
Josephus Problem: Build the Circular Linked List
1
head
tail
2
x
3
![Page 15: 1 public class Josephus { private static class Node { int val; Node next; } public static void main(String[] args) { int M = Integer.parseInt(args[0]);](https://reader030.vdocument.in/reader030/viewer/2022031601/56649d8b5503460f94a7192b/html5/page/15.jpg)
15
public class Josephus { private static class Node { int val; Node next; }
public static void main(String[] args) { int M = Integer.parseInt(args[0]); int N = Integer.parseInt(args[1]);
Node head = new Node(); head.val = 1; head.next = head; Node tail = head;
for (int i = 2; i <= N; i++) { Node x = new Node(); x.val = i; x.next = head; tail.next = x; tail = x; }
Josephus Problem: Build the Circular Linked List
1
head
tail
2
x
3
![Page 16: 1 public class Josephus { private static class Node { int val; Node next; } public static void main(String[] args) { int M = Integer.parseInt(args[0]);](https://reader030.vdocument.in/reader030/viewer/2022031601/56649d8b5503460f94a7192b/html5/page/16.jpg)
16
public class Josephus { private static class Node { int val; Node next; }
public static void main(String[] args) { int M = Integer.parseInt(args[0]); int N = Integer.parseInt(args[1]);
Node head = new Node(); head.val = 1; head.next = head; Node tail = head;
for (int i = 2; i <= N; i++) { Node x = new Node(); x.val = i; x.next = head; tail.next = x; tail = x; }
Josephus Problem: Build the Circular Linked List
1
head
tail
2
x
3
![Page 17: 1 public class Josephus { private static class Node { int val; Node next; } public static void main(String[] args) { int M = Integer.parseInt(args[0]);](https://reader030.vdocument.in/reader030/viewer/2022031601/56649d8b5503460f94a7192b/html5/page/17.jpg)
17
public class Josephus { private static class Node { int val; Node next; }
public static void main(String[] args) { int M = Integer.parseInt(args[0]); int N = Integer.parseInt(args[1]);
Node head = new Node(); head.val = 1; head.next = head; Node tail = head;
for (int i = 2; i <= N; i++) { Node x = new Node(); x.val = i; x.next = head; tail.next = x; tail = x; }
Josephus Problem: Build the Circular Linked List
1
head
tail
2
x
3
![Page 18: 1 public class Josephus { private static class Node { int val; Node next; } public static void main(String[] args) { int M = Integer.parseInt(args[0]);](https://reader030.vdocument.in/reader030/viewer/2022031601/56649d8b5503460f94a7192b/html5/page/18.jpg)
18
public class Josephus { private static class Node { int val; Node next; }
public static void main(String[] args) { int M = Integer.parseInt(args[0]); int N = Integer.parseInt(args[1]);
Node head = new Node(); head.val = 1; head.next = head; Node tail = head;
for (int i = 2; i <= N; i++) { Node x = new Node(); x.val = i; x.next = head; tail.next = x; tail = x; }
Josephus Problem: Build the Circular Linked List
1
head
tail
23
0
null
x
![Page 19: 1 public class Josephus { private static class Node { int val; Node next; } public static void main(String[] args) { int M = Integer.parseInt(args[0]);](https://reader030.vdocument.in/reader030/viewer/2022031601/56649d8b5503460f94a7192b/html5/page/19.jpg)
19
public class Josephus { private static class Node { int val; Node next; }
public static void main(String[] args) { int M = Integer.parseInt(args[0]); int N = Integer.parseInt(args[1]);
Node head = new Node(); head.val = 1; head.next = head; Node tail = head;
for (int i = 2; i <= N; i++) { Node x = new Node(); x.val = i; x.next = head; tail.next = x; tail = x; }
Josephus Problem: Build the Circular Linked List
1
head
tail
23
4
null
x
![Page 20: 1 public class Josephus { private static class Node { int val; Node next; } public static void main(String[] args) { int M = Integer.parseInt(args[0]);](https://reader030.vdocument.in/reader030/viewer/2022031601/56649d8b5503460f94a7192b/html5/page/20.jpg)
20
public class Josephus { private static class Node { int val; Node next; }
public static void main(String[] args) { int M = Integer.parseInt(args[0]); int N = Integer.parseInt(args[1]);
Node head = new Node(); head.val = 1; head.next = head; Node tail = head;
for (int i = 2; i <= N; i++) { Node x = new Node(); x.val = i; x.next = head; tail.next = x; tail = x; }
Josephus Problem: Build the Circular Linked List
1
head
tail
23
4
x
![Page 21: 1 public class Josephus { private static class Node { int val; Node next; } public static void main(String[] args) { int M = Integer.parseInt(args[0]);](https://reader030.vdocument.in/reader030/viewer/2022031601/56649d8b5503460f94a7192b/html5/page/21.jpg)
21
public class Josephus { private static class Node { int val; Node next; }
public static void main(String[] args) { int M = Integer.parseInt(args[0]); int N = Integer.parseInt(args[1]);
Node head = new Node(); head.val = 1; head.next = head; Node tail = head;
for (int i = 2; i <= N; i++) { Node x = new Node(); x.val = i; x.next = head; tail.next = x; tail = x; }
Josephus Problem: Build the Circular Linked List
1
head
tail
2x 3
4
![Page 22: 1 public class Josephus { private static class Node { int val; Node next; } public static void main(String[] args) { int M = Integer.parseInt(args[0]);](https://reader030.vdocument.in/reader030/viewer/2022031601/56649d8b5503460f94a7192b/html5/page/22.jpg)
22
public class Josephus { private static class Node { int val; Node next; }
public static void main(String[] args) { int M = Integer.parseInt(args[0]); int N = Integer.parseInt(args[1]);
Node head = new Node(); head.val = 1; head.next = head; Node tail = head;
for (int i = 2; i <= N; i++) { Node x = new Node(); x.val = i; x.next = head; tail.next = x; tail = x; }
Josephus Problem: Build the Circular Linked List
1
head
tail
2x 3
4
![Page 23: 1 public class Josephus { private static class Node { int val; Node next; } public static void main(String[] args) { int M = Integer.parseInt(args[0]);](https://reader030.vdocument.in/reader030/viewer/2022031601/56649d8b5503460f94a7192b/html5/page/23.jpg)
23
public class Josephus { private static class Node { int val; Node next; }
public static void main(String[] args) { int M = Integer.parseInt(args[0]); int N = Integer.parseInt(args[1]);
Node head = new Node(); head.val = 1; head.next = head; Node tail = head;
for (int i = 2; i <= N; i++) { Node x = new Node(); x.val = i; x.next = head; tail.next = x; tail = x; }
Josephus Problem: Build the Circular Linked List
1
head
23
4
5
tail
![Page 24: 1 public class Josephus { private static class Node { int val; Node next; } public static void main(String[] args) { int M = Integer.parseInt(args[0]);](https://reader030.vdocument.in/reader030/viewer/2022031601/56649d8b5503460f94a7192b/html5/page/24.jpg)
24
public class Josephus { private static class Node { int val; Node next; }
public static void main(String[] args) { int M = Integer.parseInt(args[0]); int N = Integer.parseInt(args[1]);
Node head = new Node(); head.val = 1; head.next = head; Node tail = head;
for (int i = 2; i <= N; i++) { Node x = new Node(); x.val = i; x.next = head; tail.next = x; tail = x; }
Josephus Problem: Build the Circular Linked List
1
head
23
4
5
6
tail
![Page 25: 1 public class Josephus { private static class Node { int val; Node next; } public static void main(String[] args) { int M = Integer.parseInt(args[0]);](https://reader030.vdocument.in/reader030/viewer/2022031601/56649d8b5503460f94a7192b/html5/page/25.jpg)
25
public class Josephus { private static class Node { int val; Node next; }
public static void main(String[] args) { int M = Integer.parseInt(args[0]); int N = Integer.parseInt(args[1]);
Node head = new Node(); head.val = 1; head.next = head; Node tail = head;
for (int i = 2; i <= N; i++) { Node x = new Node(); x.val = i; x.next = head; tail.next = x; tail = x; }
Josephus Problem: Build the Circular Linked List
1
head
tail
23
4
5
6 7
![Page 26: 1 public class Josephus { private static class Node { int val; Node next; } public static void main(String[] args) { int M = Integer.parseInt(args[0]);](https://reader030.vdocument.in/reader030/viewer/2022031601/56649d8b5503460f94a7192b/html5/page/26.jpg)
26
public class Josephus { private static class Node { int val; Node next; }
public static void main(String[] args) { int M = Integer.parseInt(args[0]); int N = Integer.parseInt(args[1]);
Node head = new Node(); head.val = 1; head.next = head; Node tail = head;
for (int i = 2; i <= N; i++) { Node x = new Node(); x.val = i; x.next = head; tail.next = x; tail = x; }
Josephus Problem: Build the Circular Linked List
1
head
tail
23
4
5
6 7
8
![Page 27: 1 public class Josephus { private static class Node { int val; Node next; } public static void main(String[] args) { int M = Integer.parseInt(args[0]);](https://reader030.vdocument.in/reader030/viewer/2022031601/56649d8b5503460f94a7192b/html5/page/27.jpg)
27
public class Josephus { private static class Node { int val; Node next; }
public static void main(String[] args) { int M = Integer.parseInt(args[0]); int N = Integer.parseInt(args[1]);
Node head = new Node(); head.val = 1; head.next = head; Node tail = head;
for (int i = 2; i <= N; i++) { Node x = new Node(); x.val = i; x.next = head; tail.next = x; tail = x; }
Josephus Problem: Build the Circular Linked List
1
head
tail
23
4
5
6 7
8
9
![Page 28: 1 public class Josephus { private static class Node { int val; Node next; } public static void main(String[] args) { int M = Integer.parseInt(args[0]);](https://reader030.vdocument.in/reader030/viewer/2022031601/56649d8b5503460f94a7192b/html5/page/28.jpg)
28
public class Josephus { private static class Node { int val; Node next; }
public static void main(String[] args) { int M = Integer.parseInt(args[0]); int N = Integer.parseInt(args[1]);
Node head = new Node(); head.val = 1; head.next = head; Node tail = head;
for (int i = 2; i <= N; i++) { Node x = new Node(); x.val = i; x.next = head; tail.next = x; tail = x; }
Josephus Problem: Build the Circular Linked List
1
head
tail
23
4
5
6 7
8
9
Done Building
![Page 29: 1 public class Josephus { private static class Node { int val; Node next; } public static void main(String[] args) { int M = Integer.parseInt(args[0]);](https://reader030.vdocument.in/reader030/viewer/2022031601/56649d8b5503460f94a7192b/html5/page/29.jpg)
29
Josephus Problem: Kill Off Every Mth Person
Node x = tail;while (x != x.next) { for (int i = 1; i < M; i++) x = x.next; System.out.print(x.next.val + " "); x.next = x.next.next;}System.out.println(x.val);
1
23
4
5
6 7
8
9
% java Josephus 5 9N
9
M
5
![Page 30: 1 public class Josephus { private static class Node { int val; Node next; } public static void main(String[] args) { int M = Integer.parseInt(args[0]);](https://reader030.vdocument.in/reader030/viewer/2022031601/56649d8b5503460f94a7192b/html5/page/30.jpg)
30
Josephus Problem: Kill Off Every Mth Person
Node x = tail;while (x != x.next) { for (int i = 1; i < M; i++) x = x.next; System.out.print(x.next.val + " "); x.next = x.next.next;}System.out.println(x.val);
1
23
4
5
6 7
8
9
% java Josephus 5 9
x
N
9
M
5
![Page 31: 1 public class Josephus { private static class Node { int val; Node next; } public static void main(String[] args) { int M = Integer.parseInt(args[0]);](https://reader030.vdocument.in/reader030/viewer/2022031601/56649d8b5503460f94a7192b/html5/page/31.jpg)
31
Josephus Problem: Kill Off Every Mth Person
Node x = tail;while (x != x.next) { for (int i = 1; i < M; i++) x = x.next; System.out.print(x.next.val + " "); x.next = x.next.next;}System.out.println(x.val);
1
23
4
5
6 7
8
9
% java Josephus 5 9
x
N
9
M
5
![Page 32: 1 public class Josephus { private static class Node { int val; Node next; } public static void main(String[] args) { int M = Integer.parseInt(args[0]);](https://reader030.vdocument.in/reader030/viewer/2022031601/56649d8b5503460f94a7192b/html5/page/32.jpg)
32
Josephus Problem: Kill Off Every Mth Person
Node x = tail;while (x != x.next) { for (int i = 1; i < M; i++) x = x.next; System.out.print(x.next.val + " "); x.next = x.next.next;}System.out.println(x.val);
1
23
4
5
6 7
8
9
% java Josephus 5 9
x
i
1
N
9
M
5
![Page 33: 1 public class Josephus { private static class Node { int val; Node next; } public static void main(String[] args) { int M = Integer.parseInt(args[0]);](https://reader030.vdocument.in/reader030/viewer/2022031601/56649d8b5503460f94a7192b/html5/page/33.jpg)
33
Josephus Problem: Kill Off Every Mth Person
Node x = tail;while (x != x.next) { for (int i = 1; i < M; i++) x = x.next; System.out.print(x.next.val + " "); x.next = x.next.next;}System.out.println(x.val);
1
23
4
5
6 7
8
9
% java Josephus 5 9
x
i
1
N
9
M
5
![Page 34: 1 public class Josephus { private static class Node { int val; Node next; } public static void main(String[] args) { int M = Integer.parseInt(args[0]);](https://reader030.vdocument.in/reader030/viewer/2022031601/56649d8b5503460f94a7192b/html5/page/34.jpg)
34
Josephus Problem: Kill Off Every Mth Person
Node x = tail;while (x != x.next) { for (int i = 1; i < M; i++) x = x.next; System.out.print(x.next.val + " "); x.next = x.next.next;}System.out.println(x.val);
1
23
4
5
6 7
8
9
% java Josephus 5 9
x
i
2
N
9
M
5
![Page 35: 1 public class Josephus { private static class Node { int val; Node next; } public static void main(String[] args) { int M = Integer.parseInt(args[0]);](https://reader030.vdocument.in/reader030/viewer/2022031601/56649d8b5503460f94a7192b/html5/page/35.jpg)
35
Josephus Problem: Kill Off Every Mth Person
Node x = tail;while (x != x.next) { for (int i = 1; i < M; i++) x = x.next; System.out.print(x.next.val + " "); x.next = x.next.next;}System.out.println(x.val);
1
23
4
5
6 7
8
9
% java Josephus 5 9
x
i
2
N
9
M
5
![Page 36: 1 public class Josephus { private static class Node { int val; Node next; } public static void main(String[] args) { int M = Integer.parseInt(args[0]);](https://reader030.vdocument.in/reader030/viewer/2022031601/56649d8b5503460f94a7192b/html5/page/36.jpg)
36
Josephus Problem: Kill Off Every Mth Person
Node x = tail;while (x != x.next) { for (int i = 1; i < M; i++) x = x.next; System.out.print(x.next.val + " "); x.next = x.next.next;}System.out.println(x.val);
1
23
4
5
6 7
8
9
% java Josephus 5 9
x
i
3
N
9
M
5
![Page 37: 1 public class Josephus { private static class Node { int val; Node next; } public static void main(String[] args) { int M = Integer.parseInt(args[0]);](https://reader030.vdocument.in/reader030/viewer/2022031601/56649d8b5503460f94a7192b/html5/page/37.jpg)
37
Josephus Problem: Kill Off Every Mth Person
Node x = tail;while (x != x.next) { for (int i = 1; i < M; i++) x = x.next; System.out.print(x.next.val + " "); x.next = x.next.next;}System.out.println(x.val);
1
23
4
5
6 7
8
9
% java Josephus 5 9
x
i
3
N
9
M
5
![Page 38: 1 public class Josephus { private static class Node { int val; Node next; } public static void main(String[] args) { int M = Integer.parseInt(args[0]);](https://reader030.vdocument.in/reader030/viewer/2022031601/56649d8b5503460f94a7192b/html5/page/38.jpg)
38
Josephus Problem: Kill Off Every Mth Person
Node x = tail;while (x != x.next) { for (int i = 1; i < M; i++) x = x.next; System.out.print(x.next.val + " "); x.next = x.next.next;}System.out.println(x.val);
1
23
4
5
6 7
8
9
% java Josephus 5 9
x
i
4
N
9
M
5
![Page 39: 1 public class Josephus { private static class Node { int val; Node next; } public static void main(String[] args) { int M = Integer.parseInt(args[0]);](https://reader030.vdocument.in/reader030/viewer/2022031601/56649d8b5503460f94a7192b/html5/page/39.jpg)
39
Josephus Problem: Kill Off Every Mth Person
Node x = tail;while (x != x.next) { for (int i = 1; i < M; i++) x = x.next; System.out.print(x.next.val + " "); x.next = x.next.next;}System.out.println(x.val);
1
23
4
5
6 7
8
9
% java Josephus 5 9
x
i
4
N
9
M
5
![Page 40: 1 public class Josephus { private static class Node { int val; Node next; } public static void main(String[] args) { int M = Integer.parseInt(args[0]);](https://reader030.vdocument.in/reader030/viewer/2022031601/56649d8b5503460f94a7192b/html5/page/40.jpg)
40
Josephus Problem: Kill Off Every Mth Person
Node x = tail;while (x != x.next) { for (int i = 1; i < M; i++) x = x.next; System.out.print(x.next.val + " "); x.next = x.next.next;}System.out.println(x.val);
1
23
4
5
6 7
8
9
% java Josephus 5 9
x
i
5
N
9
M
5
![Page 41: 1 public class Josephus { private static class Node { int val; Node next; } public static void main(String[] args) { int M = Integer.parseInt(args[0]);](https://reader030.vdocument.in/reader030/viewer/2022031601/56649d8b5503460f94a7192b/html5/page/41.jpg)
41
Josephus Problem: Kill Off Every Mth Person
Node x = tail;while (x != x.next) { for (int i = 1; i < M; i++) x = x.next; System.out.print(x.next.val + " "); x.next = x.next.next;}System.out.println(x.val);
1
23
4
5
6 7
8
9
% java Josephus 5 95
x
N
9
M
5
![Page 42: 1 public class Josephus { private static class Node { int val; Node next; } public static void main(String[] args) { int M = Integer.parseInt(args[0]);](https://reader030.vdocument.in/reader030/viewer/2022031601/56649d8b5503460f94a7192b/html5/page/42.jpg)
42
Josephus Problem: Kill Off Every Mth Person
Node x = tail;while (x != x.next) { for (int i = 1; i < M; i++) x = x.next; System.out.print(x.next.val + " "); x.next = x.next.next;}System.out.println(x.val);
1
23
4
5
6 7
8
9
% java Josephus 5 95
x
N
9
M
5
5 is effectively deleted
![Page 43: 1 public class Josephus { private static class Node { int val; Node next; } public static void main(String[] args) { int M = Integer.parseInt(args[0]);](https://reader030.vdocument.in/reader030/viewer/2022031601/56649d8b5503460f94a7192b/html5/page/43.jpg)
43
Josephus Problem: Kill Off Every Mth Person
Node x = tail;while (x != x.next) { for (int i = 1; i < M; i++) x = x.next; System.out.print(x.next.val + " "); x.next = x.next.next;}System.out.println(x.val);
1
23
4
6 7
8
9
% java Josephus 5 95
x
N
9
M
5
![Page 44: 1 public class Josephus { private static class Node { int val; Node next; } public static void main(String[] args) { int M = Integer.parseInt(args[0]);](https://reader030.vdocument.in/reader030/viewer/2022031601/56649d8b5503460f94a7192b/html5/page/44.jpg)
44
Josephus Problem: Kill Off Every Mth Person
Node x = tail;while (x != x.next) { for (int i = 1; i < M; i++) x = x.next; System.out.print(x.next.val + " "); x.next = x.next.next;}System.out.println(x.val);
i
1
N
9
M
5
1
23
4
6 7
8
9x
% java Josephus 5 95
![Page 45: 1 public class Josephus { private static class Node { int val; Node next; } public static void main(String[] args) { int M = Integer.parseInt(args[0]);](https://reader030.vdocument.in/reader030/viewer/2022031601/56649d8b5503460f94a7192b/html5/page/45.jpg)
45
Josephus Problem: Kill Off Every Mth Person
Node x = tail;while (x != x.next) { for (int i = 1; i < M; i++) x = x.next; System.out.print(x.next.val + " "); x.next = x.next.next;}System.out.println(x.val);
i
1
N
9
M
5
1
23
4
6 7
8
9x
% java Josephus 5 95
![Page 46: 1 public class Josephus { private static class Node { int val; Node next; } public static void main(String[] args) { int M = Integer.parseInt(args[0]);](https://reader030.vdocument.in/reader030/viewer/2022031601/56649d8b5503460f94a7192b/html5/page/46.jpg)
46
Josephus Problem: Kill Off Every Mth Person
Node x = tail;while (x != x.next) { for (int i = 1; i < M; i++) x = x.next; System.out.print(x.next.val + " "); x.next = x.next.next;}System.out.println(x.val);
i
2
N
9
M
5
1
23
4
6 7
8
9x
% java Josephus 5 95
![Page 47: 1 public class Josephus { private static class Node { int val; Node next; } public static void main(String[] args) { int M = Integer.parseInt(args[0]);](https://reader030.vdocument.in/reader030/viewer/2022031601/56649d8b5503460f94a7192b/html5/page/47.jpg)
47
Josephus Problem: Kill Off Every Mth Person
Node x = tail;while (x != x.next) { for (int i = 1; i < M; i++) x = x.next; System.out.print(x.next.val + " "); x.next = x.next.next;}System.out.println(x.val);
i
2
N
9
M
5
1
23
4
6 7
8
9x
% java Josephus 5 95
![Page 48: 1 public class Josephus { private static class Node { int val; Node next; } public static void main(String[] args) { int M = Integer.parseInt(args[0]);](https://reader030.vdocument.in/reader030/viewer/2022031601/56649d8b5503460f94a7192b/html5/page/48.jpg)
48
Josephus Problem: Kill Off Every Mth Person
Node x = tail;while (x != x.next) { for (int i = 1; i < M; i++) x = x.next; System.out.print(x.next.val + " "); x.next = x.next.next;}System.out.println(x.val);
i
3
N
9
M
5
1
23
4
6 7
8
9x
% java Josephus 5 95
![Page 49: 1 public class Josephus { private static class Node { int val; Node next; } public static void main(String[] args) { int M = Integer.parseInt(args[0]);](https://reader030.vdocument.in/reader030/viewer/2022031601/56649d8b5503460f94a7192b/html5/page/49.jpg)
49
Josephus Problem: Kill Off Every Mth Person
Node x = tail;while (x != x.next) { for (int i = 1; i < M; i++) x = x.next; System.out.print(x.next.val + " "); x.next = x.next.next;}System.out.println(x.val);
i
3
N
9
M
5
1
23
4
6 7
8
9x
% java Josephus 5 95
![Page 50: 1 public class Josephus { private static class Node { int val; Node next; } public static void main(String[] args) { int M = Integer.parseInt(args[0]);](https://reader030.vdocument.in/reader030/viewer/2022031601/56649d8b5503460f94a7192b/html5/page/50.jpg)
50
Josephus Problem: Kill Off Every Mth Person
Node x = tail;while (x != x.next) { for (int i = 1; i < M; i++) x = x.next; System.out.print(x.next.val + " "); x.next = x.next.next;}System.out.println(x.val);
i
4
N
9
M
5
1
23
4
6 7
8
9x
% java Josephus 5 95
![Page 51: 1 public class Josephus { private static class Node { int val; Node next; } public static void main(String[] args) { int M = Integer.parseInt(args[0]);](https://reader030.vdocument.in/reader030/viewer/2022031601/56649d8b5503460f94a7192b/html5/page/51.jpg)
51
Josephus Problem: Kill Off Every Mth Person
Node x = tail;while (x != x.next) { for (int i = 1; i < M; i++) x = x.next; System.out.print(x.next.val + " "); x.next = x.next.next;}System.out.println(x.val);
i
4
N
9
M
5
1
23
4
6 7
8
9x
% java Josephus 5 95
![Page 52: 1 public class Josephus { private static class Node { int val; Node next; } public static void main(String[] args) { int M = Integer.parseInt(args[0]);](https://reader030.vdocument.in/reader030/viewer/2022031601/56649d8b5503460f94a7192b/html5/page/52.jpg)
52
Josephus Problem: Kill Off Every Mth Person
Node x = tail;while (x != x.next) { for (int i = 1; i < M; i++) x = x.next; System.out.print(x.next.val + " "); x.next = x.next.next;}System.out.println(x.val);
i
5
N
9
M
5
1
23
4
6 7
8
9x
% java Josephus 5 95
![Page 53: 1 public class Josephus { private static class Node { int val; Node next; } public static void main(String[] args) { int M = Integer.parseInt(args[0]);](https://reader030.vdocument.in/reader030/viewer/2022031601/56649d8b5503460f94a7192b/html5/page/53.jpg)
53
Josephus Problem: Kill Off Every Mth Person
Node x = tail;while (x != x.next) { for (int i = 1; i < M; i++) x = x.next; System.out.print(x.next.val + " "); x.next = x.next.next;}System.out.println(x.val);
% java Josephus 5 95 1
N
9
M
5
1
23
4
6 7
8
9x
![Page 54: 1 public class Josephus { private static class Node { int val; Node next; } public static void main(String[] args) { int M = Integer.parseInt(args[0]);](https://reader030.vdocument.in/reader030/viewer/2022031601/56649d8b5503460f94a7192b/html5/page/54.jpg)
54
Josephus Problem: Kill Off Every Mth Person
Node x = tail;while (x != x.next) { for (int i = 1; i < M; i++) x = x.next; System.out.print(x.next.val + " "); x.next = x.next.next;}System.out.println(x.val);
% java Josephus 5 95 1
N
9
M
5
1
23
4
6 7
8
9x
![Page 55: 1 public class Josephus { private static class Node { int val; Node next; } public static void main(String[] args) { int M = Integer.parseInt(args[0]);](https://reader030.vdocument.in/reader030/viewer/2022031601/56649d8b5503460f94a7192b/html5/page/55.jpg)
55
Josephus Problem: Kill Off Every Mth Person
Node x = tail;while (x != x.next) { for (int i = 1; i < M; i++) x = x.next; System.out.print(x.next.val + " "); x.next = x.next.next;}System.out.println(x.val);
% java Josephus 5 95 1
N
9
M
5
23
4
6 7
8
9x
![Page 56: 1 public class Josephus { private static class Node { int val; Node next; } public static void main(String[] args) { int M = Integer.parseInt(args[0]);](https://reader030.vdocument.in/reader030/viewer/2022031601/56649d8b5503460f94a7192b/html5/page/56.jpg)
56
Josephus Problem: Kill Off Every Mth Person
Node x = tail;while (x != x.next) { for (int i = 1; i < M; i++) x = x.next; System.out.print(x.next.val + " "); x.next = x.next.next;}System.out.println(x.val);
% java Josephus 5 95 1 7
N
9
M
5
23
4
6 7
8
9x
![Page 57: 1 public class Josephus { private static class Node { int val; Node next; } public static void main(String[] args) { int M = Integer.parseInt(args[0]);](https://reader030.vdocument.in/reader030/viewer/2022031601/56649d8b5503460f94a7192b/html5/page/57.jpg)
57
Josephus Problem: Kill Off Every Mth Person
Node x = tail;while (x != x.next) { for (int i = 1; i < M; i++) x = x.next; System.out.print(x.next.val + " "); x.next = x.next.next;}System.out.println(x.val);
% java Josephus 5 95 1 7 4
N
9
M
5
23
6
8
9x
![Page 58: 1 public class Josephus { private static class Node { int val; Node next; } public static void main(String[] args) { int M = Integer.parseInt(args[0]);](https://reader030.vdocument.in/reader030/viewer/2022031601/56649d8b5503460f94a7192b/html5/page/58.jpg)
58
Josephus Problem: Kill Off Every Mth Person
Node x = tail;while (x != x.next) { for (int i = 1; i < M; i++) x = x.next; System.out.print(x.next.val + " "); x.next = x.next.next;}System.out.println(x.val);
% java Josephus 5 95 1 7 4 3
N
9
M
5
2
6
8
9x
![Page 59: 1 public class Josephus { private static class Node { int val; Node next; } public static void main(String[] args) { int M = Integer.parseInt(args[0]);](https://reader030.vdocument.in/reader030/viewer/2022031601/56649d8b5503460f94a7192b/html5/page/59.jpg)
59
Josephus Problem: Kill Off Every Mth Person
Node x = tail;while (x != x.next) { for (int i = 1; i < M; i++) x = x.next; System.out.print(x.next.val + " "); x.next = x.next.next;}System.out.println(x.val);
% java Josephus 5 95 1 7 4 3 6
N
9
M
5
2
8
9x
![Page 60: 1 public class Josephus { private static class Node { int val; Node next; } public static void main(String[] args) { int M = Integer.parseInt(args[0]);](https://reader030.vdocument.in/reader030/viewer/2022031601/56649d8b5503460f94a7192b/html5/page/60.jpg)
60
Josephus Problem: Kill Off Every Mth Person
Node x = tail;while (x != x.next) { for (int i = 1; i < M; i++) x = x.next; System.out.print(x.next.val + " "); x.next = x.next.next;}System.out.println(x.val);
% java Josephus 5 95 1 7 4 3 6 9
N
9
M
5
2
8
x
![Page 61: 1 public class Josephus { private static class Node { int val; Node next; } public static void main(String[] args) { int M = Integer.parseInt(args[0]);](https://reader030.vdocument.in/reader030/viewer/2022031601/56649d8b5503460f94a7192b/html5/page/61.jpg)
61
Josephus Problem: Kill Off Every Mth Person
Node x = tail;while (x != x.next) { for (int i = 1; i < M; i++) x = x.next; System.out.print(x.next.val + " "); x.next = x.next.next;}System.out.println(x.val);
% java Josephus 5 95 1 7 4 3 6 9 2
N
9
M
5
8
x
![Page 62: 1 public class Josephus { private static class Node { int val; Node next; } public static void main(String[] args) { int M = Integer.parseInt(args[0]);](https://reader030.vdocument.in/reader030/viewer/2022031601/56649d8b5503460f94a7192b/html5/page/62.jpg)
62
Josephus Problem: Kill Off Every Mth Person
Node x = tail;while (x != x.next) { for (int i = 1; i < M; i++) x = x.next; System.out.print(x.next.val + " "); x.next = x.next.next;}System.out.println(x.val);
% java Josephus 5 95 1 7 4 3 6 9 2
N
9
M
5
8
x
![Page 63: 1 public class Josephus { private static class Node { int val; Node next; } public static void main(String[] args) { int M = Integer.parseInt(args[0]);](https://reader030.vdocument.in/reader030/viewer/2022031601/56649d8b5503460f94a7192b/html5/page/63.jpg)
63
Josephus Problem: Kill Off Every Mth Person
Node x = tail;while (x != x.next) { for (int i = 1; i < M; i++) x = x.next; System.out.print(x.next.val + " "); x.next = x.next.next;}System.out.println(x.val);
% java Josephus 5 95 1 7 4 3 6 9 2 8
N
9
M
5
8
x
Survivor