打架

给出打败关系图，输出打败人数最多的编号。

#include<cstdio>#include<cstring>#include<string.h>#include<algorithm>#include<iostream>#include<math.h>#include<vector>using namespace std;int main(){int n,i,j,k;char buf[1005];while(scanf("%d",&n)!=EOF){memset(d,0,sizeof(d));for(int i=0;i<n;i++){scanf("%s",buf);for(j=0;j<n;j++)d[i]+=(buf[j]-'0');}k=0;for(int i=1;i<n;i++)if(d[i]>d[k])k=i;printf("%d\n",k+1);}return 0;}

from sysuoj