Submission #1500882
Source Code Expand
#include <bits/stdc++.h> const long long MOD = 1000000007; const int INF = INT_MAX / 2; const long double PI = 3.1415926; #define FOR(i, r, n) for(int i=(ll)(r); i<(ll)(n); i++) #define REP(i, n) FOR(i, (0), n) #define ALL(r) r.begin(), r.end() #define ll long long int #define vci vector<ll> #define vcs vector<string> #define vcp vector<pair<ll, ll>> #define vct vector<tuple<ll, ll, ll>> using namespace std; //vector<vector<ll>> vv(n, vector<ll>(n)); typedef int Weight; struct Edge { int from, to; Weight cost; bool operator < (const Edge& e) const { return cost < e.cost; } bool operator > (const Edge& e) const { return cost > e.cost; } }; typedef vector<Edge> Edges; typedef vector<Edges> Graph; void add_edge(Graph &g, int from, int to, Weight cost) { g[from].push_back(Edge{ from, to, cost }); } int main() { ll n; cin >> n; ll ans = 1; REP(i,n) { ans = ans*(i + 1); ans = ans%MOD; } cout << ans << endl; }
Submission Info
Submission Time | |
---|---|
Task | B - Training Camp |
User | haniwasi |
Language | C++14 (GCC 5.4.1) |
Score | 200 |
Code Size | 982 Byte |
Status | AC |
Exec Time | 2 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 | 2 ms | 256 KB |
01.txt | AC | 1 ms | 256 KB |
02.txt | AC | 1 ms | 256 KB |
03.txt | AC | 2 ms | 256 KB |
04.txt | AC | 2 ms | 256 KB |