Submission #11562222
Source Code Expand
import math N, M = map(int, input().split()) mod = 10**9+7 if(abs(N-M) == 1): print((math.factorial(N)*math.factorial(M))%mod) elif(N==M): print((2*math.factorial(N)*math.factorial(M))%mod) else: print(0)
Submission Info
Submission Time | |
---|---|
Task | C - Reconciled? |
User | tanukon |
Language | Python (3.4.3) |
Score | 300 |
Code Size | 226 Byte |
Status | AC |
Exec Time | 705 ms |
Memory | 5184 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 | 18 ms | 3060 KB |
02.txt | AC | 559 ms | 4860 KB |
03.txt | AC | 18 ms | 3060 KB |
04.txt | AC | 704 ms | 5184 KB |
05.txt | AC | 459 ms | 4620 KB |
06.txt | AC | 18 ms | 3060 KB |
07.txt | AC | 17 ms | 3060 KB |
08.txt | AC | 18 ms | 3060 KB |
09.txt | AC | 458 ms | 4664 KB |
10.txt | AC | 466 ms | 4652 KB |
11.txt | AC | 18 ms | 3060 KB |
12.txt | AC | 18 ms | 2940 KB |
s1.txt | AC | 18 ms | 3060 KB |
s2.txt | AC | 18 ms | 3060 KB |
s3.txt | AC | 18 ms | 3060 KB |
s4.txt | AC | 705 ms | 5104 KB |