blob: 034a9751185af49d7b484d019e580bff35c2365f (
plain)
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
|
#include <iostream>
#include <cmath>
#include <vector>
using namespace std;
void is_prime(int);
void print_vector(vector<int>);
void is_prime(int x) {
int original = x;
vector<int> primes, factors;
primes.push_back(2);
primes.push_back(3);
for(int i = 5; i <= x; i++) {
bool itsPrime = false;
for(int j = 0; j < primes.size(); j++) {
if(i % primes[j] == 0) {
itsPrime = false;
break;
} else {
itsPrime = true;
}
}
if(itsPrime) {
primes.push_back(i);
}
}
// cout << "Prime numbers to consider: ";
// print_vector(primes);
while(x != 1) {
for(int l = 0; l < primes.size(); l++) {
if(x % primes[l] == 0) {
factors.push_back(primes[l]);
x = x / primes[l];
break;
}
}
}
cout << "Factors of " << original << ": ";
print_vector(factors);
}
void print_vector(vector<int> v) {
for(int k = 0; k < v.size(); k++) {
cout << v[k] << " ";
}
cout << endl;
}
int main() {
is_prime(103);
return 0;
}
|
