I have got a C++ prolem?

Question

We have to find the prime factors of a no & display it like - for the no 6, the prime factors are 1*2*3.

Answer 1

#include
#include

int prime(int x)
{
int y=sqrt(x);
int j=0;
for(int i=2;i {
if(x%i==0)
y=1;
}
return y
}

int main()
{
int a;
cout<<"Enter Any Number: ";
cin>>a;
cout< for(int i=2;i<=a;i++)
if(a%i==0)
if(prime(i))
cout<<", "< return 0;
}

// Enjoy ;)

Answer 2

1 is not a prime factor btw.
So if n is the number, just search from 2 to (n/2)+1, and see if they are prime and divide with n. If they do then they are prime factors.
There is a theorem which demonstrates that all prime factors for n are located between 2 and (n/2).