mirror of
https://bitbucket.org/Mattrixwv/projecteulercpp.git
synced 2025-12-06 17:13:59 -05:00
83 lines
3.0 KiB
C++
83 lines
3.0 KiB
C++
//ProjectEuler/ProjectEulerCPP/Headers/Problem8.hpp
|
|
//Matthew Ellison
|
|
// Created: 09-28-18
|
|
//Modified: 07-09-20
|
|
//Find the thirteen adjacent digits in the 1000-digit number that have the greatest product. What is the value of this product?
|
|
/*
|
|
73167176531330624919225119674426574742355349194934
|
|
96983520312774506326239578318016984801869478851843
|
|
85861560789112949495459501737958331952853208805511
|
|
12540698747158523863050715693290963295227443043557
|
|
66896648950445244523161731856403098711121722383113
|
|
62229893423380308135336276614282806444486645238749
|
|
30358907296290491560440772390713810515859307960866
|
|
70172427121883998797908792274921901699720888093776
|
|
65727333001053367881220235421809751254540594752243
|
|
52584907711670556013604839586446706324415722155397
|
|
53697817977846174064955149290862569321978468622482
|
|
83972241375657056057490261407972968652414535100474
|
|
82166370484403199890008895243450658541227588666881
|
|
16427171479924442928230863465674813919123162824586
|
|
17866458359124566529476545682848912883142607690042
|
|
24219022671055626321111109370544217506941658960408
|
|
07198403850962455444362981230987879927244284909188
|
|
84580156166097919133875499200524063689912560717606
|
|
05886116467109405077541002256983155200055935729725
|
|
71636269561882670428252483600823257530420752963450
|
|
*/
|
|
//Unless otherwise listed all non-standard includes are my own creation and available from https://bibucket.org/Mattrixwv/myClasses
|
|
/*
|
|
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
|
|
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 PROBLEM8_HPP
|
|
#define PROBLEM8_HPP
|
|
|
|
|
|
#include <cinttypes>
|
|
#include <string>
|
|
#include <vector>
|
|
#include "Problem.hpp"
|
|
|
|
|
|
class Problem8 : public Problem{
|
|
private:
|
|
//Variables
|
|
//Static variables
|
|
static std::string number; //The number that we are working with
|
|
//Instance variables
|
|
std::string maxNums; //Holds the string of the largest product
|
|
uint64_t maxProduct; //Holds the largest product of 13 numbers
|
|
public:
|
|
//Constructor
|
|
Problem8();
|
|
//Operational functions
|
|
virtual void solve(); //Solve the problem
|
|
virtual void reset(); //Reset the problem so it can be run again
|
|
//Gets
|
|
std::string getLargestNums() const; //Returns the string of numbers that produces the largest product
|
|
uint64_t getLargestProduct() const; //Returns the requested product
|
|
};
|
|
|
|
|
|
/* Results
|
|
The greatest product is 23514624000
|
|
The numbers are 5576689664895
|
|
It took an average of 129.024 microseconds to run this problem over 100 iterations
|
|
*/
|
|
|
|
#endif //PROBLEM8_HPP
|