Submission #3813517
Source Code Expand
#include <iostream> #include <string> #include <algorithm> #include <vector> #include <cstring> #include <utility> using namespace std; #define rep(i,n) for(int i = 0; i < (int)(n); i++) typedef long long ll; typedef pair<int,int> pii; ll mod = 1e9+7; ll f(ll n){ ll res = 1; for(ll i = 1; i <= n; i++){ res *= i; res %= mod; } return res; } int main(){ ll n,m; cin >> n >> m; if(abs(n-m)>=2){ cout << 0 << endl; return 0; } if(abs(n-m)==1){ cout << f(n) * f(m) %mod << endl; }else{ cout << 2 * f(n) * f(m) % mod << endl; } }
Submission Info
Submission Time | |
---|---|
Task | C - Reconciled? |
User | polyomino |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 648 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 |