/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 vote247 views1 answer
Fast input and output c++
C++
0 vote181 views1 answer
Argsort c++
C++
-1 vote150 views1 answer
Cast c++
C++
2 votes162 views3 answers
Digit sum c++
C++
0 vote146 views2 answers
C ++ splitlines
C++
0 vote158 views1 answer
Deal with bad input cpp
C++
1 vote146 views1 answer
How to traverse a linked list in c++
C++
1 vote163 views1 answer
Expected number of trials to get n consecutive heads
C++
267 votes310 views1 answer
Visual studio c++ compiler
C++
0 vote164 views1 answer
How to adjust and delete memory in c, c++
C++