/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

148 votes453 views10 answers
Grepper
C++
0 vote272 views1 answer
Pointeur cpp
C++
1 vote287 views1 answer
C++ copy file to another directory
C++
0 vote275 views1 answer
Hamming distance c++
C++
0 vote285 views1 answer
Wgat is duble in c++
C++
1 vote259 views1 answer
Qt qimage load from file
C++
0 vote267 views2 answers
C++ program to find prime number using function
C++
2 votes268 views2 answers
What is typedef
C++
0 vote297 views1 answer
Cpp pointer to two dimensional array
C++
0 vote264 views1 answer
Flake8 max line length
C++