Since $c-n = \log(n)+1$, $c-1 = n+\log(n)$, and in turn $e^{c-1}= n e^n$. Thus $n={\rm W}(e^{c-1})$ where W is Lambert W function.
EDIT: Adding details in response to the OP's request.
Put $x=e^{c-1} (> 0)$. Then, there exists a unique (real) number $n=n(x)$ such that $x=ne^n$. For example, if $c=2$, so that $x=e$, then $n=1$ (since $e=1e^1$). As another example, if $c=3$, so that $x=e^2$, then $n \approx 1.5571455989976$; indeed, letting $\hat n=1.5571455989976$, $\hat n e^{\hat n}$ is very close to $e^2$. The unique solution $n=n(x)$ of the equation $x=ne^n$ (x > 0) is given by (defined) $n={\rm W}(x)$, where ${\rm W}$ is the Lambert W function (thus, for example, ${\rm W}(e)=1$ and ${\rm W}(e^2) \approx 1.5571455989976$). While the function W is rather complicated, it can be evaluated immediately using WolframAlpha. So, given the constant $c$, just ask WolframAlpha to compute ${\rm W}(e^{c-1})(=n)$ (note that the function W is implemented as ProductLog).