Problem
for i in range(1, 10):
Five students each write their name on a card. The cards are collected, shuffled, and handed back out so that every student receives exactly one card.
Compute the number of ways to hand the cards back so that no student receives their own card.
Want to contribute problems and receive full credit? Click here to add your problem!
Please report any issues to us in our Discord server
Problem feedback
Difficulty
—