02. Equal Sums Even Odd Position

#include <iostream>
using namespace std;

int main()
{
	int startNumber, endNumber;
	cin >> startNumber >> endNumber;

	for (int number  = startNumber; number <= endNumber; number++)
	{
		//проверка дали цифрите на четни и нечетни позиции са равни
		//234876
		int units = number % 10; //единици
		int tens = (number / 10) % 10; //десетици
		int hundreds = (number / 100) % 10;//стотици
		int thousands = (number / 1000) % 10; //хилядни
		int tenThousands = (number / 10000) % 10;// десетохилядни
		int hundredThousands = number / 100000;//стохилядни

		int sumEvenPositions = units + hundreds + tenThousands;
		int sumOddPositions = hundredThousands + thousands + tens;

		if (sumEvenPositions == sumOddPositions)
		{
			cout << number << " ";
		}


	}
}