Every positive integer larger than 1 can be uniquely factorized into a product of prime numbers. These prime numbers are called the prime factors. Find all the prime factors of an input integer.
#include<iostream>
#include<cmath>
using namespace std;
int main()
{
int inum, i;
cout<<"Please input a positive interger."<<endl;
cin>>inum;
cout<<inum<<" = ";
for(i = 2; i <= sqrt(inum); i++)
{
if((inum % i == 0) && (inum/i != 1))
{
cout<<i<<"*";
inum = inum/i;
i--;
}
}
cout<<inum<<endl;
return 0;
}
kerins-MacBook-Pro:cpp kerin$ ./test5
Please input a positive interger.
45
45 = 3*3*5
kerins-MacBook-Pro:cpp kerin$ ./test5
Please input a positive interger.
46
46 = 2*23