結果
| 問題 | No.1632 Sorting Integers (GCD of M) |
| ユーザー |
 stoq
|
| 提出日時 | 2021-07-30 22:58:22 |
| 言語 | C++17(gcc12) (gcc 12.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 1,972 ms / 2,000 ms |
| コード長 | 6,883 bytes |
| コンパイル時間 | 7,848 ms |
| コンパイル使用メモリ | 273,764 KB |
| 最終ジャッジ日時 | 2025-01-23 12:42:33 |
|
ジャッジサーバーID （参考情報） |
judge2 / judge6 |
| 純コード判定しない問題か言語 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 4 |
| other | AC * 59 |
ソースコード
#define MOD_TYPE 1#pragma region Macros#include <bits/stdc++.h>using namespace std;#if 1#pragma GCC target("avx2")#pragma GCC optimize("O3")#pragma GCC optimize("unroll-loops")#endif#if 0#include <ext/pb_ds/assoc_container.hpp>#include <ext/pb_ds/tree_policy.hpp>#include <ext/pb_ds/tag_and_trait.hpp>#include <ext/rope>using namespace __gnu_pbds;using namespace __gnu_cxx;template <typename T>using extset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;#endif#if 0#include <boost/multiprecision/cpp_int.hpp>#include <boost/multiprecision/cpp_dec_float.hpp>using Int = boost::multiprecision::cpp_int;using lld = boost::multiprecision::cpp_dec_float_100;#endifusing ll = long long;using ld = long double;using pii = pair<int, int>;using pll = pair<ll, ll>;using pld = pair<ld, ld>;template <typename T>using smaller_queue = priority_queue<T, vector<T>, greater<T>>;constexpr ll MOD = (MOD_TYPE == 1 ? (ll)(1e9 + 7) : 998244353);constexpr int INF = (int)1e9 + 10;constexpr ll LINF = (ll)4e18;constexpr ld PI = acos(-1.0);constexpr ld EPS = 1e-7;constexpr int Dx[] = {0, 0, -1, 1, -1, 1, -1, 1, 0};constexpr int Dy[] = {1, -1, 0, 0, -1, -1, 1, 1, 0};#define REP(i, m, n) for (ll i = m; i < (ll)(n); ++i)#define rep(i, n) REP(i, 0, n)#define REPI(i, m, n) for (int i = m; i < (int)(n); ++i)#define repi(i, n) REPI(i, 0, n)#define MP make_pair#define MT make_tuple#define YES(n) cout << ((n) ? "YES" : "NO") << "\n"#define Yes(n) cout << ((n) ? "Yes" : "No") << "\n"#define possible(n) cout << ((n) ? "possible" : "impossible") << "\n"#define Possible(n) cout << ((n) ? "Possible" : "Impossible") << "\n"#define all(v) v.begin(), v.end()#define NP(v) next_permutation(all(v))#define dbg(x) cerr << #x << ":" << x << "\n";struct io_init{io_init(){cin.tie(0);ios::sync_with_stdio(false);cout << setprecision(30) << setiosflags(ios::fixed);};} io_init;template <typename T>inline bool chmin(T &a, T b){if (a > b){a = b;return true;}return false;}template <typename T>inline bool chmax(T &a, T b){if (a < b){a = b;return true;}return false;}inline ll CEIL(ll a, ll b){return (a + b - 1) / b;}template <typename A, size_t N, typename T>inline void Fill(A (&array)[N], const T &val){fill((T *)array, (T *)(array + N), val);}template <typename T, typename U>constexpr istream &operator>>(istream &is, pair<T, U> &p) noexcept{is >> p.first >> p.second;return is;}template <typename T, typename U>constexpr ostream &operator<<(ostream &os, pair<T, U> &p) noexcept{os << p.first << " " << p.second;return os;}#pragma endregionrandom_device seed_gen;mt19937_64 engine(seed_gen());// --------------------------------------#pragma region minttemplate <int MOD>struct Fp{long long val;constexpr Fp(long long v = 0) noexcept : val(v % MOD){if (val < 0)v += MOD;}constexpr int getmod(){return MOD;}constexpr Fp operator-() const noexcept{return val ? MOD - val : 0;}constexpr Fp operator+(const Fp &r) const noexcept{return Fp(*this) += r;}constexpr Fp operator-(const Fp &r) const noexcept{return Fp(*this) -= r;}constexpr Fp operator*(const Fp &r) const noexcept{return Fp(*this) *= r;}constexpr Fp operator/(const Fp &r) const noexcept{return Fp(*this) /= r;}constexpr Fp &operator+=(const Fp &r) noexcept{val += r.val;if (val >= MOD)val -= MOD;return *this;}constexpr Fp &operator-=(const Fp &r) noexcept{val -= r.val;if (val < 0)val += MOD;return *this;}constexpr Fp &operator*=(const Fp &r) noexcept{val = val * r.val % MOD;if (val < 0)val += MOD;return *this;}constexpr Fp &operator/=(const Fp &r) noexcept{long long a = r.val, b = MOD, u = 1, v = 0;while (b){long long t = a / b;a -= t * b;swap(a, b);u -= t * v;swap(u, v);}val = val * u % MOD;if (val < 0)val += MOD;return *this;}constexpr bool operator==(const Fp &r) const noexcept{return this->val == r.val;}constexpr bool operator!=(const Fp &r) const noexcept{return this->val != r.val;}friend constexpr ostream &operator<<(ostream &os, const Fp<MOD> &x) noexcept{return os << x.val;}friend constexpr istream &operator>>(istream &is, Fp<MOD> &x) noexcept{return is >> x.val;}};Fp<MOD> modpow(const Fp<MOD> &a, long long n) noexcept{if (n == 0)return 1;auto t = modpow(a, n / 2);t = t * t;if (n & 1)t = t * a;return t;}using mint = Fp<MOD>;template <class T>struct BiCoef{vector<T> fact_, inv_, finv_;constexpr BiCoef(){}constexpr BiCoef(int n) noexcept : fact_(n, 1), inv_(n, 1), finv_(n, 1){init(n);}constexpr void init(int n) noexcept{fact_.assign(n, 1), inv_.assign(n, 1), finv_.assign(n, 1);int MOD = fact_[0].getmod();for (int i = 2; i < n; i++){fact_[i] = fact_[i - 1] * i;inv_[i] = -inv_[MOD % i] * (MOD / i);finv_[i] = finv_[i - 1] * inv_[i];}}constexpr T C(ll n, ll k) const noexcept{if (n < k || n < 0 || k < 0)return 0;return fact_[n] * finv_[k] * finv_[n - k];}constexpr T P(ll n, ll k) const noexcept{return C(n, k) * fact_[k];}constexpr T H(ll n, ll k) const noexcept{return C(n + k - 1, k);}constexpr T Ch1(ll n, ll k) const noexcept{if (n < 0 || k < 0)return 0;T res = 0;for (int i = 0; i < n; i++)res += C(n, i) * modpow(n - i, k) * (i & 1 ? -1 : 1);return res;}constexpr T fact(ll n) const noexcept{if (n < 0)return 0;return fact_[n];}constexpr T inv(ll n) const noexcept{if (n < 0)return 0;return inv_[n];}constexpr T finv(ll n) const noexcept{if (n < 0)return 0;return finv_[n];}};BiCoef<mint> bc(200010);#pragma endregionll rand(vector<ll> a){ll mod = 2 * 2 * 2 * 2 * 3 * 3 * 3 * 5 * 7 * 11;rep(i, 9) a[i] %= mod;vector<int> v;rep(i, 9){rep(j, a[i]) v.push_back(i + 1);}shuffle(all(v), engine);ll p = 1;ll res = 0;rep(i, v.size()){res = (res + v[i] * p) % mod;p = p * 10 % mod;}return res;}void solve(){ll n;cin >> n;ll z = 0, num;vector<ll> a(9);rep(i, 9){cin >> a[i];if (a[i] != 0)z++, num = i + 1;}if (z == 1){mint p = modpow(10, n);p -= 1;p /= 9;p *= num;cout << p << "\n";return;}ll ans = 0;rep(i, 100){ans = gcd(ans, rand(a));}cout << ans << "\n";}int main(){solve();}