Пример #1
0
        public void Verify_Solution_For_TwentyOne_Is_Seven()
        {
            var problem = new ProblemThree();

            long solution = problem.Solve(21);

            Assert.AreEqual(7, solution);
        }
Пример #2
0
        public void Determine_Solution()
        {
            var problem = new ProblemThree();

            long solution = problem.Solve(600851475143);

            Console.WriteLine("Solution = {0}", solution);
        }
Пример #3
0
        public void Verify_Solution_For_TwentyOne_Is_Seven()
        {
            var problem = new ProblemThree();

            long solution = problem.Solve(21);

            Assert.AreEqual(7, solution);
        }
Пример #4
0
        public void Determine_Solution()
        {
            var problem = new ProblemThree();

            long solution = problem.Solve(600851475143);

            Console.WriteLine("Solution = {0}", solution);
        }
        public void GetFibonacciNums_WhenCalled_ShouldReturnFibonacciNums()
        {
            var expected = new long[]
            {
                0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987, 1597, 2584, 4181, 6765, 10946, 17711, 28657, 46368, 75025, 121393,
                196418, 317811, 514229, 832040, 1346269, 2178309, 3524578, 5702887, 9227465, 14930352, 24157817, 39088169, 63245986,
                102334155, 165580141, 267914296, 433494437, 701408733, 1134903170, 1836311903, 2971215073, 4807526976, 7778742049
            };

            var actual = ProblemThree.GetFibonacciNums(50);

            CollectionAssert.AreEqual(expected, actual);
        }
Пример #6
0
 public void Return29AsTheLargestPrimeFactorOf13195()
 => ProblemThree.GetLargestPrimeFactorOf(13195).Should().Be(29);