/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 vote256 views2 answers
Ex:c programming
C++
0 vote260 views1 answer
Adding variables c++
C++
0 vote253 views1 answer
Bit c++
C++
0 vote220 views0 answer
C++
0 vote238 views1 answer
Template member functions in cpp files
C++
3 votes228 views1 answer
What is a variable in cpp
C++
3 votes261 views4 answers
String c++
C++
3 votes222 views1 answer
(a) one-dimensional arrays and multidimensional arrays in c++
C++
1 vote277 views1 answer
Array sum in c++ stl
C++
7 votes262 views5 answers
Sleep c++
C++