-
Notifications
You must be signed in to change notification settings - Fork 11
/
Copy pathprimefactorize.cpp
88 lines (83 loc) · 1.71 KB
/
primefactorize.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
#include <iostream>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
string toString(int a){
ostringstream g;
g << a;
return g.str();
}
void printVector(vector<int> v){
string output = "{";
for (int i=0;i<v.size();i++){
ostringstream a;
a << v[i];
if (i==(v.size()-1)){
output += a.str() +"}";
}
else{
output += a.str() + ", ";
}
}
cout <<output<<endl;
}
vector<int> Factors(int num){
vector<int> f;
for (int i=1;i<=num;++i){
if (num%i==0){
f.push_back(i);
}
}
return f;
}
bool isprime(int num){
if (Factors(num).size()==2){
return true;
}
else{
return false;
}
}
vector<int> primeFactors(vector<int> f){
vector<int> r;
for (int i=0;i<f.size();++i){
if (isprime(f[i])){
r.push_back(f[i]);
}
}
return r;
}
vector<int> primeFactors(int a){
vector<int> r;
vector<int> f = Factors(a);
for (int i=0;i<f.size();++i){
if (isprime(f[i])){
r.push_back(f[i]);
}
}
return r;
}
string primeFactorize(int num){
vector<int> factors = primeFactors(num);
if (isprime(num)){
return toString(num);
}
else{
return toString(factors[0])+"*"+primeFactorize(num/factors[0]);
}
}
int main()
{
cout << "Welcome to Prime Factorizer.. Keep entering your numbers to prime factorize or enter -1 to quit" << endl;
int num=0;
cout << "Enter the numbers below"<<endl;
while (num!=-1){
if (num!=0){
cout << primeFactorize(num)<<endl;
}
cout << ">>>";
cin >> num;
}
return 0;
}