http://projecteuler.net/problem=36 [Answer:872187]

 

#include <iostream>

using namespace std;

bool IsPalindromic( int number, int base )
{
    int digit[32];
    size_t count = 0;

    do
    {
        digit[count++] = number % base;
        number /= base;
    } while ( number != 0 );

    for ( size_t i = 0; i < (count + 1) / 2; ++i )
    {
        if ( digit[i] != digit[count-1-i] )
        {
            return false;
        }
    }

    return true;
}

int main()
{
    int sum = 0;
    for ( int n = 1; n < 1000000; n += 2 )
    {
        if ( IsPalindromic( n, 10 ) && IsPalindromic( n, 2 ) )
        {
            sum += n;
        }
    }
    cout << sum << endl;
    return 0;
}