Breaking News: Grepper is joining You.com. Read the official announcement!

Prime power factorization

MO77_LXXVII answered on July 5, 2023 Popularity 2/10 Helpfulness 9/10

answer Prime power factorization

Prime power factorization

Comment

vector<pair<int, int>> factors;
void prime_power_factorization(int n)
{
    for (int i = 2; i * i <= n; i++)
    {
        if (n % i == 0)
        {
            int count = 0;
            while (n % i == 0)
            {
                n /= i;
                count++;
            }
            factors.push_back({i, count});
        }
    }
    if (n > 1)
        factors.push_back({n, 1});
}

void coutf()
{
    for (auto i : factors)
        cout << i.first << "^" << i.second << " ";
}


// in main
prime_power_factorization(72);
coutf() // 2^3 3^2

Popularity 2/10 Helpfulness 9/10 Language cpp

Source: Grepper

Tags: c++

Link to this answer
Share Copy Link

Contributed on Jul 05 2023

MO77_LXXVII

0 Answers Avg Quality 2/10

Continue with Google

By continuing, I agree that I have read and agree to Greppers's Terms of Service and Privacy Policy.

Prime power factorization

Contents

More Related Answers

Prime power factorization

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.