递归:
public boolean divisorGame(int N) {
boolean [] f = new boolean[N+2];
f[1] = false;
f[2] = true;
for (int i = 3; i <= N; i++){
for (int j = 1; j < i; j++){
if ((j % i == 0) && !f[i-j]){
f[i] = true;
break;
}
}
}
return f[N];
}
数学方法: