/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

1 vote178 views1 answer
How to reset linerenderer unity
C++
0 vote279 views1 answer
New expression
C++
-1 vote176 views2 answers
Delete file cpp
C++
0 vote200 views2 answers
Print all number between a and b in c++
C++
0 vote190 views1 answer
Http://nv-study.ru/http://nv-study.ru/http://nv-study.ru/
C++
0 vote281 views1 answer
Ind the number of digits of a given integer n .
C++
3 votes182 views2 answers
Console colors in C++
C++
0 vote188 views1 answer
Binary search c++
C++
0 vote183 views1 answer
How to get the last element of an array in C++ using std::array
C++
2 votes205 views2 answers
C++ length of char*
C++