結果
問題 | No.8089 32xtm fwf8ggk pgmer@ qr@,wsvb guf@t^xd@ |
ユーザー |
![]() |
提出日時 | 2022-04-01 21:38:47 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 2 ms / 2,000 ms |
コード長 | 3,411 bytes |
コンパイル時間 | 1,868 ms |
コンパイル使用メモリ | 197,964 KB |
最終ジャッジ日時 | 2025-01-28 13:50:32 |
ジャッジサーバーID (参考情報) |
judge3 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 10 |
ソースコード
#include <bits/stdc++.h>#include <sys/time.h>using namespace std;typedef string::const_iterator State;class ParseError {};// using mint = ll;// using mint = atcoder::modint998244353;// using mint = atcoder::modint1000000007;typedef long long ll;typedef long double ld;typedef pair<ll, ll> P;typedef pair<ll, P> T;const ll INF = 3e18;const ll fact_table = 8000005;/*priority_queue<ll> pql;priority_queue<P> pqp;// big priority queue// priority_queue<ll, vector<ll>, greater<ll>> pqls;priority_queue<P, vector<P>, greater<P>> pqps;// small priority queue// top pop*/ll dx[8] = {1, 0, -1, 0, 1, 1, -1, -1};ll dy[8] = {0, 1, 0, -1, -1, 1, 1, -1};//↓,→,↑,←#define p(x) cout << x << "\n";#define el cout << "\n";#define pe(x) cout << x << " ";#define ps(x) cout << fixed << setprecision(25) << x << endl;#define pu(x) cout << (x);#define pb push_back#define eb emplace_back#define lb lower_bound#define ub upper_bound#define rep(i, n) for (ll i = 0; i < (n); i++)#define rep2(i, a, b) for (ll i = a; i <= (b); i++)#define rep3(i, a, b) for (ll i = a; i >= (b); i--)#define all(c) begin(c), end(c)#define sorti(v) sort(all(v))#define sortd(v) \sort(all(v)); \reverse(all(v));#define SUM(v) accumulate(all(v), 0LL)#define MIN(v) *min_element(all(v))#define MAX(v) *max_element(all(v))#ifdef LOCAL#define dump(var) cout << #var "= " << var << endl#else#define dump(var)#pragma GCC optimize("O3")#endiftypedef vector<ll> vec;typedef vector<vector<ll>> mat;// vec v(n) -> 長さnのベクトルを宣言// mat dp(h, vec(w)) -> h * w の行列を宣言const ll mod = 998244353ll;// const ll mod = 1000000007ll;ll mypow(ll a, ll b, ll m = mod) {ll x = 1ll;while (b) {while (!(b & 1ll)) {(a *= a) %= m;b >>= 1ll;}(x *= a) %= m;b--;}return x;}vec rv(ll read) {vec res(read);for (int i = 0; i < read; i++) {cin >> res[i];}return res;}vec fact, rfact;void c3_init() {fact.resize(fact_table + 5);rfact.resize(fact_table + 5);fact[0] = rfact[0] = 1;for (ll i = 1; i <= fact_table; i++) {fact[i] = (fact[i - 1] * i) % mod;}rfact[fact_table] = mypow(fact[fact_table], mod - 2, mod);for (ll i = fact_table; i >= 1; i--) {rfact[i - 1] = rfact[i] * i;rfact[i - 1] %= mod;}return;}ll c3(ll n, ll r) {if (fact.size() == 0) {c3_init();}if (n < 0) return 0ll;if (r < 0) return 0ll;if (n < r) return 0ll;return fact[n] * rfact[r] % mod * rfact[n - r] % mod;}bool icpc = false;bool multicase = false;// 配列の長さ足りてますか?ll n, m, k;ll h, w;bool solve() {cin >> n;p(n * 17);return true;}/**/int main() {#ifndef LOCALios::sync_with_stdio(false);cin.tie(nullptr);#endifif (icpc) {while (solve());return 0;}ll q, testcase = 1;if (multicase) {cin >> q;} else {q = 1;}while (q--) {// cout << "Case #" << testcase << ": ";solve();testcase++;}// solve();return 0;}