Part 2

#C
n, m = map(int, input().split())
matrix = [input().split() for i in range(n)]
k, r, count = int(input()), int(input()), 0
for i in range(n):
    for j in range(m):
        if len(matrix[i][j]) == k and sum([int(i) for i in matrix[i][j]]) % r == 0:
            count += 1
print(count)
#D
#include <iostream>
#include <iomanip>
#include <ctime>
using namespace std;

int main()
{
	srand((int)time(0));
	int N, M, imin = 0, jmin = 0, imax = 0, jmax = 0;

	cin >> N >> M;

	double **a = new double*[N], min = 0.0, max = 0.0;
	for (int i = 0; i < N; i++)
		a[i] = new double[M];

	for (int i = 0; i < N; i++)
	{
		for (int j = 0; j < M; j++)
		{
			cin >> a[i][j];
			if ((i == 0 && j == 0) || a[i][j]<min) { min = a[i][j]; imin = i; jmin = j; }
			if ((i == 0 && j == 0) || a[i][j]>max) { max = a[i][j]; imax = i; jmax = j; }
		}
	}
	cout << imin + 1 << " " << jmin + 1 << " " << min << "\n";
	cout << imax + 1 << " " << jmax + 1 << " " << max << "\n";

	for (int i = 0; i < N; i++)
		delete[] a[i];
	delete[] a;
	system("pause");
	return 0;
}
#E
#include <iostream>
#include <cstdlib>
#include <climits>
#include <ctime>
using namespace std;

int main()
{
	srand((int)time(0));
	int n, m, sum, min = INT_MAX, index = 0;
	cin >> n;
	cin >> m;
	int **a = new int*[n];
	for (int i = 0; i < n; i++)
		a[i] = new int[m];
	for (int i = 0; i < n; i++)
	{
		sum = 0;
		for (int j = 0; j < m; j++)
		{
			cin >> a[i][j];
			sum += a[i][j];
		}
		if (sum<min) { min = sum; index = i; }
	}
	for (int j = 0; j < m; j++)
		cout << a[index][j] << " ";
	for (int i = 0; i < n; i++)
		delete[]a[i];
	delete[]a;
	system("pause");
	return 0;
}