mirror of
https://bitbucket.org/Mattrixwv/projecteulercpp.git
synced 2025-12-07 01:23:57 -05:00
Updated comments and made sure style was consistent
This commit is contained in:
@@ -1,11 +1,11 @@
|
||||
//ProjectEuler/C++/Headers/Problem10.hpp
|
||||
//ProjectEuler/ProjectEulerCPP/Headers/Problem10.hpp
|
||||
//Matthew Ellison
|
||||
// Created: 09-28-18
|
||||
//Modified: 07-14-19
|
||||
//Modified: 07-09-20
|
||||
//Find the sum of all the primes below two million
|
||||
//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,20 +32,25 @@
|
||||
|
||||
class Problem10 : public Problem{
|
||||
private:
|
||||
//Variables
|
||||
//Static variables
|
||||
static uint64_t GOAL_NUMBER;
|
||||
//Instance variables
|
||||
uint64_t sum;
|
||||
public:
|
||||
//Constructor
|
||||
Problem10();
|
||||
virtual void solve();
|
||||
virtual std::string getString() const;
|
||||
virtual void reset();
|
||||
//Returns the sum that was requested
|
||||
uint64_t getSum() const;
|
||||
//Operational functions
|
||||
virtual void solve(); //Solve the problem
|
||||
virtual void reset(); //Reset the problem so it can be run again
|
||||
//Gets
|
||||
virtual std::string getString() const; //Return a string with the solution to the problem
|
||||
uint64_t getSum() const; //Returns the sum that was requested
|
||||
};
|
||||
|
||||
/* Results:
|
||||
The sum of all the primes less than 2000000 is 142913828922
|
||||
It took 162.240 milliseconds to solve this problem.
|
||||
It took an average of 171.141 milliseconds to run this problem over 100 iterations
|
||||
*/
|
||||
|
||||
#endif //PROBLEM10_HPP
|
||||
|
||||
Reference in New Issue
Block a user