TCO11 Qual3 Easy(250) AllButOneDivisor

TopCoder

AllButOneDivisor

11*12*13*14*15=360360。ここまで調べれば充分。全探索しても間に合う。

#include <vector>
using namespace std;

class AllButOneDivisor{public:
int getMinimum( vector <int> divisors )
{
    int K = (int)divisors.size();

    for ( int i=0; i<=360360; i++ )
    {
        int c = 0;
        for ( int j=0; j<K; j++ )
            if ( i%divisors[j] == 0 )
                c++;
        if ( c == K-1 )
            return i;
    }

    return -1;
}};