/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 vote118 views7 answers
C++ convert to assembly language
C++
0 vote150 views1 answer
Visual studio code include path not working c++
C++
0 vote125 views1 answer
C++ const shared_ptr
C++
0 vote152 views1 answer
What is 10 + (-4)
C++
1 vote131 views1 answer
Comentar todas linhas de uma vez vs code
C++
0 vote183 views1 answer
C++ functions dynamic vector
C++
0 vote153 views1 answer
Check if equal to \ char or not c++
C++
0 vote148 views1 answer
Kmp c++
C++
3 votes80 views1 answer
(a) one-dimensional arrays and multidimensional arrays in c++
C++
0 vote120 views1 answer
If(arr[i]==k) return arr[i];
C++