/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 vote302 views1 answer
Dynamically array of string in c++
C++
0 vote333 views1 answer
Empty 2d array as a member of a class class c++
C++
0 vote291 views3 answers
Online c++ compiler
C++
17 votes332 views6 answers
Find max value in array c++
C++
0 vote290 views1 answer
Log base 10 c+_+
C++
0 vote338 views1 answer
C++ tokenize string
C++
0 vote308 views1 answer
Add partition mysql
C++
93 votes490 views4 answers
C++ get time
C++
18 votes293 views2 answers
Stl for sorting IN C++
C++
0 vote324 views1 answer
Age in days in c++
C++