Project Euler: Problem 36

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11

long result = 0;
for (long i = 0; i < 1000000; i++) {
	StringBuilder tempdec = new StringBuilder(Long.toString(i));
	if (tempdec.toString().equals(tempdec.reverse().toString())) {
		StringBuilder tempbin = new StringBuilder(Long.toBinaryString(i));
		if (tempbin.toString().equals(tempbin.reverse().toString())) {
			result = result + i;
		}
	} 
}
System.out.println(result);