Submission #3811439
Source Code Expand
#include<iostream> #include<algorithm> #include<string> #include<vector> #include<queue> #include<map> #include<cmath> using namespace std; #define REP(i, limit) for(int i=0; i< limit; ++i) #define FOR(i, j, limit) for(int i=j; i< limit; ++i) #define DUMP(a) REP(d,a.size()){cout<<a[d];if(d!=a.size()-1)cout<<" ";else cout<<endl;} #define LL long long int INF = 2147483647; LL LINF = 9223372036854775807; LL MOD = 1000000007; typedef pair<int, int>P; typedef pair<LL, LL>PL; typedef vector<int> vi; typedef vector<LL> vl; int main(){ LL n, m; cin>>n>>m; if(n!=m && n!=m-1 && n!=m+1){ cout<<0<<endl; return 0; } LL ans = 1; for(LL i=0; i<n; ++i) ans = ans*(i+1)%MOD; for(LL i=0; i<m; ++i) ans =ans*(i+1)%MOD; if(n==m)ans = ans*2%MOD; cout<<ans<<endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Reconciled? |
User | howahowa |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 835 Byte |
Status | AC |
Exec Time | 4 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 300 / 300 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | s1.txt, s2.txt, s3.txt, s4.txt |
All | 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, s1.txt, s2.txt, s3.txt, s4.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
01.txt | AC | 1 ms | 256 KB |
02.txt | AC | 4 ms | 256 KB |
03.txt | AC | 1 ms | 256 KB |
04.txt | AC | 4 ms | 256 KB |
05.txt | AC | 4 ms | 256 KB |
06.txt | AC | 1 ms | 256 KB |
07.txt | AC | 1 ms | 256 KB |
08.txt | AC | 1 ms | 256 KB |
09.txt | AC | 4 ms | 256 KB |
10.txt | AC | 4 ms | 256 KB |
11.txt | AC | 1 ms | 256 KB |
12.txt | AC | 1 ms | 256 KB |
s1.txt | AC | 1 ms | 256 KB |
s2.txt | AC | 1 ms | 256 KB |
s3.txt | AC | 1 ms | 256 KB |
s4.txt | AC | 4 ms | 256 KB |