結果

問題 No.2193 メガの下1桁
ユーザー ecotteaecottea
提出日時 2023-01-20 02:05:51
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
WA  
実行時間 -
コード長 7,673 bytes
コンパイル時間 3,622 ms
コンパイル使用メモリ 238,832 KB
実行使用メモリ 6,944 KB
最終ジャッジ日時 2024-06-22 18:59:43
合計ジャッジ時間 4,691 ms
ジャッジサーバーID
(参考情報)
judge4 / judge1
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
other AC * 38 WA * 2
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#ifndef HIDDEN_IN_VS //
//
#define _CRT_SECURE_NO_WARNINGS
//
#include <bits/stdc++.h>
using namespace std;
//
using ll = long long; // -2^63 2^63 = 9 * 10^18int -2^31 2^31 = 2 * 10^9
using pii = pair<int, int>; using pll = pair<ll, ll>; using pil = pair<int, ll>; using pli = pair<ll, int>;
using vi = vector<int>; using vvi = vector<vi>; using vvvi = vector<vvi>;
using vl = vector<ll>; using vvl = vector<vl>; using vvvl = vector<vvl>;
using vb = vector<bool>; using vvb = vector<vb>; using vvvb = vector<vvb>;
using vc = vector<char>; using vvc = vector<vc>; using vvvc = vector<vvc>;
using vd = vector<double>; using vvd = vector<vd>; using vvvd = vector<vvd>;
template <class T> using priority_queue_rev = priority_queue<T, vector<T>, greater<T>>;
using Graph = vvi;
//
const double PI = acos(-1);
const vi DX = { 1, 0, -1, 0 }; // 4
const vi DY = { 0, 1, 0, -1 };
int INF = 1001001001; ll INFL = 4004004004004004004LL;
double EPS = 1e-12;
//
struct fast_io { fast_io() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(18); } } fastIOtmp;
//
#define all(a) (a).begin(), (a).end()
#define sz(x) ((int)(x).size())
#define lbpos(a, x) (int)distance((a).begin(), std::lower_bound(all(a), x))
#define ubpos(a, x) (int)distance((a).begin(), std::upper_bound(all(a), x))
#define Yes(b) {cout << ((b) ? "Yes\n" : "No\n");}
#define rep(i, n) for(int i = 0, i##_len = int(n); i < i##_len; ++i) // 0 n-1
#define repi(i, s, t) for(int i = int(s), i##_end = int(t); i <= i##_end; ++i) // s t
#define repir(i, s, t) for(int i = int(s), i##_end = int(t); i >= i##_end; --i) // s t
#define repe(v, a) for(const auto& v : (a)) // a
#define repea(v, a) for(auto& v : (a)) // a
#define repb(set, d) for(int set = 0; set < (1 << int(d)); ++set) // d
#define repp(a) sort(all(a)); for(bool a##_perm = true; a##_perm; a##_perm = next_permutation(all(a))) // a
#define smod(n, m) ((((n) % (m)) + (m)) % (m)) // mod
#define uniq(a) {sort(all(a)); (a).erase(unique(all(a)), (a).end());} //
#define EXIT(a) {cout << (a) << endl; exit(0);} //
//
template <class T> inline ll pow(T n, int k) { ll v = 1; rep(i, k) v *= n; return v; }
template <class T> inline bool chmax(T& M, const T& x) { if (M < x) { M = x; return true; } return false; } // true
    
template <class T> inline bool chmin(T& m, const T& x) { if (m > x) { m = x; return true; } return false; } // true
    
