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.