public void GetFactorsAmount_MaxInt_IsPrime() //!!! 2^n-1 sometimes is prime; 2^32-1 indeed ! { var solver = new CountFactors(); var amount = solver.GetFactorsAmount(int.MaxValue); _outputHelper.WriteLine($"max int has {amount} divisors"); }
public void GetFactorsAmount_Prime_2(int n) { var solver = new CountFactors(); var amount = solver.GetFactorsAmount(n); amount.Should().Be(2); }
public void GetFactorsAmount_Composite_Many(int n, int expected) { var solver = new CountFactors(); var amount = solver.GetFactorsAmount(n); amount.Should().Be(expected); }
public void ShouldCountFactorsOfN(int N, int expected) { CountFactors counter = new CountFactors(); int actual = counter.Count(N); Assert.AreEqual(expected, actual); }
public void GetFactorsAmount_Small_1(int n) { var solver = new CountFactors(); var amount = solver.GetFactorsAmount(n); amount.Should().Be(1); }
public void test_solution_givenN_returnsNumberOfItsFactors(int given, int expected) { var target = new CountFactors(); var actual = target.solution(given); Assert.AreEqual(expected, actual); }
public void GetFactorsAmount_BigInt_Many() { var bigNumber = 2_147_395_600; var solver = new CountFactors(); var amount = solver.GetFactorsAmount(bigNumber); _outputHelper.WriteLine($"{bigNumber} has {amount} divisors"); }
public void WhenSendind24ShouldReturn8() { var expectedValue = 8; var countFactors = new CountFactors(); var actualValue = countFactors.Solution(24); Assert.AreEqual(expectedValue, actualValue); }
public void Basic() { // Arrange int n = 24; int expected = 8; CountFactors solution = new CountFactors(); // Act int result = solution.Solution(n); // Assert Assert.AreEqual(expected, result); }
public void MinValue() { // Arrange int n = 1; int expected = 1; CountFactors solution = new CountFactors(); // Act int result = solution.Solution(n); // Assert Assert.AreEqual(expected, result); }
public void QuadraticValueWithMoreThanThree() { // Arrange int n = 81; int expected = 5; CountFactors solution = new CountFactors(); // Act int result = solution.Solution(n); // Assert Assert.AreEqual(expected, result); }
public void LargestValue() { // Arrange int n = int.MaxValue - 1; int expected = 192; CountFactors solution = new CountFactors(); // Act int result = solution.Solution(n); // Assert Assert.AreEqual(expected, result); }
public void Initialize() { _countFactors = new CountFactors(); }