Revision as of 16:37, 28 July 2021 (view source) Laurence (talk \| contribs) m (Updated description and link for Fōrmulæ solution) ← Older edit		Revision as of 08:52, 20 October 2021 (view source) CalmoSoft (talk \| contribs) (→‎{{header\|Ring}}) Newer edit →
Line 1,079: <lang Ring> load "stdlib.ring" see "working..." + nl for n = 13 to 100000 ~~fac~~Digits = 0[] ~~numStr~~sumFact = ~~string(n)~~0 ~~for m~~strn = ~~1 to len~~string(~~numStr~~n) for m = 1 ~~num~~to ~~= number~~len(~~numStr[m]~~strn) ~~fac~~fact = ~~fac +~~ factorial(~~num~~number(strn[m])) sumFact += fact add(Digits,fact) next if nsumFact = ~~fac~~ n ~~see~~for ~~"Factorion:~~ind "= +1 nto ~~+ nl~~len(strn)-1 see "" + strn[ind] + "! + " next see "" + strn[ind] + "! = " for p = 1 to len(Digits) - 1 see "" + Digits[p] + " + " next factLast = Digits[p] see "" + factLast + " = " + n + nl ok next see "done..." + nl </lang> <pre> working... ~~Factorion: 1~~ 1! + 4! + 5! = 1 + 24 + 120 = 145 ~~Factorion: 2~~ 4! + 0! + 5! + 8! + 5! = 24 + 1 + 120 + 40320 + 120 = 40585 ~~Factorion: 145~~ done... ~~Factorion: 40585~~ </pre> =={{header\|Ruby}}== <lang ruby>

Factorions: Difference between revisions

Factorions (view source)