http://projecteuler.net/problem=4

#include <iostream>
#include <algorithm>

using namespace std;

int GeneratePalindromicNumber(int nFirstHalf)
{
    int nResult = nFirstHalf;
    int nTemp   = nFirstHalf;

    while (nTemp != 0)
    {
        nResult *= 10;
        nResult += nTemp % 10;
        nTemp   /= 10;
    }

    return nResult;
}

bool IsProductOfTwo3Digit(int nNumber)
{
    int nMin = max(100, nNumber / 999);
    int nMax = min(999, nNumber / 100);
    for (int i = nMin; i <= nMax; ++i)
    {
        if (nNumber % i == 0)
        {
            return true;
        }
    }

    return false;
}

int main()
{
    int nResult = 0;
    for (int i = 906; i >= 100; --i)
    {
        int nPalindromicNumber = GeneratePalindromicNumber(i);
        if (IsProductOfTwo3Digit(nPalindromicNumber))
        {
            nResult = nPalindromicNumber;
            break;
        }
    }

    cout << nResult;
    return 0;
}