結果
問題 | No.500 階乗電卓 |
ユーザー |
|
提出日時 | 2017-06-18 15:31:48 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 2 ms / 2,000 ms |
コード長 | 3,246 bytes |
コンパイル時間 | 1,828 ms |
コンパイル使用メモリ | 173,760 KB |
実行使用メモリ | 5,376 KB |
最終ジャッジ日時 | 2024-06-25 03:02:19 |
合計ジャッジ時間 | 2,593 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 20 |
ソースコード
#define TEST_MODE true#define _CRT_SECURE_NO_WARNINGS#define _USE_MATH_DEFINES#include "bits/stdc++.h"using namespace std;#define rep(i, n) for (int i = 0; i < (n); ++i)#define rep2(i, a, b) for (int i = (a); i < (b); ++i)#define rrep(i, n) for (int i = (n)-1; i >= 0; --i)#define rrep2(i, a, b) for (int i = (a)-1; i >= b; --i)#define range(i, a, b, c) for (int i = a; \c > 0 ? i < b : i > b; \i += c)#define chmax(a, b) (a = (a) < (b) ? (b) : (a))#define chmin(a, b) (a = (a) > (b) ? (b) : (a))using ll = long long;using ull = unsigned long long;using ld = long double;#define all(a) begin(a), end(a)#define ifnot(a) if (not(a))#define int long long#ifdef LOCAL_ENV#if TEST_MODE == trueconst bool test = true;#define dump(x) cerr << #x << " = " << (x) << endl#elseconst bool test = false;#define dump(x)#endif#elseconst bool test = false;#define dump(x)#endifint dx[] = {1, 0, -1, 0};int dy[] = {0, 1, 0, -1};const int INF = (int)1 << 60;const ll INFL = (ll)1 << 60;ll mod_n = (int)1e9 + 7;const double eps = 1e-10;typedef long double Real;// return -1, 0, 1int sgn(const Real &r) { return (r > eps) - (r < -eps); }int sgn(const Real &a, const Real &b) { return sgn(a - b); }//.....................const int MAX = (int)2e5 + 5;vector<string> split(const string &str, char sep){vector<string> v;stringstream ss(str);string buffer;while (getline(ss, buffer, sep)){v.push_back(buffer);}return v;}template <class InputIterator>int sum(InputIterator begin, InputIterator end){return accumulate(begin, end, 0ll);}void solve();signed main(){cout << fixed << setprecision(20);solve();while (true){char s[MAX];if (scanf("%s", s) == EOF)break;int n = strlen(s);for (int i = n - 1; i > -1; i--){ungetc(s[i], stdin);}solve();}return 0;}// class Mycin {// bool flag = true;// public:// Mycin& operator >> (int& a) {flag = scanf("%lld", &a) != EOF; return *this;}// Mycin& operator >> (char& a) {flag = scanf("%c", &a) != EOF; return *this;}// Mycin& operator >> (string& s) {flag = (bool)(cin >> s); return *this;}// operator bool() {return flag;}// } mycin;// class Mycout {// public:// Mycout& operator << (const int& a) {printf("%lld", a); return *this;}// Mycout& operator << (const char c) {printf("%c", c); return *this;}// Mycout& operator << (const string& s) {printf("%s", s.c_str()); return *this;}// } mycout;// #define cin mycin// #define cout mycout// #define endl '\n'int N;bool flag;/* mod_factorial(n) : n! */int mod_factorial(int n) {int res = 1;++n;while (--n) {res *= n;if (res >= mod_n) {res %= mod_n;flag = true;}}return res;}void solve() {mod_n = (int)(1e12 + 0.1);cin >> N;if (N < 1000) {mod_factorial(N);if (flag) cout << setfill('0') << setw(12)<< mod_factorial(N) << endl;else cout << mod_factorial(N) << endl;}else cout << setfill('0') << setw(12) << (int)0 << endl;}