public void FindSumOfAllEvenFibonacciSequencesBelowMax_ShouldWork()
{
int expected = 4613732;
int actual = EvenFibonacciNumbers.SumOfAllFibonacciEvenNumbers(4000000);
Assert.Equal(expected, actual);
}
public void EvenFibonacci_1_0()
{
//Arrange
int limit = 1;
//Act
int result = EvenFibonacciNumbers.Calculate(limit);
//Assert
Assert.Equal(0, result);
}
public void Problem2Solution_4000000_4613732()
{
//Arrange
int limit = 4000000;
//Act
int result = EvenFibonacciNumbers.Calculate(limit);
//Assert
Assert.Equal(4613732, result);
}
public void EvenFibonacci_34_44()
{
//Arrange
int limit = 34;
//Act
int result = EvenFibonacciNumbers.Calculate(limit);
//Assert
Assert.Equal(44, result);
}
public void GivenAnInclusiveUpperNumber_ReturnsCorrectFibonacciSequence(int inclusiveUpper, int[] expectedSequence)
{
// arrange
var sut = new EvenFibonacciNumbers();
// act
var sequence = sut.FindFibonacciSequence(inclusiveUpper);
// assert
Assert.Equal(expectedSequence, sequence);
}
public void TestMethod2()
{
//Arrange
var cutoff = 4_000_000;
var expected = 4613732;
//Act
var res = EvenFibonacciNumbers.Solve(cutoff);
//Assert
Assert.AreEqual(expected, res);
}
public void CalculateSumOfEvenNumbersInSequence_ForFibonnaciSequenceOfTenIterations_ReturnsExpectedValue()
{
// Arrange
const int ExpectedSumOfFirstTenIterations = 44;
var sequence = EvenFibonacciNumbers.GenerateFibonacciSequenceUntillMaxSequenceValue(89);
// Act
var result = EvenFibonacciNumbers.CalculateSumOfEvenNumbersInSequence(sequence);
// Assert
result.ShouldBe(ExpectedSumOfFirstTenIterations);
}
public void GenerateFibonacciSequenceUntillMaxSequenceValue_ForFirstTenIterations_ReturnsExpectedSequence()
{
// Arrange
var sequence = new List <int> {
1, 2, 3, 5, 8, 13, 21, 34, 55, 89
};
// Act
var result = EvenFibonacciNumbers.GenerateFibonacciSequenceUntillMaxSequenceValue(89).ToList();
// Assert
for (var index = 0; index < sequence.Count; index++)
{
result[index].ShouldBe(sequence[index]);
}
}
static void Main(string[] args)
{
StringBuilder description = new StringBuilder("Project Euler");
description.AppendLine("Project Euler provides a large collection of challenges in the domain of computer science and mathematics.");
description.AppendLine("The challenges typically involve writing a small program to figure out the solution");
description.AppendLine("to a clever mathematical formula or equation, such as finding the sum of digits");
description.AppendLine("of all numbers preceding each number in a series.\n");
description.AppendLine("Bellow is a list of the problems to pick from to get a solution for\n");
Console.ForegroundColor = ConsoleColor.Red;
Console.Write(description);
int id = -1;
foreach (var value in Enum.GetValues(typeof(EulerProblems)))
{
Console.ForegroundColor = ConsoleColor.Blue;
Console.Write((int)value + ": " + value + "\n");
id = (int)value;
}
Console.ForegroundColor = ConsoleColor.White;
Console.Write("\nType in a number to get Problems answers.\n");
var input = Console.ReadKey();
Console.WriteLine();
// stops wrong inputs
int number = 0;
while (!Int32.TryParse(input.KeyChar.ToString(), out number) || (number > id || number == 0))
{
Console.Write("\nPick a number from the list of problems.\n");
input = Console.ReadKey();
}
// Get a enum value to check agaisnt list
if (Enum.IsDefined(typeof(EulerProblems), number))
{
var problem = (EulerProblems)number;
Console.Clear();
switch (problem)
{
case EulerProblems.MultiplesOf3And5:
MultiplesOf3And5.SolveMultiples();
break;
case EulerProblems.EvenFibonacciNumbers:
EvenFibonacciNumbers.SolveEvenFibonacci();
break;
case EulerProblems.LargestPrimeFactor:
LargestPrimeFactor.ComputeLargestPrime();
break;
case EulerProblems.LargestPalindromeProduct:
LargestPalindromeProduct.GetLargestPalindrome();
break;
}
}
// pause at the end
Console.Read();
}
public void TestEvenFibonacciNumbers()
{
var actual = EvenFibonacciNumbers.GetSum();
Assert.Equal(4613732, actual);
}
protected void SetUp()
{
_evenFibonacciNumbers = new EvenFibonacciNumbers();
}
