Largest five adjacent number: Difference between revisions

Added 11l
(Add CLU)
(Added 11l)
Line 8:
Find the '''five''' adjacent digits in the 1000-digit number that form the smallest 5-digit number.
 
 
=={{header|11l}}==
{{trans|Python}}
 
<lang 11l>V largeNum = [random:(1..9)] [+] (0.<999).map(i -> random:(0..9))
 
V (maxNum, minNum) = (0, 99999)
 
L(i) 996
V num = Int(largeNum[i.+5].join(‘’))
I num > maxNum
maxNum = num
E I num < minNum
minNum = num
 
print(‘Largest 5-digit number extracted from random 1000-digit number: ’maxNum)
print(‘Smallest 5-digit number extracted from random 1000-digit number: #05’.format(minNum))</lang>
 
{{out}}
<pre>
Largest 5-digit number extracted from random 1000-digit number: 99902
Smallest 5-digit number extracted from random 1000-digit number: 00043
</pre>
 
=={{header|Ada}}==
1,480

edits