Solution to Project Euler problem 4
#include<iostream>
using namespace std;
bool isPalindrome(char* x);
int main()
{
char prodStr[100];
int max = 0;
int i, j, prod;
for (i = 100; i < 1000; i++)
{
for (j = 100; j < 1000; j++)
{
prod = i * j;
sprintf_s(prodStr, 100, "%i", prod);
if(isPalindrome(prodStr) == 1)
{
if(prod > max)
max = prod;
}
}
}
cout<<max<<endl;
return 0;
}
bool isPalindrome(char* x)
{
int i = 0;
int j = strlen(x) - 1;
while (i <= j)
{
if (x[i] != x[j])
return false;
i++;
j--;
}
return true;
}