View Code of Problem 82

#include<stdio.h>
#include<math.h>
struct student
{
  char num[100];
  char nam[100];
  int a,b,c;
}stu;
int main()
{
  struct  student stu[100];
  int n,i,j=0,ave1=0,ave2=0,ave3=0,max1,max2,max3;
  scanf("%d",&n);
  for(i=0;i<n;i++)
  {
    scanf("%s %s %d %d %d",&stu[i].num,&stu[i].nam,&stu[i].a,&stu[i].b,&stu[i].c);
    ave1+=stu[i].a;
    ave2+=stu[i].b;
    ave3+=stu[i].c;
  }
  ave1=ave1/n;
  ave2=ave2/n;
  ave3=ave3/n;
  printf("%d %d %d\n",ave1,ave2,ave3);
  max1=stu[0].a;max2=stu[0].b;max3=stu[0].c;
  for(i=1;i<n;i++)
  {
     if(stu[i].a>max1&&stu[i].b>max2&&stu[i].c>max3)
     {
        max1=stu[i].a; 
        max2=stu[i].b;
        max3=stu[i].c;
        j=i;
 
     } 
  }
  printf("%s %s %d %d %d",stu[j].num,stu[j].nam,stu[j].a,stu[j].b,stu[j].c);
  return 0;
}