/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

9 votes215 views2 answers
Fast io
C++
0 vote170 views1 answer
Interest rate parity
C++
0 vote222 views1 answer
Lcm function c++
C++
0 vote206 views1 answer
How to generate number in c++
C++
2 votes218 views1 answer
How to use winmain function
C++
0 vote210 views1 answer
C++ find with predicat
C++
0 vote231 views1 answer
Inner Section Sticky Scroll in elementor
C++
0 vote217 views1 answer
The smallest element from three
C++
4 votes218 views1 answer
C++ measure time
C++
4 votes217 views1 answer
Sort vector struct c++
C++