思路分析
- 在上一篇求整数的约数个数.的文章中,我们开一个存放整数约数个数的数组,利用线性筛的筛选素数的过程,对任意整数约数个数进行标记。
- 同样的思路, 我们这里可以开一个存放整数约数和的数组, 利用线性筛筛选素数过程,对任意整数约数的和进行标记,
代码如下
#include<iostream>
#include<cmath>
using namespace std;
#define max_n 100
int prime[max_n + 5] = {0};
int factor[max_n + 5] = {0};
int sum[max_n + 5] = {0};
void init() {
for (int i = 2; i <= max_n; ++i) {
if (!prime[i]) {
prime[++prime[0]] = i;
factor[i] = 2;
sum[i] = i + 1;
}
for (int j = 1; j <= prime[0]; j++) {
if (i * prime[j] > max_n) break;
prime[i * prime[j]] = 1;
if (i % prime[j] == 0) {
int a = i, cnt = 0;
while (a % prime[j] == 0) a /= prime[j], cnt++;
factor[i * prime[j]] = factor[i] / (cnt + 1) * (cnt + 2);
sum[i * prime[j]] = ((int)pow(prime[j], cnt + 2) - 1) * sum[i] / ((int)pow(prime[j], cnt + 1) - 1);
break;
} else {
factor[i * prime[j]] = factor[i] * factor[prime[j]];
sum[i * prime[j]] = sum[i] * (prime[j] + 1);
}
}
}
}
int main(){
init();
for (int i = 2; i <= max_n; ++i) {
cout << "i = " << i << " factor = " << factor[i] << endl;
cout << "i = " << i << " sum = " << sum[i] << endl;
}
return0;
}