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

major corrections in the files - bad CPPLINT and non-compilable codes

Browse Source
This commit is contained in:
Krishna Vedala
2020-05-25 22:56:38 -04:00
parent 1e5b9f842d
commit baea3b07c1
6 changed files with 145 additions and 203 deletions
Download Patch File Download Diff File Expand all files Collapse all files

46
math/prime_factorization.cpp
View File

@@ -1,67 +1,56 @@
#include <algorithm>
#include <cstring>
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
// Declaring variables for maintaing prime numbers and to check whether a number is prime or not
// Declaring variables for maintaing prime numbers and to check whether a number
// is prime or not
bool isprime[1000006];
vector<int> prime_numbers;
vector<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 j = 2 * i; j <= N; j += i)
isprime[j] = false;
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(make_pair(prime_numbers[i], count));
if (count) factors.push_back(make_pair(prime_numbers[i], count));
}
}
/*
I added a simple UI.
*/
int main()
{
int main() {
int num;
cout << "\t\tComputes the prime factorization\n\n";
cout << "Type in a number: ";
@@ -72,8 +61,7 @@ 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) {
cout << it.first << " " << it.second << endl;
}