Submission #67789710
Source Code Expand
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
//
//
// S i r o t a n w a t c h e s o v e r y o u .
//
// ...Jggg+J+JJJg@NQmgJa.....,
// ....gH@@@@HHB""""7"YYYYHMMMMMMM@@@@@@@Hma,.
// ...JH@@MMHY"! ? __""YH@@@@N&...
// ..JH@@HY"~ _TW@@@Mme.
// .Jg@@#"= _TTM@@N..
// .Jg@@MY! ?T@@@h,.
// .-@@@B! (TM@@@L
// .(H@MY ?W@@@+
// .W@@@ .T@@@[
// .d@@M! .T@@N,
// .d@M@' -W@@o.
// (@@M\ ?M@N,
// -d@M% .., .., j@@b
// d@@M= TM9 ?MD W@@[
// .H@M: .W@H,
// H@Ht ,@@#
// (@@M~ .@@h.
// .@@M% ..gmHHJ. .JdHga. .H@@e
// j@@#_ .@@@@@@@b J@@@@@@@h. .H@@\
// d@@@ .4@@@@@@MF (@@@@@@@@ H@@b
// d@@[ ?"BMY"= .d@@@@H, ?TWHHY"! d@@e
// J@@b .JJJ-.., ,@@@@@@M% ......... -@@@M.
// ?@@M\ ?YHHM@@@@b .. .W@@HP X@@HMWY"= d@@@#
// ,@@@L. ?H@Ng&+gd@@#H@@NHaJ+gH@[ J@@@]
// X@@@[ ...... ?"YYYYY"" ?"YHHHB"^ ..... (@@@#
// WH@N+. .W@@@@MHB= .TWH@M@Hmc .H@@M~
// .H@@@@N, _!~ .d@@@N,
// .J@@#T@@@N, .d@@@@@@@b.
// (@@@@! .T@@@n, .(H@@@H>.W@@@x
// (@@@F 4@@@@MaJ. .d@@@@Y77 4@@@r
//.H@@P ?TM@@@@N... .-JH@HMY= d@@N,
//(@@@F ?"WM@@@MQa-,. .(J(JN@@M#" Z@@@L
// d@@H, (M@@@@@@@Ng&maJ.... .. ...J.J+W@@@@@@HY! .dH@b
// ?M@@@N&. ..(JW@@@MM"?7""TYHMH@@HH@@@@@HHHgkHagHa(mggdmmagH@H@@Q@@HMMMHY"7!TMM@@@HaJ,. ..H@@@M^
// ?"W@@@@MN@@@@@H@@MMY" _???!"= ?WMMBYYTMH=7""Y@""?"~^ _"YM@@@@@@@@MH@@@@@#"^
// ?77WMMMYB""! _7"WWMMMY"7=
// need
#include <iostream>
#include <algorithm>
// data structure
#include <bitset>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <cstring>
#include <utility>
#include <vector>
#include <complex>
//#include <deque>
#include <valarray>
#include <unordered_map>
#include <unordered_set>
#include <array>
#include <ranges>
// etc
#include <cassert>
#include <cmath>
#include <functional>
#include <iomanip>
#include <chrono>
#include <random>
#include <numeric>
#include <fstream>
#if 0
std::ifstream ifs("AHC050/in/0000.txt");
auto & scan_in = ifs;
#else
auto & scan_in = std::cin;
#endif
auto & scan_out = std::cout;
// input
#define INIT std::ios::sync_with_stdio(false);std::cin.tie(0);
#define VAR(type, ...)type __VA_ARGS__;MACRO_VAR_Scan(__VA_ARGS__);
template<typename T> void MACRO_VAR_Scan(T & t) { scan_in >> t; }
template<typename First, typename...Rest>void MACRO_VAR_Scan(First & first, Rest& ...rest) { scan_in >> first; MACRO_VAR_Scan(rest...); }
#define VEC_ROW(type, n, ...)std::vector<type> __VA_ARGS__;MACRO_VEC_ROW_Init(n, __VA_ARGS__); for(int w_=0; w_<n; ++w_){MACRO_VEC_ROW_Scan(w_, __VA_ARGS__);}
template<typename T> void MACRO_VEC_ROW_Init(int n, T & t) { t.resize(n); }
template<typename First, typename...Rest>void MACRO_VEC_ROW_Init(int n, First & first, Rest& ...rest) { first.resize(n); MACRO_VEC_ROW_Init(n, rest...); }
template<typename T> void MACRO_VEC_ROW_Scan(int p, T & t) { scan_in >> t[p]; }
template<typename First, typename...Rest>void MACRO_VEC_ROW_Scan(int p, First & first, Rest& ...rest) { scan_in >> first[p]; MACRO_VEC_ROW_Scan(p, rest...); }
#define VEC(type, c, n) std::vector<type> c(n);for(auto& i:c)scan_in>>i;
#define MAT(type, c, m, n) std::vector<std::vector<type>> c(m, std::vector<type>(n));for(auto& R:c)for(auto& w:R)scan_in>>w;
// output
template<typename T>void MACRO_OUT(const T t) { scan_out << t; }
template<typename First, typename...Rest>void MACRO_OUT(const First first, const Rest...rest) { scan_out << first << ' '; MACRO_OUT(rest...); }
#define OUT(...) MACRO_OUT(__VA_ARGS__);
#define FOUT(n, dist) scan_out<<std::fixed<<std::setprecision(n)<<(dist);
#define SOUT(n, c, dist) scan_out<<std::setw(n)<<std::setfill(c)<<(dist);
#define VOUT(v) {auto tv_(v); for(size_t w_ = 0; w_ < tv_.size(); ++w_) {OUT(tv_[w_]);if(w_+1<tv_.size()){SP}}}
#define EOUT(...) do{ OUT(__VA_ARGS__); BR; exit(0); }while(0)
#define SP scan_out<<' ';
#define TAB scan_out<<'\t';
#define BR scan_out<<'\n';
#define SPBR(w, n) scan_out<<(w + 1 == n ? '\n' : ' ');
#define ENDL scan_out<<std::endl;
#define FLUSH scan_out<<std::flush;
#define SHOW(dist) {std::cerr << #dist << "\t: " << (dist) << '\n';}
// utility
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(),(a).rend()
#define FOR(w, a, n) for(int w=(a);w<(n);++w)
#define REP(w, n) FOR(w, 0, n)
#define RFOR(w, a, n) for(int w=(n)-1;w>=(a);--w)
#define RREP(w, n) RFOR(w, 0, n)
#define FORC(w, a, n) for(char w=(a);w<(n);++w)
#define REPC(w, n) FORC(w, 0, n)
template<class S, class T, class U> bool IN(S a, T x, U b) { return a <= x && x < b; }
template<class T> inline bool CHMAX(T & a, const T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool CHMIN(T & a, const T b) { if (a > b) { a = b; return true; } return false; }
// test
template<class T> using V = std::vector<T>;
template<class T> using VV = V<V<T>>;
//
//std::ostream& operator<<(std::ostream& os, const __int128& t) {
// if (t >= 1000000000000000000) {
// os << (long long)(t / 1000000000000000000) << (long long)(t % 1000000000000000000);
// }
// else {
// os << (long long)t;
// }
// return os;
//}
template<typename S, typename T>
std::ostream & operator<<(std::ostream & os, const std::pair<S, T> & p) {
os << '(' << p.first << ',' << p.second << ')';
return os;
}
template<typename T>
std::ostream & operator<<(std::ostream & os, const std::vector<T> & v) {
os << '{';
for (size_t i = 0; i < v.size(); ++i) {
os << v[i];
if (i + 1 < v.size()) os << ',';
}
os << '}';
return os;
}
template<typename T>
std::ostream & operator<<(std::ostream & os, const std::set<T> & v) {
os << '{';
for (auto it = v.cbegin(); it != v.cend();) {
os << *it << (++it == v.cend() ? '}' : ',');
}
return os;
}
template<typename S, typename T>
std::ostream & operator<<(std::ostream & os, const std::map<S, T> & m) {
os << '{';
for (auto it = m.cbegin(); it != m.cend();) { os << it->first << ':' << it->second; ++it; os << (it != m.cend() ? ',' : '}'); }
return os;
}
template<typename T>
std::ostream & operator<<(std::ostream & os, std::queue<T> q) {
os << '<';
while (!q.empty()) { os << q.front(); q.pop(); os << (q.empty() ? '<' : ','); }
return os;
}
template<typename T>
std::ostream & operator<<(std::ostream & os, std::stack<T> q) {
os << '>';
while (!q.empty()) { os << q.top(); q.pop(); os << (q.empty() ? ']' : ','); }
return os;
}
namespace std {
template<typename S, typename T> class numeric_limits<pair<S, T>> {
public:
static constexpr pair<S, T> max() noexcept { return { numeric_limits<S>::max(), numeric_limits<T>::max() }; }
static constexpr pair<S, T> lowest() noexcept { return { numeric_limits<S>::lowest(), numeric_limits<T>::lowest() }; }
};
}
// type/const
using i64 = long long;
using u64 = unsigned long long;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
//using PAIR = std::pair<int, int>;
using PAIR = std::pair<i64, i64>;
constexpr int INFINT = (1 << 30) - 1; // 1.07x10^ 9
constexpr int INFINT_LIM = (1LL << 31) - 1; // 2.15x10^ 9
constexpr long long INFLL = 1LL << 60; // 1.15x10^18
constexpr long long INFLL_LIM = (1LL << 62) - 1 + (1LL << 62); // 9.22x10^18
constexpr ld EPS = 1e-6;
constexpr int MOD = 998244353;
constexpr long double PI = 3.141592653589793238462643383279;
template<class T, size_t N> void FILL(T(&a)[N], const T & val) { for (auto & x : a) x = val; }
template<class ARY, size_t N, size_t M, class T> void FILL(ARY(&a)[N][M], const T & val) { for (auto & b : a) FILL(b, val); }
template<class T> void FILL(std::vector<T> & a, const T & val) { for (auto & x : a) x = val; }
template<class ARY, class T> void FILL(std::vector<std::vector<ARY>> & a, const T & val) { for (auto & b : a) FILL(b, val); }
// ------------>8------------------------>8------------
class ModInt {
friend std::istream & operator>>(std::istream & is, ModInt & obj);
private:
inline ModInt & normUpper() { if (val >= MOD) val -= MOD; return *this; }
inline ModInt & normLower() { if (val < 0) val += MOD; return *this; }
inline ModInt & norm() { return normUpper(), normLower(); }
public:
constexpr static int numOfPrecalc = 3000006;
static ModInt inv[numOfPrecalc];
static ModInt fact[numOfPrecalc];
static ModInt factInv[numOfPrecalc];
int val;
ModInt() : val(0) {}
ModInt(int n) : val(n) { if (n >= MOD || n <= -MOD) n %= MOD; norm(); }
ModInt(long long n) : ModInt((int)(n % MOD)) {}
ModInt & operator=(const ModInt & r) { val = r.val; return *this; }
ModInt operator+() const { return *this; }
ModInt operator-() const { return ModInt(MOD - val); }
ModInt & operator+=(const ModInt & r) { val += r.val; return normUpper(); }
ModInt & operator-=(const ModInt & r) { val -= r.val; return normLower(); }
ModInt & operator*=(const ModInt & r) { val = (long long)val * r.val % MOD; return *this; }
ModInt & operator/=(ModInt r) { return *this *= (r.val < numOfPrecalc) ? inv[r.val] : (r ^= MOD - 2); }
ModInt & operator^=(int p) {
assert(p >= 0);
ModInt t(*this); *this = 1;
for (; p; p >>= 1, t *= t) if (p & 1) *this *= t;
return *this;
}
const ModInt operator+(const ModInt & r) const { return ModInt(*this) += r; }
const ModInt operator-(const ModInt & r) const { return ModInt(*this) -= r; }
const ModInt operator*(const ModInt & r) const { return ModInt(*this) *= r; }
const ModInt operator/(const ModInt & r) const { return ModInt(*this) /= r; }
const ModInt operator^(int p) const { return ModInt(*this) ^= p; }
bool operator==(const ModInt & r) const { return val == r.val; }
bool operator==(const int r) const { return *this == ModInt(r); }
bool operator!=(const ModInt & r) const { return val != r.val; }
bool operator!=(const int r) const { return *this != ModInt(r); }
};
const ModInt operator+(long long l, const ModInt & r) { return ModInt(l) += r; }
const ModInt operator-(long long l, const ModInt & r) { return ModInt(l) -= r; }
const ModInt operator*(long long l, const ModInt & r) { return ModInt(l) *= r; }
const ModInt operator/(long long l, const ModInt & r) { return ModInt(l) /= r; }
const ModInt operator+(int l, const ModInt & r) { return ModInt(l) += r; }
const ModInt operator-(int l, const ModInt & r) { return ModInt(l) -= r; }
const ModInt operator*(int l, const ModInt & r) { return ModInt(l) *= r; }
const ModInt operator/(int l, const ModInt & r) { return ModInt(l) /= r; }
std::ostream & operator<<(std::ostream & os, const ModInt & obj) { return os << obj.val; }
/* friend */ std::istream & operator>>(std::istream & is, ModInt & obj) {
is >> obj.val; obj.norm();
return is;
}
ModInt ModInt::inv[ModInt::numOfPrecalc];
ModInt ModInt::fact[ModInt::numOfPrecalc];
ModInt ModInt::factInv[ModInt::numOfPrecalc];
struct Init_ModInt {
Init_ModInt() {
// inv
ModInt::inv[1] = 1;
for (int i = 2; i < ModInt::numOfPrecalc; ++i) ModInt::inv[i] = (MOD - MOD / i) * ModInt::inv[MOD % i];
// fact
ModInt::fact[0] = 1;
ModInt::factInv[0] = 1;
for (int i = 1; i < ModInt::numOfPrecalc; ++i) {
ModInt::fact[i] = ModInt::fact[i - 1] * i;
ModInt::factInv[i] = ModInt::factInv[i - 1] * ModInt::inv[i];
}
}
} _init_modint;
ModInt Permutation(int n, int r) {
if (n < 0 || r < 0 || n < r) return 0;
return ModInt::fact[n] * ModInt::factInv[n - r];
}
ModInt Combination(int n, int r) {
if (n < 0 || r < 0 || n < r) return 0;
return ModInt::fact[n] * ModInt::factInv[n - r] * ModInt::factInv[r];
}
ModInt CombinationWithRepetition(ll n, ll r) {
return Combination(n + r - 1, r);
}
/** ModInt **/
// メビウス関数列挙
std::vector<int> enumerateMobius(int n) {
std::vector<int> mu(n + 1, 0);
mu[1] = 1;
for (int i = 1; i <= n; i++) if (mu[i]) for (int j = i << 1; j <= n; j += i) mu[j] -= mu[i];
return mu;
}
// 約数列挙
VV<int> initDivisors(int n) {
VV<int> divisors(n + 1);
for (int i = 1; i <= n; ++i) {
for (int j = i; j <= n; j += i) {
divisors[j].push_back(i);
}
}
return divisors;
}
signed main() {
INIT;
VAR(int, n);
VEC(int, a, n);
auto mu = enumerateMobius(200005);
VV<int> ds(200005 + 1);
FOR(i, 1, 200005) {
for (int j = i; j <= 200005; j += i) {
ds[j].emplace_back(i);
}
}
V<ModInt> p10(200005, 1);
REP(i, 200004) p10[i + 1] = p10[i] * 10;
V<bool> used(200005, false);
used[1] = true;
ModInt ans = 1;
REP(i, n) {
for (auto x : ds[a[i]]) {
if (used[x]) continue;
used[x] = true;
ModInt sub = 1;
for (auto d : ds[x]) {
if (mu[d] == 0) continue;
if (mu[d] == 1) sub *= p10[x / d] - 1;
else sub /= p10[x / d] - 1;
}
ans *= sub;
}
OUT(ans)BR;
}
return 0;
}
Submission Info
| Submission Time |
|
| Task |
C - Repunits |
| User |
satanic0258 |
| Language |
C++ 23 (gcc 12.2) |
| Score |
900 |
| Code Size |
15480 Byte |
| Status |
AC |
| Exec Time |
240 ms |
| Memory |
62016 KiB |
Compile Error
Main.cpp:26:1: warning: multi-line comment [-Wcomment]
26 | // j@@#_ .@@@@@@@b J@@@@@@@h. .H@@\
| ^
Main.cpp: In member function ‘ModInt ModInt::operator+() const’:
Main.cpp:221:43: warning: implicitly-declared ‘constexpr ModInt::ModInt(const ModInt&)’ is deprecated [-Wdeprecated-copy]
221 | ModInt operator+() const { return *this; }
| ^~~~~
Main.cpp:220:18: note: because ‘ModInt’ has user-provided ‘ModInt& ModInt::operator=(const ModInt&)’
220 | ModInt & operator=(const ModInt & r) { val = r.val; return *this; }
| ^~~~~~~~
Main.cpp: In member function ‘ModInt& ModInt::operator^=(int)’:
Main.cpp:229:31: warning: implicitly-declared ‘constexpr ModInt::ModInt(const ModInt&)’ is deprecated [-Wdeprecated-copy]
229 | ModInt t(*this); *this = 1;
| ^
Main.cpp:220:18: note: because ‘ModInt’ has user-provided ‘ModInt& ModInt::operator=(const ModInt&)’
220 | ModInt & operator=(const ModInt & r) { val = r.val; return *this; }
| ^~~~~~~~
Main.cpp: In member function ‘const ModInt ModInt::operator+(const ModInt&) const’:
Main.cpp:233:77: warning: implicitly-declared ‘constexpr ModInt::ModInt(const ModInt&)’ is deprecated [-Wdeprecated-copy]
233 | const ModInt operator+(const ModInt & r) const { return ModInt(*this) += r; }
| ^
Main.cpp:220:18: note: because ‘ModInt’ has user-provided ‘ModInt& ModInt::operator=(const ModInt&)’
220 | ModInt & operator=(const ModInt & r) { val = r.val; return *this; }
| ^~~~~~~~
Main.cpp:233:79: warning: implicitly-declared ‘constexpr ModInt::ModInt(const ModInt&)’ is deprecated [-Wdeprecated-copy]
233 | const ModInt operator+(const ModInt & r) const { return ModInt(*this) += r; }
| ~~~~~~~~~~~~~~^~~~
Main.cpp:220:18: note: because ‘ModInt’ has user-provided ‘ModInt& ModInt::operator=(const ModInt&)’
220 | ModInt & operator=(const ModInt & r) { val = r.val; return *this; }
| ^~~~~~~~
Main.cpp: In member function ‘const ModInt ModInt::operator-(const ModInt&) const’:
Main.cpp:234:77: warning: implicitly-declared ‘constexpr ModInt::ModInt(const ModInt&)’ is deprecated [-Wdeprecated-copy]
234 | const ModInt operator-(const ModInt & r) const { return ModInt(*this) -= r; }
| ^
Main.cpp:220:18: note: because ‘ModInt’ has user-provided ‘ModInt& ModInt::operator=(const ModInt&)’
220 | ModInt & operator=(const ModInt & r) { val = r.val; return *this; }
| ^~~~~~~~
Main.cpp:234:79: warning: implicitly-declared ‘constexpr ModInt::ModInt(const ModInt&)’ is deprecated [-Wdeprecated-copy]
234 | const ModInt operator-(const ModInt & r) const { return ModInt(*this) -= r; }
| ~~~~~~~~~~~~~~^~~~
Main.cpp:220:18: note: because ‘ModInt’ has user-provided ‘ModInt& ModInt::operator=(const ModInt&)’
220 | ModInt & operator=(const ModInt & r) { val = r.val; return *this; }
| ^~~~~~~~
Main.cpp: In member function ‘const ModInt ModInt::operator*(const ModInt&) const’:
Main.cpp:235:77: warning: implicitly-declared ‘constexpr ModInt::ModInt(const ModInt&)’ is deprecated [-Wdeprecated-copy]
235 | const ModInt operator*(const ModInt & r) const { return ModInt(*this) *= r; }
| ^
Main.cpp:220:18: note: because ‘ModInt’ has user-provided ‘ModInt& ModInt::operator=(const ModInt&)’
220 | ModInt & operator=(const ModInt & r) { val = r.val; return *this; }
| ^~~~~~~~
Main.cpp:235:79: warning: implicitly-declared ‘constexpr ModInt::ModInt(const ModInt&)’ is deprecated [-Wdeprecated-copy]
235 | const ModInt operator*(const ModInt & r) const { return ModInt(*this) *= r; }
| ~~~~~~~~~~~~~~^~~~
Main.cpp:220:18: note: because ‘ModInt’ has user-provided ‘ModInt& ModInt::operator=(const ModInt&)’
220 | ModInt & operator=(const ModInt & r) { val = r.val; return *this; }
| ^~~~~~~~
Main.cpp: In member function ‘const ModInt ModInt::operator/(const ModInt&) const’:
Main.cpp:236:77: warning: implicitly-declared ‘constexpr ModInt::ModInt(const ModInt&)’ is deprecated [-Wdeprecated-copy]
236 | const ModInt operator/(const ModInt & r) const { return ModInt(*this) /= r; }
| ^
Main.cpp:220:18: note: because ‘ModInt’ has user-provided ‘ModInt& ModInt::operator=(const ModInt&)’
220 | ModInt & operator=(const ModInt & r) { val = r.val; return *this; }
| ^~~~~~~~
Main.cpp:236:82: warning: implicitly-declared ‘constexpr ModInt::ModInt(const ModInt&)’ is deprecated [-Wdeprecated-copy]
236 | const ModInt operator/(const ModInt & r) const { return ModInt(*this) /= r; }
| ^
Main.cpp:220:18: note: because ‘ModInt’ has user-provided ‘ModInt& ModInt::operator=(const ModInt&)’
220 | ModInt & operator=(const ModInt & r) { val = r.val; return *this; }
| ^~~~~~~~
Main.cpp:226:36: note: initializing argument 1 of ‘ModInt& ModInt::operator/=(ModInt)’
226 | ModInt & operator/=(ModInt r) { return *this *= (r.val < numOfPrecalc) ? inv[r.val] : (r ^= MOD - 2); }
| ~~~~~~~^
Main.cpp:236:79: warning: implicitly-declared ‘constexpr ModInt::ModInt(const ModInt&)’ is deprecated [-Wdeprecated-copy]
236 | const ModInt operator/(const ModInt & r) const { return ModInt(*this) /= r; }
| ~~~~~~~~~~~~~~^~~~
Main.cpp:220:18: note: because ‘ModInt’ has user-provided ‘ModInt& ModInt::operator=(const ModInt&)’
220 | ModInt & operator=(const ModInt & r) { val = r.val; return *this; }
| ^~~~~~~~
Main.cpp: In member function ‘const ModInt ModInt::operator^(int) const’:
Main.cpp:237:66: warning: implicitly-declared ‘constexpr ModInt::ModInt(const ModInt&)’ is deprecated [-Wdeprecated-copy]
237 | const ModInt operator^(int p) const { return ModInt(*this) ^= p; }
| ^
Main.cpp:220:18: note: because ‘ModInt’ has user-provided ‘ModInt& ModInt::operator=(const ModInt&)’
220 | ModInt & operator=(const ModInt & r) { val = r.val; return *this; }
| ^~~~~~~~
Main.cpp:237:68: warning: implicitly-declared ‘constexpr ModInt::ModInt(const ModInt&)’ is deprecated [-Wdeprecated-copy]
237 | const ModInt operator^(int p) const { return ModInt(*this) ^= p; }
| ~~~~~~~~~~~~~~^~~~
Main.cpp:220:18: note: because ‘ModInt’ has user-provided ‘ModInt& ModInt::operator=(const ModInt&)’
220 | ModInt & operator=(const ModInt & r) { val = r.val; return *this; }
| ^~~~~~~~
Main.cpp: In function ‘const ModInt operator+(long long int, const ModInt&)’:
Main.cpp:243:74: warning: implicitly-declared ‘constexpr ModInt::ModInt(const ModInt&)’ is deprecated [-Wdeprecated-copy]
243 | const ModInt operator+(long long l, const ModInt & r) { return ModInt(l) += r; }
| ~~~~~~~~~~^~~~
Main.cpp:220:18: note: because ‘ModInt’ has user-provided ‘ModInt& ModInt::operator=(const ModInt&)’
220 | ModInt & operator=(const ModInt & r) { val = r.val; return *this; }
| ^~~~~~~~
Main.cpp: In function ‘const ModInt operator-(long long int, const ModInt&)’:
Main.cpp:244:74: warning: implicitly-declared ‘constexpr ModInt::ModInt(const ModInt&)’ is deprecated [-Wdeprecated-copy]
244 | const ModInt operator-(long long l, const ModInt & r) { return ModInt(l) -= r; }
| ~~~~~~~~~~^~~~
Main.cpp:220:18: note: because ‘ModInt’ has user-provided ‘ModInt& ModInt::operator=(const ModInt&)’
220 | ModInt & operator=(const ModInt & r) { val = r.val; return *this; }
| ^~~~~~~~
Main.cpp: In function ‘const ModInt operator*(long long int, const ModInt&)’:
Main.cpp:245:74: warning: implicitly-declared ‘constexpr ModInt::ModInt(const ModInt&)’ is deprecated [-Wdeprecated-copy]
245 | const ModInt operator*(long long l, const ModInt & r) { return ModInt(l) *= r; }
| ~~~~~~~~~~^~~~
Main.cpp:220:18: note: because ‘ModInt’ has user-provided ‘ModInt& ModInt::operator=(const ModInt&)’
220 | ModInt & operator=(const ModInt & r) { val = r.val; return *this; }
| ^~~~~~~~
Main.cpp: In function ‘const ModInt operator/(long long int, const ModInt&)’:
Main.cpp:246:77: warning: implicitly-declared ‘constexpr ModInt::ModInt(const ModInt&)’ is deprecated [-Wdeprecated-copy]
246 | const ModInt operator/(long long l, const ModInt & r) { return ModInt(l) /= r; }
| ^
Main.cpp:220:18: note: because ‘ModInt’ has user-provided ‘ModInt& ModInt::operator=(const ModInt&)’
220 | ModInt & operator=(const ModInt & r) { val = r.val; return *this; }
| ^~~~~~~~
Main.cpp:226:36: note: initializing argument 1 of ‘ModInt& ModInt::operator/=(ModInt)’
226 | ModInt & operator/=(ModInt r) { return *this *= (r.val < numOfPrecalc) ? inv[r.val] : (r ^= MOD - 2); }
| ~~~~~~~^
Main.cpp:246:74: warning: implicitly-declared ‘constexpr ModInt::ModInt(const ModInt&)’ is deprecated [-Wdeprecated-copy]
246 | const ModInt operator/(long long l, const ModInt & r) { return ModInt(l) /= r; }
| ~~~~~~~~~~^~~~
Main.cpp:220:18: note: because ‘ModInt’ has user-provided ‘ModInt& ModInt::operator=(const ModInt&)’
220 | ModInt & operator=(const ModInt & r) { val = r.val; return *this; }
| ^~~~~~~~
Main.cpp: In function ‘const ModInt operator+(int, const ModInt&)’:
Main.cpp:247:68: warning: implicitly-declared ‘constexpr ModInt::ModInt(const ModInt&)’ is deprecated [-Wdeprecated-copy]
247 | const ModInt operator+(int l, const ModInt & r) { return ModInt(l) += r; }
| ~~~~~~~~~~^~~~
Main.cpp:220:18: note: because ‘ModInt’ has user-provided ‘ModInt& ModInt::operator=(const ModInt&)’
220 | ModInt & operator=(const ModInt & r) { val = r.val; return *this; }
| ^~~~~~~~
Main.cpp: In function ‘const ModInt operator-(int, const ModInt&)’:
Main.cpp:248:68: warning: implicitly-declared ‘constexpr ModInt::ModInt(const ModInt&)’ is deprecated [-Wdeprecated-copy]
248 | const ModInt operator-(int l, const ModInt & r) { return ModInt(l) -= r; }
| ~~~~~~~~~~^~~~
Main.cpp:220:18: note: because ‘ModInt’ has user-provided ‘ModInt& ModInt::operator=(const ModInt&)’
220 | ModInt & operator=(const ModInt & r) { val = r.val; return *this; }
| ^~~~~~~~
Main.cpp: In function ‘const ModInt operator*(int, const ModInt&)’:
Main.cpp:249:68: warning: implicitly-declared ‘constexpr ModInt::ModInt(const ModInt&)’ is deprecated [-Wdeprecated-copy]
249 | const ModInt operator*(int l, const ModInt & r) { return ModInt(l) *= r; }
| ~~~~~~~~~~^~~~
Main.cpp:220:18: note: because ‘ModInt’ has user-provided ‘ModInt& ModInt::operator=(const ModInt&)’
220 | ModInt & operator=(const ModInt & r) { val = r.val; return *this; }
| ^~~~~~~~
Main.cpp: In function ‘const ModInt operator/(int, const ModInt&)’:
Main.cpp:250:71: warning: implicitly-declared ‘constexpr ModInt::ModInt(const ModInt&)’ is deprecated [-Wdeprecated-copy]
250 | const ModInt operator/(int l, const ModInt & r) { return ModInt(l) /= r; }
| ^
Main.cpp:220:18: note: because ‘ModInt’ has user-provided ‘ModInt& ModInt::operator=(const ModInt&)’
220 | ModInt & operator=(const ModInt & r) { val = r.val; return *this; }
| ^~~~~~~~
Main.cpp:226:36: note: initializing argument 1 of ‘ModInt& ModInt::operator/=(ModInt)’
226 | ModInt & operator/=(ModInt r) { return *this *= (r.val < numOfPrecalc) ? inv[r.val] : (r ^= MOD - 2); }
| ~~~~~~~^
Main.cpp:250:68: warning: implicitly-declared ‘constexpr ModInt::ModInt(const ModInt&)’ is deprecated [-Wdeprecated-copy]
250 | const ModInt operator/(int l, const ModInt & r) { return ModInt(l) /= r; }
| ~~~~~~~~~~^~~~
Main.cpp:220:18: note: because ‘ModInt’ has user-provided ‘ModInt& ModInt::operator=(const ModInt&)’
220 | ModInt & operator=(const ModInt & r) { val = r.val; return *this; }
| ^~~~~~~~
Main.cpp: In function ‘int main()’:
Main.cpp:98:27: warning: implicitly-declared ‘constexpr ModInt::ModInt(const ModInt&)’ is deprecated [-Wdeprecated-copy]
98 | #define OUT(...) MACRO_OUT(__VA_ARGS__);
| ~~~~~~~~~^~~~~~~~~~~~~
Main.cpp:343:17: note: in expansion of macro ‘OUT’
343 | OUT(ans)BR;
| ^~~
Main.cpp:220:18: note: because ‘ModInt’ has user-provided ‘ModInt& ModInt::operator=(const ModInt&)’
220 | ModInt & operator=(const ModInt & r) { val = r.val; return *this; }
| ^~~~~~~~
Main.cpp:96:44: note: initializing argument 1 of ‘void MACRO_OUT(T) [with T = ModInt]’
96 | template<typename T>void MACRO_OUT(const T t) { scan_out << t; }
| ~~~~~~~~^
Judge Result
| Set Name |
Sample |
All |
| Score / Max Score |
0 / 0 |
900 / 900 |
| Status |
|
|
| Set Name |
Test Cases |
| Sample |
00_sample_00.txt, 00_sample_01.txt, 00_sample_02.txt |
| All |
00_sample_00.txt, 00_sample_01.txt, 00_sample_02.txt, 01_n_small_00.txt, 01_n_small_01.txt, 01_n_small_02.txt, 01_n_small_03.txt, 01_n_small_04.txt, 02_random_00.txt, 02_random_01.txt, 02_random_02.txt, 02_random_03.txt, 02_random_04.txt, 02_random_05.txt, 02_random_06.txt, 02_random_07.txt, 02_random_08.txt, 02_random_09.txt, 02_random_10.txt, 02_random_11.txt, 02_random_12.txt, 02_random_13.txt, 02_random_14.txt, 03_hcn_00.txt, 03_hcn_01.txt, 03_hcn_02.txt, 03_hcn_03.txt, 03_hcn_04.txt, 04_max_00.txt, 05_min_00.txt |
| Case Name |
Status |
Exec Time |
Memory |
| 00_sample_00.txt |
AC |
107 ms |
61076 KiB |
| 00_sample_01.txt |
AC |
108 ms |
60956 KiB |
| 00_sample_02.txt |
AC |
108 ms |
61124 KiB |
| 01_n_small_00.txt |
AC |
112 ms |
61068 KiB |
| 01_n_small_01.txt |
AC |
109 ms |
61124 KiB |
| 01_n_small_02.txt |
AC |
110 ms |
61100 KiB |
| 01_n_small_03.txt |
AC |
111 ms |
61216 KiB |
| 01_n_small_04.txt |
AC |
111 ms |
61164 KiB |
| 02_random_00.txt |
AC |
201 ms |
61668 KiB |
| 02_random_01.txt |
AC |
218 ms |
61872 KiB |
| 02_random_02.txt |
AC |
196 ms |
61592 KiB |
| 02_random_03.txt |
AC |
218 ms |
61876 KiB |
| 02_random_04.txt |
AC |
217 ms |
61896 KiB |
| 02_random_05.txt |
AC |
218 ms |
61860 KiB |
| 02_random_06.txt |
AC |
209 ms |
61908 KiB |
| 02_random_07.txt |
AC |
218 ms |
62016 KiB |
| 02_random_08.txt |
AC |
191 ms |
61664 KiB |
| 02_random_09.txt |
AC |
217 ms |
61932 KiB |
| 02_random_10.txt |
AC |
226 ms |
61852 KiB |
| 02_random_11.txt |
AC |
239 ms |
62016 KiB |
| 02_random_12.txt |
AC |
239 ms |
61868 KiB |
| 02_random_13.txt |
AC |
239 ms |
61912 KiB |
| 02_random_14.txt |
AC |
240 ms |
61916 KiB |
| 03_hcn_00.txt |
AC |
189 ms |
61876 KiB |
| 03_hcn_01.txt |
AC |
189 ms |
61888 KiB |
| 03_hcn_02.txt |
AC |
187 ms |
61788 KiB |
| 03_hcn_03.txt |
AC |
187 ms |
61880 KiB |
| 03_hcn_04.txt |
AC |
187 ms |
61788 KiB |
| 04_max_00.txt |
AC |
138 ms |
61924 KiB |
| 05_min_00.txt |
AC |
108 ms |
61136 KiB |