結果

問題 No.1476 esreveR dna esreveR
ユーザー rokahikou1
提出日時 2021-04-16 20:23:45
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 3 ms / 2,000 ms
コード長 6,551 bytes
コンパイル時間 1,590 ms
コンパイル使用メモリ 166,348 KB
実行使用メモリ 6,944 KB
最終ジャッジ日時 2024-07-02 22:32:27
合計ジャッジ時間 2,116 ms
ジャッジサーバーID
(参考情報)
judge2 / judge4
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 2
other AC * 6
権限があれば一括ダウンロードができます

ソースコード

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

#pragma region Macros
#include <bits/stdc++.h>
#define rep(i, n) for(int(i) = 0; (i) < (n); (i)++)
#define FOR(i, m, n) for(int(i) = (m); (i) < (n); (i)++)
#define ALL(v) (v).begin(), (v).end()
#define LLA(v) (v).rbegin(), (v).rend()
#define SZ(v) (int)(v).size()
#define INT(...) \
int __VA_ARGS__; \
read(__VA_ARGS__)
#define LL(...) \
ll __VA_ARGS__; \
read(__VA_ARGS__)
#define DOUBLE(...) \
double __VA_ARGS__; \
read(__VA_ARGS__)
#define CHAR(...) \
char __VA_ARGS__; \
read(__VA_ARGS__)
#define STRING(...) \
string __VA_ARGS__; \
read(__VA_ARGS__)
#define VEC(type, name, size) \
vector<type> name(size); \
read(name)
#define VEC2(type, name, height, width) \
vector<vector<type>> name(height, vector<type>(width)); \
read(name)
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using Graph = vector<vector<int>>;
template <typename T> struct edge {
int from, to;
T cost;
edge(int f, int t, T c) : from(f), to(t), cost(c) {}
};
template <typename T> using WGraph = vector<vector<edge<T>>>;
const int INF = 1 << 30;
const ll LINF = 1LL << 60;
const int MOD = 998244353;
const char newl = '\n';
template <class T> inline vector<T> make_vec(size_t a, T val) {
return vector<T>(a, val);
}
template <class... Ts> inline auto make_vec(size_t a, Ts... ts) {
return vector<decltype(make_vec(ts...))>(a, make_vec(ts...));
}
void read() {}
template <class T> inline void read(T &a) { cin >> a; }
template <class T, class S> inline void read(pair<T, S> &p) {
read(p.first), read(p.second);
}
template <class T> inline void read(vector<T> &v) {
for(auto &&a : v)
read(a);
}
template <class Head, class... Tail>
inline void read(Head &head, Tail &...tail) {
read(head), read(tail...);
}
template <class T> void write(const T &a) { cout << a << '\n'; }
template <class T> void write(const vector<T> &a) {
for(int i = 0; i < a.size(); i++)
cout << a[i] << (i + 1 == a.size() ? '\n' : ' ');
}
template <class Head, class... Tail>
void write(const Head &head, const Tail &...tail) {
cout << head << ' ';
write(tail...);
}
template <class T> void writel(const T &a) { cout << a << '\n'; }
template <class T> void writel(const vector<T> &a) {
for(int i = 0; i < a.size(); i++)
cout << a[i] << '\n';
}
template <class Head, class... Tail>
void writel(const Head &head, const Tail &...tail) {
cout << head << '\n';
write(tail...);
}
template <class T> auto sum(const vector<T> &a) {
return accumulate(ALL(a), T(0));
}
template <class T> auto min(const vector<T> &a) { return *min_element(ALL(a)); }
template <class T> auto max(const vector<T> &a) { return *max_element(ALL(a)); }
template <class T> inline void chmax(T &a, T b) { (a < b ? a = b : a); }
template <class T> inline void chmin(T &a, T b) { (a > b ? a = b : a); }
struct IO {
IO() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout << fixed << setprecision(10);
}
} io;
#pragma endregion
template <uint_fast64_t MOD> class ModInt {
using u64 = uint_fast64_t;
public:
u64 val;
ModInt(const u64 x = 0) : val((x + MOD) % MOD) {}
constexpr u64 &value() { return val; }
constexpr ModInt operator-() { return val ? MOD - val : 0; }
constexpr ModInt operator+(const ModInt &rhs) const {
return ModInt(*this) += rhs;
}
constexpr ModInt operator-(const ModInt &rhs) const {
return ModInt(*this) -= rhs;
}
constexpr ModInt operator*(const ModInt &rhs) const {
return ModInt(*this) *= rhs;
}
constexpr ModInt operator/(const ModInt &rhs) const {
return ModInt(*this) /= rhs;
}
constexpr ModInt &operator+=(const ModInt &rhs) {
val += rhs.val;
if(val >= MOD) {
val -= MOD;
}
return *this;
}
constexpr ModInt &operator-=(const ModInt &rhs) {
if(val < rhs.val) {
val += MOD;
}
val -= rhs.val;
return *this;
}
constexpr ModInt &operator*=(const ModInt &rhs) {
val = val * rhs.val % MOD;
return *this;
}
constexpr ModInt &operator/=(const ModInt &rhs) {
*this *= rhs.inv();
return *this;
}
constexpr bool operator==(const ModInt &rhs) {
return this->val == rhs.val;
}
constexpr bool operator!=(const ModInt &rhs) {
return this->val != rhs.val;
}
friend constexpr ostream &operator<<(ostream &os, const ModInt<MOD> &x) {
return os << x.val;
}
friend constexpr istream &operator>>(istream &is, ModInt<MOD> &x) {
return is >> x.val;
}
constexpr ModInt inv() const { return ModInt(*this).pow(MOD - 2); }
constexpr ModInt pow(ll e) const {
u64 x = 1, p = val;
while(e > 0) {
if(e % 2 == 0) {
p = (p * p) % MOD;
e /= 2;
} else {
x = (x * p) % MOD;
e--;
}
}
return ModInt(x);
}
};
using mint = ModInt<MOD>;
//nCk mod.p;1<=k<=n<=1e7,pfor ModInt
template <class T> struct BiCoefficient {
vector<T> fac, finv, inv;
BiCoefficient(const int MAX) : fac(MAX), finv(MAX), inv(MAX) {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for(int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i;
inv[i] = -inv[MOD % i] * (MOD / i);
finv[i] = finv[i - 1] * inv[i];
}
}
T comb(int n, int k) {
if(n < k)
return 0;
if(n < 0 || k < 0)
return 0;
return fac[n] * finv[k] * finv[n - k];
}
};
int main() {
LL(n);
write(mint(6).pow(n / 2));
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0