/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

5 votes310 views3 answers
Int to float c++
C++
0 vote317 views1 answer
Ue4 set size of widget c++
C++
-2 votes353 views4 answers
Function Template in c++
C++
0 vote335 views1 answer
Texorpdfstring math in title latex
C++
1 vote296 views1 answer
Separation between paragraphs latex
C++
0 vote342 views1 answer
Split the array there is an array val of n integers . A good subarray is defined as
C++
0 vote313 views1 answer
Print linked list reverse order in c++
C++
54 votes398 views2 answers
C# toint
C++
3 votes306 views1 answer
Set precision with fixed c++
C++
0 vote317 views1 answer
To toggle (flip the status of) the k-th item of the set
C++