[polya+欧拉函数] POJ 2154

题意

依旧是计数,n较大,不能直接枚举
联系正常的公式
https://blog.csdn.net/maxwei_wzj/article/details/72866802
https://blog.csdn.net/acdreamers/article/details/8656247

思路

代码

#include <algorithm>
//#include <bits/stdc++.h>
#include <cstdio>
#include <cstring>
#include <iostream>

using namespace std;
typedef long long ll;

const int INF = 0x7f7f7f7f;
const int maxn = 36000 + 10;

int MOD;

int pri[ maxn ];
bool ispri[ maxn ];
int cnt = 0;

void isPrime () {
    memset ( ispri, true, sizeof ( ispri ) );

    for ( int i = 2; i < maxn; ++i ) {
        if ( ispri[ i ] == true )
            pri[ cnt++ ] = i;

        for ( int j = i + i; j < maxn; j += i )
            ispri[ j ] = false;
    }
}

int phi ( int n ) {
    int ans = n;
    //枚举素数
    for ( int i = 0; pri[ i ] * pri[ i ] <= n; ++i ) {
        // n * ( 1 - 1/p1 ) ( 1- 1/p2 )...
        if ( n % pri[ i ] == 0 ) {
            ans = ans - ans / pri[ i ];

            while ( n % pri[ i ] == 0 )
                n /= pri[ i ];
        }
    }

    if ( n > 1 )
        ans = ans - ans / n;
    return ans % MOD;
}

// a^b
int powquick_mod ( int a, int b ) {
    int ans = 1;
    a %= MOD;

    while ( b ) {
        if ( b & 1 ) {
            ans = ( ans * a ) % MOD;
            --b;
        }
        b >>= 1;
        a = a * a % MOD;
    }

    return ans;
}

int main () {
#ifdef LOCAL
    freopen ( "in", "r", stdin );
    // freopen("out","w",stdout);
#endif
    isPrime ();
    int T;
    scanf ( "%d", &T );
    while ( T-- ) {
        int n;
        scanf ( "%d%d", &n, &MOD );

        int ans = 0;
        for ( int i = 1; i * i <= n; ++i ) {
            // i== n/i时加一次就够了
            if ( i * i == n )
                ans = ( ans + ( powquick_mod ( n, i ) * phi ( i ) ) ) % MOD;
            //同时加上i和n/i的值
            else if ( n % i == 0 )
                ans = ( ( powquick_mod ( n, i ) * phi ( n / i ) % MOD ) +
                        ( powquick_mod ( n, n / i ) * phi ( i ) % MOD ) + ans ) %
                      MOD;
        }
        ans = ans / n % MOD;
        printf ( "%d\n", ans );
    }

    return 0;
}