Problem: Sum of Divisors for OCaml Golf Competition
Code: Sum+of+Divisors+for+OCaml+Golf+Competition/tails_1669099627
Nibbles version: 0.2 | 0.21 | 0.22 | 0.23 | 0.24 | 0.25 | 1.00
Format: Compact | Simple | +Type | Table | JSON | .nbl (DeBruijn) | .nbl (names)
| Depth | Lit | Desc | Type | Arg | Let |
|---|---|---|---|---|---|
| 0 | | implicit string concatenation | [chr] | ||
| * 1 | | implicit string concatenation | [chr] | ||
| ** 2 | $ | = fstInt | int | ||
| ** 2 | ": " | string | [chr] | B:int A:int | |
| * 1 | + | sum | int | ||
| ** 2 | | | filter | [int] | ||
| *** 3 | , | range from 1 | [int] | ||
| **** 4 | $ | = fstInt | int | ||
| *** 3 | ~ | not | null | ||
| *** 3 | % | modulus | int | C:int | |
| **** 4 | @ | = fstInt | int | ||
| **** 4 | | implicit arg = C | int |