P7398 [COCI 2020/2021 #5] Šifra

Given a string of length at most $100$ that contains only lowercase letters and characters from $0 \sim 9$ (the letters in the string can be treated as separators), find how many distinct numbers appear in the string.

One line containing a string with only lowercase letters and characters from $0 \sim 9$. It is guaranteed that each number has at most $3$ digits.

Output the number of distinct numbers in the string.

#### Constraints For $50\%$ of the testdata, all numbers that appear are pairwise distinct. For $100\%$ of the testdata, the string length is between $1$ and $100$. #### Notes **The score for this problem follows the original COCI settings, with a full score of $50$.** **This problem is translated from [COCI2020-2021](https://hsin.hr/coci/) [CONTEST #5](https://hsin.hr/coci/contest5_tasks.pdf) _T1 Šifra_.** Translated by ChatGPT 5