結果
問題 | No.2487 Multiple of M |
ユーザー |
![]() |
提出日時 | 2023-09-29 23:56:03 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 3 ms / 2,000 ms |
コード長 | 2,626 bytes |
コンパイル時間 | 1,212 ms |
コンパイル使用メモリ | 120,568 KB |
最終ジャッジ日時 | 2025-02-17 03:39:55 |
ジャッジサーバーID (参考情報) |
judge3 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 53 |
ソースコード
#include <iostream>#include <algorithm>#include <iomanip>#include <vector>#include <queue>#include <deque>#include <set>#include <map>#include <tuple>#include <cmath>#include <numeric>#include <functional>#include <cassert>#include <atcoder/modint>#define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl;#define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl;template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }using namespace std;typedef long long ll;template<typename T>vector<vector<T>> vec2d(int n, int m, T v){return vector<vector<T>>(n, vector<T>(m, v));}template<typename T>vector<vector<vector<T>>> vec3d(int n, int m, int k, T v){return vector<vector<vector<T>>>(n, vector<vector<T>>(m, vector<T>(k, v)));}template<typename T>void print_vector(vector<T> v, char delimiter=' '){if(v.empty()) {cout << endl;return;}for(int i = 0; i+1 < v.size(); i++) cout << v[i] << delimiter;cout << v.back() << endl;}using mint = atcoder::modint998244353;ostream& operator<<(ostream& os, const mint& m){os << m.val();return os;}void test(int n, int a, int b){int ga = gcd(a, n);int gb = gcd(b, n);vector<int> sum(n);for(int x = 0; x < n; x++){for(int y = 0; y < n; y++){int z = (a*x+b*y)%n;sum[z]++;}}print_vector(sum);}mint naive(int n, int m, int k){mint ans = n%2 == 0 ? 1 : -1;ll cur = 1;for(int i = 0; i < n; i++){ll g = gcd(cur, (ll)m);mint sgn = i%2 == 0 ? 1 : -1;int l = n-i-1;ans += sgn*mint(m-1).pow(l)*g;cur *= k;cur %= m;}return ans;}mint solve(int n, int m, int k){mint ans = n%2 == 0 ? 1 : -1;ll cur = 1;for(int i = 0; i < n; i++){ll g = gcd(cur, (ll)m);if(i >= 50){mint inv = mint(-(m-1)).inv();mint sum = (1-inv.pow(n-i))/(1-inv);ans += mint(m-1).pow(n-1)*inv.pow(i)*sum*g;break;}mint sgn = i%2 == 0 ? 1 : -1;int l = n-i-1;ans += sgn*mint(m-1).pow(l)*g;cur *= k;cur %= m;}return ans;}int main(){ios::sync_with_stdio(false);cin.tie(0);cout << setprecision(10) << fixed;int n, m, k; cin >> n >> m >> k;// cout << naive(n, m, k) << endl;cout << solve(n, m, k) << endl;}