/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 vote278 views1 answer
C++ count vector elements
C++
14 votes285 views4 answers
Converting to string c++
C++
0 vote271 views1 answer
Call to constructor of 'extClockType' is ambiguous extClockType time2;
C++
15 votes259 views4 answers
How to make a random number in c++
C++
1 vote277 views1 answer
Sum of stack c++
C++
0 vote258 views1 answer
Unreal engine delay c++
C++
1 vote272 views1 answer
Why are inline keyword in header c++
C++
7 votes277 views3 answers
C++ replace
C++
0 vote282 views1 answer
Sync_with_stdio
C++
1 vote292 views1 answer
Qt label set text color
C++