mirror of
https://bitbucket.org/Mattrixwv/projecteulercpp.git
synced 2025-12-07 09:33:57 -05:00
Updated to work with the new libraries
This commit is contained in:
@@ -1,11 +1,11 @@
|
||||
//ProjectEuler/ProjectEulerCPP/headers/Problems/Problem17.hpp
|
||||
//Matthew Ellison
|
||||
// Created: 10-05-18
|
||||
//Modified: 08-28-20
|
||||
//Modified: 07-02-21
|
||||
//If all the numbers from 1 to 1000 (one thousand) inclusive were written out in words, how many letters would be used?
|
||||
//Unless otherwise listed all non-standard includes are my own creation and available from https://bibucket.org/Mattrixwv/myClasses
|
||||
/*
|
||||
Copyright (C) 2020 Matthew Ellison
|
||||
Copyright (C) 2021 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
|
||||
@@ -50,12 +50,15 @@ public:
|
||||
virtual void solve(); //Solve the problem
|
||||
virtual void reset(); //Reset the problem so it can be run again
|
||||
//Gets
|
||||
virtual std::string getResult(); //Return a string with the solution to the problem
|
||||
virtual std::string getResult() const; //Return a string with the solution to the problem
|
||||
uint64_t getLetterCount() const; //Returns the number of letters asked for
|
||||
};
|
||||
|
||||
|
||||
/* Results:
|
||||
The number of letters is 21124
|
||||
It took an average of 220.126 microseconds to run this problem over 100 iterations
|
||||
*/
|
||||
|
||||
#endif //Problem17_HPP
|
||||
|
||||
#endif //Problem17_HPP
|
||||
|
||||
Reference in New Issue
Block a user