Long stairs: Difference between revisions

Added 11l
m (→‎{{header|Free Pascal}}: new way of calculation without random.Fits much better to random results)
(Added 11l)
Line 8:
 
If you escaped, run 10,000 tests and print the average time taken and the average final length of the staircase.
 
=={{header|11l}}==
{{trans|C}}
 
<lang 11l>V secs_tot = 0
V steps_tot = 0
print(‘Seconds steps behind steps ahead’)
 
L(trial) 1..10000
V sbeh = 0
V slen = 100
V secs = 0
L sbeh < slen
sbeh++
L 5
I random:(slen) < sbeh
sbeh++
slen++
 
secs++
I trial == 1 & secs C 600..609
print(‘#. #. #.’.format(secs, sbeh, slen - sbeh))
 
secs_tot += secs
steps_tot += slen
 
print(‘Average secs taken: #.6’.format(secs_tot / 10000.0))
print(‘Average final length of staircase: #.6’.format(steps_tot / 10000.0))</lang>
 
{{out}}
<pre>
Seconds steps behind steps ahead
600 1906 1194
601 1910 1195
602 1913 1197
603 1918 1197
604 1923 1197
605 1929 1196
606 1934 1196
607 1936 1199
608 1940 1200
609 1943 1202
Average secs taken: 2920.077500
Average final length of staircase: 14700.387500
</pre>
 
=={{header|C}}==
1,453

edits