CCPC2017网络赛1003Friend-Graph——暴力

O(n^3)暴力，据说n>=6时输出坏团队

#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <stack>
#include <queue>
#include <map>
#include <cmath>
using namespace std;
const int INF = 0x3f3f3f3f;
const int maxn = 3001;
int T, n;
bool g[maxn][maxn];
int main() {
    scanf("%d", &T);
    while (T--) {
        memset(g, 0, sizeof(g));
        scanf("%d", &n);
        for (int i = 1; i <= n - 1; i++) {
            for (int j = i + 1; j <= n; j++) {
                scanf("%d", &g[i][j]);
            }
        }
        bool ok = true;
        for (int i = 1; i <= n; i++) {
            for (int j = i + 1; j <= n; j++) {
                for (int k = j + 1; k <= n; k++) {
                    if (!g[i][j] && !g[i][k] && !g[j][k]) {
                        ok = false; break;
                    }
                    if (g[i][j] && g[i][k] && g[j][k]) {
                        ok = false; break;
                    }
                }
            }
        }
        if (ok) printf("Great Team!\n");
        else printf("Bad Team!\n");
    }
    return 0;
}