codeforces 603B (数学)

关注

原创最新推荐文章于 2020-09-06 14:48:50 发布 802 阅读 AI 写同款· GEO 优化 ›

AI权益加码！Claude Code、Cursor等20+工具免费用！购周边限时加赠Coding Plan Lite，畅享主流AI工具！学习进阶更高效！阅读详情

As behooves any intelligent schoolboy, Kevin Sun is studying psycowlogy, cowculus, and cryptcowgraphy at the Bovinia State University (BGU) under Farmer Ivan. During his Mathematics of Olympiads (MoO) class, Kevin was confronted with a weird functional equation and needs your help. For two fixed integers k and p, where p is an odd prime number, the functional equation states that

$\text{[math]}$

for some function $\text{[math]}$ . (This equation should hold for any integer x in the range0 to p - 1, inclusive.)

It turns out that f can actually be many different functions. Instead of finding a solution, Kevin wants you to count the number of distinct functions f that satisfy this equation. Since the answer may be very large, you should print your result modulo 109 + 7.

Input

The input consists of two space-separated integers p and k (3 ≤ p ≤ 1 000 000, 0 ≤ k ≤ p - 1) on a single line. It is guaranteed thatp is an odd prime number.

Output

Print a single integer, the number of distinct functions f modulo 109 + 7.

Sample test(s)

input
3 2

output
3

input
5 4

output
25

Note

In the first sample, p = 3 and k = 2. The following functions work:

f(0) = 0, f(1) = 1, f(2) = 2.
f(0) = 0, f(1) = 2, f(2) = 1.
f(0) = f(1) = f(2) = 0.

题意是给你一个奇质数p和小于p的数k，求满足题目所给方程的所有映射的种数．

因为ｐ是质数，显然x*k属于不同的模ｐ剩余系，也就是把x=0...p-1每一个都带进去以后左边的必然是f(0) f(1) ... f(p-1)的一个排列，右边本身是f(0)...f (p-1)的一个排列，这样就可以对于

f(x1) = k*f(x2)%p，找到对应的f(x2) = k*f(x3)%p，一直迭代下去，知道发现f(xl) = k*f(x1)%p，如此就可以把这一个环路转化为　f(x1) = k^l * f(x1)%p，把右边前面的系数先模p，发现当且仅当k^l%p==１时，f(x1)的值可以任取，也就是可以有ｐ种取法，否则f(x1)的值只能为１．

这样就很简单了，建个图，搞个环，判断系数模ｐ.

注意特判和long long.

#include <bits/stdc++.h>
using namespace std;
#define maxn 1111111
#define mod 1000000007

long long p, k;
long long ans;
int head[maxn], cnt;
struct node {
    long long from, to, next;
}edge[maxn];

long long qpow (long long a, long long b, long long m) {
    if (b == 0)
        return 1;
    long long ans = qpow (a, b>>1, m);
    ans = ans*ans%m;
    if (b&1)
        ans = ans*a%m;
    return ans;
}

void add_edge (int from, int to) {
    edge[cnt].from = from, edge[cnt].to = to, edge[cnt].next = head[from], head[from] = cnt++;
}

bool vis[maxn]; long long cur;

void dfs (int u) {
    cur++;
    vis[u] = 1;
    for (int i = head[u]; i != -1; i = edge[i].next) {
        int v = edge[i].to;
        if (!vis[v]) {
            dfs (v);
        }
    }
    return ;
}

long long find_loop () {
    memset (vis, 0, sizeof vis);
    long long ans = 1;
    for (int i = 0; i < p; i++) {
        if (!vis[i]) {
            cur = 0;
            dfs (i); 
            if (qpow (k, cur, p) == 1)
                ans = ans*p%mod;
        }
    }
    return ans;
}

int main () {
    while (cin >> p >> k) {
        if (k == 0) {
            ans = qpow (p, p-1, mod);
        }
        else if (k == 1) {
            ans = qpow (p, p, mod);
        }
        else {
            memset (head, -1, sizeof head);
            cnt = 0;
            for (int i = 0; i < p; i++) {
                add_edge (k*i%p, i);
            }
            ans = find_loop ();
        }
        cout << ans << endl;
    }
    return 0;
}