OJ Board

Do you have any ideas to solve this problem?
....

I haven't yet wrote the code for it, but it seems a SAT-2 problem ignoring the clauses with 3 variables. Given there are only 5 such clauses with 3 variables, I think the solution can possibly be complimented by a bruteforce.

I have a doubt with this problem...
3 x y means that either x or y must be absent

How is possible that the solution of case 1 is "2 1 3", if the sampre input for case 1 says "3 2 1", that means "2" or "1" must be absent?

2 1 3 means that 2 people are invited and they are 1 and 3. Hope it answers your question.

Jan wrote:2 1 3 means that 2 people are invited and they are 1 and 3. Hope it answers your question.

Yes, sorry.
I already self-answered my question yesterday, but I forgot to delete my question.

Thanks anyway.

Can somebody tell me what is the diffrerence between "either x or y should be present in the meeting." and "either x or y must be present but not both." ?

1 x y means that either x or y or both should be present in the meeting.
4 x y means that either x or y must be present but not both.