/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 vote176 views1 answer
I2c slave onreceive
C++
0 vote178 views1 answer
Binary add using strings
C++
0 vote190 views1 answer
C++ random int troll
C++
0 vote211 views1 answer
C++ write string
C++
0 vote174 views1 answer
Std::ofstream file1(FILE_NAME, std::ios::app);
C++
26 votes242 views2 answers
Remove element from vector on condition c++
C++
-2 votes164 views6 answers
Array in c++
C++
0 vote164 views7 answers
Hexo
C++
1 vote187 views1 answer
Vector erase not working c++
C++
-1 vote176 views10 answers
Time complexity calculator online
C++