mirror of
https://bitbucket.org/Mattrixwv/projecteulercpp.git
synced 2025-12-07 01:23:57 -05:00
61 lines
2.1 KiB
C++
61 lines
2.1 KiB
C++
//ProjectEuler/C++/Headers/Problem12.hpp
|
|
//Matthew Ellison
|
|
// Created: 09-27-18
|
|
//Modified: 07-14-19
|
|
//What is the value of the first triangle number to have over five hundred divisors?
|
|
//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 PROBLEM12_HPP
|
|
#define PROBLEM12_HPP
|
|
|
|
|
|
#include <vector>
|
|
#include <cinttypes>
|
|
#include <string>
|
|
#include "Problem.hpp"
|
|
|
|
|
|
class Problem12 : public Problem{
|
|
private:
|
|
static uint64_t GOAL_DIVISORS; //The number of divisors that you want
|
|
int64_t sum; //The sum of the numbers up to counter
|
|
int64_t counter; //The next number to be added to sum
|
|
std::vector<int64_t> divisors; //Holds the divisors of the triangular number sum
|
|
public:
|
|
Problem12();
|
|
virtual void solve();
|
|
virtual std::string getString() const;
|
|
virtual void reset();
|
|
//Returns the triangular number
|
|
int64_t getTriangularNumber() const;
|
|
//Get the final number that was added to the triangular number
|
|
int64_t getLastNumberAdded() const;
|
|
//Returns the list of divisors of the requested number
|
|
std::vector<int64_t> getDivisorsOfTriangularNumber() const;
|
|
//Returns the number of divisors of the requested number
|
|
size_t getNumberOfDivisors() const;
|
|
};
|
|
|
|
|
|
/* Results:
|
|
The triangular number 76576500 is a sum of all numbers >= 12375 and has 576 divisors
|
|
It took 262.765 milliseconds to solve this problem.
|
|
*/
|
|
|
|
#endif //PROBLEM12_HPP
|