Submission #1995444
Source Code Expand
#include "bits/stdc++.h" #define rep(a,b) for(int a = 0;a < b;a++) #define REP(i, x, n) for(int i = x; i < n; i++) #define P(a) cout << a << endl #define pb(a) push_back(a) #define mp(a,b) make_pair(a,b) #define ssort(v) sort(v.begin(),v.end()) #define rev(v) reverse(v.begin(),v.end()) #define vP(v) for(int i = 0;i < v.size();i++){cout << v[i];if(i != v.size()-1)cout << endl;} #define vcin(v,n) rep(i,n){int a;cin >> a;v.pb(a);} using namespace std; typedef long long ll; typedef unsigned long long ull; int dx[] = { 1, -1 , 0 , 0 }; int dy[] = { 0, 0, 1, -1 }; ll MOD = 1000000007; void solve(){ int n; cin >> n; ll ans = 1; rep(i,n){ ans = (ans*(i+1))%MOD; } P(ans); } int main() { solve(); return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Training Camp |
User | pantacia1128 |
Language | C++14 (GCC 5.4.1) |
Score | 200 |
Code Size | 757 Byte |
Status | AC |
Exec Time | 3 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 200 / 200 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | 00_example_01.txt, 00_example_02.txt, 00_example_03.txt |
All | 00_example_01.txt, 00_example_02.txt, 00_example_03.txt, 01.txt, 02.txt, 03.txt, 04.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
00_example_01.txt | AC | 1 ms | 256 KB |
00_example_02.txt | AC | 1 ms | 256 KB |
00_example_03.txt | AC | 3 ms | 256 KB |
01.txt | AC | 1 ms | 256 KB |
02.txt | AC | 1 ms | 256 KB |
03.txt | AC | 3 ms | 256 KB |
04.txt | AC | 2 ms | 256 KB |