mirror of
https://bitbucket.org/Mattrixwv/projecteulercpp.git
synced 2025-12-06 17:13:59 -05:00
51 lines
1.4 KiB
C++
51 lines
1.4 KiB
C++
//ProjectEuler/C++/Headers/Problem10.hpp
|
|
//Matthew Ellison
|
|
// Created: 09-28-18
|
|
//Modified: 07-14-19
|
|
//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
|
|
|
|
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
|
|
the Free Software Foundation, either version 3 of the License, or
|
|
(at your option) any later version.
|
|
|
|
This program is distributed in the hope that it will be useful,
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
GNU Lesser General Public License for more details.
|
|
|
|
You should have received a copy of the GNU Lesser General Public License
|
|
along with this program. If not, see <https://www.gnu.org/licenses/>.
|
|
*/
|
|
|
|
#ifndef PROBLEM10_HPP
|
|
#define PROBLEM10_HPP
|
|
|
|
|
|
#include <cinttypes>
|
|
#include <string>
|
|
#include "Problem.hpp"
|
|
|
|
|
|
class Problem10 : public Problem{
|
|
private:
|
|
static uint64_t GOAL_NUMBER;
|
|
uint64_t sum;
|
|
public:
|
|
Problem10();
|
|
virtual void solve();
|
|
virtual std::string getString() const;
|
|
//Returns the sum that was requested
|
|
uint64_t getSum() const;
|
|
};
|
|
|
|
/* Results:
|
|
The sum of all the primes less than 2000000 is 142913828922
|
|
It took 162.240 milliseconds to solve this problem.
|
|
*/
|
|
|
|
#endif //PROBLEM10_HPP
|