@@ -0,0 +1,576 @@
+%0Apackage josephiusproblem;%0A    import java.util.Scanner;%0A%0Apublic class JosepheusProblem %7B%0A    %0A    public static int problem(int n, int k)%7B%0A        if(n==1) return 1;%0A%0A%09return (((problem(n-1, k) + k - 1) %25 n) + 1);%0A    %7D%0A    %0A    public static void main(String%5B%5D args) %7B%0A        Scanner l = new Scanner(System.in);%0A        int n, k;%0A        %0A        System.out.println(%22Enter the number of people:%22);%0A        n = l.nextInt();%0A        System.out.println(%22Enter the step:%22);%0A        k = l.nextInt();%0A        %0A        System.out.println(%22Survivor: %22+problem(n,k));%0A%0A    %7D%0A    %0A%7D%0A

Create JosepheusProblem.java