#include <bits/stdc++.h>\nusing namespace std;
\nvector factorsCount;
\nvoid calculateFactorsCount(int n) {\n for (int i = 1; i <= sqrt(n); i++) {\n if (n % i == 0) {\n factorsCount[i]++;\n if (n / i != i) {\n factorsCount[n / i]++;\n }\n }\n }\n}\n\nint main() {\n string a;
getline(cin, a);
\n int maxNum = stoi(a);
factorsCount.resize(maxNum + 1);
\n for (int i = 2; i <= maxNum; i++) {\n if (factorsCount[i] == 0) {\n calculateFactorsCount(i);\n }\n cout << factorsCount[i] << " ";\n }\n \n return 0;\n}

C++ 优化代码:高效计算因子个数

原文地址: https://www.cveoy.top/t/topic/pQev 著作权归作者所有。请勿转载和采集!

免费AI点我,无需注册和登录