Правка кода по заданию

#include

int main(){

int A[10][3];

for(int c=1;c

{

printf("Insert scores of %d sportsman: ",c);

for(int d=0;d

{

scanf("%d",&A[c][d]);

}

}

int temp1,temp2,temp3;

int pos[11];

int i=0;

for(int a=1;a

{

int res1=A[a][0]+A[a][1]+A[a][2];

for(int b=a+1;b

int res2 = A[0]+A[1]+A[2];

if(res1

{

pos=b;

temp1=A[a][0];

temp2=A[a][1];

temp3=A[a][2];

A[a][0] = A[0];

A[a][1] = A[1];

A[a][2] = A[2];

A[0] = temp1;

A[1] = temp2;

A[2] = temp3;

}

}

i++;

}

for(int a=0;a

{

int Sum=0;

for(int b=0;b

{

Sum = Sum + A[a];

}

printf("%d place - %d sportsman with %d score\n",a+1,pos[a],Sum);

}

}

#include

#include

double f(double x)

{

return log(x) - x + 1.8;

}

int main()

{

int N,t1=0,t2=0;

double a,b,y,min,max,S=0;

printf("1.Insert N: ");

scanf("%d",&N);

printf(" Insert a: ");

scanf("%lf",&a);

printf(" Insert b: ");

scanf("%lf",&b);

double mas[N];

double e0;

for(int i=1;i

{

double x=a+(double)(i-1)*(b-a)/(double)(N);

mas[i-1]=f(x);

S+=mas[i-1];

if(t1==0||mas[i-1]

if(t2==0||mas[i-1]>max){t2=1;max=mas[i-1];}

printf(" mas[%d] = %0.2lf\n",i,mas[i-1]);

}

int t=0,N1;

S/=(double)(N);

printf(" min = %0.2lf\n",min);

printf(" max = %0.2lf\n",max);

printf(" average = %0.2lf\n",S);

printf("2.Insert y: ");

scanf("%lf",&y);

for(int i=0;i

if(fabs(mas-y)

{

printf(" mas[%d] = %0.2lf\n",i+1,y);

t=1;

}

for(int i=1;i

{

printf(" f(mas[%d]) = %0.2lf\n",i,f(mas[i-1]));

}

printf("3. Insert y: ");

scanf("%lf",&y);

for(int i=0;i

if((fabs(f(mas)-y)f(mas))&&(fabs(f(mas[i+1])-y)

{

printf("f(mas[%d])(%0.2lf)),y,i+2,f(mas[i+1]),100.0*fabs(mas[i+1]-mas)/fabs(y));

t=1;

e0=100.0*fabs(mas[i+1]-mas)/fabs(y);

}

if(t==0)printf(" Values not found!\n");

printf("Insert accuracy: ");

double e;

scanf("%lf",&e);

N1=N;

printf("For N = %d:\n", N);

while(e0>e&&fabs(e-e0)>0.005)

{

N1++;

memset(mas, 0, sizeof(mas));

mas[N1];

}

for(int i=1;i

{

double x=a+(double)(i-1)*(b-a)/(double)(N*2);

mas[i-1]=f(x);

}

t=0;

for(int i=0;i

{

if((fabs(f(mas)-y)f(mas))&&(fabs(f(mas[i+1])-y)

{e0=100.0*fabs(mas[i+1]-mas)/fabs(y);t=1;}

}

if(t==0)

{printf(" Values not found!\n");}

memset(mas, 0, sizeof(mas));

printf("For N = %d:\n",N*2);

mas[N*2];

for(int i=1;i

{

double x=a+(double)(i-1)*(b-a)/(double)(N*2);

mas[i-1]=f(x);

}

t=0;

for(int i=0;i

{

if((fabs(f(mas)-y)f(mas))&&(fabs(f(mas[i+1])-y)

{e0=100.0*fabs(mas[i+1]-mas)/fabs(y);t=1;}

}

if(t==0)

{printf(" Values not found!\n");}

memset(mas, 0, sizeof(mas));

printf("For N = %d:\n",N1*5);

mas[N1*5];

for(int i=1;i

{

double x=a+(double)(i-1)*(b-a)/(double)(N*2);

mas[i-1]=f(x);

}

t=0;

for(int i=0;i

{

if((fabs(f(mas)-y)f(mas))&&(fabs(f(mas[i+1])-y)

{e0=100.0*fabs(mas[i+1]-mas)/fabs(y);t=1;}

}

if(t==0)

{printf(" Values not found!\n");}

memset(mas, 0, sizeof(mas));

printf("For N = %d:\n",N*10);

mas[N*10];

for(int i=1;i

{

double x=a+(double)(i-1)*(b-a)/(double)(N*2);

mas[i-1]=f(x);

}

t=0;

for(int i=0;i

{

if((fabs(f(mas)-y)f(mas))&&(fabs(f(mas[i+1])-y)

{e0=100.0*fabs(mas[i+1]-mas)/fabs(y);t=1;}

}

if(t==0)

{printf(" Values not found!\n");}

}