Problem #PRU-116581

Problems Set theory and logic Algorithm Theory Algorithm Theory

Problem

At a round table, 30 people are sitting – knights and liars (knights always tell the truth, and liars always lie). It is known that each of them at that table has exactly one friend, and for each knight this friend is a liar, and for a liar this friend is a knight (friendship is always mutual). To the question “Does your friend sit next to you?” those in every other seat answered “yes”. How many of the others could also have said “Yes”?