- 求n的正约数和
唯一分解定理:
N = p 1 a 1 ∗ p 2 a 1 ∗ . . . ∗ p n a n ∗ N=p_{1}^{a_1}*p_{2}^{a_1}*...*p_{n}^{a_n}* N=p1a1∗p2a1∗...∗pnan∗
σ 1 = ( 1 + p 1 + p 1 2 + . . . + p 1 a 1 ) ∗ ( 1 + p 2 + p 2 2 + . . . + p 2 a 2 ) ∗ . . . ∗ ( 1 + p n + p n 2 + . . . + p n a n ) \sigma_{1}=(1+p_1+p_{1}^{2}+...+p_{1}^{a_1})*(1+p_2+p_{2}^{2}+...+p_{2}^{a_2})*...*(1+p_n+p_{n}^{2}+...+p_{n}^{a_n}) σ1=(1+p1+p12+...+p1a1)∗(1+p2+p22+...+p2a2)∗...∗(1+pn+pn2+...+pnan)
故直接写就好了。
- 求前n的个数的约数和
参考博客:
神犇1
约数和函数 :
σ
1
(
n
)
=
∑
d
∣
n
d
\sigma_{1}(n)= \sum_{d|n}d
σ1(n)=∑d∣nd
现在求
∑
i
=
1
n
=
σ
1
(
i
)
\sum_{i=1}^{n}=\sigma_{1}(i)
∑i=1n=σ1(i)
∑ i = 1 n = σ 1 ( i ) = ∑ i = 1 n i ∗ ⌊ n i ⌋ \sum_{i=1}^{n}=\sigma_{1}(i)=\sum_{i=1}^{n}i*\left \lfloor \frac{n}{i} \right \rfloor ∑i=1n=σ1(i)=∑i=1ni∗⌊in⌋
代码1:
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
int main()
{
LL n;
scanf("%lld",&n);
int num=0;
LL ed=1,sum=0;
///整数分块
for(LL a=1;a<=n;a=ed+1)
{
ed=(n/(n/a));
sum+=(a+ed)*(ed-a+1)/2*(n/a);
// num++;
}
printf("%lld\n",sum);
}
神犇2
代码2参考上面的链接,写这个是为了以后自己好回顾:
#include <cstdio>
#include <algorithm>
#include <cstring>
using namespace std;
typedef long long LL:
LL n,i,a,b;
LL sum;
int main(){
while(~scanf("%lld",&n)){
sum = 0;
for(i=1;i*i<=n;i++){
///计算前sqrt(n)的因子i贡献
sum += i * (n / i);
///另一个因子n/i,j属于区间[a,b]内,n/j都相同,故直接算它们的和
b = n/i;
a = n/(i+1)+1;
// printf("a=%lld b=%lld\n",a,b);
///区间[a,b]和的贡献为它们的i倍
sum += (a+b) * (b-a+1) / 2 * i;
}
i--;
if (i == n / i)
sum -= i * (n / i);
printf("%lld\n",sum);
}
return 0;
}