/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

7 votes345 views5 answers
Stack in c++
C++
0 vote315 views1 answer
Void linux java
C++
0 vote359 views1 answer
Omp multiple reductions
C++
1 vote381 views2 answers
Read comma separated text file in c++
C++
0 vote347 views2 answers
Find prime number c++
C++
1 vote328 views1 answer
How to create a pair of double quotes in c++
C++
0 vote359 views1 answer
C++ program to find gcd of 3 numbers
C++
3 votes389 views3 answers
C++ string contains
C++
0 vote358 views1 answer
Add for input output file in c/c++
C++
0 vote360 views1 answer
Ex: cpp
C++