HDU5528 - Count a * b

---

做法：求\(\sum_{m|n}(m^2 - \sum_{i=1}^{m}\sum_{j=1}^m [m|(ij)])\)

\(h(m) = \sum_{i=1}^{m}\sum_{j=1}^m [m|(ij)] = \sum_{i=1}^m\sum_{j=1}^m [\frac{m}{(i,m)}|\frac{i}{(i,m)}j]\)
$ = \sum_{i=1}^m\sum_{j=1}^m [\frac{m}{(i,m)}|j] = \sum_{i=1}^m \frac{m}{\frac{m}{(i,m)}} = \sum_{i=1}^m (i,m)$
$ = \sum_{d|m} d \sum_{i=1}^m [(i,m)=d] = \sum_{d|m} d \sum_{i=1}^{\frac{m}ozvdkddzhkzd} [(i,\frac{m}ozvdkddzhkzd)=1] = \sum_{d|m}d\varphi(\frac{m}ozvdkddzhkzd)$

$
\sum_{m|n} \sum_{d|m}d\varphi(\frac{m}ozvdkddzhkzd) = \sum_{d|n}d\sum_{m|\frac{n}ozvdkddzhkzd}\varphi(m) = \sum_{d|n}d\frac{n}ozvdkddzhkzd = \sum_{d|n}n
$
所以\(ans = \sum_{d|n} d^2 - n\sigma_0(n)\)兩個值均為積性函數，預處理素因子，合并答案即可。本題時限較緊，不能直接使用試除法分解，盡量優化常數。

#include <bits/stdc++.h> typedef unsigned long long ll; const int N = 1e6 + 7; inline int read() {char c = getchar(); int x = 0, f = 1;while( ! isdigit(c) ) { if(c == '-') f = -1; c = getchar(); }while( isdigit(c) ) { x = x*10 + c - '0'; c = getchar(); }return x * f; } inline void write( ll x ) {if( x >= 10 ) write( x / 10 );putchar( x % 10 + '0' ); } using namespace std; int T; ll n; int p[N], notp[N]; void init() {notp[1] = 1;for(int i = 2; i <= 1e6; ++i) {if(!notp[i]) p[++p[0]] = i;for(int j = 1; j <= p[0] && p[j]*i <= 1e6; ++j) {notp[i*p[j]] = 1;if(i%p[j] == 0) break;}} } ll solve(ll n) {ll ans = 1, num = 1, tn = n;for(int i = 1; i <= p[0] && p[i]*p[i] <= n; ++i) if(n%p[i] == 0){ll t = p[i], tmp1 = 1, tmp2 = 0;while(n%t==0) {n/=t;tmp1 = tmp1*t*t + 1;++tmp2;}ans *= tmp1;num *= (tmp2 + 1);}if(n!=1) {num*=2;ans *= (1 + n*n);}ans -= num*tn;return ans; } int main() {T = read();init();while(T--) {n = read();write(solve(n)); putchar('\n');}return 0; }

轉載于:https://www.cnblogs.com/RRRR-wys/p/9736250.html

創作挑戰賽新人創作獎勵來咯，堅持創作打卡瓜分現金大獎

總結

以上是生活随笔為你收集整理的HDU5528 - Count a * b的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。