判斷一個數(shù)是否為素數(shù)

#include<iostream> #include<vector> #include<math.h> #include<algorithm>/*判斷是否為素數(shù)*/ bool isprime(int n) {bool result;int k = (int)sqrt((double)n); // 只需要循環(huán)到 √n 即可int i = 0;for (i = 2; i <= k; i++){if (n%i == 0)break;}result = (i > k);return result; }void test_isprime() {std::cout << " isprime(2) = " << isprime(2) << '\n';std::cout << " isprime(10) = " << isprime(10) << '\n';std::cout << " isprime(17) = " << isprime(17) << '\n'; }

求一個數(shù)的因數(shù)

/* 尋找所有因數(shù) 包括1和其本身*/ std::vector<int> factorize(int n) {std::vector<int> answer;int k = (int)sqrt((double)n);int i = 0;for (i = 1; i <= k; i++){if (!(n%i)){answer.push_back(i);answer.push_back(n / i);}}sort(answer.begin(), answer.end()); // 利用sort函數(shù)進(jìn)行排序，再輸出，這一步若不是必須可省略std::cout << " The factors of " << n << " are";return answer; }/* 打印vector */ void print_vector(std::vector<int>& vec) {for (auto it = vec.cbegin(); it != vec.cend(); ++it)std::cout << ' ' << *it;std::cout << '\n'; }void test_factorize() {std::vector<int> vf;vf = factorize(2);print_vector(vf);vf = factorize(72);print_vector(vf);vf = factorize(196);print_vector(vf); }

質(zhì)因數(shù)分解

/* 質(zhì)因數(shù)分解 */ std::vector<int> prime_factorize(int n) {std::vector<int> answer;if (n != 2){int k = (int)sqrt((double)n); // 只需要循環(huán)到 √n 即可int i = 0, m = n;for (i = 2; i <= k; i++){while (m%i == 0){m = m / i;answer.push_back(i);}if (m == n)answer.push_back(n);}}elseanswer.push_back(n);std::cout << " The prime factorization of " << n << " are";return answer; }void test_prime_factorize() {std::vector<int> vf;vf = prime_factorize(2);print_vector(vf);vf = prime_factorize(72);print_vector(vf);vf = prime_factorize(196);print_vector(vf); }int main() {test_isprime();test_factorize();test_prime_factorize();return 0; }

結(jié)果

總結(jié)

以上是生活随笔為你收集整理的C++判断是否为素数、求一个数的因数、质因数分解的全部內(nèi)容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網(wǎng)站內(nèi)容還不錯，歡迎將生活随笔推薦給好友。