sanjasimic34 sanjasimic34 16-05-2020 Mathematics contestada Eleven computer science students stand in line at the student service. The three students are called Nikola. How many ways can they line up so that neither Nikola can stand together?
