-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathJosephusProblem.java
More file actions
53 lines (44 loc) · 1.44 KB
/
Copy pathJosephusProblem.java
File metadata and controls
53 lines (44 loc) · 1.44 KB
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
/*
* To change this license header, choose License Headers in Project Properties.
* To change this template file, choose Tools | Templates
* and open the template in the editor.
*/
package josephusproblem;
import java.util.*;
/**
*
* @author Tima
*/
public class JosephusProblem {
/**
* @param args the command line arguments
*/
public static void main(String[] args) {
// TODO code application logic here
int numPeople, skip, targetIndex;
List<String> list = new ArrayList<String>();
Scanner in = new Scanner(System.in);
// get the initial number of soldiers
System.out.print("Enter the number of soldiers: ");
numPeople = in.nextInt();
in.nextLine();
// get the number of soldiers to skip
System.out.print("Enter the number of soldiers to skip: ");
skip = in.nextInt();
// load the initial list of soldiers
for (int count = 1; count <= numPeople; count++)
{
list.add("Soldier " + count);
}
targetIndex = skip;
System.out.println("The order is: ");
// Treating the list as circular, remove every nth element
// until the list is empty
while (!list.isEmpty())
{
System.out.println(list.remove(targetIndex));
if (list.size() > 0)
targetIndex = (targetIndex + skip) % list.size();
}
}
}