/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 vote186 views1 answer
C++ how to inherit from a template class
C++
0 vote144 views1 answer
What c++ library is arccos in
C++
2 votes178 views3 answers
Online ide c++
C++
1 vote148 views1 answer
C++ read file to char buffer
C++
0 vote154 views1 answer
Hamming distance c++
C++
0 vote145 views1 answer
How to find min of two numbers in c++
C++
1 vote133 views1 answer
Prints all the keys and values in a map c++
C++
0 vote139 views1 answer
Tree to array c++
C++
8 votes142 views2 answers
Check variable type c++
C++
1 vote155 views1 answer
C++ overwrite file
C++