ProjectEuler/ProjectEulerCPP
1
0
Fork 0
mirror of https://bitbucket.org/Mattrixwv/projecteulercpp.git synced 2025-12-06 17:13:59 -05:00
Code Issues Packages Projects Releases Wiki Activity

Updated comments and made sure style was consistent

Browse Source
This commit is contained in:
Mattrixwv
2020-07-10 13:36:16 -04:00
parent 7257a118d4
commit c72754dcf8
65 changed files with 1160 additions and 747 deletions
Download Patch File Download Diff File Expand all files Collapse all files

24
Source/Problem3.cpp
View File

@@ -1,11 +1,11 @@
//ProjectEuler/C++/Source/Problem3.cpp
//ProjectEuler/ProjectEulerCPP/Source/Problem3.cpp
//Matthew Ellison
// Created: 09-28-18
//Modified: 07-14-19
//Modified: 07-09-20
//The largest prime factor of 600851475143
//Unless otherwise listed all non-standard includes are my own creation and available from https://bibucket.org/Mattrixwv/myClasses
/*
Copyright (C) 2019 Matthew Ellison
Copyright (C) 2020 Matthew Ellison
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU Lesser General Public License as published by
@@ -32,11 +32,14 @@
#include "../Headers/Problem3.hpp"
//The number of which you are trying to find the factors
uint64_t Problem3::GOAL_NUMBER = 600851475143;
//Constructor
Problem3::Problem3() : Problem("What is the largest prime factor of 600851475143?"){
}
//Solve the problem
void Problem3::solve(){
//If the problem has already been solved do nothing and end the function
if(solved){
@@ -55,6 +58,13 @@ void Problem3::solve(){
solved = true;
}
//Reset the problem so it can be run again
void Problem3::reset(){
Problem::reset();
factors.clear();
}
//Return a string with the solution to the problem
std::string Problem3::getString() const{
//If the problem hasn't been solved throw an exception
if(!solved){
@@ -65,6 +75,7 @@ std::string Problem3::getString() const{
return results.str();
}
//Returns the list of factors of the number
std::vector<uint64_t> Problem3::getFactors() const{
//If the problem hasn't been solved throw an exception
if(!solved){
@@ -73,6 +84,7 @@ std::vector<uint64_t> Problem3::getFactors() const{
return factors;
}
//Returns the largest factor of the number
uint64_t Problem3::getLargestFactor() const{
//If the problem hasn't been solved throw an exception
if(!solved){
@@ -82,6 +94,7 @@ uint64_t Problem3::getLargestFactor() const{
return *factors.end();
}
//Returns the number
uint64_t Problem3::getGoalNumber() const{
//If the problem hasn't been solved throw an exception
if(!solved){
@@ -89,8 +102,3 @@ uint64_t Problem3::getGoalNumber() const{
}
return GOAL_NUMBER;
}
void Problem3::reset(){
Problem::reset();
factors.clear();
}