backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-04-15 11:20:05 +08:00
Code Issues Projects Releases Wiki Activity

formatting source-code for d7af6fdc8c

Browse Source
This commit is contained in:
github-actions
2020-05-29 23:26:30 +00:00
parent edb3d51ec2
commit 7ad1f171c1
176 changed files with 5342 additions and 4288 deletions
Download Patch File Download Diff File Expand all files Collapse all files

36
math/prime_factorization.cpp
View File

@@ -20,44 +20,55 @@ std::vector<std::pair<int, int>> factors;
/** Calculating prime number upto a given range
*/
void SieveOfEratosthenes(int N) {
void SieveOfEratosthenes(int N)
{
// initializes the array isprime
memset(isprime, true, sizeof isprime);
for (int i = 2; i <= N; i++) {
if (isprime[i]) {
for (int i = 2; i <= N; i++)
{
if (isprime[i])
{
for (int j = 2 * i; j <= N; j += i) isprime[j] = false;
}
}
for (int i = 2; i <= N; i++) {
if (isprime[i]) prime_numbers.push_back(i);
for (int i = 2; i <= N; i++)
{
if (isprime[i])
prime_numbers.push_back(i);
}
}
/** Prime factorization of a number */
void prime_factorization(int num) {
void prime_factorization(int num)
{
int number = num;
for (int i = 0; prime_numbers[i] <= num; i++) {
for (int i = 0; prime_numbers[i] <= num; i++)
{
int count = 0;
// termination condition
if (number == 1) {
if (number == 1)
{
break;
}
while (number % prime_numbers[i] == 0) {
while (number % prime_numbers[i] == 0)
{
count++;
number = number / prime_numbers[i];
}
if (count) factors.push_back(std::make_pair(prime_numbers[i], count));
if (count)
factors.push_back(std::make_pair(prime_numbers[i], count));
}
}
/** Main program */
int main() {
int main()
{
int num;
std::cout << "\t\tComputes the prime factorization\n\n";
std::cout << "Type in a number: ";
@@ -68,7 +79,8 @@ int main() {
prime_factorization(num);
// Prime factors with their powers in the given number in new line
for (auto it : factors) {
for (auto it : factors)
{
std::cout << it.first << " " << it.second << std::endl;
}