/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

5 votes246 views2 answers
How to convert a string to a double c++
C++
-1 vote260 views1 answer
String interpolation in c++
C++
0 vote270 views1 answer
All permutations with repetition C++
C++
0 vote256 views3 answers
Get number round off to two decimal places c++
C++
0 vote251 views3 answers
Best gun in freefire for headshot
C++
0 vote249 views1 answer
C++ erase last element of set
C++
0 vote299 views1 answer
C++ chrono get milliseconds
C++
1 vote259 views1 answer
Include guard c++
C++
0 vote245 views1 answer
String format decimal places c++
C++
0 vote290 views1 answer
Flutter websocket auto reconnect
C++