Horje
prime factorisation of a number in c++ Code Example
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;
}



Cpp

Related
input full line as input in cpp Code Example input full line as input in cpp Code Example
Character cin(userInput) in c++ Code Example Character cin(userInput) in c++ Code Example
cin does not wait for input Code Example cin does not wait for input Code Example
phph date Code Example phph date Code Example
how to find product of a given numbers in c++ Code Example how to find product of a given numbers in c++ Code Example

Type:
 Code Example
Category:
 Coding
Sub Category:
 Code Example
Uploaded by:
 Admin
Views:
 8



 

Horje