Challenge : hyperfactorial

Question

The hyperfactorial for n equals
n^n.(n-1)^(n-1)...5^5.4^4.3^3.2^2

Write a function calculating hyperfactorial(n) and invhyperefactorial(f) such that invhyperfactorial(hyperfactorial(n))=n

Application find k such that huperfactorial(k)= number of milliseconds in a day

Answer 1

My try in C, inverse huperfactorial return 0 if the parameter is not the result of huperfactorial call
https://code.sololearn.com/cc3b9swSZxun/?ref=app

Answer 2

https://code.sololearn.com/c8yf4bef2aeq/?ref=app

Well, I'm 2 years in late ahah

Answer 3

https://code.sololearn.com/WbbLRn1fHNw2/#js

Well, looks like I've failed both requirements.... nice challenge tho XD

Answer 4

https://code.sololearn.com/c3OnkbSq75h9/?ref=app

Answer 5

this is my first code which worked in first try😅

https://code.sololearn.com/c6yuD62sPL1H/?ref=app

Answer 6

heres my one linerss

https://code.sololearn.com/clGSm0n0oA5C/?ref=app

Answer 7

i just gave 1 zero less#####
@ vcc
😂😂😂

Answer 8

My try using C. May show bugs on code playground due to use of C99 features.
Edit: Recursive approach used for inverse hyperfactorial
https://code.sololearn.com/cWd0jbpS8uyH/?ref=app

Answer 9

Not the entire Challenge, but I assume here: I did the best I could
https://code.sololearn.com/c7OEsr6xhSh7/?ref=app

Answer 10

@sayan application result should be 5