2019藍橋 RSA 解密

#include<bits/stdc++.h> #define ll long long using namespace std; inline ll ksc(ll x,ll y,ll mod) { return (x*y-(ll)((long double)x/mod*y)*mod+mod)%mod; } ll fast_pow(ll x, ll k, ll p){

>>阅读原文<<