//
template <class T, class U> inline istream& operator>>(istream& is, pair<T, U>& p) { is >> p.first >> p.second; return is; }
template <class T> inline istream& operator>>(istream& is, vector<T>& v) { repea(x, v) is >> x; return is; }
template <class T> inline vector<T>& operator--(vector<T>& v) { repea(x, v) --x; return v; }
template <class T> inline vector<T>& operator++(vector<T>& v) { repea(x, v) ++x; return v; }
// Visual Studio
#ifdef _MSC_VER
#include "local.hpp"
// gcc
#else
inline int popcount(int n) { return __builtin_popcount(n); }
inline int popcount(ll n) { return __builtin_popcountll(n); }
inline int lsb(int n) { return n != 0 ? __builtin_ctz(n) : -1; }
inline int lsb(ll n) { return n != 0 ? __builtin_ctzll(n) : -1; }
inline int msb(int n) { return n != 0 ? (31 - __builtin_clz(n)) : -1; }
inline int msb(ll n) { return n != 0 ? (63 - __builtin_clzll(n)) : -1; }
#define gcd __gcd
#define dump(...)
#define dumpel(v)
#define dump_list(v)
#define dump_list2D(v)
#define input_from_file(f)
#define output_to_file(f)
#define Assert(b) { if (!(b)) while (1) cout << "OLE"; }
#endif
#endif //
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
//using mint = modint1000000007;
//using mint = modint998244353;
using mint = modint; // mint::set_mod(m);
istream& operator>>(istream& is, mint& x) { ll x_; is >> x_; x = x_; return is; }
ostream& operator<<(ostream& os, const mint& x) { os << x.val(); return os; }
using vm = vector<mint>; using vvm = vector<vm>; using vvvm = vector<vvm>;
#endif
//O(√n)
/*
* n pps pps
* pps[p] = d n p d
*/
map<ll, int> factor_integer(ll n) {
// verify : https://algo-method.com/tasks/457
map<ll, int> pps;
for (ll i = 2; i * i <= n; i++) {
int d = 0;
while (n % i == 0) {
d++;
n /= i;
}
if (d > 0) pps[i] = d;
}
if (n > 1) pps[n] = 1;
return pps;
}
//O(√n)
/*
* φ(n)
*
*
*/
ll euler_phi(ll n) {
// verify : https://judge.yosupo.jp/problem/tetration_mod
// n pps
auto pps = factor_integer(n);
// φ(n)
ll res = 1;
repe(pp, pps) {
res *= (pp.first - 1) * pow(pp.first, pp.second - 1);
}
return res;
}
//
/*
* Map_composite(vi s, ll k_max) : O(n log(k_max))
* [0..n) i -> s[i]
* apply() k k_max
*
* int apply(int x, ll k) : O(log(k_max))
* s^k[x]
*
* ll max_right(int x, function<bool(int)>& okQ) : O(log(k_max))
* okQ(s^k[x]) = true okQ(s^(k+1)[x]) = false k
*
*
*/
class Map_composite {
int n, K;
// dp[i][j] : s^(2^i)[j]
vvi dp;
public:
// [0..n) i -> s[i]
Map_composite(const vi& s, ll k_max = 1LL << 62) : n(sz(s)), K(msb(k_max) + 1), dp(K, vi(n)) {
// verify : https://atcoder.jp/contests/abc212/tasks/abc212_f
// s^(2^0)[j] = s[j]
rep(j, n) dp[0][j] = s[j];
rep(i, K - 1) {
rep(j, n) {
// s^(2^(i+1))[j] = s^(2^i)[ s^(2^i)[j] ]
dp[i + 1][j] = dp[i][dp[i][j]];
}
}
}
// s^k[x]
int apply(int x, ll k) const {
// verify : https://atcoder.jp/contests/abc212/tasks/abc212_f
rep(i, K) {
if (k & (1LL << i)) {
x = dp[i][x];
}
}
return x;
}
// okQ[s^k[x]] = true okQ[s^(k+1)[x]] = false k
ll max_right(int x, function<bool(int)>& okQ) const {
// verify : https://atcoder.jp/contests/arc060/tasks/arc060_c
ll res = 0;
repir(i, K - 1, 0) {
res <<= 1;
if (okQ(dp[i][x])) {
res++;
x = dp[i][x];
}
}
return res;
}
#ifdef _MSC_VER
friend ostream& operator<<(ostream& os, const Map_composite& mc) {
rep(i, mc.K) {
os << (1LL << i) << ":" << endl;
rep(j, mc.n) os << mc.dp[i][j] << " "; os << endl;
}
return os;
}
#endif
};
int main() {
// input_from_file("input.txt");
// output_to_file("output.txt");
ll m, d, n; int b;
cin >> m >> d >> n >> b;
auto d1 = [&](ll i) {
i %= b;
if (i < 10) return (char)('0' + i);
else return 'A';
};
if (n == 0) EXIT(d1(m));
if (m == 0 && d == 0) EXIT(d1(1));
int phi = (int)euler_phi(b);
int bp = b * phi;
mint::set_mod(bp);
vi s(bp);
rep(i, bp) {
mint id = mint(i + d);
if (id != 0) s[i] = id.pow(i).val();
else s[i] = 0;
}
Map_composite mc(s, n);
int res = mc.apply(mint(m).val(), n);
cout << d1(res) << endl;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0