1210：因子分解

本文主要是介绍1210：因子分解，希望对大家解决编程问题提供一定的参考价值，需要的开发者们随着小编来一起学习吧！

通过代码：

#include <bits/stdc++.h>
using namespace std;
int n;
vector<int> prime;
vector<int> fact;
bool isPrime(int _n) {for(int i = 2; i * i <= _n; i ++)if(_n % i == 0)return false;return true;
}
int main() {for(int i = 2; i <= 100; i ++)if(isPrime(i)) prime.push_back(i);scanf("%d", &n);while(n != 1) for(int i = 0; i < prime.size(); i ++)if(n % prime.at(i) == 0){n /= prime.at(i);fact.push_back(prime[i --]);}int amount = 1;for(int i = 0; i < fact.size(); i ++) {if(i == 0) printf("%d", fact.at(0));else if(fact.at(i) == fact.at(i - 1)) {amount ++;if(i == fact.size() - 1) printf("^%d", amount);continue;} else {if(amount == 1)printf("*%d", fact.at(i));else {printf("^%d*%d", amount, fact.at(i));amount = 1;}}}return 0;
}

这篇关于1210：因子分解的文章就介绍到这儿，希望我们推荐的文章对编程师们有所帮助！

---