36 lines
792 B
C++
36 lines
792 B
C++
#include <bits/stdc++.h>
|
|
|
|
using namespace std;
|
|
|
|
//分解质因数
|
|
const int N = 110;
|
|
|
|
//欧拉筛
|
|
int primes[N], cnt; // primes[]存储所有素数
|
|
bool st[N]; // st[x]存储x是否被筛掉
|
|
void get_primes(int n) {
|
|
for (int i = 2; i <= n; i++) {
|
|
if (!st[i]) primes[cnt++] = i;
|
|
for (int j = 0; primes[j] <= n / i; j++) {
|
|
st[primes[j] * i] = true;
|
|
if (i % primes[j] == 0) break;
|
|
}
|
|
}
|
|
}
|
|
|
|
int main() {
|
|
int n;
|
|
cin >> n;
|
|
get_primes(n);
|
|
int c = 0;
|
|
for (int i = 0; i < cnt; i++) {
|
|
while (n % primes[i] == 0) {
|
|
n /= primes[i];
|
|
cout << primes[i] << " ";
|
|
c++;
|
|
}
|
|
}
|
|
cout << endl;
|
|
cout << c << endl;
|
|
return 0;
|
|
} |