static void Main(string[] args)
{
// https://www.codewars.com/kata/primes-in-numbers/train/csharp
// input: 7775460
// output: "(2**2)(3**3)(5)(7)(11**2)(17)"
for (int i = 1; i < 7775460; i++)
{
foreach (var item in PrimeDecomp.DividerFinder(i))
{
Console.Write("{0} ", item);
}
Console.WriteLine(PrimeDecomp.Dividers(i));
}
//PrimeDecomp.Dividers(2);
//PrimeDecomp.Dividers(2);
//PrimeDecomp.Dividers(7775460);
Console.ReadKey();
}
public void Test1()
{
int lst = 7775460;
Assert.AreEqual("(2**2)(3**3)(5)(7)(11**2)(17)", PrimeDecomp.factors(lst));
}
public void Test7()
{
int lst = 987654321;
Assert.AreEqual("(3**2)(17**2)(379721)", PrimeDecomp.factors(lst));
}
public void Test6()
{
int lst = 123456789;
Assert.AreEqual("(3**2)(3607)(3803)", PrimeDecomp.factors(lst));
}
public void Test5()
{
int lst = 342217392;
Assert.AreEqual("(2**4)(3)(11)(43)(15073)", PrimeDecomp.factors(lst));
}
public void Test4()
{
int lst = 933555431;
Assert.AreEqual("(7537)(123863)", PrimeDecomp.factors(lst));
}
public void Test3()
{
int lst = 17 * 17 * 93 * 677;
Assert.AreEqual("(3)(17**2)(31)(677)", PrimeDecomp.factors(lst));
}
public void Test2()
{
int lst = 7919;
Assert.AreEqual("(7919)", PrimeDecomp.factors(lst));
}
