Largest five adjacent number: Difference between revisions
m
Realphabetize
Thundergnat (talk | contribs) m (Realphabetize) |
|||
Line 53:
<pre>
maximum((evalpoly(10, dig[i:i + 4]) for i = 1:length(dig) - 4)) = 99993
</pre>▼
=={{header|Pascal}}==▼
{{works with|Free Pascal}} inspired by [[Largest_five_adjacent_number#Wren|Wren]]▼
<lang pascal>▼
var▼
digits,▼
s : AnsiString;▼
i : LongInt;▼
begin▼
randomize;▼
setlength(digits,1000);▼
for i := 1 to 1000 do▼
digits[i] := chr(random(10)+ord('0'));▼
for i := 99999 downto 0 do▼
begin▼
str(i:5,s);▼
if Pos(s,digits) > 0 then▼
break;▼
end;▼
writeln(s, ' found as largest 5 digit number ')▼
end.</lang>▼
{{out}}▼
<pre>99889 found as largest 5 digit number </pre>▼
=={{header|Perl}}==▼
<lang perl>#!/usr/bin/perl▼
use strict; # https://rosettacode.org/wiki/Largest_five_adjacent_number▼
use warnings;▼
$_ = join '', map int rand 10, 1 .. 1e3;▼
my @n;▼
$n[$1] = $1 while /(?=(\d{5}))/g;▼
print "$n[-1]\n";</lang>▼
{{out}}▼
<pre>▼
99958▼
</pre>
Line 102 ⟶ 139:
The largest number is:
99638
▲</pre>
▲=={{header|Pascal}}==
▲{{works with|Free Pascal}} inspired by [[Largest_five_adjacent_number#Wren|Wren]]
▲<lang pascal>
▲var
▲ digits,
▲ s : AnsiString;
▲ i : LongInt;
▲begin
▲ randomize;
▲ setlength(digits,1000);
▲ for i := 1 to 1000 do
▲ digits[i] := chr(random(10)+ord('0'));
▲ for i := 99999 downto 0 do
▲ begin
▲ str(i:5,s);
▲ if Pos(s,digits) > 0 then
▲ break;
▲ end;
▲ writeln(s, ' found as largest 5 digit number ')
▲end.</lang>
▲{{out}}
▲<pre>99889 found as largest 5 digit number </pre>
▲=={{header|Perl}}==
▲<lang perl>#!/usr/bin/perl
▲use strict; # https://rosettacode.org/wiki/Largest_five_adjacent_number
▲use warnings;
▲$_ = join '', map int rand 10, 1 .. 1e3;
▲my @n;
▲$n[$1] = $1 while /(?=(\d{5}))/g;
▲print "$n[-1]\n";</lang>
▲{{out}}
▲<pre>
▲99958
</pre>
| |||