C++ Vaje

int main (int argc, char* argv[])
{

	string vrstica;
	string popravljena_vrstica;

	getline (cin, vrstica);

	for (int i = 0; i < vrstica.size (); i++)
	{
		if (vrstica[i] != ' ')
			popravljena_vrstica += vrstica[i]; 
	}

	cout << vrstica << endl << popravljena_vrstica << endl;

	return 0;
}

int main (int argc, char* argv[])
{
	bool crke [27]= {false};

	// PAZI, DA VPISES SAMO VELIKE TISKANE CRKE 
	string beseda;
	cin >> beseda;

	int max_crka = 0;

	for (int x = 0; x < beseda.size (); x++)
	{
		int xxx = beseda[x] - 'A';
		crke[xxx] = true;
		
		if (xxx > max_crka) max_crka = xxx;
	}
	
	int i = 0;
	char iz_crke;
	char v_crko;
	while (true)
	{
		iz_crke = 0;
		v_crko = 0;

		while (i <= max_crka)
		{
			if (crke[i])
			{
				if (iz_crke == 0)
					iz_crke = i + 'A';
				else
				{
					v_crko = i + 'A';
					break;
				}
			}
			i++;
		}

		if (v_crko == 0) break;

		for (int i = 0; i < beseda.size (); i++)
		{
			if (beseda[i] == iz_crke)
				beseda[i] = v_crko;
		}

		cout << beseda << endl;
	}

	return 0;
}

...OO...O.
.O.O.OOO..
..O.OO.OOO
OOOO.OOO..
....O..O..
OO...O..O.
..O.O.OOO.
OOO.......
O..O..O...
...O.O..OO

void DisplayField (const char *pField, const int width, const int height)
{
	int size = width * height;

	for (int i = 0; i < size; i++)
	{
		if (i % width == 0)
			cout << endl;

		char val = *(pField + i);
		if (val == 0)
			cout << ".";
		else
			cout << val;
	}

	cout << endl << endl;
}

bool PreveriSosedo (const char *pField, const int width, const int height, const int x, const int y)
{
	if (x < 0 || x >= width) return false;
	if (y < 0 || y >= height) return false;

	if (*(pField + y * height + x) == 'O')
		return true;

	return false;
}


int Prestej_O_Sosede (const char *pField, const int width, const int height, const int curX, const int curY)
{
	int count = 0;

	if (PreveriSosedo (pField, width, height, curX-1, curY-1)) count++;
	if (PreveriSosedo (pField, width, height, curX, curY-1)) count++;
	if (PreveriSosedo (pField, width, height, curX+1, curY-1)) count++;

	if (PreveriSosedo (pField, width, height, curX-1, curY)) count++;
	if (PreveriSosedo (pField, width, height, curX+1, curY)) count++;

	if (PreveriSosedo (pField, width, height, curX-1, curY+1)) count++;
	if (PreveriSosedo (pField, width, height, curX, curY+1)) count++;
	if (PreveriSosedo (pField, width, height, curX+1, curY+1)) count++;

	return count;
}



int main (int argc, char* argv[])
{
	const int WIDTH = 10;
	const int HEIGHT = 10;
	char tabela[HEIGHT][WIDTH];
	char *pTabela = &tabela[0][0];

	ifstream is;
	is.open ("e:\\slo-tech.txt");
	if (!is.is_open ())
		return -1;

	for (int vrstica = 0; vrstica < HEIGHT; vrstica++)
	{
		string strPodatki;
		getline (is, strPodatki);

		for (int znak = 0; znak < WIDTH; znak++)
			tabela [vrstica][znak] = strPodatki[znak];
	}

	DisplayField (&tabela[0][0], WIDTH, HEIGHT);

	for (int h = 0; h < HEIGHT; h++)
	{
		for (int w = 0; w < WIDTH; w++)
		{
			if (w == 2 && h == 1)
				h = h;
			int count;
			count = Prestej_O_Sosede (pTabela, WIDTH, HEIGHT, w, h);
			if (count > 3)
				cout << "Polje (" << w << ", " << h << ") ima dovolj sosed" << endl;
		}
	}

	return 0;
}

...OO...O.
.O.O.OOO..
..O.OO.OOO
OOOO.OOO..
....O..O..
OO...O..O.
..O.O.OOO.
OOO.......
O..O..O...
...O.O..OO

Polje (2, 1) ima dovolj sosed
Polje (3, 1) ima dovolj sosed
Polje (4, 1) ima dovolj sosed
Polje (5, 1) ima dovolj sosed
Polje (6, 1) ima dovolj sosed
Polje (7, 1) ima dovolj sosed
Polje (8, 1) ima dovolj sosed
Polje (1, 2) ima dovolj sosed
Polje (2, 2) ima dovolj sosed
Polje (3, 2) ima dovolj sosed
Polje (4, 2) ima dovolj sosed
Polje (5, 2) ima dovolj sosed
Polje (6, 2) ima dovolj sosed
Polje (7, 2) ima dovolj sosed
Polje (8, 2) ima dovolj sosed
Polje (3, 3) ima dovolj sosed
Polje (4, 3) ima dovolj sosed
Polje (5, 3) ima dovolj sosed
Polje (6, 3) ima dovolj sosed
Polje (7, 3) ima dovolj sosed
Polje (8, 3) ima dovolj sosed
Polje (0, 4) ima dovolj sosed
Polje (1, 4) ima dovolj sosed
Polje (2, 4) ima dovolj sosed
Polje (5, 4) ima dovolj sosed
Polje (6, 4) ima dovolj sosed
Polje (6, 5) ima dovolj sosed
Polje (7, 5) ima dovolj sosed
Polje (0, 6) ima dovolj sosed
Polje (1, 6) ima dovolj sosed
Polje (1, 7) ima dovolj sosed
Polje (3, 7) ima dovolj sosed
Polje (7, 7) ima dovolj sosed
Polje (1, 8) ima dovolj sosed
Polje (2, 8) ima dovolj sosed