/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 vote145 views1 answer
Calculating Function codeforces in c++
C++
7 votes144 views3 answers
How to use sleep function in c++ windows
C++
0 vote148 views1 answer
Cpp how to add collisions to boxes
C++
0 vote151 views1 answer
How to get steam id c++
C++
1 vote163 views1 answer
Get window position
C++
15 votes146 views4 answers
How to make a random number in c++
C++
1 vote166 views10 answers
Js
C++
0 vote148 views1 answer
Swap first and last character of string in c++
C++
1 vote137 views1 answer
Doubly linked list c++ code
C++
2 votes158 views1 answer
Ue4 cpp OnHit
C++