| ||||||||||
| Online Judge | Problem Set | Authors | Online Contests | User | ||||||
|---|---|---|---|---|---|---|---|---|---|---|
| Web Board Home Page F.A.Qs Statistical Charts | Current Contest Past Contests Scheduled Contests Award Contest | |||||||||
水#include <stdio.h>
int w[233]={0};
int main() {
int n;
scanf("%d",&n);
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++){
int t;
scanf("%d",&t);
if((i-j)>>31){
if(t^3)w[j]++;
else w[i]++;
}
}
}
int m=0,a;
for(int i=1;i<=n;i++){
if(w[i]>m){m=w[i];a=i;}
}
printf("%d\n",a);
return 0;
}
Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator