Josephus Circle Solution

JosephusCircle.java

public class JosephusCircle {

    public static void main(String[] args) {
        int n = 0;
        int m = 0;
        int i = 0;
        int s = 0;

        Scanner scanner = new Scanner(System.in);

        if (scanner.hasNextInt()) {
            n = scanner.nextInt();
        }
        if (scanner.hasNextInt()) {
            m = scanner.nextInt();
        }
        for (i = 2; i <= n; i++) {
            s = (s + m) % i;
        }
        System.out.println("The winner is " + s);

    }

    //http://www.cnblogs.com/EricYang/archive/2009/09/04/1560478.html

}