Prime Factorization
#include <bits/stdc++.h>
using namespace std;
void primeFactors(int n)
{ while (n % 2 == 0)
{
cout << 2 << " ";
n = n/2;
}
for (int i = 3; i <= sqrt(n); i = i + 2)
{
while (n % i == 0) {
cout << i << " ";
n = n/i;
}
}
if (n > 2)
cout << n << " ";
}
int main()
{
int n;
cin>>n;
primeFactors(n);
return 0;
} //Enter Your Code Here...
More Articles of Ramniwash Kumar:
| Name | Views | Likes |
|---|---|---|
| Sieve of Eratosthenes | 208 | 1 |
| Prime Factorization | 1311 | 1 |
Comments