Smallest square that begins with n: Difference between revisions
Add Miranda
m (→{{header|Phix}}: correct limit) |
Not a robot (talk | contribs) (Add Miranda) |
||
| (5 intermediate revisions by 3 users not shown) | |||
Line 198:
41209 4225 4356 441 45369 4624 4761 484 49
</pre>
=={{header|APL}}==
<syntaxhighlight lang="apl">5 10⍴'∘',0 {1=⊃(⍕⍵)⍷⍕⍺×⍺:⍺×⍺ ⋄ (⍺+1)∇⍵}¨ ⍳49</syntaxhighlight>
{{out}}
<pre> ∘ 1 25 36 4 529 64 729 81 9
100 1156 121 1369 144 1521 16 1764 1849 196
2025 2116 225 2304 2401 25 2601 2704 289 2916
3025 3136 324 3364 3481 35344 36 3721 3844 3969
400 41209 4225 4356 441 45369 4624 4761 484 49</pre>
=={{header|Arturo}}==
Line 1,170 ⟶ 1,179:
3136 324 3364 3481 35344 36 3721 3844 3969 400
41209 4225 4356 441 45369 4624 4761 484 49</pre>
=={{header|EasyLang}}==
<syntaxhighlight>
func f n .
n$ = n
repeat
xx = x * x
until substr xx 1 len n$ = n$
x += 1
.
return xx
.
for i = 1 to 49
write f i & " "
.
</syntaxhighlight>
{{out}}
<pre>
1 25 36 4 529 64 729 81 9 100 1156 121 1369 144 1521 16 1764 1849 196 2025 2116 225 2304 2401 25 2601 2704 289 2916 3025 3136 324 3364 3481 35344 36 3721 3844 3969 400 41209 4225 4356 441 45369 4624 4761 484 49
</pre>
=={{header|Excel}}==
Line 1,377 ⟶ 1,406:
| style="text-align:right" | 5041
|}
=={{header|F_Sharp|F#}}==
Line 2,032 ⟶ 2,060:
484
49</pre>
=={{header|Miranda}}==
<syntaxhighlight lang="miranda">main :: [sys_message]
main = [Stdout (lay (map (concat . map (rjustify 6 . show . smallsqr))
(split 10 [1..49])))]
split :: num->[*]->[[*]]
split n [] = []
split n ls = take n ls:split n (drop n ls)
smallsqr :: num->num
smallsqr n = hd [x^2 | x<-[1..]; startswith n (x^2)]
startswith :: num->num->bool
startswith x y = False, if x>y
startswith x y = True, if x=y
startswith x y = startswith x (y div 10)</syntaxhighlight>
{{out}}
<pre> 1 25 36 4 529 64 729 81 9 100
1156 121 1369 144 1521 16 1764 1849 196 2025
2116 225 2304 2401 25 2601 2704 289 2916 3025
3136 324 3364 3481 35344 36 3721 3844 3969 400
41209 4225 4356 441 45369 4624 4761 484 49</pre>
=={{header|Modula-2}}==
<syntaxhighlight lang="modula2">MODULE SmallestSquareWithPrefix;
FROM InOut IMPORT WriteCard, WriteLn;
VAR n: CARDINAL;
PROCEDURE prefix(n, m: CARDINAL): BOOLEAN;
BEGIN
IF n>=m
THEN RETURN n=m
ELSE RETURN prefix(n, m DIV 10)
END
END prefix;
PROCEDURE firstPrefixSquare(n: CARDINAL): CARDINAL;
VAR
sq, sqr: CARDINAL;
BEGIN
sqr := 0;
REPEAT
INC(sqr);
sq := sqr*sqr
UNTIL prefix(n, sq);
RETURN sq
END firstPrefixSquare;
BEGIN
FOR n := 0 TO 49 DO
WriteCard(firstPrefixSquare(n), 7);
IF n MOD 10 = 9 THEN WriteLn END
END
END SmallestSquareWithPrefix.</syntaxhighlight>
{{out}}
<pre> 1 1 25 36 4 529 64 729 81 9
100 1156 121 1369 144 1521 16 1764 1849 196
2025 2116 225 2304 2401 25 2601 2704 289 2916
3025 3136 324 3364 3481 35344 36 3721 3844 3969
400 41209 4225 4356 441 45369 4624 4761 484 49</pre>
=={{header|Nim}}==
Line 2,878 ⟶ 2,968:
Same output.
=={{header|Refal}}==
<syntaxhighlight lang="refal">$ENTRY Go {
= <Table (7 7) <Each FirstPrefixSquare <Iota 1 49>>>;
};
Cell {
s.W s.N, <Repeat s.W ' '> <Symb s.N>: e.C,
<Last s.W e.C>: (e.X) e.CI = e.CI;
}
Repeat {
0 s.C = ;
s.N s.C = s.C <Repeat <- s.N 1> s.C>;
};
Table {
(s.Cols s.CW) e.X = <Table () (s.Cols s.Cols s.CW) e.X>;
(e.Row) (s.Cols s.N s.CW), e.Row: {
= ;
e.Row = <Prout e.Row>;
};
(e.Row) (s.Cols 0 s.CW) e.X =
<Prout e.Row>
<Table () (s.Cols s.Cols s.CW) e.X>;
(e.Row) (s.Cols s.N s.CW) s.I e.X =
<Table (e.Row <Cell s.CW s.I>) (s.Cols <- s.N 1> s.CW) e.X>;
};
Each {
s.F = ;
s.F s.I e.X = <Mu s.F s.I> <Each s.F e.X>;
};
Iota {
s.End s.End = s.End;
s.Start s.End = s.Start <Iota <+ 1 s.Start> s.End>;
};
FirstPrefixSquare {
s.N = <FirstPrefixSquare s.N 1>;
s.N s.Sqr, <* s.Sqr s.Sqr>: s.Sq,
<Symb s.N>: e.Pfx,
<Symb s.Sq>: e.Pfx e.X = s.Sq;
s.N s.Sqr = <FirstPrefixSquare s.N <+ 1 s.Sqr>>;
};
</syntaxhighlight>
{{out}}
<pre> 1 25 36 4 529 64 729
81 9 100 1156 121 1369 144
1521 16 1764 1849 196 2025 2116
225 2304 2401 25 2601 2704 289
2916 3025 3136 324 3364 3481 35344
36 3721 3844 3969 400 41209 4225
4356 441 45369 4624 4761 484 49</pre>
=={{header|REXX}}==
Line 3,236 ⟶ 3,381:
(return-from search)))
((set k (trunc k 10)))))))</syntaxhighlight>
=={{header|Uiua}}==
{{works with|Uiua|0.10}}
In best YAGNI style, just calculate sufficient squares for the task as specced (up to 220^2)
<syntaxhighlight lang="Uiua">
IsPrefix ← =⧻⟜(/+⬚@.=)
⊞◇IsPrefix °⋕↘1⇡50 °⋕.ⁿ2+1⇡220
⊏≡(⊢⊚)
</syntaxhighlight>
{{out}}
<pre>
[1 25 36 4 529 64 729 81 9 100 1156 ...etc...]
</pre>
=={{header|VTL-2}}==
| |||