/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 vote214 views1 answer
List in c++
C++
60 votes253 views2 answers
For(var i=0; i<=10; i++)
C++
1 vote271 views1 answer
Unique_ptr header file
C++
0 vote223 views1 answer
Vector c++ length integer
C++
0 vote233 views1 answer
Error C2011
C++
0 vote210 views1 answer
Compare values within within a vector c++
C++
4 votes221 views2 answers
Check uppercase c++
C++
5 votes236 views2 answers
C++ contains
C++
0 vote237 views1 answer
How to use custom array in c++
C++
267 votes235 views1 answer
Visual studio c++ compiler
C++