http://projecteuler.net/problem=33 [Answer:100]

#include <iostream>

using namespace std;

int GCD( int m, int n )
{
    int r = m % n;
    while ( r != 0 )
    {
        m = n;
        n = r;
        r = m % n;
    }
    return n;
}

int main()
{
    int numerator = 1;
    int denominator = 1;
    for ( int a = 1; a <= 9; ++a )
    {
        for ( int b = 1; b <= 9; ++b )
        {
            for ( int c = 1; c <= 9; ++c )
            {
                if ( a != c && (a*10+b) * c == a * (b*10+c) )
                {
                    numerator *= a;
                    denominator *= c;
                }
            }
        }
    }
    cout << denominator / GCD( denominator, numerator ) << endl;
    return 0;
}