算术基本定理的应用:
(1)一个大于1的正整数N,如果它的标准分解式为:
,那么它的正因数个数为
(2) 它的全体正因数之和为
求因子数
#include<iostream>
using namespace std;
#define N 1000
int p[N],a[N];
int main()
{
int n;
cin >> n;
int k = 0;
//n为合数
for(int i = 2; i * i <= n; i++)
if(n % i == 0) {
p[k] = i;
while(n % i == 0) a[k]++,n /= i;
k++;
}
//n为质数
if(n > 1) {
p[k] = n;
a[k] = 1;
k++;
}
int num = 1;
for(int i = 0; i < k; i++)
num *= (1 + a[i]);
cout << num << endl;
return 0;
}
进一步简化
#include<iostream>
using namespace std;
int main()
{
int n;
cin >> n;
int num = 1,a;
for(int i = 2; i * i <= n; i++)
if(n % i == 0) {
a = 0;
while(n % i == 0) a++,n /= i;
num *= (1 + a);
}
if(n > 1) num *= 2;
cout << num << endl;
return 0;
}
求因子和
#include<iostream>
using namespace std;
int main()
{
int n;
cin >> n;
int sum = 1,a;
for(int i = 2; i * i <= n; i++)
if(n % i == 0) {
a = 1;
while(n % i == 0) a *= i,n /= i;
sum *= (a * i - 1) / (i - 1);//等比数列求和
}
if(n > 1) sum *= (1 + n);
cout << sum << endl;
return 0;
}