题目大意
定义 f ( x ) = ∑ a = 1 + ∞ ∑ b = 1 + ∞ [ a b ∣ x ] f(x)=\sum_{a=1}^{+\infty}\sum_{b=1}^{+\infty}[ab|x] f(x)=∑a=1+∞∑b=1+∞[ab∣x],求 ∑ i = 1 n f ( i ) \sum_{i=1}^nf(i) ∑i=1nf(i), n ≤ 1 0 11 n\le10^{11} n≤1011
解题分析
嗯……转化一道就是求 a b c ≤ n abc\le n abc≤n的组数,然后……玄学枚举一下?
先枚举最小的a,然后枚举较大的b,统计最大的c个数,然后排列组合,分类讨论了解一下?
时间复杂度 O ( n 2 3 ) O(n^{\frac{2}{3}}) O(n32),诡异……
示例代码
#include<cstdio>
using namespace std;
typedef long long LL;
LL n; int tst;
LL _work(LL n){
LL ans=0;
for (LL a=1;a*a*a<=n;a++)
for (LL b=a;a*b*b<=n;b++){
LL c=n/(a*b); if (c<b) break;
if (a==b) ans+=(c-b)*3+1; else ans+=(c-b)*6+3;
}
return ans;
}
int main()
{
freopen("exam.in","r",stdin);
freopen("exam.out","w",stdout); tst=0;
while (scanf("%lld",&n)==1) printf("Case %d: %lld\n",++tst,_work(n));
return 0;
}