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

int main(){

int i,j,n, k;
double **A, **M;
double *r,*x,*p,beta,alfa,*b, *v, pom1, pom2, pom3, *y;

printf("ucitaj n: ");
scanf("%d",&n);

A = (double **) malloc( n*n * sizeof(double) );
for(i=0;i<n;i++) A[i]=(double *) malloc( n * sizeof(double) );
r = (double *) malloc( n * sizeof(double) );
x = (double *) malloc( n * sizeof(double) );
p = (double *) malloc( n * sizeof(double) );
b = (double *) malloc( n * sizeof(double) );
M = (double **) malloc( n*n * sizeof(double) );

for(i=0;i<n;i++) M[i]=(double *) malloc( n * sizeof(double) );
y = (double *) malloc( n * sizeof(double) );

for(i=0;i<n;i++)
for(j=0;j<n;j++) if (i==j) M[i][j]=1-1.0/(sqrt(i+1));
                 else M[i][j]=0;

for(i=0;i<n;i++)
for(j=0;j<n;j++)
A[i][j]=1.0/(i+j+1);

for(i=0;i<n;i++){
x[i]=0;
b[i]=1;}

for(i=0;i<n;i++)
r[i]=-b[i];

for(i=0; i<n; i++){
 y[i]=0;
 for (j=0; j<n; j++) if(M[i][j]!=0) y[i]=y[i]+M[i][j]*r[j];
 }

for(i=0;i<n;i++) p[i]=-y[i];

k=0;
v = (double *) malloc( n * sizeof(double) );
pom3=1;

while (sqrt(pom3)>0.000001){

pom1=0;

for(i=0; i<n; i++) pom1=pom1+r[i]*y[i];

for(i=0; i<n; i++) v[i]=0;

for(i=0; i<n; i++) for (j=0; j<n; j++) v[i]=v[i]+p[j]*A[i][j];

pom2=0;

for (i=0; i<n; i++) pom2=pom2+v[i]*p[i];

alfa=pom1/pom2;

for (i=0; i<n; i++){
 x[i]=x[i]+alfa*p[i];
 r[i]=r[i]+alfa*v[i];
 }

for(i=0; i<n; i++){
 y[i]=0;
 for (j=0; j<n; j++) if(M[i][j]!=0) y[i]=y[i]+M[i][j]*r[j];
 }
 
pom3=0;

for(i=0; i<n; i++) pom3=pom3+r[i]*y[i];

beta=pom3/pom1;

for(i=0; i<n; i++) p[i]=-y[i]+beta*p[i];

k++;

}

printf("\n");
for (i=0; i<n; i++) printf ("%f   ", x[i]);
printf("\n Broj iteracija: %d\n", k);

return 0;

}