#include <iostream>
#include <ctime>;
using namespace std;

void InMang2Chieu(int a[][100], int &n, int &m)
{
	cout << "So hang:";
	cin >> n;
	cout << "So cot:";
	cin >> m;
	cout << "Cac phan tu cua mang hai chieu la:" << endl;
	srand(time(NULL));
	for (int i = 0; i < n; i++)
	{
		for (int j = 0; j < m; j++)
		{
			a[i][j] = -20 + rand() % (41);
			cout << a[i][j] << "\t";
		}
		cout << endl;
	}
}

int Sum(int a[][100], int n, int m)
{
	int sum = 0;
	for (int i = 0; i < n; i++)
	{
		for (int j = 0; j < m; j++)
		{
			sum = sum + a[i][j];
		}
	}
	return sum;
}

int SumVien(int a[][100], int n, int m)
{
	int sum1 = 0;
	for (int i = 0; i < n; i++)
	{
		for (int j = 0; j < m; j++)
		{
			sum1 = sum1 + a[i][j];

		}
	}
	int sum2 = 0;
	for (int x = 1; x < n-1; x++)
	{
		for (int k = 1; k < m-1; k++)
		{
			sum2 = sum2 + a[x][k];
		}
	}
	return sum1-sum2;
}

int FindMaxTich(int a[][100], int n, int m)
{
	int maxtich = -1000000000,j,i,k;
	for ( j = 0; j < m; j++)
	{
		int tich = 1;
		for (i = 0; i < n; i++)
		{
			tich = tich * a[i][j];
		}
		if (tich > maxtich)
		{
			maxtich = tich;
			k = j;
		}
		else if (tich == maxtich)
			cout << "Khong co cot nao co tich lon nhat";
	}
	return k;
}

int CheckSCP(int a[][100], int n, int m)
{
	int x=-1, max = 0;
	for (int i = 0; i < n; i++)
	{
		int dem = 0;
		for (int j = 0; j < m; j++)
		{
			for (int k = 0; k <= sqrt(a[i][j]) ; k++)
			{
				if (a[i][j]>=1&&(float)sqrt(a[i][j]) == k)
				{
					dem += 1;
					
				}
			}
			if (dem > max)
			{
				max = dem;
				x = i;
			}
		}
	}
	return x;
}

void ChuyenVeMang1Chieu(int a[][100], int b[], int n, int m)
{
	int temp, x = -1;
	for (int i = 0; i < n; i++)
		for (int j = 0; j < m; j++)
			b[++x] = a[i][j];
	for (int k = 0; k < x + 1; k++)
	{
		for (int t = k + 1; t < x + 1; t++)
		{
			if (b[k] > b[t])
			{
				temp = b[k];
				b[k] = b[t];
				b[t] = temp;
			}
		}
	}
	cout << "Mang da sap xep la:" << endl;
	for (int i = 0; i < m * n; i++)
		cout << "Phan tu thu " << i << " la:" << b[i] << endl;
}

int main()
{
	int m, n, a[100][100],b[100];
	InMang2Chieu(a, n, m);
	cout << "Sum=" << Sum(a, n, m) << endl;
	cout << "SumVien=" << SumVien(a, n, m) << endl;
	cout << "Cot co tich lon nhat la cot :" << FindMaxTich(a, n, m) << endl;
	if (CheckSCP(a, n, m) == -1)
		cout << "Khong co dong nao chua so chinh phuong" << endl;
	else cout << "Dong co nhieu so chinh phuong nhat la :" << CheckSCP(a, n, m) << endl;
	ChuyenVeMang1Chieu(a, b, n, m);
	return 1;
}