Dont copy in exams

[Tahmid Hasan]

in a class there is only 1 round table.there are total $m$ students.among them $n$ are copy cats(tuklifyer).the teacher wants to arrange them in such a way so that none of the bad ones(not even 2) sit beside each other.in how many ways can the teacher arrange them?
@moon bhai,this is a problem made by me,u can ask zzzz,we have discussed about it.

[Tahmid Hasan]

consider both two scenarios.(if u undrstand this that means u have cruxed it )

[Hasib]

feeling so sick after viewing the last part of the post- "moon vai...."

[Zzzz]

Changed the topic name. You must write english in olympiad level forum.

[HandaramTheGreat]

if $\left(m-n\right)\ge n$ then $(m-n-1)! \cdot ^{m-n}P_n$
else $(n-1)! \cdot ^nP_{m-n}$

in first case, arrange those who don't copy and then put n students in blanks from m-n blanks among m-n students...