/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

9 votes180 views3 answers
Log base c++
C++
0 vote186 views1 answer
Making content editable
C++
3 votes161 views1 answer
Convert refference to pointer c++
C++
0 vote160 views2 answers
Add variable to legend matlab
C++
4 votes176 views2 answers
Max value of double c++
C++
0 vote169 views1 answer
MPI_File_seek
C++
3 votes179 views3 answers
C++ colored output
C++
0 vote200 views1 answer
C++ uint32_t
C++
0 vote174 views2 answers
Print all number between a and b in c++
C++
0 vote221 views5 answers
Palindrome String
C++