/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 vote342 views1 answer
Compile c++ MPI Program
C++
0 vote381 views1 answer
How to input a file path in c++
C++
0 vote350 views1 answer
Glm multiply vector by scalar
C++
0 vote297 views7 answers
Online converter c++ to c
C++
0 vote351 views1 answer
How to scan vector in c++
C++
1 vote307 views1 answer
How to run a c++ program in the background
C++
0 vote329 views1 answer
End vs cend in cpp
C++
-1 vote329 views4 answers
How to say hello world in c++
C++
0 vote341 views1 answer
Call to constructor of 'extClockType' is ambiguous extClockType time2;
C++
3 votes328 views4 answers
C++ char array size
C++