P-NP Problem

Rearranging $P=N\times P$ gives $(N-1)P=0$. Thus the equality holds exactly when $N=1$ or $P=0$.

The main solution checks these two conditions. The naive solution directly computes $N\times P$ and compares it with $P$. Both take $O(1)$ time and extra space per case and $O(T)$ total time. Both methods work under the full constraints.

Since $|NP|\leq 10^6$ and $|(N-1)P|\leq 1\,001\,000$, even signed 32-bit arithmetic is sufficient. Do not divide both sides by without checking it, since may be zero.

Solution written by GPT