#1.cpp

these are 5 C codes (BorlandC++) realizing the numerical algoriths

// laba_4_10.cpp : Defines the entry point for the console application.
//

#include "stdafx.h"
#include <stdio.h>
#include <conio.h>
//#include <iostream.h>


int _tmain(int argc, _TCHAR* argv[])
{
	int m, n;	
	printf("M= ");
	scanf("%d", &m);
	printf("N= ");
	scanf("%d", &n);
	int **p = new int* [m];	
	for(int i = 0; i < m; i++)
		p[i] = new int [n];	
	for(int i = 0; i < m; i++)
		for(int j = 0; j < n; j++)
		{
			printf("X[%d][%d]=",i,j);
			scanf("%d", *(p+i)+j);
		}
	printf("Source array:  \n");
	for(int i = 0; i < m; i++)
	{
		for(int j = 0; j < n; j++)
			printf("%d  ", *(*(p+i)+j));
		printf("\n");
	}	
	for(int i = 0; i < m; i++)
	{
		int max = p[i][0]; int nMax = 0;
		int min = p[i][0]; int nMin = 0;
		for(int j = 1; j < n; j++)
		{
			if(p[i][j] > max) {max = p[i][j]; nMax = j;}
			if(p[i][j] < min) {min = p[i][j]; nMin = j;}
		}
		bool bMin = true;
		bool bMax = true;
		for(int k = 0; k < m; k++)
		{
			if(p[k][nMax] < max )
				bMin = false;
			if(p[k][nMin] > min )
				bMax = false;
			if(!bMin && ! bMax)
				break;
		}
		if (bMin) printf("%d,%d;  ", i, nMax);
		if (bMax) printf("%d,%d;  ", i, nMin);
	}
	getch();
	delete [] p;
	return 0;
}