n \sqrt[]{n} n算法
vector<int>a;
for (int i = 2;i * i <= n;i++) {
if (n % i == 0) {
while (n % i == 0)n /= i;
a.push_back(i);
}
}
if (n != 1)a.push_back(n);
n \sqrt[]{n} n算法
vector<int>a;
for (int i = 2;i * i <= n;i++) {
if (n % i == 0) {
while (n % i == 0)n /= i;
a.push_back(i);
}
}
if (n != 1)a.push_back(n);