題解/算法 {198. 反素数}

@Link

Solution

Suppose $a=p_1^{a_1}\ast p_2^{a_2}\ast ...$ where $p_1\le p_2\le ...$ is an Anti-Prime, it would has some properties:
. $a_1\ge a_2\ge ...$; (if not, e.g., $a=2^1\ast 3^2$, another number $b=2^2\ast 3^1$ which own the same Divisor-Count with $a$, while $b<a$ implies $a$ is not Anti-Prime)
. $p_1=2,p_2=3,p_3=5,...$; (the analysis is similar to the above)

Due to these two properties, actually we can use DFS-Brute to finding all such numbers $a$ (notice, $a$ may not be a Anti-Prime; e.g., in the range of int, the number of such $a$ is greater than the number of Anti-Prime), the number of such $a$ would not too much even in the whole range of int, cuz $2\ast 3\ast 5\ast 7\ast ...$ at most $9$ Primes-Factor would attain the maximum of int;

Code

int P[] = {2, 3, 5, 7, 11, 13, 17, 19, 23};
long long N;
long long Cont, Ans;
void Dfs( int _ind, int _power, int _cont, long long _n){
    if( _ind >= 9){ return;}
    long long cur = 1;
    for( int p = 1; p <= _power; ++p){
        cur *= P[ _ind];
        if( _n * cur > N){ break;}
        if( (_cont * (p + 1) > Cont) || ((_cont * (p + 1) == Cont) && (_n * cur < Ans))){
            Cont = _cont * (p + 1);
            Ans = _n * cur;
        }
        Dfs( _ind + 1, p, _cont * (p + 1), _n * cur);
    }
}

scanf("%lld", &N);
Cont = 1, Ans = 1;
Dfs( 0, 100, 1, 1);
cout<< Ans;