`n` different toys have to be distributed among `n` children. Find the number of ways in which these toys can be distributed so that exactly one child gets no toy.

Explanation

To solve the problem of distributing `n` different toys among `n` children such that exactly one child receives no toy, we can follow these steps:

### Step 1: Choose the child who will receive no toy
We have `n` children, and we need to select one child who will not receive any toys. The number of ways to choose this child is `n`.

**Hint:** Think of it as selecting one option from `n` available options.

### Step 2: Distribute the toys among the remaining children
...