Method main

Java/Recursion/joshephus.java:10–16

(String args[])

       return (Jos(n - 1,k) + k-1) % n + 1;
   } 
   public static void main(String args[])
   {
       Scanner I = new Scanner(System.in);
       int n = I.nextInt(), k = I.nextInt();
       System.out.println(Jos(n,k));
       I.close();
   }   
}
/*when starting pos is 0
import java.util.*;