/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 vote282 views1 answer
Ue4 c++ add tag
C++
24 votes284 views5 answers
Install heroku
C++
0 vote313 views1 answer
Walk filesystem in c++
C++
-1 vote293 views1 answer
Standard input c++
C++
0 vote307 views1 answer
Esp
C++
0 vote307 views1 answer
Disallowcopy c++
C++
1 vote273 views1 answer
Il2cpp unity stuck c#
C++
0 vote290 views1 answer
Str[i] - '0'
C++
2 votes327 views1 answer
Recursive binary search
C++
2 votes306 views1 answer
C++ time nanoseconds
C++