BZOJ4816 数字表格-莫比乌斯反演

传送门php 题意： 定义 f[0]=0,f[1]=1,f[n]=f[n−1]+f[n−2],n≥2 f [ 0 ] = 0 , f [ 1 ] = 1 , f [ n ] = f [ n − 1 ] + f [ n − 2 ] , n ≥ 2 ios 给出n,m，求 Πni=1Πmj=1f[gcd(i,j)]%1e9+7 Π i = 1 n Π j = 1 m f [ g c d ( i , j

>>阅读原文<<