Reasoning :
Consider
- problem $$$A$$$ with one boolean as input and arbitrary output
- problem $$$B$$$ with arbitrary input and one boolean as output
$$$A$$$ can never be an NP problem (only two possibilities $$$(0/1)$$$ and each have a fixed answer regardless of the output).
$$$B$$$ can be an NP problem (example : check whether array can be partitioned into two sets of equal sums)
It should be obvious that this is true, because an arbitrary output can be converted easily to a boolean output and the problem will have the same difficulty (e.g. check that the answer is less than some given integer $$$x$$$).
you probably meant NP-hard and not NP?