Solved Best Divisor and Restaurant.

Author: jonasraoni

README.md

@@ -122,6 +122,7 @@ Note: Few codes were solved in C# (I've written them a long time ago), I'll conv
 ### [Fundamentals](mathematics/fundamentals)
 
 - [Army Game](mathematics/fundamentals/gameWithCells.js)
+- [Best Divisor](mathematics/fundamentals/bestDivisor.js)
 - [Connecting Towns](mathematics/fundamentals/connectingTowns.js)
 - [Cutting Paper Squares](mathematics/fundamentals/cuttingPapersSquare.js)
 - [Find the Point](mathematics/fundamentals/findPoint.js)
@@ -130,6 +131,7 @@ Note: Few codes were solved in C# (I've written them a long time ago), I'll conv
 - [Leonardo's Prime Factors](mathematics/fundamentals/primeCount.js)
 - [Maximum Draws](mathematics/fundamentals/maximumDraws.js)
 - [Minimum Height Triangle](mathematics/fundamentals/lowestTriangle.js)
+- [Restaurant](mathematics/fundamentals/restaurant.js)
 - [Sherlock and Moving Tiles](mathematics/fundamentals/movingTiles.js)
 - [Summing the N Series](mathematics/fundamentals/summingSeries.js)
 

mathematics/fundamentals/bestDivisor.js

@@ -0,0 +1,21 @@
+//+ Jonas Raoni Soares Silva
+//@ http://raoni.org
+
+function bestDivisor(n) {
+	let bestSum = 0;
+	let bestNumber = 0;
+	for (let i = n + 1; --i; ) {
+		// Look for a divisor
+		if (!(n % i)) {
+			// Lazy way to get the sum of digits (didn't want to go the Math way: "dividing by 10")
+			const sum = [...`${i}`].reduce((t, v) => t += +v, 0);
+			if (sum > bestSum) {
+				bestSum = sum;
+				bestNumber = i;
+			}
+			else if (sum === bestSum && i < bestNumber)
+				bestNumber = i;
+		}
+	}
+	return bestNumber;
+}

mathematics/fundamentals/restaurant.js

@@ -0,0 +1,17 @@
+//+ Jonas Raoni Soares Silva
+//@ http://raoni.org
+
+function restaurant(l, b) {
+	const gcd = function(...o){
+		let l = o.length;
+		if(!l)
+			return 0;
+		let max = o[l - 1];
+		for (let i = l - 1; i--; )
+			for (let n = o[i], r; r = n % (n = max); max = r);
+		return max;
+	};
+	// In order to divide something in equal pieces, both the width and the length should be divisible by the same number, as we need the biggest, there's the greatest common divisor
+	const maxDivisor = gcd(l, b);
+	return (l / maxDivisor) * (b / maxDivisor);
+}