hdu1530 最大团裸题

```cpp
#include <bits/stdc++.h>
using namespace std;
int g[100][100];
int n,ans;
int temp[100];
bool ok(int x,int currentlevel){
    for(int i = 1;i <= currentlevel;i++){
        if(g[x][temp[i]] == 0) return false;
    }
    return true;
}
void dfs(int currentlevel,int now){
    //cout << currentlevel << " " << now << " " << step << endl;
    if(currentlevel > ans){
        ans = currentlevel;
    }
    if(n <= ans) return;
    for(int i = now + 1;i <= n;i++){
        if(ok(i,currentlevel)){
            temp[currentlevel+1] = i;
            dfs(currentlevel+1,i);
        }
    }
}
int main(){
    ios::sync_with_stdio(0);
    while(cin >> n){
        if(n == 0) break;
        ans = 0;
        for(int i = 1;i <= n;i++){
            for(int j = 1;j <= n;j++){
                int t;
                cin >> t;
                g[i][j] = t;
            }
        }
        for(int i = 1;i <= n;i++){
            temp[1] = i;
            dfs(1,i);
        }
        cout << ans << endl;
    }
}