結果

問題 No.502 階乗を計算するだけ
ユーザー tossytossy
提出日時 2017-04-07 23:20:35
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 54 ms / 1,000 ms
コード長 2,936 bytes
コンパイル時間 1,640 ms
コンパイル使用メモリ 167,032 KB
実行使用メモリ 4,380 KB
最終ジャッジ日時 2023-09-23 02:42:30
合計ジャッジ時間 3,470 ms
ジャッジサーバーID
(参考情報)
judge12 / judge11
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
4,376 KB
testcase_01 AC 1 ms
4,380 KB
testcase_02 AC 2 ms
4,380 KB
testcase_03 AC 2 ms
4,376 KB
testcase_04 AC 1 ms
4,380 KB
testcase_05 AC 1 ms
4,376 KB
testcase_06 AC 1 ms
4,376 KB
testcase_07 AC 2 ms
4,376 KB
testcase_08 AC 2 ms
4,376 KB
testcase_09 AC 2 ms
4,376 KB
testcase_10 AC 2 ms
4,376 KB
testcase_11 AC 1 ms
4,376 KB
testcase_12 AC 1 ms
4,376 KB
testcase_13 AC 1 ms
4,376 KB
testcase_14 AC 2 ms
4,380 KB
testcase_15 AC 1 ms
4,380 KB
testcase_16 AC 1 ms
4,376 KB
testcase_17 AC 2 ms
4,376 KB
testcase_18 AC 2 ms
4,380 KB
testcase_19 AC 2 ms
4,376 KB
testcase_20 AC 1 ms
4,376 KB
testcase_21 AC 2 ms
4,376 KB
testcase_22 AC 6 ms
4,376 KB
testcase_23 AC 3 ms
4,376 KB
testcase_24 AC 5 ms
4,380 KB
testcase_25 AC 2 ms
4,376 KB
testcase_26 AC 3 ms
4,380 KB
testcase_27 AC 3 ms
4,380 KB
testcase_28 AC 3 ms
4,376 KB
testcase_29 AC 3 ms
4,376 KB
testcase_30 AC 6 ms
4,376 KB
testcase_31 AC 4 ms
4,376 KB
testcase_32 AC 34 ms
4,380 KB
testcase_33 AC 54 ms
4,376 KB
testcase_34 AC 51 ms
4,376 KB
testcase_35 AC 53 ms
4,380 KB
testcase_36 AC 28 ms
4,380 KB
testcase_37 AC 54 ms
4,380 KB
testcase_38 AC 24 ms
4,376 KB
testcase_39 AC 48 ms
4,380 KB
testcase_40 AC 9 ms
4,380 KB
testcase_41 AC 2 ms
4,380 KB
testcase_42 AC 2 ms
4,376 KB
testcase_43 AC 1 ms
4,380 KB
testcase_44 AC 2 ms
4,380 KB
testcase_45 AC 1 ms
4,380 KB
testcase_46 AC 1 ms
4,380 KB
testcase_47 AC 1 ms
4,376 KB
testcase_48 AC 1 ms
4,380 KB
testcase_49 AC 1 ms
4,376 KB
testcase_50 AC 2 ms
4,376 KB
testcase_51 AC 1 ms
4,376 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

#include <bits/stdc++.h>
using namespace std;
#define repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define rep(i,n) repl(i,0,n)
#define mp(a,b) make_pair((a),(b))
#define pb(a) push_back((a))
#define all(x) (x).begin(),(x).end()
#define uniq(x) sort(all(x)),(x).erase(unique(all(x)),end(x))
#define fi first
#define se second
#define dbg(x) cout<<#x" = "<<((x))<<endl
template<class T,class U> ostream& operator<<(ostream& o, const pair<T,U> &p){o<<"("<<p.fi<<","<<p.se<<")";return o;}
template<class T> ostream& operator<<(ostream& o, const vector<T> &v){o<<"[";for(T t:v){o<<t<<",";}o<<"]";return o;}

#define INF 2147483600
#define MOD 1000000007

vector<long> arr = {1,682498929,491101308,76479948,723816384,67347853,27368307,625544428,199888908,888050723,927880474,281863274,661224977,623534362,970055531,261384175,195888993,66404266,547665832,109838563,933245637,724691727,368925948,268838846,136026497,112390913,135498044,217544623,419363534,500780548,668123525,128487469,30977140,522049725,309058615,386027524,189239124,148528617,940567523,917084264,429277690,996164327,358655417,568392357,780072518,462639908,275105629,909210595,99199382,703397904,733333339,97830135,608823837,256141983,141827977,696628828,637939935,811575797,848924691,131772368,724464507,272814771,326159309,456152084,903466878,92255682,769795511,373745190,606241871,825871994,957939114,435887178,852304035,663307737,375297772,217598709,624148346,671734977,624500515,748510389,203191898,423951674,629786193,672850561,814362881,823845496,116667533,256473217,627655552,245795606,586445753,172114298,193781724,778983779,83868974,315103615,965785236,492741665,377329025,847549272,698611116};

vector<long> vec = { 0,10000000,20000000,30000000,40000000,50000000,60000000,70000000,80000000,90000000,100000000,110000000,120000000,130000000,140000000,150000000,160000000,170000000,180000000,190000000,200000000,210000000,220000000,230000000,240000000,250000000,260000000,270000000,280000000,290000000,300000000,310000000,320000000,330000000,340000000,350000000,360000000,370000000,380000000,390000000,400000000,410000000,420000000,430000000,440000000,450000000,460000000,470000000,480000000,490000000,500000000,510000000,520000000,530000000,540000000,550000000,560000000,570000000,580000000,590000000,600000000,610000000,620000000,630000000,640000000,650000000,660000000,670000000,680000000,690000000,700000000,710000000,720000000,730000000,740000000,750000000,760000000,770000000,780000000,790000000,800000000,810000000,820000000,830000000,840000000,850000000,860000000,870000000,880000000,890000000,900000000,910000000,920000000,930000000,940000000,950000000,960000000,970000000,980000000,990000000,1000000000};

int main(){
  long n;
  cin>>n;
  if(n>=MOD){ cout<<0<<endl; return 0;}

  int i = upper_bound(all(vec), n) - vec.begin();
  i--;
  long ans = arr[i];
  i = vec[i];
  i++;
  while(i<=n){ans = (ans*i)%MOD; i++;}
  cout << ans << endl;

  return 0;
}
0