/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

1 vote132 views1 answer
Rapidjson write stringbuffer to file
C++
0 vote151 views1 answer
Three way comparison operator c++
C++
0 vote132 views1 answer
C++ header boilerplate
C++
-6 votes124 views3 answers
Explicit in c++ meaning
C++
0 vote132 views1 answer
How to have a queue as a parameter in c++
C++
0 vote139 views1 answer
Set iterator
C++
2 votes118 views1 answer
C++ terminal color
C++
0 vote148 views1 answer
Assignment of single field in struct in solidity
C++
0 vote139 views1 answer
Split 2d array into chunks in c++
C++
25 votes138 views5 answers
Sort vector in descending order c++
C++