A - Friend-Graph

https://vjudge.net/contest/280879#problem/A

#include <cstring>
#include <cstdio>
#include <algorithm>
using namespace std;
bool mp[3010][3010];
int n,i,j,m,q;
bool finded(int n)
{
    int i,j,k;
    for(i=1; i<=n; i++)
        for(j=i+1; j<=n; j++)
            for(k=j+1; k<=n; k++)
                if(mp[i][j]==mp[i][k]&&mp[i][k]==mp[j][k]&&mp[i][j]==mp[j][k])
                    return 1;
    return 0;
}
int main()
{
    scanf("%d",&n);
    while(n--)
    {
        scanf("%d",&m);
        for(i=1; i<m; i++)
            for(j=i+1; j<=m; j++)
            {
                scanf("%d",&q);
                if(q==1) mp[j][i]=mp[i][j]=0;
                else mp[j][i]=mp[i][j]=1;

            }
        if(!finded(m))
            printf("Great Team!\n");
        else
            printf("Bad Team!\n");
    }
}