/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 vote111 views1 answer
Constructor syntax in c++
C++
-1 vote117 views1 answer
C++ itoa
C++
14 votes104 views5 answers
Find length of array c++
C++
0 vote110 views1 answer
C++ read_ascii
C++
0 vote111 views1 answer
Qt widget list set selected
C++
2 votes119 views1 answer
What is -> in c++
C++
0 vote117 views1 answer
First and last digit of a number in c++
C++
0 vote113 views1 answer
Binary search c++
C++
3 votes120 views1 answer
Rick astley - never gonna give you up
C++
0 vote111 views1 answer
Program To Calculate Number Power Using Recursion In C++. The power number should always be positive integer.
C++