結果

問題 No.1206 OR, OR, OR......
ユーザー ningenMe
提出日時 2020-08-30 14:50:52
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 3 ms / 2,000 ms
コード長 6,247 bytes
コンパイル時間 2,898 ms
コンパイル使用メモリ 199,664 KB
最終ジャッジ日時 2025-01-13 22:02:15
ジャッジサーバーID
(参考情報)
judge3 / judge5
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 1
other AC * 8
権限があれば一括ダウンロードができます

ソースコード

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

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define ALL(obj) (obj).begin(),(obj).end()
template<class T> using priority_queue_reverse = priority_queue<T,vector<T>,greater<T>>;
constexpr long long MOD = 1'000'000'000LL + 7;
constexpr long long MOD2 = 998244353;
constexpr long long HIGHINF = (long long)1e18;
constexpr long long LOWINF = (long long)1e15;
constexpr long double PI = 3.1415926535897932384626433L;
template <class T> vector<T> multivector(size_t N,T init){return vector<T>(N,init);}
template <class... T> auto multivector(size_t N,T... t){return vector<decltype(multivector(t...))>(N,multivector(t...));}
template <class T> void corner(bool flg, T hoge) {if (flg) {cout << hoge << endl; exit(0);}}
template <class T, class U>ostream &operator<<(ostream &o, const map<T, U>&obj) {o << "{"; for (auto &x : obj) o << " {" << x.first << " : " << x
    .second << "}" << ","; o << " }"; return o;}
template <class T>ostream &operator<<(ostream &o, const set<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj
    .begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const multiset<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr !
    = obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const vector<T>&obj) {o << "{"; for (int i = 0; i < (int)obj.size(); ++i)o << (i > 0 ? ", " : "")
    << obj[i]; o << "}"; return o;}
template <class T, class U>ostream &operator<<(ostream &o, const pair<T, U>&obj) {o << "{" << obj.first << ", " << obj.second << "}"; return o;}
void print(void) {cout << endl;}
template <class Head> void print(Head&& head) {cout << head;print();}
template <class Head, class... Tail> void print(Head&& head, Tail&&... tail) {cout << head << " ";print(forward<Tail>(tail)...);}
template <class T> void chmax(T& a, const T b){a=max(a,b);}
template <class T> void chmin(T& a, const T b){a=min(a,b);}
vector<string> split(const string &str, const char delemiter) {vector<string> res;stringstream ss(str);string buffer; while( getline(ss, buffer,
    delemiter) ) res.push_back(buffer); return res;}
int msb(int x) {return x?31-__builtin_clz(x):-1;}
void YN(bool flg) {cout << (flg ? "YES" : "NO") << endl;}
void Yn(bool flg) {cout << (flg ? "Yes" : "No") << endl;}
void yn(bool flg) {cout << (flg ? "yes" : "no") << endl;}
/*
* @title Mod
*/
class Mod{
public:
//Pow_Mod O(log(n))
inline static long long pow(long long x, long long n, long long mod) {
long long res = 1;
for (x %= mod; n > 0; n >>= 1, (x *= x) %= mod) if (n & 1) (res *= x) %= mod;
return res;
}
//Inv_Mod O(log(mod))
inline static long long inv(long long x, long long mod){
return pow(x,mod-2,mod);
}
};
/*
* @title ModInt
*/
template<long long mod> class ModInt {
public:
long long x;
constexpr ModInt():x(0) {
// do nothing
}
constexpr ModInt(long long y) : x(y>=0?(y%mod): (mod - (-y)%mod)%mod) {
// do nothing
}
ModInt &operator+=(const ModInt &p) {
if((x += p.x) >= mod) x -= mod;
return *this;
}
ModInt &operator+=(const long long y) {
ModInt p(y);
if((x += p.x) >= mod) x -= mod;
return *this;
}
ModInt &operator+=(const int y) {
ModInt p(y);
if((x += p.x) >= mod) x -= mod;
return *this;
}
ModInt &operator-=(const ModInt &p) {
if((x += mod - p.x) >= mod) x -= mod;
return *this;
}
ModInt &operator-=(const long long y) {
ModInt p(y);
if((x += mod - p.x) >= mod) x -= mod;
return *this;
}
ModInt &operator-=(const int y) {
ModInt p(y);
if((x += mod - p.x) >= mod) x -= mod;
return *this;
}
ModInt &operator*=(const ModInt &p) {
x = (x * p.x % mod);
return *this;
}
ModInt &operator*=(const long long y) {
ModInt p(y);
x = (x * p.x % mod);
return *this;
}
ModInt &operator*=(const int y) {
ModInt p(y);
x = (x * p.x % mod);
return *this;
}
ModInt &operator^=(const ModInt &p) {
x = (x ^ p.x) % mod;
return *this;
}
ModInt &operator^=(const long long y) {
ModInt p(y);
x = (x ^ p.x) % mod;
return *this;
}
ModInt &operator^=(const int y) {
ModInt p(y);
x = (x ^ p.x) % mod;
return *this;
}
ModInt &operator/=(const ModInt &p) {
*this *= p.inv();
return *this;
}
ModInt &operator/=(const long long y) {
ModInt p(y);
*this *= p.inv();
return *this;
}
ModInt &operator/=(const int y) {
ModInt p(y);
*this *= p.inv();
return *this;
}
ModInt operator=(const int y) {
ModInt p(y);
*this = p;
return *this;
}
ModInt operator=(const long long y) {
ModInt p(y);
*this = p;
return *this;
}
ModInt operator-() const { return ModInt(-x); }
ModInt operator++() {
x++;
if(x>=mod) x-=mod;
return *this;
}
ModInt operator--() {
x--;
if(x<0) x+=mod;
return *this;
}
ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }
ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }
ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }
ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }
ModInt operator^(const ModInt &p) const { return ModInt(*this) ^= p; }
bool operator==(const ModInt &p) const { return x == p.x; }
bool operator!=(const ModInt &p) const { return x != p.x; }
ModInt inv() const {
int a = x, b = mod, u = 1, v = 0, t;
while(b > 0) {
t = a / b;
swap(a -= t * b, b);
swap(u -= t * v, v);
}
return ModInt(u);
}
ModInt pow(long long n) const {
ModInt ret(1), mul(x);
while(n > 0) {
if(n & 1) ret *= mul;
mul *= mul;
n >>= 1;
}
return ret;
}
friend ostream &operator<<(ostream &os, const ModInt &p) {
return os << p.x;
}
friend istream &operator>>(istream &is, ModInt &a) {
long long t;
is >> t;
a = ModInt<mod>(t);
return (is);
}
};
using modint = ModInt<MOD2>;
void solve() {
ll N,K; cin >> N >> K;
ll pow2N = Mod::pow(2,N,MOD2);
pow2N = Mod::pow(pow2N,K,MOD2);
ll pow2N_1 = Mod::pow(2,N-1,MOD2);
pow2N_1 = Mod::pow(pow2N_1,K,MOD2);
modint cnt = pow2N - pow2N_1;
cnt *= N;
cout << cnt << endl;
}
int main() {
cin.tie(0);ios::sync_with_stdio(false);
int T; cin >> T;
while(T--) {
solve();
}
return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0