/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 vote208 views1 answer
Sinh nhi phan c++
C++
5 votes183 views3 answers
Pneumonia
C++
0 vote189 views2 answers
Opencv combine video
C++
0 vote216 views1 answer
How to write a template c++
C++
0 vote199 views1 answer
C++ rename function
C++
1 vote199 views1 answer
OPA in expanse
C++
1 vote177 views1 answer
Terminal compile c++
C++
0 vote214 views1 answer
Write a CPP program to calculate sum of first N natural numbers
C++
5 votes219 views6 answers
If arduino
C++
6 votes211 views2 answers
Create dynamic array c++
C++