45 lines
1.0 KiB
C#
45 lines
1.0 KiB
C#
using System;
|
|
using System.Collections.Generic;
|
|
|
|
namespace PrimeDecomposition
|
|
{
|
|
class Program
|
|
{
|
|
static void Main(string[] args)
|
|
{
|
|
GetPrimes(12);
|
|
}
|
|
|
|
static List<int> GetPrimes(decimal n)
|
|
{
|
|
List<int> storage = new List<int>();
|
|
while (n > 1)
|
|
{
|
|
int i = 1;
|
|
while (true)
|
|
{
|
|
if (IsPrime(i))
|
|
{
|
|
if (((decimal)n / i) == Math.Round((decimal) n / i))
|
|
{
|
|
n /= i;
|
|
storage.Add(i);
|
|
break;
|
|
}
|
|
}
|
|
i++;
|
|
}
|
|
}
|
|
return storage;
|
|
}
|
|
|
|
static bool IsPrime(int n)
|
|
{
|
|
if (n <= 1) return false;
|
|
for (int i = 2; i <= Math.Sqrt(n); i++)
|
|
if (n % i == 0) return false;
|
|
return true;
|
|
}
|
|
}
|
|
}
|