project-euler

https://projecteuler.net/
Log | Files | Refs | README

commit 9b1c6a0fc8b668477094d926975a94e9f0c90140
parent 644a8c74c30a358d8b91711d990a69c5364eff6b
Author: mpizzzle <m@michaelpercival.xyz>
Date:   Sun, 27 Sep 2020 22:13:32 +0100

cleanup

Diffstat:
MEuler_95.cpp | 9---------
1 file changed, 0 insertions(+), 9 deletions(-)

diff --git a/Euler_95.cpp b/Euler_95.cpp @@ -15,8 +15,6 @@ int Euler::AmicableChains() } } - //std::cout << std::endl << "precalc done." << std::endl; - for (int n = 1; n <= one_million; ++n) { int length = 0; int candidate = one_million; @@ -32,7 +30,6 @@ int Euler::AmicableChains() if (slow_ptr == fast_ptr) { while (true) { - std::cout << slow_ptr << " -> "; length++; fast_ptr = divisors[fast_ptr]; @@ -44,12 +41,6 @@ int Euler::AmicableChains() if (length > longest) { solution = candidate; longest = length; - std::cout << "chicken dinner!" << std::endl; - std::cout << "current solution: " << solution << std::endl; - std::cout << std::endl << "current length: " << length << std::endl; - } - else { - std::cout << "not a winner." << std::endl; } divisors[candidate] = 1;