1059. Prime Factors (25)

1059. Prime Factors (25)

#include <istream>
using namespace std;
class CA
{
public:
	void run();
	long int n;
};

void CA::run()
{
	scanf("%d",&n);
	if(n<=1)
	{
		printf("%d=%d",n,n);
		return;
	}
	printf("%d=",n);
	int k=2,cr;
	while(n>1)
	{	
		cr=0;
		while(n%k==0)
		{
			n/=k;
			cr++;
		}
		if(cr>1)
		{
			printf("%d^%d",k,cr);
			if(n>1) printf("*");
		}
		else if(cr==1)
		{
			printf("%d",k);
			if(n>1) printf("*");
		}
		k++;
	}
}

int main()
{
//	freopen("test.in","r",stdin);
	CA *a=new CA;
	a->run();
	return 0;
}