Suppose that I have 2 positive integers $N$ and $K$ $(K \ge 3)$, I want to write
$N = 1*x + 2*y + K*z$.
All $x, y,z$ are non-negative integers. $z$ should be $\lfloor\frac{N}{K}\rfloor$ or $\lfloor\frac{N}{K}\rfloor - 1$.
Are there any ways to verify that $N$ can be written in that form, so that $x + y + z$ is an odd number?
If we fix $z$, we have $x + 2y = N-Kz$. If $N-Kz > 1$, we can always choose the parity of $x+y$ by choosing between $y=0$ and $y=1$. If $N-Kz \le 1$ we are forced to have $x = N-Kz$, $y=0$.
Therefore the only cases which fail for the choice $z = \left\lfloor\frac NK\right\rfloor$ are (a) $z$ is odd, $N - Kz = 1$; (b) $z$ is even, $N - Kz = 0$.
If we can choose $z = \left\lfloor\frac NK\right\rfloor - 1$, similar constraints apply. Of course, we can't do that validly if that would give $z < 0$.
So the cases where this is impossible are:
Conclusion: for all $N > 0$ and $K > 1$ it is possible.