結果
問題 | No.8045 怪文書 |
ユーザー |
![]() |
提出日時 | 2019-04-01 22:24:40 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 3 ms / 2,000 ms |
コード長 | 3,233 bytes |
コンパイル時間 | 1,411 ms |
コンパイル使用メモリ | 166,592 KB |
実行使用メモリ | 5,248 KB |
最終ジャッジ日時 | 2024-11-27 03:19:17 |
合計ジャッジ時間 | 2,073 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 1 |
other | AC * 20 |
ソースコード
#include <bits/stdc++.h>using namespace std;typedef long long signed int LL;typedef long long unsigned int LU;#define incII(i, l, r) for(int i = (l) ; i <= (r); ++i)#define incID(i, l, r) for(int i = (l) ; i < (r); ++i)#define decII(i, l, r) for(int i = (r) ; i >= (l); --i)#define decID(i, l, r) for(int i = (r) - 1; i >= (l); --i)#define inc(i, n) incID(i, 0, n)#define inc1(i, n) incII(i, 1, n)#define dec(i, n) decID(i, 0, n)#define dec1(i, n) decII(i, 1, n)#define inII(v, l, r) ((l) <= (v) && (v) <= (r))#define inID(v, l, r) ((l) <= (v) && (v) < (r))#define PB push_back#define EB emplace_back#define MP make_pair#define FI first#define SE second#define ALL(v) v.begin(), v.end()#define RALL(v) v.rbegin(), v.rend()template<typename T> bool setmin (T & a, T b) { if(b < a) { a = b; return true; } else { return false; } }template<typename T> bool setmax (T & a, T b) { if(b > a) { a = b; return true; } else { return false; } }template<typename T> bool setmineq(T & a, T b) { if(b <= a) { a = b; return true; } else { return false; } }template<typename T> bool setmaxeq(T & a, T b) { if(b >= a) { a = b; return true; } else { return false; } }LL mo(LL a, LL b) { assert(b > 0); a %= b; if(a < 0) { a += b; } return a; }LL fl(LL a, LL b) { assert(b > 0); return (a > 0 ? a / b : (a - b + 1) / b); }LL ce(LL a, LL b) { assert(b > 0); return (a < 0 ? a / b : (a + b - 1) / b); }#define bit(b, i) (((b) >> (i)) & 1)#define BC __builtin_popcountll#define SC(T, v) static_cast<T>(v)#define SI(v) SC(int, v.size())#define SL(v) SC( LL, v.size())#define RF(e, v) for(auto & e: v)#define ei else if#define UR assert(false)// ---- ----string s = "ABCDEFGHIJKLMNOPQRSTUVWXZABCDEFGHIJKLMNPQRSTVWXYZ_BCDEFGHIJKLMNOPQSTUVWXYZABCDFGHIJKLMNOPQRSTUVWXYZ_ABCDEFHJKLMNOPQRSTUWXYZABCDFGHIJKLMOPQRSTUVWXYZ_ABCDEFGHIJKLMNOPQRSUVXYZABCDEFGHIJKLMNPQRSTUVWXYZ_ABCDEFGHJKLMOPQRSUVWXYZABCDFHIJKLMNOPQRSTUVWXYZABCDFGHIJKLMNOPQTUVWXYZ_ABCDEFGHIJKLMOPQRSTUVWXYZ_BCDEFGHIJKLMOPQRSTUVWXYZABCEFGHIJKLMNOPQRSTUVWXYZ_ABCDEFGHIJKLNOPQRSTUVWXYZ._ABCDEFGHIJKLMNOPQRSTUVWXZABCDEFGHIJKLMNPQRSTVWXYZABCDEFGHIJKLMNOPQSTUVWXYZ_ABCDEFGHIJKLMNOPQRSUVWXYZBCDEFGHIJKLMNOPQRTUVWXYZABCDEFGHIJLMNOPQRSTUVWXYZ_ABCDEFGHJKLMNOPQRTUVWXYZ_ABCDEFGHIJKLMNOPQRSUVWXYZABCDEFGHIJKLMNPQRSTUVWXYZ_ABCDEGHJKLMOPQRSTUVWXYZABCEFGHIJKLMNOPQRSTUVWXYZ_ABCDEFGHIJKLMNOPQRSUVWXYZABCDEFGIJKLMNOPQRSTUVWXYZABCDFGHIJKLMNOPQRSTUVWXYZ_ABCDEGHIJKLMNOPQRSTUVWXYZBDEFGHIJKLMNOPQRSUVWXYZABCDEFGHIJKLMNPQSTUVWXYZABCDEFGHJKLMNOPQRSTUVWXYZBCDEFGHIJKMNOPQRSTUVWXYZ_ABCDEFGHIJKLMNPQRSTUVWXYZABCDEGHIJKLMNOPQRSTUVWXYZ_ABCDEFGHIJKLMOPQRSTUVWXYZ,_ABCDEFGHIJKLNPQRSTUVWXYZABCEFGHIJKLMNOPQRSTVWXYZABCDEFGHIJKMNPQRSTUVWXYZ_ABCDEFGHIJKLNOPQRSTUVWXYZ.";// YOU_ARE_GIVEN_TWO_INTEGERT_N_AND_M._YOUR_TASK_IS_TO_FIND_THE_FACTORIAL_OF_N,_MODULO_M.int n;void ne(char & c) { if(c == 'Z') { c = 'A'; } else { c++; } }int main() {/*char c = 'A';inc(i, SI(s)) {if(c != s[i]) {if(inII(s[i], 'A', 'Z')) { cout << c; ne(c); } else { cout << s[i]; }}if(inII(s[i], 'A', 'Z')) { ne(c); }}*/LL n, m;cin >> n >> m;LL ans = 1;if(n >= m) { ans = 0; } else {inc1(i, n) { (ans *= i) %= m; }}cout << ans << endl;return 0;}