You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
42 lines
891 B
42 lines
891 B
#include <bits/stdc++.h>
|
|
|
|
using namespace std;
|
|
|
|
//判断是不是质数
|
|
bool isPrime(int n) { //最快的方法
|
|
if (n < 2) return false;
|
|
if (n == 2 || n == 3) return true;
|
|
if (n % 6 != 1 && n % 6 != 5) return false;
|
|
for (int i = 5; i <= floor(sqrt(n)); i += 6)
|
|
if (n % i == 0 || n % (i + 2) == 0)
|
|
return false;
|
|
return true;
|
|
}
|
|
|
|
int main() {
|
|
int n;
|
|
cin >> n;
|
|
cout << n << "=";
|
|
int a[100] = {0};
|
|
|
|
int k = 0;
|
|
for (int i = 2; i <= n / 2; ++i) {
|
|
if (isPrime(i)) {
|
|
a[k] = i;
|
|
k++;
|
|
}
|
|
}
|
|
|
|
for (int i = 0; i < k;) {
|
|
if (n % a[i] == 0) {
|
|
n = n / a[i];
|
|
cout << a[i];
|
|
//这个判断条件需要反复斟酌
|
|
if (n > 1) cout << "*";
|
|
} else {
|
|
i++;
|
|
}
|
|
}
|
|
return 0;
|
|
}
|