TLE 70pts求优化，互关

#include <bits/stdc++.h>
using namespace std;
long long n, t[1000005];
int main () {
	scanf ("%lld", &n);
	for (int i = 2; i * i <= n; i++) {
		while (n % i == 0) {
			n /= i;
			t[i]++;
		}
	}
	int p = 2;
	while (!t[p]) {
		p++;
	}
	if (t[p] > 1)
		printf ("%d^%lld", p, t[p]);
	if (t[p] == 1)
		printf ("%lld", p);
	for (int i = p + 1; i <= 1000001; i++) {
		if (t[i] > 1) {
			printf (" * %lld^%lld", i, t[i]);
		}
		if (t[i] == 1) {
			printf (" * %d", i);
		}
	}
	if (n > 1) {
		printf (" * %d", n);
	}
	return 0;
}