//ProjectEuler/C++/Headers/Problem23.hpp
//Matthew Ellison
// Created: 11-09-18
//Modified: 07-14-19
//Find the sum of all the positive integers which cannot be written as the sum of two abundant numbers
//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 PROBLEM23_HPP
#define PROBLEM23_HPP


#include <vector>
#include <cinttypes>
#include <string>
#include "Problem.hpp"


class Problem23 : public Problem{
private:
	static int MAX_NUM;
	std::vector<uint64_t> divisorSums;	//This gives the sum of the divisors at subscripts
	uint64_t sum;	//The sum of all the numbers we are looking for
	//A function that returns true if num can be created by adding two elements from abund and false if it cannot
	bool isSum(const std::vector<int>& abund, int num);
public:
	Problem23();
	virtual void solve();
	virtual std::string getString() const;
	//Returns the sum of the numbers asked for
	uint64_t getSum() const;
};

/* Results:
The answer is 4179871
It took 4.888 seconds to solve this problem.
*/

#endif //PROBLEM23_HPP