package leetcode;

/**
 * https://leetcode.com/problems/divisor-game/
 */
public class Problem1025 {
    public boolean divisorGame(int N) {
        // TODO
        return false;
    }

    public static void main(String[] args) {
        Problem1025 prob = new Problem1025();
        System.out.println(prob.divisorGame(2)); // true
        System.out.println(prob.divisorGame(3)); // false
    }
}

@@ -146,250 +146,26 @@
     
-// TODO%0A        return false;%0A    %7D%0A%0A    public static void main(String%5B%5D args) %7B%0A        Problem1025 prob = new Problem1025();%0A        System.out.println(prob.divisorGame(2)); // true%0A        System.out.println(prob.divisorGame(3)); // false
+return N %25 2 == 0;
 %0A   

Solve problem 1025