/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

15 votes203 views3 answers
C++ string to char array
C++
1 vote193 views2 answers
Sort c++
C++
-1 vote200 views1 answer
C++ if else
C++
0 vote203 views1 answer
Display dot product of two Arrays.
C++
4 votes192 views1 answer
Cpp iterator of element
C++
0 vote236 views1 answer
How to use jwt in login api in node js
C++
0 vote200 views1 answer
Deal with bad input cpp
C++
0 vote220 views1 answer
Polycarp found a rectangular table consisting of n rows and m columns. He noticed that each cell of the table has its number, obtained by the following algorithm "by columns": codeforces solution
C++
0 vote212 views2 answers
Qpushbutton clicked connect c++
C++
0 vote199 views1 answer
Built in led
C++