Cod sursă (job #365044)

#include <fstream>

using namespace std;

char F[1000][1000], f[1000][1000];

ifstream in("fotografie.in");
ofstream out("fotografie.out");

int main()
{
	int M, N;
	in >> M >> N;
	for (int i = 0; i < M; i++)
		for (int j = 0; j < N; j++)
			in >> F[i][j];

	int m, n;
	in >> m >> n;
	for (int i = 0; i < m; i++)
		for (int j = 0; j < n; j++)
			in >> f[i][j];

	for (int i = 0; i < M; i++)
		for (int j = 0; j < N; j++)
		{
			bool found = true;
			for (int u = 0; u < m; u++)
				for (int v = 0; v < n; v++)
				{
					if (u >= m || v >= n) { u = m; v = n; found = false; break; }
					if (F[i + u][j + v] != f[u][v]) {u = m; v = n; found = false;}
				}

			if(found) 
				out << i << ' ' << j << '\n';
		}



}