Problem Statement

Perfect Dancers Problem Description A dance institute provides morning and evening sessions. Every person who joins the institute is provided a unique ID. Persons can choose any number of dance forms. Some people who are not very perfect in any dance form attends both the sessions. The dance trainer prepares a separate list for the morning and evening session of all the persons who attend the session. The ID of the persons is repeated in the list by the same number of times as the number of dance forms he/she has chosen. The institute has planned to showcase various dance forms on the annual event. The institute wants some leaders who can lead the event on the final day. So, the trainer is looking for the dancers who are perfect in various dance forms. According to the trainer, perfect dancers are the one who attends only one session either morning or evening. Write an algorithm to find the number of perfect dancers selected by the trainer to lead the event. If a dancer is perfect in m