hdu4746 Mophues

花了几天时间熟悉莫比乌斯反演，看了一些讲得比较好的blog链接如下

Acdreamer

贾志鹏线性筛

zimpha's blog

形式1. F(x)=∑nd|nf(d) ⇒ f(x)=∑nd|nμ(d)F(nd)
形式2. F(x)=∑nx|nf(n) ⇒ f(x)=∑nx|nμ(nx)F(n)

ACcode:

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<vector>
#include<set>
#include<map>
#include<queue>
#include<sstream>
#include<string>
#include<bitset>
using namespace std;

typedef long long LL;

const LL LINF = (1LL <<63);
const int INF = 1 << 31;


const int NS = 500010;
const int MS = 19;
const int MOD = 1000000007;
int n, m, p;

bitset<NS> isPrime;
int fac[NS];
int u[NS];
int prefix[NS][MS];

void prepare()
{
    memset(fac, 0, sizeof(fac));
    memset(u, 0, sizeof(u));
    isPrime.set();
    isPrime[1] = false;
    u[1] = 1;

    for(int i = 2; i < NS; i++)
    {
        if(isPrime[i])
        {
            fac[i] = 1;
            u[i] = -1;
      //      printf("%d ", i);

            for(int j = 2; j * i < NS; j++)
            {
                int val = j * i;
                isPrime[val] = false;
                fac[val] = fac[j] + 1;
                if(j % i)
                {
                    u[val] = -u[j];
                }
                else
                {
                    u[val] = 0;
                }
            }
        }
    }
//    puts("*****");

//    for(int i = 1; i < NS; i++)
//    {
//        printf("u[%d] = %d\n ", i, u[i]);
//    }
//    puts("");


    memset(prefix, 0, sizeof(prefix));

    for(int i = 1; i < NS; i++)
    {
        for(int j = 1; j * i < NS; j++)
        {
            int val = j * i;
            prefix[val][fac[i]] += u[j];
        }
    }

    for(int i = 1; i < NS; i++)
    {
        for(int j = 1; j < MS; j++)
        {
            prefix[i][j] += prefix[i][j - 1];
        }
    }

    for(int i = 1; i < NS; i++)
    {
//        printf("fac[%2d] = %2d", i, fac[i]);
        for(int j = 0; j < MS; j++)
        {
            prefix[i][j] += prefix[i - 1][j];

//            printf("%4d", prefix[i][j]);
        }
//        puts("");
    }


}

LL solve()
{
    LL res = 0;
    if(p >= 19)
    {
        res = 1LL * n * m;
        return res;
    }

    int lim = min(n,m);
    for(int i = 1; i <= lim; i++)
    {
        int last = min(n/(n/i), m/(m/i));
        res += 1LL * (prefix[last][p] - prefix[i - 1][p]) * (n / i) * (m / i);
        i = last;
    }
    return res;
}

int main()
{
    prepare();

//    freopen("in.txt", "r", stdin);
//    freopen("out.txt", "w", stdout);

    int nCase;
    scanf("%d", &nCase);
    while(nCase --)
    {
        scanf("%d %d %d", &n, &m, &p);
        printf("%I64d\n", solve());

    }
    return 0;
}