結果
| 問題 | No.1411 Hundreds of Conditions Sequences |
| ユーザー |
 noimi
|
| 提出日時 | 2021-02-26 23:14:32 |
| 言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
| 結果 |
AC
|
| 実行時間 | 148 ms / 2,000 ms |
| コード長 | 23,899 bytes |
| コンパイル時間 | 5,104 ms |
| コンパイル使用メモリ | 282,420 KB |
| 実行使用メモリ | 47,256 KB |
| 最終ジャッジ日時 | 2024-10-02 16:10:01 |
| 合計ジャッジ時間 | 15,935 ms |
|
ジャッジサーバーID （参考情報） |
judge1 / judge3 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 41 ms
35,128 KB |
| testcase_01 | AC | 41 ms
35,308 KB |
| testcase_02 | AC | 41 ms
35,060 KB |
| testcase_03 | AC | 39 ms
35,084 KB |
| testcase_04 | AC | 40 ms
35,116 KB |
| testcase_05 | AC | 40 ms
35,056 KB |
| testcase_06 | AC | 41 ms
34,936 KB |
| testcase_07 | AC | 41 ms
35,068 KB |
| testcase_08 | AC | 39 ms
35,080 KB |
| testcase_09 | AC | 41 ms
35,088 KB |
| testcase_10 | AC | 42 ms
35,144 KB |
| testcase_11 | AC | 41 ms
35,168 KB |
| testcase_12 | AC | 129 ms
45,608 KB |
| testcase_13 | AC | 113 ms
45,176 KB |
| testcase_14 | AC | 90 ms
45,748 KB |
| testcase_15 | AC | 111 ms
45,308 KB |
| testcase_16 | AC | 70 ms
44,072 KB |
| testcase_17 | AC | 109 ms
45,188 KB |
| testcase_18 | AC | 132 ms
46,288 KB |
| testcase_19 | AC | 139 ms
45,556 KB |
| testcase_20 | AC | 87 ms
44,320 KB |
| testcase_21 | AC | 141 ms
45,732 KB |
| testcase_22 | AC | 90 ms
44,732 KB |
| testcase_23 | AC | 134 ms
46,000 KB |
| testcase_24 | AC | 61 ms
43,880 KB |
| testcase_25 | AC | 135 ms
46,632 KB |
| testcase_26 | AC | 109 ms
45,092 KB |
| testcase_27 | AC | 94 ms
45,832 KB |
| testcase_28 | AC | 124 ms
45,716 KB |
| testcase_29 | AC | 77 ms
44,296 KB |
| testcase_30 | AC | 108 ms
45,672 KB |
| testcase_31 | AC | 102 ms
45,296 KB |
| testcase_32 | AC | 143 ms
46,388 KB |
| testcase_33 | AC | 139 ms
46,400 KB |
| testcase_34 | AC | 140 ms
45,712 KB |
| testcase_35 | AC | 143 ms
45,768 KB |
| testcase_36 | AC | 138 ms
46,388 KB |
| testcase_37 | AC | 138 ms
45,792 KB |
| testcase_38 | AC | 141 ms
46,596 KB |
| testcase_39 | AC | 142 ms
46,552 KB |
| testcase_40 | AC | 142 ms
45,836 KB |
| testcase_41 | AC | 148 ms
46,372 KB |
| testcase_42 | AC | 146 ms
46,080 KB |
| testcase_43 | AC | 138 ms
46,132 KB |
| testcase_44 | AC | 140 ms
46,476 KB |
| testcase_45 | AC | 138 ms
46,256 KB |
| testcase_46 | AC | 144 ms
47,256 KB |
| testcase_47 | AC | 136 ms
46,400 KB |
| testcase_48 | AC | 138 ms
45,680 KB |
| testcase_49 | AC | 138 ms
45,928 KB |
| testcase_50 | AC | 138 ms
46,000 KB |
| testcase_51 | AC | 143 ms
46,868 KB |
| testcase_52 | AC | 127 ms
46,864 KB |
| testcase_53 | AC | 125 ms
46,216 KB |
| testcase_54 | AC | 127 ms
46,836 KB |
| testcase_55 | AC | 130 ms
45,856 KB |
| testcase_56 | AC | 124 ms
45,928 KB |
| testcase_57 | AC | 128 ms
46,612 KB |
| testcase_58 | AC | 130 ms
45,888 KB |
| testcase_59 | AC | 128 ms
45,992 KB |
| testcase_60 | AC | 127 ms
46,772 KB |
| testcase_61 | AC | 125 ms
46,544 KB |
| testcase_62 | AC | 94 ms
45,064 KB |
| testcase_63 | AC | 111 ms
46,536 KB |
ソースコード
#pragma region Macros
// #pragma GCC target("avx2")
#pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define rep2(i, a, b) for(ll i = a; i <= b; ++i)
#define rep(i, n) for(ll i = 0; i < n; ++i)
#define rep3(i, a, b) for(ll i = a; i >= b; --i)
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pb push_back
#define eb emplace_back
#define vi vector<int>
#define vll vector<ll>
#define vpi vector<pii>
#define vpll vector<pll>
#define overload2(_1, _2, name, ...) name
#define vec(type, name, ...) vector<type> name(__VA_ARGS__)
#define VEC(type, name, size) \
vector<type> name(size); \
IN(name)
#define vv(type, name, h, ...) vector<vector<type>> name(h, vector<type>(__VA_ARGS__))
#define VV(type, name, h, w) \
vector<vector<type>> name(h, vector<type>(w)); \
IN(name)
#define vvv(type, name, h, w, ...) vector<vector<vector<type>>> name(h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))
#define vvvv(type, name, a, b, c, ...) \
vector<vector<vector<vector<type>>>> name(a, vector<vector<vector<type>>>(b, vector<vector<type>>(c, vector<type>(__VA_ARGS__))))
#define mt make_tuple
#define fi first
#define se second
#define all(c) begin(c), end(c)
#define SUM(v) accumulate(all(v), 0LL)
#define MIN(v) *min_element(all(v))
#define MAX(v) *max_element(all(v))
#define lb(c, x) distance((c).begin(), lower_bound(all(c), (x)))
#define ub(c, x) distance((c).begin(), upper_bound(all(c), (x)))
using namespace std;
constexpr pii dx4[4] = {pii{1, 0}, pii{0, 1}, pii{-1, 0}, pii{0, -1}};
constexpr pii dx8[8] = {{1, 0}, {1, 1}, {0, 1}, {-1, 1}, {-1, 0}, {-1, -1}, {0, -1}, {1, -1}};
const string YESNO[2] = {"NO", "YES"};
const string YesNo[2] = {"No", "Yes"};
const string yesno[2] = {"no", "yes"};
void YES(bool t = 1) { cout << YESNO[t] << endl; }
void Yes(bool t = 1) { cout << YesNo[t] << endl; }
void yes(bool t = 1) { cout << yesno[t] << endl; }
template <class T> using vc = vector<T>;
template <class T> using vvc = vector<vc<T>>;
template <class T> using vvvc = vector<vvc<T>>;
template <class T> using vvvvc = vector<vvvc<T>>;
template <class T> using pq = priority_queue<T>;
template <class T> using pqg = priority_queue<T, vector<T>, greater<T>>;
#define si(c) (int)(c).size()
#define INT(...) \
int __VA_ARGS__; \
IN(__VA_ARGS__)
#define LL(...) \
ll __VA_ARGS__; \
IN(__VA_ARGS__)
#define STR(...) \
string __VA_ARGS__; \
IN(__VA_ARGS__)
#define CHR(...) \
char __VA_ARGS__; \
IN(__VA_ARGS__)
#define DBL(...) \
double __VA_ARGS__; \
IN(__VA_ARGS__)
int scan() { return getchar(); }
void scan(int &a) { cin >> a; }
void scan(long long &a) { cin >> a; }
void scan(char &a) { cin >> a; }
void scan(double &a) { cin >> a; }
void scan(string &a) { cin >> a; }
template <class T, class S> void scan(pair<T, S> &p) { scan(p.first), scan(p.second); }
template <class T> void scan(vector<T> &);
template <class T> void scan(vector<T> &a) {
for(auto &i : a) scan(i);
}
template <class T> void scan(T &a) { cin >> a; }
void IN() {}
template <class Head, class... Tail> void IN(Head &head, Tail &...tail) {
scan(head);
IN(tail...);
}
template <class T, class S> inline bool chmax(T &a, const S &b) { return (a < b ? a = b, 1 : 0); }
template <class T, class S> inline bool chmin(T &a, const S &b) { return (a > b ? a = b, 1 : 0); }
vi iota(int n) {
vi a(n);
iota(all(a), 0);
return a;
}
template <typename T> vi iota(vector<T> &a, bool greater = false) {
vi res(a.size());
iota(all(res), 0);
sort(all(res), [&](int i, int j) {
if(greater) return a[i] > a[j];
return a[i] < a[j];
});
return res;
}
#define UNIQUE(x) sort(all(x)), x.erase(unique(all(x)), x.end())
template <class T> T POW(T x, int n) {
T res = 1;
for(; n; n >>= 1, x *= x)
if(n & 1) res *= x;
return res;
}
vector<pll> factor(ll x) {
vector<pll> ans;
for(ll i = 2; i * i <= x; i++)
if(x % i == 0) {
ans.push_back({i, 1});
while((x /= i) % i == 0) ans.back().second++;
}
if(x != 1) ans.push_back({x, 1});
return ans;
}
template <class T> vector<T> divisor(T x) {
vector<T> ans;
for(T i = 1; i * i <= x; i++)
if(x % i == 0) {
ans.pb(i);
if(i * i != x) ans.pb(x / i);
}
return ans;
}
template <typename T> void zip(vector<T> &x) {
vector<T> y = x;
sort(all(y));
for(int i = 0; i < x.size(); ++i) { x[i] = lb(y, x[i]); }
}
int topbit(signed t) { return t == 0 ? -1 : 31 - __builtin_clz(t); }
int topbit(ll t) { return t == 0 ? -1 : 63 - __builtin_clzll(t); }
int lowbit(signed a) { return a == 0 ? 32 : __builtin_ctz(a); }
int lowbit(ll a) { return a == 0 ? 64 : __builtin_ctzll(a); }
// int allbit(int n) { return (1 << n) - 1; }
ll allbit(ll n) { return (1LL << n) - 1; }
int popcount(signed t) { return __builtin_popcount(t); }
int popcount(ll t) { return __builtin_popcountll(t); }
bool ispow2(int i) { return i && (i & -i) == i; }
int in() {
int x;
cin >> x;
return x;
}
ll lin() {
unsigned long long x;
cin >> x;
return x;
}
template <class T> pair<T, T> operator-(const pair<T, T> &x, const pair<T, T> &y) { return pair<T, T>(x.fi - y.fi, x.se - y.se); }
template <class T> pair<T, T> operator+(const pair<T, T> &x, const pair<T, T> &y) { return pair<T, T>(x.fi + y.fi, x.se + y.se); }
// template <class T> pair<T, T> &operator+=(pair<T, T> x, const pair<T, T> &y) {
// x = x + y;
// return &x;
// }
// template <class T> pair<T, T> &operator-=(pair<T, T> x, const pair<T, T> &y) {
// x = x - y;
// return &x;
// }
template <class T> ll operator*(const pair<T, T> &x, const pair<T, T> &y) { return (ll)x.fi * y.fi + (ll)x.se * y.se; }
template <typename T> struct edge {
int from, to;
T cost;
int id;
edge(int to, T cost) : from(-1), to(to), cost(cost) {}
edge(int from, int to, T cost) : from(from), to(to), cost(cost) {}
edge(int from, int to, T cost, int id) : from(from), to(to), cost(cost), id(id) {}
edge &operator=(const int &x) {
to = x;
return *this;
}
operator int() const { return to; }
};
template <typename T> using Edges = vector<edge<T>>;
using Tree = vector<vector<int>>;
using Graph = vector<vector<int>>;
template <class T> using Wgraph = vector<vector<edge<T>>>;
Graph getG(int n, int m = -1, bool directed = false, int margin = 1) {
Tree res(n);
if(m == -1) m = n - 1;
while(m--) {
int a, b;
cin >> a >> b;
a -= margin, b -= margin;
res[a].emplace_back(b);
if(!directed) res[b].emplace_back(a);
}
return move(res);
}
template <class T> Wgraph<T> getWg(int n, int m = -1, bool directed = false, int margin = 1) {
Wgraph<T> res(n);
if(m == -1) m = n - 1;
while(m--) {
int a, b;
T c;
cin >> a >> b >> c;
a -= margin, b -= margin;
res[a].emplace_back(b, c);
if(!directed) res[b].emplace_back(a, c);
}
return move(res);
}
#define i128 __int128_t
#define ull unsigned long long int
#define TEST \
INT(testcases); \
while(testcases--)
template <class T> ostream &operator<<(ostream &os, const vector<T> &v) {
for(auto it = begin(v); it != end(v); ++it) {
if(it == begin(v))
os << *it;
else
os << " " << *it;
}
return os;
}
template <class T, class S> ostream &operator<<(ostream &os, const pair<T, S> &p) {
os << p.first << " " << p.second;
return os;
}
template <class S, class T> string to_string(pair<S, T> p) { return "(" + to_string(p.first) + "," + to_string(p.second) + ")"; }
template <class A> string to_string(A v) {
if(v.empty()) return "{}";
string ret = "{";
for(auto &x : v) ret += to_string(x) + ",";
ret.back() = '}';
return ret;
}
string to_string(string s) { return "\"" + s + "\""; }
void dump() { cerr << endl; }
template <class Head, class... Tail> void dump(Head head, Tail... tail) {
cerr << to_string(head) << " ";
dump(tail...);
}
#define endl '\n'
#ifdef _LOCAL
#undef endl
#define debug(x) \
cout << #x << ": "; \
dump(x)
#else
#define debug(x)
#endif
template <typename T> static constexpr T inf = numeric_limits<T>::max() / 2;
struct Setup_io {
Setup_io() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
cout << fixed << setprecision(15);
}
} setup_io;
#define drop(s) cout << #s << endl, exit(0)
#pragma endregion
namespace modular {
constexpr ll MOD = 1000000007;
const int MAXN = 11000000;
template <ll Modulus> class modint;
#define mint modint<MOD>
#define vmint vector<mint>
vector<mint> Inv;
mint inv(int x);
template <ll Modulus> class modint {
public:
static constexpr int mod() { return Modulus; }
ll a;
constexpr modint(const ll x = 0) noexcept : a(((x % Modulus) + Modulus) % Modulus) {}
constexpr ll &value() noexcept { return a; }
constexpr const ll &value() const noexcept { return a; }
constexpr modint operator-() const noexcept { return modint() - *this; }
constexpr modint operator+() const noexcept { return *this; }
constexpr modint &operator++() noexcept {
if(++a == MOD) a = 0;
return *this;
}
constexpr modint &operator--() noexcept {
if(!a) a = MOD;
a--;
return *this;
}
constexpr modint operator++(int) {
modint res = *this;
++*this;
return res;
}
constexpr modint operator--(int) {
mint res = *this;
--*this;
return res;
}
constexpr modint &operator+=(const modint rhs) noexcept {
a += rhs.a;
if(a >= Modulus) { a -= Modulus; }
return *this;
}
constexpr modint &operator-=(const modint rhs) noexcept {
if(a < rhs.a) { a += Modulus; }
a -= rhs.a;
return *this;
}
constexpr modint &operator*=(const modint rhs) noexcept {
a = a * rhs.a % Modulus;
return *this;
}
constexpr modint &operator/=(const modint rhs) noexcept {
a = a * (modular::inv(rhs.a)).a % Modulus;
return *this;
}
constexpr modint pow(long long n) const noexcept {
if(n < 0) {
n %= Modulus - 1;
n = (Modulus - 1) + n;
}
modint x = *this, r = 1;
while(n) {
if(n & 1) r *= x;
x *= x;
n >>= 1;
}
return r;
}
constexpr modint inv() const noexcept { return pow(Modulus - 2); }
constexpr friend modint operator+(const modint &lhs, const modint &rhs) { return modint(lhs) += modint(rhs); }
constexpr friend modint operator-(const modint &lhs, const modint &rhs) { return modint(lhs) -= modint(rhs); }
constexpr friend modint operator*(const modint &lhs, const modint &rhs) { return modint(lhs) *= modint(rhs); }
constexpr friend modint operator/(const modint &lhs, const modint &rhs) { return modint(lhs) /= modint(rhs); }
constexpr friend modint operator==(const modint &lhs, const modint &rhs) { return lhs.a == rhs.a; }
constexpr friend modint operator!=(const modint &lhs, const modint &rhs) { return lhs.a != rhs.a; }
// constexpr friend modint operator^=(const modint &lhs, const modint &rhs) { return modint(lhs) ^= modint(rhs); }
};
vmint Fact{1, 1}, Ifact{1, 1};
mint inv(int n) {
if(n > MAXN) return (mint(n)).pow(MOD - 2);
if(Inv.empty()) Inv.emplace_back(0), Inv.emplace_back(1);
if(Inv.size() > n)
return Inv[n];
else {
for(int i = Inv.size(); i <= n; ++i) {
auto [y, x] = div(int(MOD), i);
Inv.emplace_back(Inv[x] * (-y));
}
return Inv[n];
}
}
mint fact(int n) {
if(Fact.size() > n)
return Fact[n];
else
for(int i = Fact.size(); i <= n; ++i) Fact.emplace_back(Fact[i - 1] * i);
return Fact[n];
}
mint ifact(int n) {
if(Ifact.size() > n)
return Ifact[n];
else
for(int i = Ifact.size(); i <= n; ++i) Ifact.emplace_back(Ifact[i - 1] * inv(i));
return Ifact[n];
}
mint modpow(ll a, ll n) { return mint(a).pow(n); }
mint inv(mint a) { return inv(a.a); }
mint ifact(mint a) { return ifact(a.a); }
mint fact(mint a) { return fact(a.a); }
mint modpow(mint a, ll n) { return modpow(a.a, n); }
mint C(int a, int b) {
if(a < 0 || b < 0) return 0;
if(a < b) return 0;
if(a > MAXN) {
mint res = 1;
rep(i, b) res *= a - i, res /= i + 1;
return res;
}
return fact(a) * ifact(b) * ifact(a - b);
}
mint P(int a, int b) {
if(a < 0 || b < 0) return 0;
if(a < b) return 0;
if(a > MAXN) {
mint res = 1;
rep(i, b) res *= a - i;
return res;
}
return fact(a) * ifact(a - b);
}
ostream &operator<<(ostream &os, mint a) {
os << a.a;
return os;
}
istream &operator>>(istream &is, mint &a) {
ll x;
is >> x;
a = x;
return is;
}
struct modinfo {
int mod, root;
};
constexpr modinfo base0{1045430273, 3};
constexpr modinfo base1{1051721729, 6};
constexpr modinfo base2{1053818881, 7};
using mint0 = modint<base0.mod>;
using mint1 = modint<base1.mod>;
using mint2 = modint<base2.mod>;
using Poly = vmint;
template <int mod> void FMT(vector<modint<mod>> &f, bool inv = false) {
using V = vector<modint<mod>>;
static V g(30), ig(30);
if(g.front().a == 0) {
modint<mod> root = 2;
while((root.pow((mod - 1) / 2)).a == 1) root += 1;
rep(i, 30) g[i] = -(root.pow((mod - 1) >> (i + 2))), ig[i] = g[i].inv();
}
int n = size(f);
if(!inv) {
for(int m = n; m >>= 1;) {
modint<mod> w = 1;
for(int s = 0, k = 0; s < n; s += 2 * m) {
for(int i = s, j = s + m; i < s + m; ++i, ++j) {
auto x = f[i], y = f[j] * w;
if(x.a >= mod) x.a -= mod;
f[i].a = x.a + y.a, f[j].a = x.a + (mod - y.a);
}
w *= g[__builtin_ctz(++k)];
}
}
} else {
for(int m = 1; m < n; m *= 2) {
modint<mod> w = 1;
for(int s = 0, k = 0; s < n; s += 2 * m) {
for(int i = s, j = s + m; i < s + m; ++i, ++j) {
auto x = f[i], y = f[j];
f[i] = x + y, f[j].a = x.a + (mod - y.a), f[j] *= w;
}
w *= ig[__builtin_ctz(++k)];
}
}
}
modint<mod> c;
if(inv)
c = modint<mod>(n).inv();
else
c = 1;
for(auto &&e : f) e *= c;
}
Poly operator-(Poly f) {
for(auto &&e : f) e = -e;
return f;
}
Poly &operator+=(Poly &l, const Poly &r) {
l.resize(max(l.size(), r.size()));
rep(i, r.size()) l[i] += r[i];
return l;
}
Poly operator+(Poly l, const Poly &r) { return l += r; }
Poly &operator-=(Poly &l, const Poly &r) {
l.resize(max(l.size(), r.size()));
rep(i, r.size()) l[i] -= r[i];
return l;
}
Poly operator-(Poly l, const Poly &r) { return l -= r; }
Poly &operator<<=(Poly &f, size_t n) { return f.insert(f.begin(), n, 0), f; }
Poly operator<<(Poly f, size_t n) { return f <<= n; }
Poly &operator>>=(Poly &f, size_t n) { return f.erase(f.begin(), f.begin() + min(f.size(), n)), f; }
Poly operator>>(Poly f, size_t n) { return f >>= n; }
constexpr int mod0 = 998244353, mod1 = 1300234241, mod2 = 1484783617;
using M0 = modint<mod0>;
using M1 = modint<mod1>;
using M2 = modint<mod2>;
template <int mod> void mul(vector<modint<mod>> &l, vector<modint<mod>> &r) {
int n = size(l), m = size(r), sz = 1 << __lg(2 * (n + m - 1) - 1);
l.resize(sz), FMT<mod>(l);
r.resize(sz), FMT<mod>(r);
rep(i, sz) l[i] *= r[i];
FMT<mod>(l, true);
l.resize(n + m - 1);
}
Poly operator*(const Poly &l, const Poly &r) {
if(l.empty() or r.empty()) return Poly();
int n = size(l), m = size(r), sz = 1 << __lg(2 * (n + m - 1) - 1);
vector<M0> l0(n), r0(m);
vector<M1> l1(n), r1(m);
vector<M2> l2(n), r2(m);
rep(i, n) l0[i] = l[i].a, l1[i] = l[i].a, l2[i] = l[i].a;
rep(i, m) r0[i] = r[i].a, r1[i] = r[i].a, r2[i] = r[i].a;
mul<mod0>(l0, r0), mul<mod1>(l1, r1), mul<mod2>(l2, r2);
Poly res(n + m - 1);
// garner
static constexpr M1 inv0 = 613999507;
static constexpr M2 inv1 = 1147332803, inv0m1 = 45381342;
static constexpr mint m0 = mod0, m0m1 = m0 * mod1;
rep(i, n + m - 1) {
int y0 = l0[i].a;
int y1 = (inv0 * (l1[i] - y0)).a;
int y2 = (inv0m1 * (l2[i] - y0) - inv1 * y1).a;
res[i] = m0 * y1 + m0m1 * y2 + y0;
}
return res;
}
Poly &operator*=(Poly &l, const Poly &r) { return l = l * r; }
Poly integ(const Poly &f) {
Poly res(f.size() + 1);
for(int i = 1; i < (int)res.size(); ++i) res[i] = f[i - 1] / i;
return res;
}
struct Prd {
deque<Poly> deq;
Prd() = default;
void emplace(const Poly &f) { deq.emplace_back(f); }
Poly calc() {
if(deq.empty()) return {1};
sort(all(deq), [&](const Poly &f, const Poly &g) { return si(f) < si(g); });
while(deq.size() > 1) {
deq.emplace_back(deq[0] * deq[1]);
for(int i = 0; i < 2; ++i) deq.pop_front();
}
return deq.front();
}
};
Poly prd(vector<Poly> &v) {
Prd p;
for(auto &e : v) p.emplace(e);
return p.calc();
}
// Poly deriv(const Poly &f) {
// if(f.size() == 0) return Poly();
// Poly res(f.size() - 1);
// rep(i, res.size()) res[i] = f[i + 1] * (i + 1);
// return res;
// }
ostream &operator<<(ostream &os, const Poly &a) {
for(auto e : a) cout << e.a << " ";
return os;
}
} // namespace modular
using namespace modular;
// from https://judge.yosupo.jp/submission/5147
vector<int> prime_sieve(const int N, const int Q = 17, const int L = 1 << 15) {
using u8 = unsigned char;
static const int rs[] = {1, 7, 11, 13, 17, 19, 23, 29};
struct P {
P(int p) : p(p) {}
int p;
int pos[8];
};
auto approx_prime_count = [](const int N) -> int { return N > 60184 ? N / (log(N) - 1.1) : max(1., N / (log(N) - 1.11)) + 1; };
const int v = sqrt(N), vv = sqrt(v);
vector<bool> isp(v + 1, true);
for(int i = 2; i <= vv; ++i)
if(isp[i]) {
for(int j = i * i; j <= v; j += i) isp[j] = false;
}
const int rsize = approx_prime_count(N + 30);
vector<int> primes = {2, 3, 5};
int psize = 3;
primes.resize(rsize);
vector<P> sprimes;
size_t pbeg = 0;
int prod = 1;
for(int p = 7; p <= v; ++p) {
if(!isp[p]) continue;
if(p <= Q) prod *= p, ++pbeg, primes[psize++] = p;
auto pp = P(p);
for(int t = 0; t < 8; ++t) {
int j = (p <= Q) ? p : p * p;
while(j % 30 != rs[t]) j += p << 1;
pp.pos[t] = j / 30;
}
sprimes.push_back(pp);
}
vector<u8> pre(prod, 0xFF);
for(size_t pi = 0; pi < pbeg; ++pi) {
auto pp = sprimes[pi];
const int p = pp.p;
for(int t = 0; t < 8; ++t) {
const u8 m = ~(1 << t);
for(int i = pp.pos[t]; i < prod; i += p) pre[i] &= m;
}
}
const int block_size = (L + prod - 1) / prod * prod;
vector<u8> block(block_size);
u8 *pblock = block.data();
const int M = (N + 29) / 30;
for(int beg = 0; beg < M; beg += block_size, pblock -= block_size) {
int end = min(M, beg + block_size);
for(int i = beg; i < end; i += prod) { copy(pre.begin(), pre.end(), pblock + i); }
if(beg == 0) pblock[0] &= 0xFE;
for(size_t pi = pbeg; pi < sprimes.size(); ++pi) {
auto &pp = sprimes[pi];
const int p = pp.p;
for(int t = 0; t < 8; ++t) {
int i = pp.pos[t];
const u8 m = ~(1 << t);
for(; i < end; i += p) pblock[i] &= m;
pp.pos[t] = i;
}
}
for(int i = beg; i < end; ++i) {
for(int m = pblock[i]; m > 0; m &= m - 1) { primes[psize++] = i * 30 + rs[__builtin_ctz(m)]; }
}
}
assert(psize <= rsize);
while(psize > 0 && primes[psize - 1] > N) --psize;
primes.resize(psize);
return primes;
}
int main() {
INT(n);
VEC(int, a, n);
const int N = 1000000;
vi cnt(N + 1), nxt(N + 1);
for(auto e : a) cnt[e]++;
auto P = prime_sieve(N);
mint ans = 1;
vv(int, mp, N + 1);
for(auto p : P) {
auto &v = mp[p];
for(ll i = p, t = 1; i <= N; t++, i *= p) {
for(int j = i, x = 1; j <= N; j += i, x++) {
if(x % p == 0) continue;
nxt[j] = p;
if(cnt[j]) { rep(_, cnt[j]) v.eb(t); }
}
}
if(!empty(v)) { ans *= modpow(p, v.back()); }
}
mint factor = 1;
for(auto e : a) factor *= e;
for(auto e : a) {
map<int, int> f;
int now = e;
while(nxt[now] != 0) f[nxt[now]]++, now /= nxt[now];
mint tmp = factor / e;
// cout << tmp << " ";
mint s = ans;
for(auto [p, c] : f) {
if(mp[p].back() == c) {
s /= modpow(p, mp[p].back());
if(si(mp[p]) > 1) s *= modpow(p, mp[p][si(mp[p]) - 2]);
}
}
cout << tmp - s << endl;
}
}