Cod sursă (job #546292)

#include <fstream>

using namespace std;

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

#define maxn 1001

short a[maxn][maxn], s[maxn][maxn];
int n, m, p, q, ok;
char w;

bool lena_cauta (int x, int y)
{
	for (int i=1; i<=p; i++)
		for (int j=1; j<=q; j++)
			if (a[i+x-1][j+y-1] != s[i][j]) return 0;
				else return 1;
}

int main()
{
	fi>>n>>m;
	for (int i=1; i<=n; i++)
	{
		for (int j=1; j<=m; j++)
		{
			fi>>w;
			a[i][j]=w-'a';
		}
	}
	fi>>p>>q;
	for(int i=1; i<=n; i++)
		for (int j=1; j<=m; j++)
			if (a[i][j] == s[1][1])
			{
				ok = lena_cauta (i,j);
				if (ok ==1)
				fo<<i-1<<' '<<j-1<<'\n';
			}
			
		return 0;
}