HDU 6340 Problem I. Delightful Formulas(莫比乌斯反演+数论+

2019-04-13 15:31发布

class="markdown_views prism-atom-one-light"> Description 给出n,K" role="presentation" style="position: relative;">n,K,令si=jijK" role="presentation" style="position: relative;">si=jijK,求1insi[gcd(i,n)=1]" role="presentation" style="position: relative;">1insi[gcd(i,n)=1] Input 第一行一整数T" role="presentation" style="position: relative;">T表示用例组数,每组用例首先输入一整数K" role="presentation" style="position: relative;">K,之后输入一整数m" role="presentation" style="position: relative;">m表示n" role="presentation" style="position: relative;">n的素因子数量,最后输入m" role="presentation" style="position: relative;">m对整数pi,ai" role="presentation" style="position: relative;">pi,ai表示n=i=1npiai" role="presentation" style="position: relative;">n=i=1npiai (K105,K106,m20,pi,ai109,pi<pi+1)" role="presentation" style="position: relative;">(K105,K106,m20,pi,ai109,pi<pi+1) Sample Input 2
1
2
2 1
3 1
233
1
23333 1 Sample Output 16
32727388 Solution 对所求表达式反演有
ans=i=1n[(i,n)=1]j=1ijK=i=1nd|(i,n)μ(d)S(i,K)=d|nμ(d)i=1ndS(id,K)" role="presentation">ans=i=1n[(i,n)=1]j=1ijK=i=1nd|(i,n)μ(d)S(i,K)=d|nμ(d)i=1ndS(id,K)
其中S(n,k)=i=1nik=1k+1i=1k+1Ck+1iBk+1i(n+1)i" role="presentation" style="position: relative;">