#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include <math.h>
#include <stdio.h>
#include <time.h>
#include <stdlib.h>
#include <locale.h>
#include <string.h>
#include <ctype.h>


void rus() {
	setlocale(LC_ALL, "Russian");
}

int minus(int a, int b) {
	int c = a - b;
	return c;
}

void print(int** a, int n, int M) {
	for (int i = 0; i < n; i++){
		for (int j = 0; j < M;j++) {
			printf("%d\t", a[i][j]);
		}
		puts("\n");
	}
}
void print_1(int* a, int n) {
	for (int i = 0; i < n; i++) {
		printf("%d\t", a[i]);
	}
}

void print_f(float* a, int n) {
	for (int i = 0; i < n; i++)
	{
		printf("%f\t", a[i]);
	}
}

void random(int** a, int N, int M, int d, int plus) {
	for (int i = 0; i < N; i++) {
		for (int j = 0; j < M; j++) {
			a[i] [j]= rand() % d + plus;
		}
	}
}

void random_f(float* a, int N, int d, int plus) {
	for (int i = 0; i < N; i++) {
		a[i] = rand() % d + plus;
	}
}

void swap(int* a, int* b) {
	int sw = *a;
	*a = *b;
	*b = sw;
}

void swap_f(float* a, float* b) {
	float sw = *a;
	*a = *b;
	*b = sw;
}

void sort_vozrastanie(int* a, int start, int N) {
	for (int i = start; i < N; i++) {
		for (int j = start; j < N; j++) {
			if (a[j] > a[j + 1]) {
				int* pa = &a[j], * pb = &a[j + 1];
				swap(pa, pb);
			}
		}
	}
}

void sort_ybivanie(int* a, int start, int N) {
	for (int i = start; i < N; i++) {
		for (int j = start; j < N; j++) {
			if (a[j] < a[j + 1]) {
				int* pa = &a[j], * pb = &a[j + 1];
				swap(pa, pb);
			}
		}
	}
}

float cent_arifmetical(int* a, int N) {
	int arif = 0;
	for (int i = 0; i < N; i++)
	{
		arif += a[i];
	}
	arif = arif / N;
	return arif;
}

int max_in_array(int* a, int N) {
	int max = 0;
	for (int i = 0; i < N; i++)
	{
		if (a[i] > max) {
			max = a[i];
		}
	}
	return max;
}

int max_index_in_array(float* a, int N) {
	float max = 0, j = 0;
	for (int i = 0; i < N; i++)
	{
		if (a[i] > max) {
			max = a[i];
			j = i;
		}
	}
	return j;
}

float count_of_elements_who_more_then_q0_float(int* a, int N, int q0) {
	float q = 0;
	for (int i = 0; i < N; i++)
	{
		if (a[i] > q0) {
			q++;
		}
	}
	return q;
}

int sum_chet(int* a, int N) {
	int sum = 0;
	for (int i = 0; i < N; i++)
	{
		if (i % 2 == 0) {
			sum += a[i];
		}
	}
	return sum;
}

int sum_nechet(int* a, int N) {
	int sum = 0;
	for (int i = 0; i < N; i++)
	{
		if (i % 2 == 1) {
			sum += a[i];
		}
	}
	return sum;
}

void sign(int* a, int* b, int N) {
	int j = 0;
	for (int i = 0; i < N; i++) {
		if (a[i] < 0) {
			b[j++] = a[i];
		}
	}

	for (int i = 0; i < N; i++) {
		if (a[i] == 0) {
			b[j++] = a[i];
		}
	}

	for (int i = 0; i < N; i++) {
		if (a[i] > 0) {
			b[j++] = a[i];
		}
	}
}

void for_task3(int* a, int* b, int N) {
	for (int i = 0; i < N; i++) {
		int c = a[i] % 10, d = a[i] / 10;
		b[i] = minus(c, d);
	}
}

void sum(int **a, int *b, int N, int M) {
	int summa = 0;
	for (int i = 0; i < N; i++)
	{
		summa = 0;
		for (int j = 0; j < M; j++)
		{
			summa += a[i][j];
		}
		b[i] = summa;
	}
}

void pr(int** a, int* b, int N, int M) {
	int pro = 1;
	for (int i = 0; i < N; i++)
	{
		pro = 1;
		for (int j = 0; j < M; j++)
		{
			pro =pro * a[i][j];
		}
		b[i] = pro;
	}
}

void v_diag(int** a, int N, int M, int* b, int *ch) {
	for (int j = 0;j < N; j++) {
		for (int i = 0; i < j; i++) {
			b[i + j] = a[i][j];
			(*ch)++;
		}
	}
}

int min(int* a, int N) {
	int min = 100000000;
	for (int i = 0; i < N; i++)
	{
		if (a[i] < min) {
			min = a[i];
		}
	}
	return min;
}

int sqr(int a) {
	return a * a;
}

void for_task_6(int **a, int *b, int N, int M){
    for (int i = 0; i<N; i++) {
        b[i]=a[i][i];
    }
}

void for_task_9(int **a, int *b, int N, int M){
    for (int i = 0; i<N; i++) {
        b[i]=a[i][i]*a[i][i];
    }
}

void for_task_7(int **a, int *b, int N, int M){
    int max = - 11111111;
    for (int j = 0; j<N; j++){
        for (int i=0; i<M; i++){
            if (a[i][j]>max) {
                max = a[i][j];
            }
            b[j]=max;
        }
    }
}

void for_task_10(int **a, int *b, int N, int M){
    int sum = 0;
    for (int i = 0; i<N; i++){
        for (int j = 0; j<M; j++) {
            sum+=a[i][j];
        }
        b[i] = sum/M;
        sum = 0;
    }
}

