Int main()

{

char *string;

int size,lenght;

printf("Enter,how many symbols do you want: ");

scanf("%d",&size);

string=(char*)malloc(size+1*sizeof(char));

printf("Enter string: ");

GetStr(string,size);

Revers(string);

printf("\n%s",string);

free(string);

getch();

return 0;

}

Рекурсивный реверс строки

#include<stdio.h>

#include<conio.h>

#include<malloc.h>

int GetStr(char*str,int size)

{

int i;

char c;

for(i=0;i<size&&(c=getche())!=13;i++)

str[i]=c;

str[i]='\0';

return i-1;

}

void Revers(char *str,int l, int r)

{

if(l<r)

{

int temp=str[l];

str[l]=str[r];

str[r]=temp;

l++;

r--;

Revers(str, l, r);

}

}

Int main()

{

char *string;

int size,lenght;

printf("Enter,how many symbols do you want: ");

scanf("%d",&size);

string=(char*)malloc(size+1*sizeof(char));

printf("Enter string: ");

lenght=GetStr(string,size);

Revers(string,0,lenght);

printf("\n%s",string);

free(string);

getch();

return 0;

}

Седловая точка

#include<stdio.h>

#include<conio.h>

#include<malloc.h>

Int main()

{

int **A;

int m,n,i,j,point,t,i1,i2,j1,alarm=0;

printf("Enter,how many strings do you want: ");

scanf("%d",&m);

printf("Enter,how many colomns do you want: ");

scanf("%d",&n);

A=(int**)malloc(m*sizeof(int*));

for(i=0;i<m;i++)

A[i]=(int*)malloc(n*sizeof(int*));

for(i=0;i<m;i++)

for(j=0;j<n;j++)

{

printf("Element[%d][%d]= ",i,j);

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

}

for(i=0;i<m;i++)

{

t=*(*(A+i)+0);

i1=i;

j1=0;

for(j=0;j<n;j++)

if(*(*(A+i)+j)<t)

{

t=*(*(A+i)+j);

i1=i;

j1=j;

}

point=0;

for(i2=0;i2<m;i2++)

if(t<=*(*(A+i2)+j1)&&i1!=i2)

point=1;

if(!point)

{

alarm=1;

printf("\n Naidena sedlovaia tochka %d s koordinatami: %d,%d",t,i1+1,j1+1);

}

}

if(!alarm)

printf("Net sedlovix tochek");

for(i=0;i<m;i++)

free(A[i]);

free(A);

getch();

return 0;

}

Синус

#include <stdio.h>

#include <conio.h>

#include <math.h>

#define pi 3.1415926535897932384626433832

long double factorial( long int number)

{

if(number==0|| number==1)

return 1;

return number* factorial(number-1);

}

double p(double base, double stage)

{

if (stage==0)

return 1;

if (stage==1)

return base;

return base * p(base, stage - 1);

}

double mod ( double numb)

{

if (numb>=0)

return numb;

return numb*(-1);

}

Int main()

{

long double angl, calculatedsin=0, Maclaurinseries=1, sinlib;

int k=0, n, acc,iteration;

printf(" Please, enter angle ");

scanf("%lf", &angl);

printf(" Please, enter accuracy: ");

scanf("%d", &acc);

printf("Enter,how many iterations do you want: ");

scanf("%d",&iteration);

sinlib=sin(angl);

for(;angl<- pi|| angl>pi ;)

{

k=angl/pi;

angl=angl-(2*k*pi);

}

for(n=0;n<iteration && mod(Maclaurinseries)>(1/(p(10,acc)));n++)

{

Maclaurinseries=p((-1),n)*(p(angl,(2*n+1))/factorial(2*n+1));

calculatedsin=calculatedsin+Maclaurinseries; // Ряд Маклорена для синуса

}

acc++;

printf("Sin from your entered angle = ");

printf("%.*lf \n", acc,calculatedsin);

printf("For comparison, library sin = ");

printf("%.16lf \n", sinlib);

getch();

return 0;

}