//ProjectEuler/C++/Headers/Problem15.hpp
//Matthew Ellison
// Created: 09-29-18
//Modified: 07-14-19
//How many routes from the top left corner to the bottom right corner are there through a 20×20 grid if you can only move right and down?
//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 PROBLEM15_HPP
#define PROBLEM15_HPP


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


class Problem15 : public Problem{
private:
	static int WIDTH;	//The width of the grid
	static int LENGTH;	//The length of the grid
	uint64_t numOfRoutes;	//The number of routes from 0, 0 to 20, 20
	//This function acts as a handler for moving the position on the grid and counting the distance
	//If moves right first, then down
	void move(int currentX, int currentY, uint64_t& numOfRoutes);
public:
	Problem15();
	virtual void solve();
	virtual std::string getString() const;
	//Returns the number of routes found
	uint64_t getNumberOfRoutes() const;
};
/* Results:
The number of routes is 137846528820
It took 10.914 minutes to solve this problem.
*/

#endif //PROBLEM15_HPP