Largest five adjacent number: Difference between revisions
m (clarify: 5-digit number not 5-digit product) |
(Added XPL0 example.) |
||
Line 103: | Line 103: | ||
<pre> |
<pre> |
||
The largest number formed from 5 adjacent digits is: 99,850 |
The largest number formed from 5 adjacent digits is: 99,850 |
||
</pre> |
|||
=={{header|XPL0}}== |
|||
<lang XPL0>char Number(5000); |
|||
int Num, Max, I, J; |
|||
[for I:= 0 to 5000-1 do \generate 5000-digit number |
|||
Number(I):= Ran(10); |
|||
Max:= 0; \find its largest 5-digit number |
|||
for I:= 0 to 5000-5 do |
|||
[Num:= 0; |
|||
for J:= 0 to 5-1 do |
|||
Num:= Num*10 + Number(I+J); |
|||
if Num > Max then |
|||
Max:= Num; |
|||
]; |
|||
IntOut(0, Max); |
|||
]</lang> |
|||
{{out}} |
|||
<pre> |
|||
99993 |
|||
</pre> |
</pre> |
Revision as of 17:56, 27 September 2021
- Task
Generate random 1000-digit number.
Find the five adjacent digits in the 1000-digit number that form the largest 5-digit number.
ALGOL 68
Adding the minimum number for good measure... <lang algol68>BEGIN # generate 1000 random digits and find the largest/smallest numbers formed from 5 consecutive digits #
[ 1 : 1000 ]CHAR digits; FOR i TO UPB digits DO digits[ i ] := REPR ( ENTIER ( next random * 10 ) + ABS "0" ) OD; STRING max number := digits[ 1 : 5 ]; STRING min number := digits[ 1 : 5 ]; FOR i FROM 2 TO UPB digits - 4 DO STRING next number = digits[ i : i + 4 ]; IF next number > max number THEN # found a new higher number # max number := next number FI; IF next number < min number THEN # found a new lower number # min number := next number FI OD; print( ( "Largest 5 consecutive digits from 1000 random digits: ", max number, newline ) ); print( ( "Smallest 5 consecutive digits from 1000 random digits: ", min number, newline ) )
END</lang>
- Output:
Largest 5 consecutive digits from 1000 random digits: 99987 Smallest 5 consecutive digits from 1000 random digits: 00119
Julia
<lang julia>dig = rand(0:9, 1000) @show maximum(evalpoly(10, dig[i:i+4]) for i in 1:length(dig)-4)
</lang>
- Output:
maximum((evalpoly(10, dig[i:i + 4]) for i = 1:length(dig) - 4)) = 99993
Raku
<lang perl6>say (^10).roll(1000).rotor(5 => -4)».join.max</lang>
- Sample output (it's random):
99625
Ring
<lang ring> digit = "" max = 0 maxOld = 0 limit = 1000
for n = 1 to limit
rand = random(9) randStr = string(rand) digit += randStr
next
for n = 1 to len(digit)-5
res = substr(digit,n,5) resNum = number(res) if resNum > maxold max = resNum maxOld = max ok
next
see max + nl </lang>
- Output:
The largest number is: 99638
Wren
Very simple approach as there's little need for speed here. <lang ecmascript>import "random" for Random import "/fmt" for Fmt
var rand = Random.new() var digits = List.filled(1000, 0) for (i in 0...999) digits[i] = rand.int(10) var number = digits.join() for (i in 99999...0) {
var quintet = Fmt.swrite("$05d", i) if (number.contains(quintet)) { Fmt.print("The largest number formed from 5 adjacent digits is: $,d", i) return }
}</lang>
- Output:
Sample output:
The largest number formed from 5 adjacent digits is: 99,850
XPL0
<lang XPL0>char Number(5000); int Num, Max, I, J; [for I:= 0 to 5000-1 do \generate 5000-digit number
Number(I):= Ran(10);
Max:= 0; \find its largest 5-digit number for I:= 0 to 5000-5 do
[Num:= 0; for J:= 0 to 5-1 do Num:= Num*10 + Number(I+J); if Num > Max then Max:= Num; ];
IntOut(0, Max); ]</lang>
- Output:
99993