Q8.6

#include <iostream>
using namespace std;

const int maxn = 255;

struct color
{
	int r, g, b;
};

color graph[maxn][maxn];
bool isPaint[maxn][maxn];
int x1, y1, x2, y2;
color clr;

void init()
{
	memset(graph, 0, sizeof(graph));
	memset(isPaint, false, sizeof(isPaint));
	x1 = 3; y1 = 4; x2 = 10; y2 = 10;
	clr.r = 100;  clr.g = 255; clr.b = 128;
}

void paint(int m, int n)
{
	if(m > x2 || m < x1 || n < y1 || n> y2)
		return;
	if(!isPaint[m][n])
	{
		graph[m][n].r = clr.r; graph[m][n].g = clr.g; graph[m][n].b = clr.b;
		isPaint[m][n] = true;
	}	
	if(m > x1 && !isPaint[m-1][n])
		paint(m-1, n);
	if(m < x2 && !isPaint[m+1][n])
		paint(m+1, n);
	if(n > y1 && !isPaint[m][n-1])
		paint(m, n-1);
	if(n < y2 && !isPaint[m][n+1])
		paint(m, n+1);		
}

void check()
{
	cout << graph[x1][y1].r << graph[x1][y1].g << graph[x1][y1].b << endl;
	cout << graph[x1+2][y1+3].r << graph[x1+2][y1+3].g<< graph[x1+2][y1+3].b << endl;
	cout << graph[x2-1][y2].r << graph[x2-1][y2].g << graph[x2-1][y2].b << endl;
}

int main(void)
{
	init();
	paint(5, 5);
	check();
		
	return 0;
}