A team leader has 14 tickets with upcoming deadlines. He has eight developers at his disposal. In how many ways can the team leader assign tickets to developers if each developer must get at least one ticket to avoid being out of work? There is no need to discriminate between tickets, only the number of tickets is important.
(k+n-1)! / (n-1)! k! формулой попробовал но не получается помогите решить этот проблему😁