mirror of
https://bitbucket.org/Mattrixwv/projecteulercpp.git
synced 2025-12-06 17:13:59 -05:00
112 lines
3.0 KiB
C++
112 lines
3.0 KiB
C++
//ProjectEuler/C++/Source/Problem12.cpp
|
|
//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/>.
|
|
*/
|
|
|
|
#include <vector>
|
|
#include <cinttypes>
|
|
#include <string>
|
|
#include <sstream>
|
|
#include "Stopwatch.hpp"
|
|
#include "Algorithms.hpp"
|
|
#include "../Headers/Problem.hpp"
|
|
#include "../Headers/Problem12.hpp"
|
|
|
|
|
|
uint64_t Problem12::GOAL_DIVISORS = 500;
|
|
|
|
Problem12::Problem12() : Problem("What is the value of the first triangle number to have over five hundred divisors?"), sum(1), counter(2){
|
|
|
|
}
|
|
|
|
void Problem12::solve(){
|
|
//If the problem has already been solved do nothing and end the function
|
|
if(solved){
|
|
return;
|
|
}
|
|
|
|
//Setup your variables
|
|
bool foundNumber = false; //To flag whether the number has been found
|
|
|
|
//Start the timer
|
|
timer.start();
|
|
|
|
while(!foundNumber){
|
|
divisors = mee::getDivisors(sum);
|
|
//If the number of divisors is correct set the flag. It must be > 500
|
|
if(divisors.size() > GOAL_DIVISORS){
|
|
foundNumber = true;
|
|
}
|
|
//Otherwise add to the sum and increase the next numeber
|
|
else{
|
|
sum += counter;
|
|
++counter;
|
|
}
|
|
}
|
|
|
|
//Stop the timer
|
|
timer.stop();
|
|
|
|
//Throw a flag to show the problem is solved
|
|
solved = true;
|
|
}
|
|
|
|
std::string Problem12::getString() const{
|
|
//If the problem hasn't been solved throw an exception
|
|
if(!solved){
|
|
throw unsolved();
|
|
}
|
|
std::stringstream results;
|
|
results << "The triangular number " << sum << " is a sum of all numbers >= " << counter - 1 << " and has " << divisors.size() << " divisors";
|
|
return results.str();
|
|
}
|
|
|
|
int64_t Problem12::getTriangularNumber() const{
|
|
//If the problem hasn't been solved throw an exception
|
|
if(!solved){
|
|
throw unsolved();
|
|
}
|
|
return sum;
|
|
}
|
|
|
|
int64_t Problem12::getLastNumberAdded() const{
|
|
//If the problem hasn't been solved throw an exception
|
|
if(!solved){
|
|
throw unsolved();
|
|
}
|
|
return counter - 1;
|
|
}
|
|
|
|
std::vector<int64_t> Problem12::getDivisorsOfTriangularNumber() const{
|
|
//If the problem hasn't been solved throw an exception
|
|
if(!solved){
|
|
throw unsolved();
|
|
}
|
|
return divisors;
|
|
}
|
|
|
|
size_t Problem12::getNumberOfDivisors() const{
|
|
//If the problem hasn't been solved throw an exception
|
|
if(!solved){
|
|
throw unsolved();
|
|
}
|
|
return divisors.size();
|
|
}
|