Donats (pel canal d’entrada)
un enter positiu n i un enter 1 ≤ d ≤ 9,
fes un programa que calculi
quantes vegades apareix el dígit d a n.
Entrada
Un enter n > 0 i un enter 1 ≤ d ≤ 9.
Sortida
El nombre de vegades que d apareix a n.
About statements
The official statement of a problem is always the one
in the PDF document. The HTML version of the statement
is also given to help you, but may contain some content
that is not well displayed. In case of doubt, always use the PDF.