Challenge
Given a positive integer (K) Output a uniformly-random integer (Y) between [0, K).
If Y > 0 Assume K = Y and repeat the process until Y = 0.
Rules
0 must be the final output, Optionally an empty line instead 0
(loop while (/= a 0) do (print (setf a (random a)))) Assumes a is already defined.
Test case:
(setf a 5000000) (loop while (/= a 0) do (print (setf a (random a)))) -9 bytes from Okx
defmodule N do def f(0,k)do IO.puts 0 end;def f(n,k)do IO.puts n;f Enum.random(0..k),k end end;k=String.to_integer IO.gets"";N.f Enum.random(0..k),k Formatted:
defmodule N do def f(0,k) do IO.puts n end def f(n,k) do IO.puts n f Enum.random(0..k), k end end {k,_} = Integer.parse IO.gets"" N.f Enum.random(0..k),k We define a module with 2 functions - one is recursive, the other is the base case with a guard so it only executes when our random is 0 (Elixir doesn't necessarily assign anything, it does pattern matching for e.g. arguments- and thus f(0,k) only matches when n=0, otherwise f(n,k) matches). After defining that module (since functions can't be defined outside a module), we parse an integer from input and start our recursive looping.
Notably, k=String.to_integer IO.gets"" is the same length as the other method I've found to parse integers from input, {k,_}=Integer.parse IO.gets"", which is kinda neat.
def f(n,k) when n <= 0 can be shortened to def f(0,k) \$\endgroup\$ fn n->[n]++Enum.take_while(Stream.repeatedly(fn->Enum.random(0..n)end),&(&1>1))++[0]end 
<?=$a=$argn;while($a--)echo _,$a=rand(0,$a); or
<?for(;$a=&$argn;$a=rand(0,$a))echo$a--,_?>0 print integers delimited by underscore. Save to file, run as pipe with -nF.
I~n0(nRP) Output is given in the form
735920 I~n - Store input in the variable n 0( ) - Loop until the top of the stack equals zero nR - Push a random integer between 0 and n P - Print the top of the stack 
include random.fs : f begin dup . random dup 0= until . ; Get Random integer in range, loop until result is 0.
include random.fs \ import the file that implements the "random" word :f \ start a word defintion begin \ start an indefinite loop dup . \ duplicate the top of the stack and print it random \ get random int between 0 and n - 1 dup 0= \ duplicate the top of the stack and then check if it's 0 until \ if it's zero end the loop . \ output the top of the stack (always 0) ; \ end the word definition 
`0⇹ɾł Implicit input ` ł Do ... while top of stack is not 0: 0 Push 0 ⇹ Swap top two elements on stack ɾ Get random number in [0,top of stack) Implicit print 
0. Am I missing something? \$\endgroup\$ read(*,*)i do while(i>0) i=rand(i)*i print*,i enddo end Trying to golf Fortran is always fun.
Also, because seeding the RNG in Fortran is a pain and costs a lot of bytes (and RAND() uses a particularly poor algorithm but has a nice short name), the output is pretty much deterministic - but I'm hoping to get away with it.
Input:
10000000 Output:
2636923 1681125 264113 17707 2453 47 0 PHP 5.6
$k = $y = 5; do { echo $k. "\n"; $k = rand(0, $y-1); } while($k > 0)
orw∟ Explanation:
∟ # Do-while true without popping: o # Print the current integer with trailing newline (without popping) # (which will be the implicit input-integer in the first iteration) r # Pop and push a list in the range [0,K) w # Pop and push a random integer from this list Note: builtin w of itself works with an integer argument as well, but it'll output a random integer in the range \$[0,K]\$ instead of \$[0,K)\$, hence the need for the explicit r.
