New RestaurantProblem code: NEWREST |
All submissions for this problem are available.
Chef Dengklek will open a new restaurant in the city. The restaurant will be open for N days. He can cook M different types of dish. He would like to cook a single dish every day, such that for the entire N days, he only cook at most K distinct types of dishes.
In how many ways can he do that?
Input
The first line contains a single integer T, the number of test cases. T test cases follow. Each test case consists of a single line consisting of three integers N, M, K.
Output
For each test case, output a single line consisting the number of different ways he can cook for the entire N days, modulo 1000000007.
Constraints
- 1 ? T ? 100
- 1 ? N ? 1000
- 1 ? M ? 1000000
- 1 ? K ? 1000
Example
Input:
4 1 1 1 2 2 2 4 3 2 5 7 3
Output:
1 4 45 5887
| Author: | fushar |
| Date Added: | 6-09-2011 |
| Time Limit: | 2 sec |
| Source Limit: | 50000 Bytes |
| Languages: | ADA, ASM, BASH, BF, C, C99 strict, CAML, CLOJ, CLPS, CPP 4.0.0-8, CPP 4.3.2, CS2, D, ERL, F#, FORT, GO, HASK, ICK, ICON, JAR, JAVA, JS, LISP clisp, LISP sbcl, LUA, NEM, NICE, PAS fpc, PAS gpc, PERL, PERL6, PHP, PIKE, PRLG, PYTH, PYTH 3.1.2, RUBY, SCALA, SCM guile, SCM qobi, ST, TCL, TEXT, WSPC |
Comments

Fetching successful submissions

Can anybody explain the 3rd
what exactly do want to be
@jelu as to how the the
@ phantom11: we're sorry we
is k always less than M
yes
@admin-my code gives me
I can never view the my
judge gives me wrong
also can you provide me the
No, we cannot provide any
The question reads "at most K
@ garggaurav1995 No, it has
@ bravo_g7: If it is stupid,
I am getting Run Time
PLEASE any body explain 3rd
Does the 3rd test case
@ garggaurav1995: Yes.
@ narrow001: No suggestion is
[edited by admin] please do
my code is working fine for
i want to ask
I want to ask
:( :( :( Am I that bad?? :(
@Admin..............time
@satya_patel - time given is
Nice problem :)..The time
seems really hard
I tried to do it in Python