/C++/Prime factorisation of a number in c++

Prime factorisation of a number in c++

// Function that returns a vector containing all the prime factors of n (25 --> 5, 5)
vector<long long> prime_factorisation(long long n)
{
    //spf is smallest prime factor
    map<long long, long long> spf;
    vector<long long> ans(0);
    for(long long i = 2; i <= n; i++) spf[i] = i;

    for (long long i = 2; i <= n; i++)
        if (spf[i] == i)
            for (long long j = i * i; j <= n; j += i)
                if (spf[j] == j)
                    spf[j] = i;

    while (n != 1)
    {
        ans.push_back(spf[n]);
        n /= spf[n];
    }
    return ans;
}

Similar codes

0 vote97 views1 answer
Ask a question and answer it in code c++
C++
51 votes129 views3 answers
Phph date
C++
8 votes97 views2 answers
C++ factorial
C++
0 vote100 views1 answer
How to check if vector is ordered c++
C++
3 votes104 views2 answers
Precision of fixed in c++
C++
0 vote94 views1 answer
Ejemplo
C++
0 vote95 views3 answers
Print counting in c++
C++
0 vote95 views1 answer
Declare a tab c++
C++
2 votes90 views1 answer
Retu7rn this c++
C++
1 vote102 views1 answer
C++ concurrency
C++