Submission #1881177
Source Code Expand
import std.stdio, std.string, std.conv, std.range, std.algorithm; ulong fact(ulong x) { ulong z = 1; foreach(i; iota(1, x + 1)) { z *= i; z %= 1000000007; } return z; } void main() { auto WH = readln.chomp.split.map!(to!int); auto W = WH[0]; auto H = WH[1]; auto answer = fact(W + H - 2) / (fact(W - 1) * fact(H - 1)); answer.writeln; }
Submission Info
Submission Time | |
---|---|
Task | A - Trapezoids |
User | yousack728 |
Language | D (LDC 0.17.0) |
Score | 0 |
Code Size | 387 Byte |
Status | RE |
Exec Time | 1 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 100 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01.txt, sample_02.txt |
All | 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, sample_01.txt, sample_02.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
01.txt | RE | 1 ms | 256 KB |
02.txt | RE | 1 ms | 256 KB |
03.txt | RE | 1 ms | 256 KB |
04.txt | RE | 1 ms | 256 KB |
05.txt | RE | 1 ms | 256 KB |
sample_01.txt | RE | 1 ms | 256 KB |
sample_02.txt | RE | 1 ms | 256 KB |