# The Dividing Path

All the digits of the positive integer $$N$$ are either $$0$$ or $$1$$. The remainder after dividing $$N$$ by $$37$$ is $$18$$. What is the smallest number of times that the digit $$1$$ can appear in $$N$$?

Details and Assumptions:

This problem is not original.

×