Doubt in logic of this problem(Codeforces Round 677)

Revision en1, by Akash_Roy, 2020-10-23 07:42:49

This is the problem link

This is the editorial link

We select members for first round dance. Then members of second round dance get automatically selected . Hence the factor nC(n/2). Then we arrange both the round dance. This leads to nC(n/2)*(n-1)!*(n-1)! {Circular permutation}. After this why are we dividing the answer only by 2? I feel we should divide final answer by 4. Since clockwise and anticlockwise arrangement does not matter, the final answer should be [nC(n/2)*(n-1)!*(n-1)!]/4. Why is it [nC(n/2)*(n-1)!*(n-1)!]/2 ?

Please help.

Sorry for my poor number formatting.

Tags #math, #combinatorics, #div 3, #codeforces

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en2 English Akash_Roy 2020-10-23 07:46:42 33 Tiny change: 'nswer by 4. Since cl' -> 'nswer by 4 since there are two round dances. Since cl'
en1 English Akash_Roy 2020-10-23 07:42:49 740 Initial revision (published)