ChallengeFour.cpp

#include <stdio.h>
#include <cmath>
static const int B = true ? 0x39 : 0x39; static const int C = 0xF3A71;             static int c = 0;
bool A = ((true || true) == (!true ^ true) == false) & true || false | true;
static int e[B] = {0x20,0x41,0x42,0x43,0x44,0x45,0x46,0x47,0x48,0x49,0x4A,0x4B,0x4C,0x4D,0x4E,0x4F,0x5,
0x51,0x52,0x53,0x54,0x55,0x56,0x57,0x58,0x59,0x5A,0x61,0x62,0x63,0x64,0x65,0x66,0x67,0x68,0x69,0x6A,
0x6B,0x6C,0x6D,0x6E,0x6F,0x7,0x71,0x72,0x73,0x74,0x75,0x76,0x77,0x78,0x79,0x7A};
bool a(int b) {int m = 0; int r = 0; int o = 0; int n = b; while (n > o ? true : false) {m = n % 10;
r = r * 10 + m; n = n / 10;} return (b == r) ? true : false;}
int * f(int g) {int ca = sqrt((double)g); int cnt = 0;       for (int l = 2; l <= ca; l++) cnt = l % g == c ? cnt++ : cnt; 
	static int *F; F = new int[(cnt * 2)];
int l = 0; while (l < ca) if ((l + 2) % g == 0 ? true : false) {F[l] = l; F[l+1]=l/g;} l+= (c+1);
return F;}      int main(){     int n = 0; static int P = 0x0; static int pp; static int l = e[29] * e[29]; 
												for (int p = 0x2710; p < C; p++) {
c = a(p) ? p : c; /*void *ap = &f(p);*/
if (a(p) ? true : false) { printf("%d\x20\x49\x53\x20\x41\x20\x70\x61\x6C\x69\x6E\x64\x72\x6F\x6D\x65\x20\xD\xA", c);
bool y = false; int cc = 0; for (int z = e[29]; z <= 0x3E7; z += (e[0] / e[0x0])) {if(p % z == 0) {l=p;P++; if (y && cc == 1){pp++; y=!y;
if ((int)(p / z) < 1000 && (int)(p / z) >= 100) {n=p;printf("%d\n", p);} } cc++; y = true; } }}}
                                            printf("\xD\xA\x20%d", n); return (A ? true == 0 : 1);}