i think you need the array way to solve it .. you all are going beyond bounds of an int

public static long pow(int x, int y) { if(y == 0 || x == 1) return 1; if(y == 1) return x; int pow = 1; long result = x; while((pow<<1) <= y) { result *= result; pow = pow<<1; } return result * (pow == y ? 1 : pow(x,y - pow)); } Almost the same solution like that from mackerzed.

int pow(int x, int n){ return x*1<

^^ does not work: int pwr(int x, int n){ int c = x; while(--n) x *= c; return x; }