std::vector<std::pair<int, int>>
factors;
27 for(
inti = 2; i <= N; i++) {
29 for(
intj = 2 * i; j <= N; j += i)
isprime[j] =
false;
33 for(
inti = 2; i <= N; i++) {
64std::cout <<
"\t\tComputes the prime factorization\n\n";
65std::cout <<
"Type in a number: ";
74std::cout << it.first <<
" "<< it.second << std::endl;
void prime_factorization(int num)
std::vector< std::pair< int, int > > factors
std::vector< int > prime_numbers
void SieveOfEratosthenes(int N)
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4