結果

問題 No.8045 怪文書
コンテスト
ユーザー nomi
提出日時 2019-04-01 22:40:35
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 5 ms / 2,000 ms
コード長 3,919 bytes
コンパイル時間 1,552 ms
コンパイル使用メモリ 172,556 KB
実行使用メモリ 5,248 KB
最終ジャッジ日時 2024-11-27 03:31:56
合計ジャッジ時間 2,102 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 1
other AC * 20
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;

#define int long long
#define vvi vector<vector<int>>
#define vec vector
#define pq priority_queue
#define all(v) (v).begin(), (v).end()
#define uniqueV(x) sort(x.begin(), x.end()); x.erase(unique(x.begin(), x.end()), x.end());
#define rep(i, n) for (int (i) = (0); (i) < (n); ++(i))
#define repp(i, m, n) for (int (i) = (m); (i) < (n); ++(i))
#define dbg(x) cerr << #x << ": " << x << endl;
#define dbg2(x, y) cerr<<"("<<#x<<", "<<#y<<") = "<<"("<<x<<", "<<y<<")"<<endl;
#define dbg3(x, y, z) cerr<<"("<<#x<<", "<<#y<<", "<<#z<<") = "<<"("<<x<<", "<<y<<", "<<z<<")"<<endl;
#define dbgB(value, size) cerr<<#value<<": "<<bitset<size>(value) << endl;
#define line() cerr << "---------------" << endl;

const int dx[] = {1, -1, 0, 0};
const int dy[] = {0, 0, -1, 1};
const double PI = 3.14159265358979323846;

template<class T>bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a = b; return 1; } return 0; }

template<typename T>
void print1(T begin, T end) {
  while (begin != end) {
    cout << (*begin) << " ";
    *begin++;
  }
  cout << endl;
}

template<typename T>
void print2(T Array, int height, int width) {
  for (int i = 0; i < height; i++) {
    for (int j = 0; j < width; j++) {
      cout << " " << Array[i][j];
    }
    cout << endl;
  }
}

void print() { std::cerr << endl; }
template <class Head, class... Tail>
void print(Head&& head, Tail&&... tail) {
  std::cerr << head << " ";
  print(std::forward<Tail>(tail)...);
}

template<class T>
void Add(T &a, const T &b, const T &mod=1000000007) {
  int val = ((a % mod) + (b % mod)) % mod;
  if (val < 0) { val += mod; }
  a = val;
}

template <typename X, typename T> auto vectors(X x, T a) { return vector<T>(x, a); }
template <typename X, typename Y, typename Z, typename... Zs> auto vectors(X x, Y y, Z z, Zs... zs) { auto cont = vectors(y, z, zs...); return vector<decltype(cont)>(x, cont); }

// ------------------------------------------------------------------------------------------

string B[] = {
  "ABCDEFGHIJKLMNOPQRSTUVWXZ",
"ABCDEFGHIJKLMNPQRSTVWXYZ_",
"BCDEFGHIJKLMNOPQSTUVWXYZ",
"ABCDFGHIJKLMN OPQRSTUVWXYZ_",
"ABCDEFHJKLMNOPQRSTUWXYZ",
"ABCDFGHIJKLMOPQRSTUVWXYZ_",
"ABCDEFGHIJKLMNOPQRSUVXYZ",
"ABCDEFGHIJKLMNPQRSTUVWXYZ_",
"ABCDEFGHJKLMOPQRSUVWXYZ",
"ABCDFHIJKLMNOPQRSTUVWXYZ",
"ABCDFGHIJKLMNOPQTUVWXYZ_",
"ABCDEFGHIJKLMOPQRSTUVWXYZ_",
"BCDEFGHIJKLMOPQRSTUVWXYZ",
"ABCEFGHIJKLMNOPQRSTUVWXYZ_",
"ABCDEFGHIJKLNOPQRSTUVWXYZ._",
"ABCDEFGHIJKLMNOPQRSTUVWXZ",
"ABCDEFGHIJKLMNPQRSTVWXYZ",
"ABCDEFGHIJKLMN OPQSTUVWXYZ_",
"ABCDEFGHIJKLMNOPQRSUVWXYZ",
"BCDEFGHIJKLMNOPQRTUVWXYZ",
"ABCDEFGHIJLMNOPQRSTUVWXYZ_ ",
"ABCDEFGHJKLMNOPQRTUVWXYZ_",
"ABCDEFGHIJKLMNOPQRSUVWXYZ",
"ABCDEFGHIJKLMNPQRSTUVWXYZ_",
"ABCDEGHJKLM OPQRSTUVWXYZ",
"ABCEFGHIJKLMNOPQRSTUVWXYZ_",
"ABCDEFGHIJKLMNOPQRSUVWXYZ",
"ABCDEFGIJKLMNOPQRSTUVWXYZ",
"ABCDFGHIJKLMNOPQRSTUVWXYZ_",
"ABCDEGHIJKLMNOPQRSTUVWXYZ",
"BDEFGHIJKLMNOPQRSUVWXYZ",
"ABCDEFGHIJKL MNPQSTUVWXYZ",
"ABCDEFGHJKLMNOPQRSTUVWXYZ",
"BCDEFGHIJKMNOPQRSTUVWXYZ_",
"ABCDEFGHIJKLMNPQRSTUVWXYZ",
"ABCDEGHIJKLMNOPQRSTUVWXYZ_",
"ABCDEFGHIJKLMOPQRSTUVWXYZ,_",
"ABCDEFGHIJKLNPQRSTUVWXYZ",
"ABCEFGHIJK LMNOPQRSTVWXYZ",
"ABCDEFGHIJKMNPQRSTUVWXYZ_",
"ABCDEFGHIJKLNOPQRSTUVWXYZ.",
};


void get(string s) {
  string ret = "";
  bool l = false;
  for (char c = 'A'; c <= 'Z'; c++) {
    if(!count(all(s), c)) {
      ret += c;
    }
  }
  if (count(all(s), '_')) l = true;

  if (l) {
    cout << ret << endl;
  } else {
    cout << ret;
  }
}

void solve(int n, int m) {
  int ans = 1;
  rep (i, n) {
    ans += n * (i+1);
    ans %= m;
  }

  cout << ans << endl;
}

signed main() {
  int n, m;
  cin >> n >> m;

  if (n <= m) {
    int ans = 1;
    for (int i = 1; i <= n; i++) {
      ans = ((ans % m) * (i % m)) % m;
    }
    cout << ans << endl;
  } else {
    cout << 0 << endl;
  }

  return 0;
}
0