FindM

FindM

long findM3(long n, long m)
{
	int c = 0;
	long v = 1;

	bool squared = false;
	int va[1000];
	while (v * v <= n)
	{
		if (v * v < n)
		{
			if (!(n % v))
			{
				va[c] = v;
				if (m == ++c)
				{
					return v;
				}
			}
		}
		else
		{
			squared = true;
			va[c] = v;
			if (m == ++c)
			{
				return v;
			}
			break;
		}

		v++;
	}

	if (squared && (m % 2))
	{
		return n / va[m - c];
	}
	else if (!squared && !(m % 2) && (m <= c * 2))
	{
		return n / va[c - (m - c)];
	}

	return -1;
}