Submission #1687877

---

Source Code Expand

#include <iostream>
#include <string>
#include <vector>
#include <algorithm>

#define INF 1e9;
//#define mod 1e9+7

//#define max(x,y) (x>y)?x:y
//#define min(x,y) (x<y)?x:y
#define rep(i,j,k) for(int i=j;i<k;i++)
#define repp(i,j,k) for(int i=j;i>=k;i--)
#define mi(n) (int*)malloc(sizeof(int)*n);
#define mc(n) (char*)malloc(sizeof(char)*n);

using namespace std;
int mod=1000000007;

int main(){
   int n;
   long long p=1;
   cin>>n;
   int i;
   rep(i,1,n+1){
       p=(p*=i)%mod;
   }
   
   cout<<p<<endl;


    return 0;
}

Submission Info

Judge Result