For example, d(12)=6 because 1,2,3,4,6,12 are all 12 's divisors.
In this problem, given l,r and k , your task is to calculate the following thing :
\begin{eqnarray*} \left(\sum_{i=l}^r d(i^k)\right)\bmod 998244353 \end{eqnarray*}
In each test case, there are 3 integers l,r,k(1\leq l\leq r\leq 10^{12},r-l\leq 10^6,1\leq k\leq 10^7) .
3 1 5 1 1 10 2 1 100 3
10 48 2302题解:刚开始的时候只是知道这样一条性质 代表因子个数。如题。求l-r的d的因子总数idea:设n=p1c1p2c2...pmcm,则d(nk)=(kc1+1)(kc2+1)...(kcm+1)。于是就用素数筛跑了一下,从l到r遍历怎么改都是TLE,我以为后面的素数其实没几个,但是也就是内几个得从头遍历到尾,所以会TLE。所以可以先跑合数,再跑素数,因为素数的因子只有k+1个,跟素数筛类似,例如可以先将合数中可以除2的先出掉,在除3的....
#include <bits/stdc++.h> using namespace std; typedef long long ll; const ll mod = 998244353; const ll maxn = 1e6+10; ll prim[maxn+10],vis[maxn+10],cnt; ll a[maxn],b[maxn]; void getprim(){ memset(vis,0,sizeof(vis)); vis[1] = 1; for(ll i = 2;i < maxn ; i++){ if(!vis[i]){ prim[cnt++] = i; } for(int j=0;j<cnt&&i*prim[j]<maxn;j++){ vis[i*prim[j]] = 1; if(i%prim[j]==0){ break; } } } } main() { int t; ll l,r,k; cnt = 0; getprim(); while(~scanf("%d",&t)){ // for(int i=0;i<cnt;i++) cout<<prim[i]<<" "; while(t--){ scanf("%lld %lld %lld",&l,&r,&k); memset(a,0,sizeof(a)); memset(b,0,sizeof(b)); for(ll i=l;i<=r;i++){ a[i-l] = 1; b[i-l] = i; } for(ll i=0;i<cnt&&prim[i]*prim[i]<=r;i++){ ll tmp = l; if(tmp%prim[i]) tmp =( tmp/prim[i] + 1)*prim[i];//是为了第一个正好是prim[i] 的倍数 for(ll j = tmp;j<=r;j+=prim[i]){ ll ans = 0; if(b[j-l]%prim[i]==0){ while(b[j-l]%prim[i]==0){ b[j-l] = b[j-l] /prim[i]; ans = (ans + 1) % mod; } //cout<<ans<<endl; a[j-l] = a[j-l] * (ans * k + 1) % mod; } } } // for(int i=0;i<=r-l;i++){ // cout<<a[i]<<" "<<b[i]<<endl;; // } ll ans = 0; for(ll i=0;i<=r-l;i++){ if(a[i] == 1&&b[i]!=1){ ans = (ans + (k+1))%mod; }else{ if(b[i]!=1){ ans = (ans + a[i] *(k + 1))%mod; }else{ ans = (ans + a[i])%mod; } } } printf("%d\n",ans); } } }