/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 vote191 views1 answer
The program must enter a natural number n from the console and find the number previous to n that is not divisible by 2 , 3 and 5 .
C++
0 vote183 views1 answer
How to remove the % in zsh that show after running c++ file
C++
1 vote194 views1 answer
Multithreading in c++
C++
0 vote195 views1 answer
How to add external library in clion
C++
8 votes193 views2 answers
Cpp print vector
C++
0 vote177 views2 answers
Basic Makefile C++
C++
1 vote172 views1 answer
Goto c++
C++
2 votes169 views1 answer
Get type of an object c++
C++
14 votes187 views5 answers
Create a vector of size n in c++
C++
2 votes130 views1 answer
Ascii to char c++
C++