My code for solving problems similar to algo expert, codility code, exceptionaly
- Divisior problem asked by exceptionally Find the divsors levels for a given number, for example 8-->4-->2, so for 8 the divisors are 4 and 2 (2 is prime) Find the divsors levels for a given number, for example 63-->7, so for 63 the divisors are 9 and 7 (and 7 is prime)
1 : 0 2 : 0 3 : 0 4 : 1 8 : 2 12 : 2 24 : 3 48 : 4 63 : 2 9 : 1
128 : 6 96 : 5 6666 : 3 128476 : 2 32119 : 0