You can simply this program and remove the need for the maks() function.

Code:
#include <iostream>

using namespace std;

int main()
{
const int sk = 13;

	for (int k = 1; k <= sk; k++)
		for (int l = 1; l <= sk; l++)
			for (int i = 1; i <= sk; i++)
				for (int j = 1; j <= sk; j++) {

					int m = k * k * k + l * l * l;
					int n = j * j * j + i * i * i;

					if (k != l && k != i && k != j && l != i && l != j && i != j && m == n) {
						cout << m;
						return 0;
					}

				}
	return 1;
}