結果

問題 No.2299 Antitypoglycemia
ユーザー rokahikou1rokahikou1
提出日時 2023-06-23 00:37:35
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
WA  
実行時間 -
コード長 9,170 bytes
コンパイル時間 1,511 ms
コンパイル使用メモリ 169,348 KB
実行使用メモリ 6,948 KB
最終ジャッジ日時 2024-06-30 06:21:09
合計ジャッジ時間 2,462 ms
ジャッジサーバーID
(参考情報)
judge4 / judge5
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 2 WA * 1
other AC * 20 WA * 5
権限があれば一括ダウンロードができます

ソースコード

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

#pragma region Macros
#include <bits/stdc++.h>
#define rep(i, n) for(int(i) = 0; (i) < (n); (i)++)
#define rrep(i, n) for(int(i) = (n)-1; (i) >= 0; (i)--)
#define FOR(i, m, n) for(int(i) = (m); (i) < (n); (i)++)
#define ROF(i, m, n) for(int(i) = (n)-1; (i) >= (m); (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)
#define DVEC(type, name1, name2, size) \
vector<type> name1(size), name2(size); \
read(name1, name2)
#define TVEC(type, name1, name2, name3, size) \
vector<type> name1(size), name2(size), name3(size); \
read(name1, name2, name3)
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const int INF = 1 << 30;
const ll LINF = 1LL << 60;
const int MOD = 1e9 + 7;
const char newl = '\n';
const int dx[] = {1, 0, -1, 0};
const int dy[] = {0, 1, 0, -1};
template <class T> inline bool between(T x, T l, T r) {
return l <= x && x < r;
}
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 T, class U> inline void read(vector<T> &a, vector<U> &b) {
for(int i = 0; i < a.size(); i++) {
read(a[i]);
read(b[i]);
}
}
template <class T, class U, class V>
inline void read(vector<T> &a, vector<U> &b, vector<V> &c) {
for(int i = 0; i < a.size(); i++) {
read(a[i]);
read(b[i]);
read(c[i]);
}
}
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; }
template <class T, class U> void _write(const std::pair<T, U> &a) { cout << a.first << ' ' << a.second; }
template <class T> void write(const T &a) {
_write(a);
cout << newl;
}
template <class T> void write(const vector<T> &a) {
for(int i = 0; i < a.size(); i++) {
_write(a[i]);
cout << (i + 1 == a.size() ? newl : ' ');
}
}
template <class Head, class... Tail>
void write(const Head &head, const Tail &...tail) {
_write(head);
cout << ' ';
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++) {
_write(a[i]);
cout << newl;
}
}
template <class Head, class... Tail>
void writel(const Head &head, const Tail &...tail) {
_write(head);
cout << newl;
write(tail...);
}
template <class T> void _debug(const T &a) { cerr << a; }
template <class T, class U> void _debug(const std::pair<T, U> &a) { cerr << a.first << ' ' << a.second; }
template <class T> void debug(const T &a) {
_debug(a);
cerr << newl;
}
template <class T> void debug(const vector<T> &a) {
for(int i = 0; i < a.size(); i++) {
_debug(a[i]);
cerr << (i + 1 == a.size() ? newl : ' ');
}
}
template <class Head, class... Tail>
void debug(const Head &head, const Tail &...tail) {
_debug(head);
cerr << ' ';
debug(tail...);
}
template <class T> void debugl(const T &a) { cerr << a << '\n'; }
template <class T> void debugl(const vector<T> &a) {
for(int i = 0; i < a.size(); i++) {
_debug(a[i]);
cerr << newl;
}
}
template <class Head, class... Tail>
void debugl(const Head &head, const Tail &...tail) {
_debug(head);
cerr << newl;
debug(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, class U> void msort(vector<T> &a, vector<U> &b) {
assert(a.size() == b.size());
vector<pair<T, U>> ab(a.size());
for(int i = 0; i < a.size(); i++)
ab[i] = {a[i], b[i]};
sort(ALL(ab));
for(int i = 0; i < a.size(); i++) {
a[i] = ab[i].first;
b[i] = ab[i].second;
}
}
template <class T, class U, class V>
void msort(vector<T> &a, vector<U> &b, vector<V> &c) {
assert(a.size() == b.size() && b.size() == c.size());
vector<tuple<T, U, V>> abc(a.size());
for(int i = 0; i < a.size(); i++)
abc[i] = {a[i], b[i], c[i]};
sort(ALL(abc));
for(int i = 0; i < a.size(); i++) {
a[i] = get<0>(abc[i]);
b[i] = get<1>(abc[i]);
c[i] = get<2>(abc[i]);
}
}
template <class T, class U> inline bool chmax(T &a, U b) {
if(a < b) {
a = b;
return 1;
}
return 0;
}
template <class T, class U> inline bool chmin(T &a, U b) {
if(a > b) {
a = b;
return 1;
}
return 0;
}
int digit(ll a) {
ll ret = 0;
while(a && ++ret)
a /= 10;
return ret;
}
int digit_sum(ll a) {
ll ret = 0;
while(a) {
ret += a % 10;
a /= 10;
}
return ret;
}
ll llpow(ll a, ll n) {
ll ret = 1;
rep(i, n) ret *= a;
return ret;
}
inline int bsf(int v) { return __builtin_ctz(v); } // 1
inline int bsf(ll v) { return __builtin_ctzll(v); }
inline int bsr(int v) {
return 31 - __builtin_clz(v);
} // 1
inline int bsr(ll v) { return 63 - __builtin_clzll(v); }
inline int lsb(int v) { return v & -v; } // 1
inline ll lsb(ll v) { return v & -v; }
inline int msb(int v) { return 1 << bsr(v); } // 1
inline ll msb(ll v) { return 1LL << bsr(v); }
struct IO {
IO() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout << fixed << setprecision(10);
}
} io;
#pragma endregion
/* ModInt */
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; }
static const u64 get_mod() { return MOD; }
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) const {
return this->val == rhs.val;
}
constexpr bool operator!=(const ModInt &rhs) const {
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(long long 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<1000000007UL>;
using mint = ModInt<998244353UL>;
void solve() {
INT(n, a, b);
mint p1 = 1, p2 = 1, p3 = 1;
for(int i = 1; i <= n; i++) {
p1 *= i;
}
for(int i = 1; i <= n - 1; i++) {
p2 *= i;
}
for(int i = 1; i <= n - 2; i++) {
p3 *= i;
}
write(p1 - p2 * 2 + p3);
}
int main() {
int t = 1;
// cin >> t;
while(t--) {
solve();
}
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0