/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 vote147 views1 answer
C++ filesystem read directory
C++
0 vote135 views1 answer
Create new node in tree
C++
0 vote143 views1 answer
CamelCase Problem
C++
3 votes139 views1 answer
C++ program to reverse an array
C++
10 votes148 views2 answers
Why convert char* to string c++
C++
0 vote97 views1 answer
Postorder traversal calculator
C++
5 votes139 views2 answers
Bitwise count total set bits
C++
7 votes140 views3 answers
Length of 2d array c++
C++
0 vote132 views1 answer
Vector keyword in c++
C++
0 vote154 views1 answer
+++++++++
C++