# Cryto-Division

**Computer Science**Level 5

\[\Large \dfrac{BOB}{DAD} = 0.HULKHULKHULK\dots\]

In the above cryptogram \(BOB\) is divided by \(DAD\) to obtain a recurring decimal \(0.HULKHULKHULK\dots\) which has repeating period of four digits \((HULK)\). Furthermore, \( \gcd(BOB, DAD) \neq 1 \).

Compute \(B+O+D+A+H+U+L+K\).

**Details And Assumptions:**

\(B,O,D,A,H,U,L,K\) represent distinct digits.

\(BOB\) and \(DAD\) are three digit numbers.