/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

4 votes125 views3 answers
REFERENCE C++
C++
14 votes141 views2 answers
How to sort in descending order in c++
C++
0 vote142 views1 answer
_ZNSolsEi
C++
0 vote125 views1 answer
Add two constant char pointers c++
C++
4 votes116 views5 answers
C++ int max value
C++
0 vote130 views1 answer
Character array to string c++ stl
C++
1 vote87 views1 answer
Arduino funktion
C++
0 vote138 views1 answer
What is stdarg.h used for
C++
0 vote119 views1 answer
Cpp how to add collisions to boxes
C++
0 vote132 views1 answer
Program to swap max and min in matrix
C++