Hi codeforces,

I'm struggling with a problem from a Greek contest which has no solution. The problem is as follows (it has only Greek problem statement):

There are N people (N <= 30). Peraon number i has A[i] oranges. You know for every person who are hus friends — you have a NxN table were if Table[i][j] is 1 then i is a friend of j. You want to make a group of people such that every person is a friend of every other in the group and the sum of the oranges they have is maximum. You must output this maximum number of oranges.

The problem has no solution and I'll be really thankful if you can help me.

Hello! I was solving last year's JBOI but I couldn't solve the second problem — palm trees. Can one tell me how to solve it? Thanks

Hello evreyone! At the contest I solved E and it Passed. Now I look at the standings and it shows WA20!? Why is this so? Codeforces said the solution is correct and now I get WA... Here is submission: http://mirror.codeforces.com/contest/676/submission/18083570

Greetings everyone!

Last year I didn't qualify for the Junior Balkan Olympiad in Informatics, but this year I think I have a real chance to participate there. In fact I'm second in the team for now.

I want to ask about who else is going to participate. Also I'm curious about where and when JBOI 2016 will be held, because as far as I remember last year it was announced that it will be Macedonia 2 months before the event.