Codeforces Beta Round #17 D. Notepad 欧拉降幂

最新推荐文章于 2022-11-22 23:15:14 发布

kaka0010

最新推荐文章于 2022-11-22 23:15:14 发布

阅读量134

点赞数 1

分类专栏： # 数论

本文链接：https://blog.csdn.net/kaka03200/article/details/113986249

版权

数论专栏收录该内容

22 篇文章 0 订阅

订阅专栏

原题链接：http://codeforces.com/problemset/problem/17/D

题意

求 (b-1) * b ^n-1 % c，b∈[2,10^1000000 ]，n∈[1, 10^1000000 ]

分析

非常裸的欧拉降幂
在这里插入图片描述
根据定义可以化简n-1，特殊的b小于φ(m)的情况注意一下

b直接边读入边取膜即可

Code

#include <bits/stdc++.h>
using namespace std;
//#define ACM_LOCAL
#define fi first
#define se second
#define il inline
#define re register
typedef long long ll;
typedef pair<int, int> PII;
typedef unsigned long long ull;
const int N = 2e5 + 10;
const int M = 1e6 + 10;
const ll INF = 1e18 + 5;
const double eps = 1e-5;
const int MOD = 998244353;

ll init(ll n) {
    ll m = (int)sqrt(n + 0.5);
    ll ans = n;
    for (ll i = 2; i <= m; ++ i) {
        if (n % i == 0) {
            ans = ans / i * (i - 1);
            while(n % i == 0) n /= i;
        }
    }
    if (n > 1) ans = ans / n * (n - 1);
    return ans;
}

ll ksm(ll a, ll b, ll mm) {
    ll res = 1, base = a;
    while (b) {
        if (b & 1) res = res * base % mm;
        base = base * base % mm;
        b >>= 1;
    }
    return res;
}

void solve() {
    string b, n; cin >> b >> n;
    ll c; cin >> c;
    ll mm = init(c);

    ll b_1, b_ = 0;//取b-1,b的值
    for (int i = 0; i < b.size(); i++) b_ = b_ * 10 + (b[i] - '0'), b_ %= c;
    b_1 = (b_ - 1 + c) % c;

    ll n_1 = 0, flag = 0;//取n-1的值
    for (int i = 0; i < n.size(); i++) {
        n_1 = n_1 * 10 + (n[i] - '0');
        if (n_1 - 1 >= mm) n_1 %= mm, flag = 1;
    }
    n_1 = (n_1 - 1 + mm) % mm;
    if (flag) n_1 += mm;

    ll ans = ksm(b_, n_1, c);
    ans = ans * b_1 % c;
    if (ans == 0) cout << c << endl;
    else cout << ans << endl;
}

signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
#ifdef ACM_LOCAL
    freopen("input", "r", stdin);
    freopen("output", "w", stdout);
#endif
    solve();
}