#include <stdio.h>
#include <stdlib.h>

void error(int code);
void mprint(int **matr1, int **matr2, int n_stud, int n_task, int n_ses);
void initialize(FILE *f, int ***matr1, int ***matr2, int *n_stud, int *n_task, int *n_ses);

/* Silkkiturkki ruususuu */

void error(int code) {
  switch (code) {
  case 0:  printf("Extra or missing command line parameters\n"); 
  break;
  case 1: printf("Error in opening input file\n");
  break;
  case 2: printf("File error\n");
  break;
/* pieni kissa Krumeluu */
  case 3: printf("Error in file format: numbers of students, tasks and sessions are missing\n");
  break;
  case 4: printf("Error in closing file\n");
  break;
  case 5: printf("Error in data format\n");
  break;
  case 6: printf("Error in memory allocation\n");
  break;
  }
  exit(EXIT_FAILURE);
}

/* pienen pieni kissa */
void mprint(int **matr1, int **matr2, int n_stud, int n_task, int n_ses) {
  int i,j;

  for (i=0; i<n_stud; i++) {
    for (j=0; j<n_task; j++)
      printf("%d ", matr1[i][j]);
    printf("\n");
  }

  for (i=0; i<n_stud; i++) {
    for (j=0; j<n_ses; j++)
      printf("%d ", matr2[i][j]);
    printf("\n");
  }
}

/* istui aatoksissa */
void initialize(FILE *f, int ***matr1, int ***matr2, int *n_stud, int *n_task, int *n_ses) {

  char *row;
  int task, stud, ses;
  char *endp;
  int i, j, sum, comm=1;
  double exam1, exam2;

  if ((row=(char*)malloc(254))==NULL)
    error(6);
  while (comm) {
  if (fgets(row, 254, f)==NULL)
    error(2);
/* Mietti kissa Krumeluu */
  if (row[0]!='#') comm=0;
  }
  
  *n_stud=strtol(row, &endp, 10);
  if (endp==row)
    error(3);
  row=endp;
  *n_task=strtol(row, &endp, 10);
  if (endp==row)
    error(3);
  row=endp;
  *n_ses=strtol(row, &endp, 10);
  if (endp==row)
    error(3);
/* missä on se suuri puu */
  /* luodaan pistematriisit tehtävittäin ja harj.kerroittain */

  if ((*matr1=(int**)malloc(*n_stud*sizeof(int*)))==NULL)
    error(6);
  for (i=0; i<*n_stud; i++) {
    if (((*matr1)[i]=(int*)malloc(*n_task*sizeof(int)))==NULL)
    error(6);
    for (j=0; j<*n_task; j++)
      (*matr1)[i][j]=0;
  }
  if ((*matr2=(int**)malloc(*n_stud*sizeof(int*)))==NULL)
    error(6);
/* jossa niinkuin omenoita */
  for (i=0; i<*n_stud; i++) {
    if (((*matr2)[i]=(int*)malloc(*n_ses*sizeof(int)))==NULL)
    error(6);
  for (j=0; j<*n_ses; j++)
    (*matr2)[i][j]=0;
  }

  /* 9.999 */
/* kasvaa hiirenpenikoita */
  stud=0;
  while (stud<*n_stud) { 
    if (fgets(row, 254, f)==NULL)
      error(5);
    /* luetaan koepisteet pois */
    exam1=strtod(row, &endp);
    if (endp==row)
      error(3);
    row=endp;
/* Puuta vain kun ravistaa */
    exam2=strtod(row, &endp);
    if (endp==row)
      error(3);
    row=endp;
    row++; /* luetaan viela valilyonti pois */

    /* luetaan harj.pisteet */
    task=0; ses=0; sum=0; j=0;
    while (row[j]!='\n') {
      if (row[j]==' ') { (*matr2)[stud][ses]=sum; ses++; sum=0;}
      else {
	if (row[j]=='1') { (*matr1)[stud][task]=1; sum++;}
	else { 
	  if (row[j]=='0') 
	    (*matr1)[stud][task]=0;
	  else error(5);
	}
	task++; 
      }
      j++; 
    }
    stud++; /* seuraava opiskelija */
  }
  free(row);
}
/* jo sata hiirtä putoaa */

