結果
問題 | No.1476 esreveR dna esreveR |
ユーザー |
![]() |
提出日時 | 2021-04-16 20:06:17 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 6 ms / 2,000 ms |
コード長 | 2,837 bytes |
コンパイル時間 | 2,816 ms |
コンパイル使用メモリ | 208,640 KB |
最終ジャッジ日時 | 2025-01-20 18:22:54 |
ジャッジサーバーID (参考情報) |
judge5 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 6 |
ソースコード
#pragma GCC optimize("O3")//#pragma GCC target("avx2")//#pragma GCC optimize("unroll-loops")#include <bits/stdc++.h>using namespace std;typedef long long ll;typedef unsigned long long ull;typedef long double ld;typedef vector<int> vi;typedef vector<ll> vll;typedef vector<ld> vld;typedef pair<ll,ll> Pll;typedef pair<int,int> Pin;ll INF = 1e16;int inf = 1e9;#define ALL(x) (x).begin(), (x).end()#define FOR(i, m, n) for (ll i = (m); i < (n); ++i)#define REVFOR(i, m, n) for (ll i = (n - 1); i >= (m); --i)#define REP(i, n) FOR(i, 0, n)#define REVREP(i, n) REVFOR(i, 0, n)#define fi first#define se second#define pb push_back#define mp make_pair#define eb emplace_back#define bcnt __builtin_popcountll#ifdef LOCAL#include <prettyprint.hpp>#define debug(...) cerr << "[" << #__VA_ARGS__ << "]: ", d_err(__VA_ARGS__);#else#define debug(...) 83;#endifvoid d_err() {cerr << endl;}template <typename H, typename... T>void d_err(H h, T... t) {cerr << h << " ";d_err(t...);}template <typename T>void print(T x) {cout << x << "\n";}template <typename T>void print(vector<T>& x) {int N = x.size();REP(i, N) {if (i > 0) cout << " ";cout << x[i];}cout << "\n";}//const ll MOD = 1000000007;const ll MOD = 998244353;struct mint {ll x; // typedef long long ll;mint(ll x=0):x((x%MOD+MOD)%MOD){}mint operator-() const { return mint(-x);}mint& operator+=(const mint a) {if ((x += a.x) >= MOD) x -= MOD;return *this;}mint& operator-=(const mint a) {if ((x += MOD-a.x) >= MOD) x -= MOD;return *this;}mint& operator*=(const mint a) {(x *= a.x) %= MOD;return *this;}mint operator+(const mint a) const {mint res(*this);return res+=a;}mint operator-(const mint a) const {mint res(*this);return res-=a;}mint operator*(const mint a) const {mint res(*this);return res*=a;}mint pow(ll t) const {if (!t) return 1;mint a = 1;mint tmp = *this;while(t > 0) {if (t & 1) a *= tmp;tmp *= tmp;t >>= 1;}return a;}// for prime MODmint inv() const {return pow(MOD-2);}mint& operator/=(const mint a) {return (*this) *= a.inv();}mint operator/(const mint a) const {return mint(*this) /= a;}};istream& operator>>(istream& is, mint& a) { return is >> a.x;}ostream& operator<<(ostream& os, const mint& a) { return os << a.x;}typedef vector<mint> vmi;int main(){cin.tie(0);ios_base::sync_with_stdio(false);cout << fixed << setprecision(20);ll n; cin >> n;print(mint(6).pow(n / 2));}