My apologies. I had a gut feeling that something was wrong but couldn't figure out the exact reason(I should have spent a moment testing my results). The problem arises due to permutations inside a room.
After spending more time on it(and brushing up my P&C), I finally arrived at something.
The solution uses Stirling's number.
Stirling's Number S(n,k): The number of ways to partition a set A {#(A)=n} into k parts.
For case n=k the answer is trivial. Only interesting solution exists for n > k.
If the rooms were indistinguishable then the answer would be S(n,k).(as from the definition of Stirling number)
Since the rooms are distinguishable, we can permute the rooms and thus the answer to the above problem is k!*S(n,k).
For more on Stirlings number read
PlanetMath: Stirling numbers of the second kind
Nice question Quantyst. I want more.