int main(int argc, char *argv[]) {
  FILE *f;
  int n_stud, n_task, n_ses;
  int **matr1, **matr2;
  double *s, *w, *s_ed, *w_ed, N_1=0, N_2=0;
  int konvergoi=0, i, j;
 
  if (argc!=2) error(0);
  if ((f=fopen(argv[1], "r"))==NULL) 
    error(1);
  initialize(f, &matr1, &matr2, &n_stud, &n_task, &n_ses);
  if(fclose(f)==EOF)
    error(4);
/* Niitä sitten popsimalla */
  if ((s=(double*)malloc(n_ses*sizeof(double)))==NULL)
      error(6);
  if ((w=(double*)malloc(n_stud*sizeof(double)))==NULL)
    error(6);
  if ((s_ed=(double*)malloc(n_ses*sizeof(double)))==NULL)
      error(6);
  if ((w_ed=(double*)malloc(n_stud*sizeof(double)))==NULL)
    error(6);
  for (j=0; j<n_ses; j++)
    s[j]=0; s_ed[j]=0;
  for (i=0; i<n_stud; i++)
    w[i]=0.0; w_ed[i]=0.0;
  
  /* hubs and authorities alkaa */
  for (j=0; j<n_ses; j++) {
    for (i=0; i<n_stud; i++) 
      s[j]+=matr1[i][j];
    N_1+=s[j]*s[j];
  }

  for (j=0; j<n_ses; j++)
    s[j]/=N_1;   /* normeeraus */
/* söisi pienen sienen alla */ 
  printf("Harj.kertojen painot alussa:\n");
  for (j=0; j<n_ses; j++)
    printf("%f\n", s[j]);
      
  for (i=0; i<n_stud; i++) {
    for (j=0; j<n_ses; j++) 
      w[i]+=matr1[i][j];
    N_2+=w[i]*w[i];
  }

  for (i=0; i<n_stud; i++)
    w[i]/=N_2;   /* normeeraus */
/* kissa Krumeluu */ 
  printf("Opiskelijoiden painot alussa:\n");
  for (i=0; i<n_stud; i++)
    printf("%f\n", w[i]);
   
  /* paivitetaan kunnes konvergoi */

  while (konvergoi==0) {
    N_1=0; N_2=0;
    for (j=0; j<n_ses; j++) {
      for (i=0; i<n_stud; i++) 
	s[j]+=w[i];
      N_1+=s[j]*s[j];
    }
    for (j=0; j<n_ses; j++)
      s[j]/=N_1;   /* normeeraus */

    for (i=0; i<n_stud; i++) {
      for (j=0; j<n_ses; j++) 
	w[i]+=s[j];
      N_2+=w[i]*w[i];
    }
    for (i=0; i<n_stud; i++)
      w[i]/=N_2;   /* normeeraus */

    /* tutkitaan, konvergoiko */
    konvergoi=1;
    for (j=0; j<n_ses; j++) {
      if (abs(s_ed[j]-s[j])>0.01) {
	konvergoi=0; break;
      }
      if (konvergoi==1) {
	for (i=0; i<n_stud; i++) {
	  if (abs(w_ed[i]-w[i])>0.01) {
	    konvergoi=0; break;
	  }
	}
      }
    }
    for (j=0; j<n_ses; j++) 
      s_ed[j]=s[j];
    for (i=0; i<n_stud; i++) 
      w_ed[i]=w[i];

  }
/* pieni ruususuu */
  printf("Opiskelijoiden painot:\n");
  for (i=0; i<n_stud; i++)
    printf("%f\n", w[i]);
  printf("Harj.kertojen painot:\n");
  for (j=0; j<n_ses; j++)
    printf("%f\n", s[j]);
 
  /* printf("lkm:t %d %d %d\n", n_stud, n_ses, n_ses);*/
  /* mprint(matr1, matr2, n_stud, n_ses, n_ses);*/

  return EXIT_SUCCESS;
}