/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

8 votes145 views2 answers
Cpp print vector
C++
0 vote155 views1 answer
How to declare a vector of int in c++
C++
0 vote151 views1 answer
How to use qdebug c++
C++
1 vote238 views1 answer
Eosio require_find
C++
25 votes160 views5 answers
Sort vector in descending order c++
C++
0 vote145 views1 answer
C++ measure time in microseconds
C++
1 vote161 views1 answer
Isalpha c++
C++
2 votes148 views1 answer
Clear buffer memory in c / c++
C++
4 votes155 views1 answer
Passing array to function c++ pointer
C++
15 votes150 views4 answers
C++ vector
C++