void for_task_12(int **a, int *b, int N, int M){
    for (int i=0; i<N; i++){
        for (int j = i+1; j<M; j++){
            if
        }
    }
}




#define N 10
#define M 10

#define task11

#ifdef task1
int main() {
	int a[N][M] = {	0 };
	int* pa[N] = { 0 };
	int** pointer_a = 0;
	int b[N] = { 0 }, *pb = b;
	for (int i = 0; i < N; i++) {
		pa[i] = a[i];
	}
	pointer_a = pa;

	random(pointer_a, N, M, 10, 1);
	print(pointer_a, N, M);
	sum(pointer_a, pb, N, M);
	print_1(pb, N);

	return 0;
}
#endif // task1

#ifdef task2
int main() {
	int a[N][M] = { 0 };
	int* pa[N] = { 0 };
	int** pointer_a = 0;
	int b[N] = { 0 }, * pb = b;
	for (int i = 0; i < N; i++) {
		pa[i] = a[i];
	}
	pointer_a = pa;
	random(pointer_a, N, M, 10, 1);
	print(pointer_a, N, M);
	for (int i = 0; i < N; i++) {
		b[i] = max_in_array(pa[i], M);
	}
	print_1(b, N);
	return 0;
}
#endif // task2

#ifdef task3
int main() {
	int a[N][M] = { 0 };
	int* pa[N] = { 0 };
	int** pointer_a = 0;
	int b[M] = { 0 }, * pb = b;
	for (int i = 0; i < N; i++) {
		pa[i] = a[i];
	}
	pointer_a = pa;
	random(pointer_a, N, M, 10, 1);
	print(pointer_a, N, M);
	sum(pointer_a, pb, N, M);

	puts("\n");
	print_1(b, M);
	return 0;
}
#endif // task3

#ifdef task4
int main() {
	int a[N][M] = { 0 };
	int* pa[N] = { 0 };
	int** pointer_a = 0;
	int b[N*M/2] = { 0 }, * pb = b;
	int chotchik = 0, *ch=&chotchik;
	for (int i = 0; i < N; i++) {
		pa[i] = a[i];
	}
	pointer_a = pa;
	random(pointer_a, N, M, 10, 1);
	print(pointer_a, N, M);

	v_diag(pointer_a, N, M, pb, ch);

	puts("\n");
	print_1(b, *ch);
	return 0;
}
#endif // task4

#ifdef task5
int main() {
	int a[N][M] = { 0 };
	int* pa[N] = { 0 };
	int** pointer_a = 0;
	int b[M] = { 0 }, * pb = b;
	for (int i = 0; i < N; i++) {
		pa[i] = a[i];
	}
	pointer_a = pa;
	random(pointer_a, N, M, 10, 1);
	print(pointer_a, N, M);
	pr(pointer_a, pb, N, M);
	puts("\n");
	print_1(b, M);
	return 0;
}
#endif // task5

#ifdef task6
int main() {
    srand(time(NULL));
    int a[N][M] = { 0 };
    int* pa[N] = { 0 };
    int** pointer_a = 0;
    int b[N] = { 0 }, *pb = b;
    for (int i = 0; i < N; i++) {
        pa[i] = a[i];
    }
    pointer_a = pa;

    random_(pointer_a, N, M, 10, 1);
    print(pointer_a, N, M);
    puts("\n");
    for_task_6(pointer_a, pb, N, M);
    print_1(pb, N);

    puts("\n");

    return 0;
}
#endif

#ifdef task7
int main() {
    srand(time(NULL));
    int a[N][M] = { 0 };
    int* pa[N] = { 0 };
    int** pointer_a = 0;
    int b[N] = { 0 }, *pb = b;
    for (int i = 0; i < N; i++) {
        pa[i] = a[i];
    }
    pointer_a = pa;

    random_(pointer_a, N, M, 10, 1);
    print(pointer_a, N, M);
    puts("\n");
    for_task_7(pointer_a, pb, N, M);
    print_1(pb, N);

    puts("\n");

    return 0;
}
#endif


#ifdef task8
int main() {
	int a[N][M] = { 0 };
	int* pa[N] = { 0 };
	int** pointer_a = 0;
	int b[N] = { 0 }, * pb = b;
	for (int i = 0; i < N; i++) {
		pa[i] = a[i];
	}
	pointer_a = pa;

	random(pointer_a, N, M, 10, 1);
	print(pointer_a, N, M);
	for (int i = 0; i < N; i++) {
		b[i] =min(pa[i], N);
	}
	print_1(pb, N);

	return 0;
}
#endif // task8

#ifdef task9
int main() {
    srand(time(NULL));
    int a[N][M] = { 0 };
    int* pa[N] = { 0 };
    int** pointer_a = 0;
    int b[N] = { 0 }, *pb = b;
    for (int i = 0; i < N; i++) {
        pa[i] = a[i];
    }
    pointer_a = pa;

    random_(pointer_a, N, M, 10, 1);
    print(pointer_a, N, M);
    puts("\n");
    for_task_9(pointer_a, pb, N, M);
    print_1(pb, N);

    puts("\n");

    return 0;
}
#endif


#ifdef task10
int main() {
    srand(time(NULL));
    int a[N][M] = { 0 };
    int* pa[N] = { 0 };
    int** pointer_a = 0;
    int b[N] = { 0 }, *pb = b;
    for (int i = 0; i < N; i++) {
        pa[i] = a[i];
    }
    pointer_a = pa;

    random_(pointer_a, N, M, 10, 1);
    print(pointer_a, N, M);
    puts("\n");
    for_task_10(pointer_a, pb, N, M);
    print_1(pb, N);

    puts("\n");

    return 0;
}
#endif