Skip to content

Fix primes.cpp #101

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
wants to merge 1 commit into
base: master
Choose a base branch
from
Open

Fix primes.cpp #101

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
27 changes: 0 additions & 27 deletions ch5/primes.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -118,7 +118,6 @@ int main() {
printf("\n");

// second part: prime factors
<<<<<<< HEAD
vll r;

r = primeFactors((1LL<<31)-1); // Mersenne prime
Expand Down Expand Up @@ -146,32 +145,6 @@ int main() {
for (auto &pf : r) printf("> %lld\n", pf); // fail to factor! (why?)
printf("\n");


=======
vi r = primeFactors((1LL<<31)-1); // slowest, Mersenne prime
for (auto &pf : r)
printf("> %d\n", pf);
r = primeFactors(136117223861LL); // slow, large prime
for (auto &pf : r)
printf("> %d\n", pf); // 104729*1299709
r = primeFactors(142391208960LL); // faster, large composite
for (auto &pf : r)
printf("> %d\n", pf); // 2^10*3^4*5*7^4*11*13
// r = primeFactors(99999820000081LL); // the limit: 9999991^2
// for (auto &pf : r)
// printf("> %d\n", pf);
// printf("\n");

r = primeFactors(9999973LL*9999973LL); // 9999973^2, the limit
for (auto &pf : r)
printf("> %d\n", pf);
printf("\n");
// r = primeFactors(9999991LL*9999991LL); // 9999991^2, first crash
// for (auto &pf : r)
// printf("> %d\n", pf);
// printf("\n");

>>>>>>> master
// third part: functions involving prime factors
printf("numPF(%d) = %d\n", 60, numPF(60)); // 2^2 * 3^1 * 5^1 => 4
printf("numDiffPF(%d) = %d\n", 60, numDiffPF(60)); // 2^2 * 3^1 * 5^1 => 3
Expand Down