Casting out nines: Difference between revisions
Thundergnat (talk | contribs) m (Automated syntax highlighting fixup (second round - minor fixes)) |
Thundergnat (talk | contribs) m (Automated syntax highlighting fixup (second round - minor fixes)) |
||
Line 1: | Line 1: | ||
[[Category:Checksums]] |
|||
{{task|Case Sensitivity}} |
|||
{{task}} |
|||
;Task (in three parts): |
|||
Three dogs (Are there three dogs or one dog?) is a code snippet used to illustrate the lettercase sensitivity of the programming language. For a case-sensitive language, the identifiers dog, Dog and DOG are all different and we should get the output: |
|||
<pre> |
|||
The three dogs are named Benjamin, Samba and Bernie. |
|||
;Part 1 |
|||
</pre> |
|||
Write a procedure (say <math>\mathit{co9}(x)</math>) which implements [https://web.archive.org/web/20120619091249/http://mathforum.org/library/drmath/view/55926.html Casting Out Nines] as described by returning the checksum for <math>x</math>. Demonstrate the procedure using the examples given there, or others you may consider lucky. |
|||
For a language that is lettercase insensitive, we get the following output: |
|||
<pre> |
|||
;Part 2 |
|||
There is just one dog named Bernie. |
|||
Notwithstanding past Intel microcode errors, checking computer calculations like this would not be sensible. To find a computer use for your procedure: |
|||
</pre> |
|||
: Consider the statement "318682 is 101558 + 217124 and squared is 101558217124" (see: [[Kaprekar numbers#Casting Out Nines (fast)]]). |
|||
: note that <math>318682</math> has the same checksum as (<math>101558 + 217124</math>); |
|||
: note that <math>101558217124</math> has the same checksum as (<math>101558 + 217124</math>) because for a Kaprekar they are made up of the same digits (sometimes with extra zeroes); |
|||
: note that this implies that for Kaprekar numbers the checksum of <math>k</math> equals the checksum of <math>k^2</math>. |
|||
Demonstrate that your procedure can be used to generate or filter a range of numbers with the property <math>\mathit{co9}(k) = \mathit{co9}(k^2)</math> and show that this subset is a small proportion of the range and contains all the Kaprekar in the range. |
|||
;Part 3 |
|||
Considering [http://mathworld.wolfram.com/CastingOutNines.html this MathWorld page], produce a efficient algorithm based on the more mathematical treatment of Casting Out Nines, and realizing: |
|||
: <math>\mathit{co9}(x)</math> is the residual of <math>x</math> mod <math>9</math>; |
|||
: the procedure can be extended to bases other than 9. |
|||
Demonstrate your algorithm by generating or filtering a range of numbers with the property <math>k%(\mathit{Base}-1) == (k^2)%(\mathit{Base}-1)</math> and show that this subset is a small proportion of the range and contains all the Kaprekar in the range. |
|||
;Related task: |
|||
<br> |
|||
* [[Unicode variable names]] |
|||
;related tasks |
|||
<br><br> |
|||
* [[First perfect square in base N with N unique digits]] |
|||
* [[Kaprekar numbers]] |
|||
<br> |
|||
=={{header|11l}}== |
=={{header|11l}}== |
||
{{trans|Python}} |
|||
11l identifiers are case sensitive. |
|||
<syntaxhighlight lang="11l">V dog = ‘Benjamin’ |
|||
<syntaxhighlight lang="11l">F CastOut(Base, Start, End) |
|||
V Dog = ‘Samba’ |
|||
V ran = (0 .< Base - 1).filter(y -> y % (@Base - 1) == (y * y) % (@Base - 1)) |
|||
V DOG = ‘Bernie’ |
|||
V (x, y) = divmod(Start, Base - 1) |
|||
print(‘The three dogs are named ’dog‘, ’Dog‘ and ’DOG‘.’)</syntaxhighlight> |
|||
[Int] r |
|||
=={{header|Action!}}== |
|||
L |
|||
<syntaxhighlight lang="action!">PROC Main() |
|||
L(n) ran |
|||
CHAR ARRAY dog="Bernie" |
|||
V k = (Base - 1) * x + n |
|||
I k < Start |
|||
L.continue |
|||
I k > End |
|||
R r |
|||
r.append(k) |
|||
x++ |
|||
L(v) CastOut(Base' 16, Start' 1, End' 255) |
|||
print(v, end' ‘ ’) |
|||
print() |
|||
L(v) CastOut(Base' 10, Start' 1, End' 99) |
|||
print(v, end' ‘ ’) |
|||
print() |
|||
L(v) CastOut(Base' 17, Start' 1, End' 288) |
|||
print(v, end' ‘ ’) |
|||
print()</syntaxhighlight> |
|||
PrintF("There is just one dog named %S.",dog) |
|||
RETURN</syntaxhighlight> |
|||
{{out}} |
{{out}} |
||
[https://gitlab.com/amarok8bit/action-rosetta-code/-/raw/master/images/Case-sensitivity_of_identifiers.png Screenshot from Atari 8-bit computer] |
|||
<pre> |
<pre> |
||
1 6 10 15 16 21 25 30 31 36 40 45 46 51 55 60 61 66 70 75 76 81 85 90 91 96 100 105 106 111 115 120 121 126 130 135 136 141 145 150 151 156 160 165 166 171 175 180 181 186 190 195 196 201 205 210 211 216 220 225 226 231 235 240 241 246 250 255 |
|||
There is just one dog named Bernie. |
|||
1 9 10 18 19 27 28 36 37 45 46 54 55 63 64 72 73 81 82 90 91 99 |
|||
1 16 17 32 33 48 49 64 65 80 81 96 97 112 113 128 129 144 145 160 161 176 177 192 193 208 209 224 225 240 241 256 257 272 273 288 |
|||
</pre> |
</pre> |
||
=={{header| |
=={{header|360 Assembly}}== |
||
{{trans|REXX}} |
|||
case insensitive |
|||
The program uses two ASSIST macros (XDECO,XPRNT) to keep the code as short as possible. |
|||
<syntaxhighlight lang="ada">with Ada.Text_IO; |
|||
<syntaxhighlight lang="360asm">* Casting out nines 08/02/2017 |
|||
procedure Dogs is |
|||
CASTOUT CSECT |
|||
Dog : String := "Bernie"; |
|||
USING CASTOUT,R13 base register |
|||
begin |
|||
B 72(R15) skip savearea |
|||
Ada.Text_IO.Put_Line ("There is just one dog named " & DOG); |
|||
DC 17F'0' savearea |
|||
end Dogs;</syntaxhighlight> |
|||
STM R14,R12,12(R13) prolog |
|||
ST R13,4(R15) " <- |
|||
Output: |
|||
ST R15,8(R13) " -> |
|||
<pre>There is just one dog named Bernie</pre> |
|||
LR R13,R15 " addressability |
|||
=={{header|Agena}}== |
|||
L R1,LOW low |
|||
Translation of Algol W. Agena is case sensitive, as this example demonstrates. Tested with Agena 2.9.5 Win32 |
|||
XDECO R1,XDEC edit low |
|||
<syntaxhighlight lang="agena">scope |
|||
MVC PGT+4(4),XDEC+8 output low |
|||
local dog := "Benjamin"; |
|||
L R1,HIGH high |
|||
scope |
|||
XDECO R1,XDEC edit high |
|||
MVC PGT+12(4),XDEC+8 output low |
|||
scope |
|||
L R1,BASE base |
|||
XDECO R1,XDEC edit base |
|||
MVC PGT+24(4),XDEC+8 output base |
|||
then print( "The three dogs are named: " & dog & ", " & Dog & " and " & DOG ) |
|||
XPRNT PGT,L'PGT print buffer |
|||
L R2,BASE base |
|||
BCTR R2,0 -1 |
|||
ST R2,RM rm=base-1 |
|||
epocs |
|||
LA R8,PG ipg=0 |
|||
epocs</syntaxhighlight> |
|||
SR R7,R7 j=0 |
|||
L R6,LOW i=low |
|||
DO WHILE=(C,R6,LE,HIGH) do i=low to high |
|||
LR R5,R6 i |
|||
SR R4,R4 clear for div |
|||
D R4,RM /rm |
|||
LR R2,R4 r2=i mod rm |
|||
LR R5,R6 i |
|||
MR R4,R6 i*i |
|||
SR R4,R4 clear for div |
|||
D R4,RM /rm |
|||
IF CR,R2,EQ,R4 THEN if (i//rm)=(i*i//rm) then |
|||
LA R7,1(R7) j=j+1 |
|||
XDECO R6,XDEC edit i |
|||
MVC 0(4,R8),XDEC+8 output i |
|||
LA R8,4(R8) ipg=ipg+4 |
|||
IF C,R7,EQ,=F'20' THEN if j=20 then |
|||
XPRNT PG,L'PG print buffer |
|||
LA R8,PG ipg=0 |
|||
SR R7,R7 j=0 |
|||
MVC PG,=CL80' ' clear buffer |
|||
ENDIF , end if |
|||
ENDIF , end if |
|||
LA R6,1(R6) i=i+1 |
|||
ENDDO , end do i |
|||
IF LTR,R7,NE,R7 THEN if j<>0 then |
|||
XPRNT PG,L'PG print buffer |
|||
ENDIF , end if |
|||
L R13,4(0,R13) epilog |
|||
LM R14,R12,12(R13) " restore |
|||
XR R15,R15 " rc=0 |
|||
BR R14 exit |
|||
LOW DC F'1' low |
|||
HIGH DC F'500' high |
|||
BASE DC F'10' base |
|||
RM DS F rm |
|||
PGT DC CL80'for ... to ... base ...' buffer |
|||
PG DC CL80' ' buffer |
|||
XDEC DS CL12 temp for xdeco |
|||
YREGS |
|||
END CASTOUT</syntaxhighlight> |
|||
{{out}} |
{{out}} |
||
<pre> |
<pre> |
||
for 1 to 500 base 10 |
|||
The three dogs are named: Benjamin, Samba and Bernie |
|||
1 9 10 18 19 27 28 36 37 45 46 54 55 63 64 72 73 81 82 90 |
|||
91 99 100 108 109 117 118 126 127 135 136 144 145 153 154 162 163 171 172 180 |
|||
181 189 190 198 199 207 208 216 217 225 226 234 235 243 244 252 253 261 262 270 |
|||
271 279 280 288 289 297 298 306 307 315 316 324 325 333 334 342 343 351 352 360 |
|||
361 369 370 378 379 387 388 396 397 405 406 414 415 423 424 432 433 441 442 450 |
|||
451 459 460 468 469 477 478 486 487 495 496 |
|||
</pre> |
</pre> |
||
=={{header| |
=={{header|Action!}}== |
||
<syntaxhighlight lang=" |
<syntaxhighlight lang="action!">INT FUNC Power(INT a,b) |
||
INT i,res |
|||
res=1 |
|||
dog = "Benjamin"; |
|||
FOR i=1 TO b |
|||
Dog = "Samba"; |
|||
DO |
|||
DOG = "Bernie"; |
|||
res==*a |
|||
OD |
|||
RETURN (res) |
|||
PROC Main() |
|||
o_form("The three dogs are named ~, ~ and ~.\n", dog, Dog, DOG);</syntaxhighlight> |
|||
DEFINE BASE="10" |
|||
=={{header|ALGOL 68}}== |
|||
DEFINE N="2" |
|||
{{works with|ALGOL 68|Revision 1.}} |
|||
INT i,max,count,total,perc |
|||
{{works with|ALGOL 68G|Any - tested with release [http://sourceforge.net/projects/algol68/files/algol68g/algol68g-2.6 algol68g-2.6].}} |
|||
{{wont work with|ELLA ALGOL 68|Any (with appropriate job cards) - tested with release [http://sourceforge.net/projects/algol68/files/algol68toc/algol68toc-1.8.8d/algol68toc-1.8-8d.fc9.i386.rpm/download 1.8-8d] - due to extensive use of '''format'''[ted] ''transput''.}} |
|||
A joke code entry... :-) ¢ but the code does actually work! |
|||
'''File: Case-sensitivity_of_identifiers.a68'''<syntaxhighlight lang="algol68">#!/usr/bin/a68g --script # |
|||
# -*- coding: utf-8 -*- # |
|||
max=Power(BASE,N) |
|||
STRING dog = "Benjamin"; |
|||
count=0 total=0 |
|||
OP D = (INT og)STRING: "Samba"; |
|||
FOR i=1 TO max |
|||
OP DOG = (INT gy)STRING: "Bernie"; |
|||
DO |
|||
INT og=~, gy=~; |
|||
total==+1 |
|||
IF i MOD (BASE-1)=(i*i) MOD (BASE-1) THEN |
|||
main:( |
|||
count==+1 |
|||
printf(($"The three dogs are named "g", "g" and "g"."l$, dog, Dog, DOGgy)); |
|||
PrintI(i) Put(32) |
|||
0 |
|||
FI |
|||
)</syntaxhighlight>'''Output:''' |
|||
OD |
|||
perc=100-100*count/total |
|||
PrintF("%E%ETrying %I numbers instead of %I numbers saves %I%%",count,total,perc) |
|||
RETURN</syntaxhighlight> |
|||
{{out}} |
|||
[https://gitlab.com/amarok8bit/action-rosetta-code/-/raw/master/images/Casting_out_nines.png Screenshot from Atari 8-bit computer] |
|||
<pre> |
<pre> |
||
1 9 10 18 19 27 28 36 37 45 46 54 55 63 64 72 73 81 82 90 91 99 100 |
|||
The three dogs are named Benjamin, Samba and Bernie. |
|||
</pre> |
|||
Trying 23 numbers instead of 100 numbers saves 77% |
|||
Alternative version. |
|||
<br> |
|||
{{works with|Rutgers_ALGOL_68|Any - Tested with the DOS version}} |
|||
{{Trans|Algol W}} |
|||
Most recent implementations of Algol 68 use "upper stropping", the "keywords" are in upper case and the identifiers are an lower case. This precludes use of e.g. Dog or DOG as the name of a variable or constant. |
|||
<br> |
|||
However, depending on the "stropping" convention used and the implementation, Algol 68 can be case-sensitive. Rutgers ALGOL 68 uses quote stropping and allows both upper and lower case in identifiers and bold words. The standard bold words must be in lower-case. |
|||
<syntaxhighlight lang="algol68">'begin' |
|||
'string' dog = "Benjamin"; |
|||
'begin' |
|||
'string' Dog = "Samba"; |
|||
'begin' |
|||
'string' DOG = "Bernie"; |
|||
'if' DOG /= Dog 'or' DOG /= dog |
|||
'then' print( ( "The three dogs are named: ", dog, ", ", Dog, " and ", DOG ) ) |
|||
'else' print( ( "There is just one dog named: ", DOG ) ) |
|||
'fi' |
|||
'end' |
|||
'end' |
|||
'end'</syntaxhighlight> |
|||
{{out}} |
|||
<pre> |
|||
The three dogs are named: Benjamin, Samba and Bernie |
|||
</pre> |
</pre> |
||
=={{header|ALGOL |
=={{header|ALGOL 68}}== |
||
{{Trans|Action!}} |
|||
Algol W identifiers are not case-sensitive but variable names in inner blocks can be the same as those in outer blocks... |
|||
<syntaxhighlight lang=" |
<syntaxhighlight lang="algol68">BEGIN # casting out nines - translated from the Action! sample # |
||
INT base = 10; |
|||
INT n = 2; |
|||
INT count := 0; |
|||
begin |
|||
INT total := 0; |
|||
FOR i TO base ^ n DO |
|||
total +:= 1; |
|||
IF i MOD ( base - 1 ) = ( i * i ) MOD ( base - 1 ) THEN |
|||
count +:= 1; |
|||
print( ( whole( i, 0 ), " " ) ) |
|||
FI |
|||
OD; |
|||
then write( "The three dogs are named: ", dog, ", ", Dog, " and ", DOG ) |
|||
print( ( newline, newline, "Trying ", whole( count, 0 ) |
|||
else write( "There is just one dog named: ", DOG ) |
|||
, " numbers instead of ", whole( total, 0 ) |
|||
end |
|||
, " numbers saves ", fixed( 100 - ( ( 100 * count ) / total ), -6, 2 ) |
|||
end |
|||
, "%", newline |
|||
end.</syntaxhighlight> |
|||
) |
|||
) |
|||
END</syntaxhighlight> |
|||
{{out}} |
{{out}} |
||
<pre> |
<pre> |
||
1 9 10 18 19 27 28 36 37 45 46 54 55 63 64 72 73 81 82 90 91 99 100 |
|||
There is just one dog named: Bernie |
|||
Trying 23 numbers instead of 100 numbers saves 77.00% |
|||
</pre> |
</pre> |
||
=={{header|APL}}== |
|||
<syntaxhighlight lang="apl"> DOG←'Benjamin' |
|||
Dog←'Samba' |
|||
dog←'Bernie' |
|||
'The three dogs are named ',DOG,', ',Dog,', and ',dog |
|||
The three dogs are named Benjamin, Samba, and Bernie</syntaxhighlight> |
|||
=={{header|Arturo}}== |
=={{header|Arturo}}== |
||
<syntaxhighlight lang="rebol"> |
<syntaxhighlight lang="rebol">N: 2 |
||
base: 10 |
|||
Dog: "Samba" |
|||
c1: 0 |
|||
DOG: "Bernie" |
|||
c2: 0 |
|||
loop 1..(base^N)-1 'k [ |
|||
c1: c1 + 1 |
|||
if (k%base-1)= (k*k)%base-1 [ |
|||
dogs: @[dog Dog DOG] |
|||
c2: c2 + 1 |
|||
prints ~"|k| " |
|||
] |
|||
] |
|||
print "" |
|||
print ["The" size dogs "dog(s) are named" join.with:", " dogs]</syntaxhighlight> |
|||
print ["Trying" c2 "numbers instead of" c1 "numbers saves" 100.0 - 100.0*c2//c1 "%"]</syntaxhighlight> |
|||
{{out}} |
{{out}} |
||
<pre>1 9 10 18 19 27 28 36 37 45 46 54 55 63 64 72 73 81 82 90 91 99 |
|||
<pre>The 3 dog(s) are named Benjamin, Samba, Bernie</pre> |
|||
Trying 22 numbers instead of 99 numbers saves 77.77777777777777 %</pre> |
|||
=={{header|AutoHotkey}}== |
|||
<syntaxhighlight lang="autohotkey">dog := "Benjamin" |
|||
Dog := "Samba" |
|||
DOG := "Bernie" |
|||
MsgBox There is just one dog named %dOG%</syntaxhighlight> |
|||
=={{header|AWK}}== |
=={{header|AWK}}== |
||
<syntaxhighlight lang="awk"> |
<syntaxhighlight lang="awk"> |
||
# syntax: GAWK -f CASTING_OUT_NINES.AWK |
|||
dog = "Benjamin" |
|||
# converted from C |
|||
Dog = "Samba" |
|||
BEGIN { |
|||
DOG = "Bernie" |
|||
base = 10 |
|||
printf "The three dogs are named %s, %s and %s.\n", dog, Dog, DOG |
|||
for (k=1; k<=base^2; k++) { |
|||
}</syntaxhighlight> |
|||
c1++ |
|||
if (k % (base-1) == (k*k) % (base-1)) { |
|||
The three dogs are named Benjamin, Samba and Bernie. |
|||
c2++ |
|||
=={{header|BASIC}}== |
|||
printf("%d ",k) |
|||
{{works with|QBasic}} |
|||
} |
|||
QBASIC is case-insensitive |
|||
} |
|||
<syntaxhighlight lang="basic256">DOG$ = "Benjamin" |
|||
printf("\nTrying %d numbers instead of %d numbers saves %.2f%%\n",c2,c1,100-(100*c2/c1)) |
|||
DOG$ = "Samba" |
|||
exit(0) |
|||
DOG$ = "Bernie" |
|||
} |
|||
PRINT "There is just one dog, named "; DOG$</syntaxhighlight> |
|||
=={{header|BASIC256}}== |
|||
BASIC256 is case-insensitive |
|||
<syntaxhighlight lang="basic256">dog = "Benjamin" |
|||
Dog = "Samba" |
|||
DOG = "Bernie" |
|||
print "There is just one dog, named "; dog |
|||
end</syntaxhighlight> |
|||
=={{header|Batch File}}== |
|||
<syntaxhighlight lang="dos"> |
|||
@echo off |
|||
set dog=Benjamin |
|||
set Dog=Samba |
|||
set DOG=Bernie |
|||
echo There is just one dog named %dog%. |
|||
pause>nul |
|||
</syntaxhighlight> |
</syntaxhighlight> |
||
{{out}} |
{{out}} |
||
<pre> |
<pre> |
||
1 9 10 18 19 27 28 36 37 45 46 54 55 63 64 72 73 81 82 90 91 99 100 |
|||
There is just one dog named Bernie. |
|||
Trying 23 numbers instead of 100 numbers saves 77.00% |
|||
</pre> |
</pre> |
||
=={{header| |
=={{header|C}}== |
||
{{trans|C++}} |
|||
<syntaxhighlight lang="bbcbasic"> dog$ = "Benjamin" |
|||
<syntaxhighlight lang="c">#include <stdio.h> |
|||
Dog$ = "Samba" |
|||
#include <math.h> |
|||
DOG$ = "Bernie" |
|||
PRINT "The three dogs are " dog$ ", " Dog$ " and " DOG$ "."</syntaxhighlight> |
|||
Output: |
|||
<pre>The three dogs are Benjamin, Samba and Bernie.</pre> |
|||
=={{header|bc}}== |
|||
The only variables are 'a' through 'z'. They can only hold numbers, not strings. Some implementations allow longer names like 'dog', but only with lowercase letters. A name like 'Dog' or 'DOG' is a syntax error. |
|||
int main() { |
|||
<syntaxhighlight lang="bc">obase = 16 |
|||
const int N = 2; |
|||
ibase = 16 |
|||
int base = 10; |
|||
int c1 = 0; |
|||
int c2 = 0; |
|||
int k; |
|||
for (k = 1; k < pow(base, N); k++) { |
|||
/* |
|||
c1++; |
|||
* Store the hexadecimal number 'BE27A312' |
|||
if (k % (base - 1) == (k * k) % (base - 1)) { |
|||
* in the variable 'd'. |
|||
c2++; |
|||
*/ |
|||
printf("%d ", k); |
|||
d = BE27A312 |
|||
} |
|||
} |
|||
quit</syntaxhighlight> |
|||
printf("\nTring %d numbers instead of %d numbers saves %f%%\n", c2, c1, 100.0 - 100.0 * c2 / c1); |
|||
There is just one dog named BE27A312 |
|||
return 0; |
|||
=={{header|Bracmat}}== |
|||
<syntaxhighlight |
}</syntaxhighlight> |
||
{{out}} |
|||
& Samba:?Dog |
|||
<pre>1 9 10 18 19 27 28 36 37 45 46 54 55 63 64 72 73 81 82 90 91 99 |
|||
& Bernie:?DOG |
|||
Tring 22 numbers instead of 99 numbers saves 77.777778%</pre> |
|||
& out$("There are three dogs:" !dog !Dog and !DOG) |
|||
=={{header|C sharp|C#}}== |
|||
);</syntaxhighlight> |
|||
{{trans|Java}} |
|||
Output: |
|||
<syntaxhighlight lang="csharp">using System; |
|||
<pre>There are three dogs: Benjamin Samba and Bernie</pre> |
|||
using System.Collections.Generic; |
|||
=={{header|Brlcad}}== |
|||
using System.Linq; |
|||
using System.Text; |
|||
namespace CastingOutNines { |
|||
The three dogs are drawn as spheres in this simple example: |
|||
public static class Helper { |
|||
public static string AsString<T>(this IEnumerable<T> e) { |
|||
var it = e.GetEnumerator(); |
|||
StringBuilder builder = new StringBuilder(); |
|||
<syntaxhighlight lang="mged"> |
|||
builder.Append("["); |
|||
opendb dogs.g y # Create a database to hold our dogs |
|||
units ft # The dogs are measured in feet |
|||
in dog.s sph 0 0 0 1 # Benjie is a little Scottie dog |
|||
in Dog.s sph 4 0 0 3 # Samba is a Labrador |
|||
in DOG.s sph 13 0 0 5 # Bernie is massive. He is a New Foundland |
|||
echo The three dogs are named Benjamin, Samba and Bernie</syntaxhighlight> |
|||
=={{header|C}}== |
|||
C is case sensitive; if it would be case insensitive, an error about redefinition of a variable would be raised. |
|||
if (it.MoveNext()) { |
|||
<syntaxhighlight lang="c">#include <stdio.h> |
|||
builder.Append(it.Current); |
|||
} |
|||
while (it.MoveNext()) { |
|||
builder.Append(", "); |
|||
builder.Append(it.Current); |
|||
} |
|||
builder.Append("]"); |
|||
static const char *dog = "Benjamin"; |
|||
return builder.ToString(); |
|||
static const char *Dog = "Samba"; |
|||
} |
|||
static const char *DOG = "Bernie"; |
|||
} |
|||
class Program { |
|||
int main() |
|||
static List<int> CastOut(int @base, int start, int end) { |
|||
{ |
|||
int[] ran = Enumerable |
|||
printf("The three dogs are named %s, %s and %s.\n", dog, Dog, DOG); |
|||
.Range(0, @base - 1) |
|||
return 0; |
|||
.Where(a => a % (@base - 1) == (a * a) % (@base - 1)) |
|||
}</syntaxhighlight> |
|||
.ToArray(); |
|||
=={{header|C sharp|C#}}== |
|||
int x = start / (@base - 1); |
|||
C# is case sensitive |
|||
<syntaxhighlight lang="c sharp"> |
|||
using System; |
|||
List<int> result = new List<int>(); |
|||
class Program |
|||
while (true) { |
|||
{ |
|||
foreach (int n in ran) { |
|||
static void Main(string[] args) |
|||
int k = (@base - 1) * x + n; |
|||
{ |
|||
if (k < start) { |
|||
continue; |
|||
} |
|||
if (k > end) { |
|||
Console.WriteLine(string.Format("The three dogs are named {0}, {1}, and {2}.", dog, Dog, DOG)); |
|||
return result; |
|||
} |
|||
result.Add(k); |
|||
} |
|||
x++; |
|||
} |
|||
} |
|||
static void Main() { |
|||
Console.WriteLine(CastOut(16, 1, 255).AsString()); |
|||
Console.WriteLine(CastOut(10, 1, 99).AsString()); |
|||
Console.WriteLine(CastOut(17, 1, 288).AsString()); |
|||
} |
|||
} |
} |
||
}</syntaxhighlight> |
}</syntaxhighlight> |
||
{{out}} |
|||
<pre>[1, 6, 10, 15, 16, 21, 25, 30, 31, 36, 40, 45, 46, 51, 55, 60, 61, 66, 70, 75, 76, 81, 85, 90, 91, 96, 100, 105, 106, 111, 115, 120, 121, 126, 130, 135, 136, 141, 145, 150, 151, 156, 160, 165, 166, 171, 175, 180, 181, 186, 190, 195, 196, 201, 205, 210, 211, 216, 220, 225, 226, 231, 235, 240, 241, 246, 250, 255] |
|||
[1, 9, 10, 18, 19, 27, 28, 36, 37, 45, 46, 54, 55, 63, 64, 72, 73, 81, 82, 90, 91, 99] |
|||
[1, 16, 17, 32, 33, 48, 49, 64, 65, 80, 81, 96, 97, 112, 113, 128, 129, 144, 145, 160, 161, 176, 177, 192, 193, 208, 209, 224, 225, 240, 241, 256, 257, 272, 273, 288]</pre> |
|||
=={{header|C++}}== |
=={{header|C++}}== |
||
===Filter=== |
|||
C++ is case-sensitive. |
|||
<syntaxhighlight lang="cpp"> |
<syntaxhighlight lang="cpp">// Casting Out Nines |
||
// |
|||
#include <string> |
|||
// Nigel Galloway. June 24th., 2012 |
|||
using namespace std; |
|||
// |
|||
#include <iostream> |
|||
int main() { |
int main() { |
||
int Base = 10; |
|||
string dog = "Benjamin", Dog = "Samba", DOG = "Bernie"; |
|||
const int N = 2; |
|||
int c1 = 0; |
|||
cout << "The three dogs are named " << dog << ", " << Dog << ", and " << DOG << endl; |
|||
int c2 = 0; |
|||
for (int k=1; k<pow((double)Base,N); k++){ |
|||
c1++; |
|||
if (k%(Base-1) == (k*k)%(Base-1)){ |
|||
c2++; |
|||
std::cout << k << " "; |
|||
} |
|||
} |
|||
std::cout << "\nTrying " << c2 << " numbers instead of " << c1 << " numbers saves " << 100 - ((double)c2/c1)*100 << "%" <<std::endl; |
|||
return 0; |
|||
}</syntaxhighlight> |
}</syntaxhighlight> |
||
{{out}} |
{{out|Produces}} |
||
<pre> |
|||
<pre>The three dogs are named Benjamin, Samba, and Bernie</pre> |
|||
1 9 10 18 19 27 28 36 37 45 46 54 55 63 64 72 73 81 82 90 91 99 |
|||
=={{header|Clojure}}== |
|||
Trying 22 numbers instead of 99 numbers saves 77.7778% |
|||
<pre>user=> (let [dog "Benjamin" Dog "Samba" DOG "Bernie"] (format "The three dogs are named %s, %s and %s." dog Dog DOG)) |
|||
</pre> |
|||
"The three dogs are named Benjamin, Samba and Bernie."</pre> |
|||
The kaprekar numbers in this range 1 9 45 55 and 99 are included. |
|||
=={{header|COBOL}}== |
|||
<syntaxhighlight lang="cobol *">* Case sensitivity of identifiers |
|||
*>* Commented-out lines in the working storage |
|||
*>* are considered as invalid redefinitions |
|||
*>* of ''dog'' that can only be ambiguously |
|||
*>* referenced in the procedure body. |
|||
Changing: "<code>int Base = 16;</code>" Produces: |
|||
IDENTIFICATION DIVISION. |
|||
<pre> |
|||
PROGRAM-ID. case-sensitivity. |
|||
1 6 10 15 16 21 25 30 31 36 40 45 46 51 55 60 61 66 70 75 76 81 85 90 91 96 100 |
|||
DATA DIVISION. |
|||
105 106 111 115 120 121 126 130 135 136 141 145 150 151 156 160 165 166 171 175 |
|||
WORKING-STORAGE SECTION. |
|||
180 181 186 190 195 196 201 205 210 211 216 220 225 226 231 235 240 241 246 250 |
|||
*>* 01 dog PICTURE X(8) VALUE IS "Benjamin". |
|||
255 |
|||
*>* 01 Dog PICTURE X(5) VALUE IS "Samba". |
|||
Trying 68 numbers instead of 255 numbers saves 73.3333% |
|||
01 DOG PICTURE X(6) VALUE IS "Bernie". |
|||
</pre> |
|||
PROCEDURE DIVISION. |
|||
The kaprekar numbers: |
|||
DISPLAY |
|||
:1 is 1 |
|||
*>* "The three dogs are named " |
|||
:6 is 6 |
|||
*>* dog ", " Dog " and " DOG "." |
|||
:a is 10 |
|||
"There is just one dog named " DOG "." |
|||
:f is 15 |
|||
END-DISPLAY |
|||
:33 is 51 |
|||
STOP RUN. |
|||
:55 is 85 |
|||
END PROGRAM case-sensitivity.</syntaxhighlight> |
|||
:5b is 91 |
|||
=={{header|CoffeeScript}}== |
|||
:78 is 120 |
|||
<syntaxhighlight lang="coffeescript"> |
|||
:88 is 136 |
|||
dog="Benjamin" |
|||
:ab is 171 |
|||
Dog = "Samba" |
|||
:cd is 205 |
|||
DOG = "Bernie" |
|||
:ff is 255 |
|||
console.log "The three dogs are names #{dog}, #{Dog}, and #{DOG}." |
|||
</syntaxhighlight> |
|||
in this range are included. |
|||
output |
|||
<syntaxhighlight lang="text"> |
|||
> coffee foo.coffee |
|||
The three dogs are names Benjamin, Samba, and Bernie. |
|||
</syntaxhighlight> |
|||
=={{header|Common Lisp}}== |
|||
<syntaxhighlight lang="lisp">CL-USER> (let* ((dog "Benjamin") (Dog "Samba") (DOG "Bernie")) |
|||
(format nil "There is just one dog named ~a." dog)) |
|||
; in: LAMBDA NIL |
|||
; (LET* ((DOG "Benjamin") (DOG "Samba") (DOG "Bernie")) |
|||
; (FORMAT NIL "There is just one dog named ~a." DOG)) |
|||
; |
|||
; caught STYLE-WARNING: |
|||
; The variable DOG is defined but never used. |
|||
; |
|||
; caught STYLE-WARNING: |
|||
; The variable DOG is defined but never used. |
|||
; |
|||
; compilation unit finished |
|||
; caught 2 STYLE-WARNING conditions |
|||
"There is just one dog named Bernie."</syntaxhighlight> |
|||
Changing: "<code>int Base = 17;</code>" Produces: |
|||
These are the style warnings from [[SBCL]]. Other implementations of Common Lisp might give different warnings. |
|||
<pre> |
|||
=={{header|Crystal}}== |
|||
1 16 17 32 33 48 49 64 65 80 81 96 97 112 113 128 129 144 145 160 161 176 177 19 |
|||
<syntaxhighlight lang="crystal">dog = "Benjamin" |
|||
2 193 208 209 224 225 240 241 256 257 272 273 288 |
|||
Dog = "Samba" |
|||
Trying 36 numbers instead of 288 numbers saves 87.5% |
|||
DOG = "Bernie" |
|||
</pre> |
|||
The kaprekar numbers: |
|||
:1 is 1 |
|||
:g is 16 |
|||
:3d is 64 |
|||
:d4 is 225 |
|||
:gg is 288 |
|||
in this range are included. |
|||
puts "The three dogs are named #{dog}, #{Dog} and #{DOG}."</syntaxhighlight> |
|||
===C++11 For Each Generator=== |
|||
Note that in Crystal, variables with all-caps identifiers (like <code>DOG</code>) are always constants. |
|||
<syntaxhighlight lang="cpp">// Casting Out Nines Generator - Compiles with gcc4.6, MSVC 11, and CLang3 |
|||
// |
|||
// Nigel Galloway. June 24th., 2012 |
|||
// |
|||
#include <iostream> |
|||
#include <vector> |
|||
struct ran { |
|||
const int base; |
|||
std::vector<int> rs; |
|||
ran(const int base) : base(base) { for (int nz=0; nz<base-1; nz++) if(nz*(nz-1)%(base-1) == 0) rs.push_back(nz); } |
|||
}; |
|||
class co9 { |
|||
private: |
|||
const ran* _ran; |
|||
const int _end; |
|||
int _r,_x,_next; |
|||
public: |
|||
bool operator!=(const co9& other) const {return operator*() <= _end;} |
|||
co9 begin() const {return *this;} |
|||
co9 end() const {return *this;} |
|||
int operator*() const {return _next;} |
|||
co9(const int start, const int end, const ran* r) |
|||
:_ran(r) |
|||
,_end(end) |
|||
,_r(1) |
|||
,_x(start/_ran->base) |
|||
,_next((_ran->base-1)*_x + _ran->rs[_r]) |
|||
{ |
|||
while (operator*() < start) operator++(); |
|||
} |
|||
const co9& operator++() { |
|||
const int oldr = _r; |
|||
_r = ++_r%_ran->rs.size(); |
|||
if (_r<oldr) _x++; |
|||
_next = (_ran->base-1)*_x + _ran->rs[_r]; |
|||
return *this; |
|||
} |
|||
}; |
|||
int main() { |
|||
ran r(10); |
|||
for (int i : co9(1,99,&r)) { std::cout << i << ' '; } |
|||
return 0; |
|||
}</syntaxhighlight> |
|||
{{out|Produces}} |
|||
<pre> |
|||
1 9 10 18 19 27 28 36 37 45 46 54 55 63 64 72 73 81 82 90 91 99 |
|||
</pre> |
|||
An alternative implementation for struct ran using http://rosettacode.org/wiki/Sum_digits_of_an_integer#C.2B.2B which produces the same result is: |
|||
<syntaxhighlight lang="cpp">struct ran { |
|||
const int base; |
|||
std::vector<int> rs; |
|||
ran(const int base) : base(base) { for (int nz=0; nz<base-1; nz++) if(SumDigits(nz) == SumDigits(nz*nz)) rs.push_back(nz); } |
|||
};</syntaxhighlight> |
|||
Changing main: |
|||
<syntaxhighlight lang="cpp">int main() { |
|||
ran r(16); |
|||
for (int i : co9(1,255,&r)) { std::cout << i << ' '; } |
|||
return 0; |
|||
}</syntaxhighlight> |
|||
{{out|Produces}} |
|||
<pre> |
|||
1 6 10 15 16 21 25 30 31 36 40 45 46 51 55 60 61 66 70 75 76 81 85 90 91 96 100 105 106 111 115 120 121 126 130 135 136 141 145 150 151 156 160 165 166 171 175 180 181 186 190 195 196 201 205 210 211 216 220 225 226 231 235 240 241 246 250 255 |
|||
</pre> |
|||
Changing main: |
|||
<syntaxhighlight lang="cpp">int main() { |
|||
ran r(17); |
|||
for (int i : co9(1,288,&r)) { std::cout << i << ' '; } |
|||
return 0; |
|||
}</syntaxhighlight> |
|||
{{out|Produces}} |
|||
<pre> |
|||
1 16 17 32 33 48 49 64 65 80 81 96 97 112 113 128 129 144 145 160 161 176 177 192 193 208 209 224 225 240 241 256 257 272 273 288 |
|||
</pre> |
|||
=={{header|Common Lisp}}== |
|||
<syntaxhighlight lang="lisp">;;A macro was used to ensure that the filter is inlined. |
|||
;;Larry Hignight. Last updated on 7/3/2012. |
|||
(defmacro kaprekar-number-filter (n &optional (base 10)) |
|||
`(= (mod ,n (1- ,base)) (mod (* ,n ,n) (1- ,base)))) |
|||
(defun test (&key (start 1) (stop 10000) (base 10) (collect t)) |
|||
(let ((count 0) |
|||
(nums)) |
|||
(loop for i from start to stop do |
|||
(when (kaprekar-number-filter i base) |
|||
(if collect (push i nums)) |
|||
(incf count))) |
|||
(format t "~d potential Kaprekar numbers remain (~~~$% filtered out).~%" |
|||
count (* (/ (- stop count) stop) 100)) |
|||
(if collect (reverse nums))))</syntaxhighlight> |
|||
{{out}} |
{{out}} |
||
<pre>CL-USER> (test :stop 99) |
|||
<pre>The three dogs are named Benjamin, Samba and Bernie.</pre> |
|||
22 potential Kaprekar numbers remain (~77.78% filtered out). |
|||
(1 9 10 18 19 27 28 36 37 45 ...) |
|||
CL-USER> (test :stop 10000 :collect nil) |
|||
2223 potential Kaprekar numbers remain (~77.77% filtered out). |
|||
NIL |
|||
CL-USER> (test :stop 1000000 :collect nil) |
|||
222223 potential Kaprekar numbers remain (~77.78% filtered out). |
|||
NIL |
|||
CL-USER> (test :stop 255 :base 16) |
|||
68 potential Kaprekar numbers remain (~73.33% filtered out). |
|||
(1 6 10 15 16 21 25 30 31 36 ...) |
|||
CL-USER> (test :stop 288 :base 17) |
|||
36 potential Kaprekar numbers remain (~87.50% filtered out). |
|||
(1 16 17 32 33 48 49 64 65 80 ...)</pre> |
|||
=={{header|D}}== |
=={{header|D}}== |
||
{{trans|Python}} |
|||
<syntaxhighlight lang="d">import std.stdio; |
|||
<syntaxhighlight lang="d">import std.stdio, std.algorithm, std.range; |
|||
uint[] castOut(in uint base=10, in uint start=1, in uint end=999999) { |
|||
void main() { |
|||
auto ran = iota(base - 1) |
|||
.filter!(x => x % (base - 1) == (x * x) % (base - 1)); |
|||
// identifiers that start with capital letters are type names |
|||
auto x = start / (base - 1); |
|||
immutable y = start % (base - 1); |
|||
writefln("There are three dogs named ", |
|||
dog, ", ", Dog, ", and ", DOG, "'"); |
|||
}</syntaxhighlight> |
|||
Output: |
|||
<pre>There are three dogs named Benjamin, Samba, and Bernie'</pre> |
|||
=={{header|dc}}== |
|||
A register name has only one character, so this example uses 'd' and 'D'. |
|||
typeof(return) result; |
|||
<syntaxhighlight lang="dc">[Benjamin]sd |
|||
while (true) { |
|||
[Samba]sD |
|||
foreach (immutable n; ran) { |
|||
[The two dogs are named ]P ldP [ and ]P lDP [. |
|||
immutable k = (base - 1) * x + n; |
|||
]P</syntaxhighlight> |
|||
if (k < start) |
|||
continue; |
|||
{{Out}} |
|||
if (k > end) |
|||
<pre>The two dogs are named Benjamin and Samba.</pre> |
|||
return result; |
|||
=={{header|Delphi}}== |
|||
result ~= k; |
|||
Delphi is case insensitive. |
|||
} |
|||
x++; |
|||
<syntaxhighlight lang="delphi">program CaseSensitiveIdentifiers; |
|||
} |
|||
} |
|||
{$APPTYPE CONSOLE} |
|||
void main() { |
|||
castOut(16, 1, 255).writeln; |
|||
castOut(10, 1, 99).writeln; |
|||
castOut(17, 1, 288).writeln; |
|||
}</syntaxhighlight> |
|||
{{out|Output (some newlines added)}} |
|||
<pre>[1, 6, 10, 15, 16, 21, 25, 30, 31, 36, 40, 45, 46, 51, 55, 60, |
|||
61, 66, 70, 75, 76, 81, 85, 90, 91, 96, 100, 105, 106, 111, 115, |
|||
120, 121, 126, 130, 135, 136, 141, 145, 150, 151, 156, 160, 165, |
|||
166, 171, 175, 180, 181, 186, 190, 195, 196, 201, 205, 210, 211, |
|||
216, 220, 225, 226, 231, 235, 240, 241, 246, 250, 255] |
|||
[1, 9, 10, 18, 19, 27, 28, 36, 37, 45, 46, 54, 55, 63, 64, 72, 73, |
|||
81, 82, 90, 91, 99] |
|||
[1, 16, 17, 32, 33, 48, 49, 64, 65, 80, 81, 96, 97, 112, 113, 128, |
|||
129, 144, 145, 160, 161, 176, 177, 192, 193, 208, 209, 224, 225, |
|||
240, 241, 256, 257, 272, 273, 288]</pre> |
|||
=={{header|Free Pascal}}== |
|||
<syntaxhighlight lang="pascal">program castout9; |
|||
{$ifdef fpc}{$mode delphi}{$endif} |
|||
uses generics.collections; |
|||
type |
|||
TIntegerList = TSortedList<integer>; |
|||
procedure co9(const start,base,lim:integer;kaprekars:array of integer); |
|||
var |
var |
||
C1:integer = 0; |
|||
C2:integer = 0; |
|||
S:TIntegerlist; |
|||
k,i:integer; |
|||
begin |
begin |
||
S:=TIntegerlist.Create; |
|||
dog := 'Benjamin'; |
|||
for k := start to lim do |
|||
begin |
|||
DOG := 'Bernie'; |
|||
inc(C1); |
|||
Writeln('There is just one dog named ' + dog); |
|||
if k mod (base-1) = (k*k) mod (base-1) then |
|||
end.</syntaxhighlight> |
|||
begin |
|||
inc(C2); |
|||
S.Add(k); |
|||
end; |
|||
end; |
|||
writeln('Valid subset: '); |
|||
for i in Kaprekars do |
|||
if not s.contains(i) then |
|||
writeln('invalid ',i); |
|||
for i in s do write(i:4); |
|||
writeln; |
|||
write('The Kaprekars in this range ['); |
|||
for i in kaprekars do write(i:4); |
|||
writeln('] are included'); |
|||
writeln('Trying ',C2, ' numbers instead of ', C1,' saves ',100-(C2 * 100 /C1):3:2,',%.'); |
|||
writeln; |
|||
S.Free; |
|||
end; |
|||
begin |
|||
co9(1, 10, 99, [1,9,45,55,99]); |
|||
co9(1, 10, 1000, [1,9,45,55,99,297,703,999]); |
|||
end.</syntaxhighlight> |
|||
<pre> |
|||
Output: |
Output: |
||
Valid subset: |
|||
<pre>There is just one dog named Bernie</pre> |
|||
1 9 10 18 19 27 28 36 37 45 46 54 55 63 64 72 73 81 82 90 91 99 |
|||
=={{header|DWScript}}== |
|||
The Kaprekars in this range [ 1 9 45 55 99] are included |
|||
<syntaxhighlight lang="delphi"> |
|||
Trying 22 numbers instead of 99 saves 77.78,%. |
|||
var dog : String; |
|||
Valid subset: |
|||
dog := 'Benjamin'; |
|||
1 9 10 18 19 27 28 36 37 45 46 54 55 63 64 72 73 81 82 90 91 99 100 108 109 117 118 126 127 135 136 144 145 153 154 162 163 171 172 180 181 189 190 198 199 207 208 216 217 225 226 234 235 243 244 252 253 261 262 270 271 279 280 288 289 297 298 306 307 315 316 324 325 333 334 342 343 351 352 360 361 369 370 378 379 387 388 396 397 405 406 414 415 423 424 432 433 441 442 450 451 459 460 468 469 477 478 486 487 495 496 504 505 513 514 522 523 531 532 540 541 549 550 558 559 567 568 576 577 585 586 594 595 603 604 612 613 621 622 630 631 639 640 648 649 657 658 666 667 675 676 684 685 693 694 702 703 711 712 720 721 729 730 738 739 747 748 756 757 765 766 774 775 783 784 792 793 801 802 810 811 819 820 828 829 837 838 846 847 855 856 864 865 873 874 882 883 891 892 900 901 909 910 918 919 927 928 936 937 945 946 954 955 963 964 972 973 981 982 990 991 9991000 |
|||
Dog := 'Samba'; |
|||
The Kaprekars in this range [ 1 9 45 55 99 297 703 999] are included |
|||
DOG := 'Bernie'; |
|||
Trying 223 numbers instead of 1000 saves 77.70,%. |
|||
</pre> |
|||
=={{header|FreeBASIC}}== |
|||
<syntaxhighlight lang="freebasic">Const base10 = 10 |
|||
Dim As Integer c1 = 0, c2 = 0, k = 1 |
|||
For k = 1 To base10^2 |
|||
PrintLn('There is just one dog named ' + dog);</syntaxhighlight> |
|||
c1 += 1 |
|||
If (k Mod (base10-1) = (k*k) Mod (base10-1)) Then c2 += 1: Print k;" "; |
|||
Next k |
|||
Print |
|||
Output: |
|||
Print Using "Intentar ## numeros en lugar de ### numeros ahorra un ##.##%"; c2; c1; 100-(100*c2/c1) |
|||
<pre>There is just one dog named Bernie</pre> |
|||
Sleep</syntaxhighlight> |
|||
=={{header|Déjà Vu}}== |
|||
<syntaxhighlight lang="dejavu">local :dog "Benjamin" |
|||
local :Dog "Samba" |
|||
local :DOG "Bernie" |
|||
!print( "There are three dogs named " dog ", " Dog " and " DOG "." )</syntaxhighlight> |
|||
{{out}} |
|||
<pre>There are three dogs named Benjamin, Samba and Bernie.</pre> |
|||
=={{header|EchoLisp}}== |
|||
<syntaxhighlight lang="scheme"> |
|||
(define dog "Benjamin") |
|||
(define Dog "Samba") |
|||
(define DOG "Bernie") |
|||
(printf "The three dogs are named %a, %a and %a. " dog Dog DOG) |
|||
The three dogs are named Benjamin, Samba and Bernie. |
|||
</syntaxhighlight> |
|||
=={{header|Elena}}== |
|||
In ELENA identifiers are case sensitive. |
|||
ELENA 4.x: |
|||
<syntaxhighlight lang="elena">import extensions; |
|||
public program() |
|||
{ |
|||
var dog := "Benjamin"; |
|||
var Dog := "Samba"; |
|||
var DOG := "Bernie"; |
|||
console.printLineFormatted("The three dogs are named {0}, {1} and {2}", dog, Dog, DOG) |
|||
}</syntaxhighlight> |
|||
{{out}} |
{{out}} |
||
<pre> |
<pre> |
||
1 9 10 18 19 27 28 36 37 45 46 54 55 63 64 72 73 81 82 90 91 99 100 |
|||
The three dogs are named Benjamin, Samba and Bernie |
|||
Intentar 23 numeros en lugar de 100 numeros ahorra un 77.00% |
|||
</pre> |
</pre> |
||
=={{header| |
=={{header|Go}}== |
||
<syntaxhighlight lang="go">package main |
|||
While Elixir's identifiers are case-sensitive, they generally must start with a lowercase letter. Capitalized identifiers are reserved for modules. |
|||
<syntaxhighlight lang="elixir">dog = "Benjamin" |
|||
doG = "Samba" |
|||
dOG = "Bernie" |
|||
IO.puts "The three dogs are named #{dog}, #{doG} and #{dOG}."</syntaxhighlight> |
|||
import ( |
|||
{{out}} |
|||
"fmt" |
|||
<pre> |
|||
"log" |
|||
The three dogs are named Benjamin, Samba and Bernie. |
|||
"strconv" |
|||
</pre> |
|||
) |
|||
=={{header|Erlang}}== |
|||
Erlang variables are case sensitive but must start with an uppercase letter. |
|||
<syntaxhighlight lang="erlang"> |
|||
-module( case_sensitivity_of_identifiers ). |
|||
// A casting out nines algorithm. |
|||
-export( [task/0] ). |
|||
// Quoting from: http://mathforum.org/library/drmath/view/55926.html |
|||
task() -> |
|||
/* |
|||
catch dog = "Benjamin", % Function will crash without catch |
|||
First, for any number we can get a single digit, which I will call the |
|||
Dog = "Samba", |
|||
"check digit," by repeatedly adding the digits. That is, we add the |
|||
DOG = "Bernie", |
|||
digits of the number, then if there is more than one digit in the |
|||
io:fwrite( "The three dogs are named ~s, ~s and ~s~n", [dog, Dog, DOG] ). |
|||
result we add its digits, and so on until there is only one digit |
|||
</syntaxhighlight> |
|||
left. |
|||
... |
|||
You may notice that when you add the digits of 6395, if you just |
|||
ignore the 9, and the 6+3 = 9, you still end up with 5 as your check |
|||
digit. This is because any 9's make no difference in the result. |
|||
That's why the process is called "casting out" nines. Also, at any |
|||
step in the process, you can add digits, not just at the end: to do |
|||
8051647, I can say 8 + 5 = 13, which gives 4; plus 1 is 5, plus 6 is |
|||
11, which gives 2, plus 4 is 6, plus 7 is 13 which gives 4. I never |
|||
have to work with numbers bigger than 18. |
|||
*/ |
|||
// The twist is that co9Peterson returns a function to do casting out nines |
|||
// in any specified base from 2 to 36. |
|||
func co9Peterson(base int) (cob func(string) (byte, error), err error) { |
|||
if base < 2 || base > 36 { |
|||
return nil, fmt.Errorf("co9Peterson: %d invalid base", base) |
|||
} |
|||
// addDigits adds two digits in the specified base. |
|||
// People perfoming casting out nines by hand would usually have their |
|||
// addition facts memorized. In a program, a lookup table might be |
|||
// analogous, but we expediently use features of the programming language |
|||
// to add digits in the specified base. |
|||
addDigits := func(a, b byte) (string, error) { |
|||
ai, err := strconv.ParseInt(string(a), base, 64) |
|||
if err != nil { |
|||
return "", err |
|||
} |
|||
bi, err := strconv.ParseInt(string(b), base, 64) |
|||
if err != nil { |
|||
return "", err |
|||
} |
|||
return strconv.FormatInt(ai+bi, base), nil |
|||
} |
|||
// a '9' in the specified base. that is, the greatest digit. |
|||
s9 := strconv.FormatInt(int64(base-1), base) |
|||
b9 := s9[0] |
|||
// define result function. The result function may return an error |
|||
// if n is not a valid number in the specified base. |
|||
cob = func(n string) (r byte, err error) { |
|||
r = '0' |
|||
for i := 0; i < len(n); i++ { // for each digit of the number |
|||
d := n[i] |
|||
switch { |
|||
case d == b9: // if the digit is '9' of the base, cast it out |
|||
continue |
|||
// if the result so far is 0, the digit becomes the result |
|||
case r == '0': |
|||
r = d |
|||
continue |
|||
} |
|||
// otherwise, add the new digit to the result digit |
|||
s, err := addDigits(r, d) |
|||
if err != nil { |
|||
return 0, err |
|||
} |
|||
switch { |
|||
case s == s9: // if the sum is "9" of the base, cast it out |
|||
r = '0' |
|||
continue |
|||
// if the sum is a single digit, it becomes the result |
|||
case len(s) == 1: |
|||
r = s[0] |
|||
continue |
|||
} |
|||
// otherwise, reduce this two digit intermediate result before |
|||
// continuing. |
|||
r, err = cob(s) |
|||
if err != nil { |
|||
return 0, err |
|||
} |
|||
} |
|||
return |
|||
} |
|||
return |
|||
} |
|||
// Subset code required by task. Given a base and a range specified with |
|||
// beginning and ending number in that base, return candidate Kaprekar numbers |
|||
// based on the observation that k%(base-1) must equal (k*k)%(base-1). |
|||
// For the % operation, rather than the language built-in operator, use |
|||
// the method of casting out nines, which in fact implements %(base-1). |
|||
func subset(base int, begin, end string) (s []string, err error) { |
|||
// convert begin, end to native integer types for easier iteration |
|||
begin64, err := strconv.ParseInt(begin, base, 64) |
|||
if err != nil { |
|||
return nil, fmt.Errorf("subset begin: %v", err) |
|||
} |
|||
end64, err := strconv.ParseInt(end, base, 64) |
|||
if err != nil { |
|||
return nil, fmt.Errorf("subset end: %v", err) |
|||
} |
|||
// generate casting out nines function for specified base |
|||
cob, err := co9Peterson(base) |
|||
if err != nil { |
|||
return |
|||
} |
|||
for k := begin64; k <= end64; k++ { |
|||
ks := strconv.FormatInt(k, base) |
|||
rk, err := cob(ks) |
|||
if err != nil { // assertion |
|||
panic(err) // this would indicate a bug in subset |
|||
} |
|||
rk2, err := cob(strconv.FormatInt(k*k, base)) |
|||
if err != nil { // assertion |
|||
panic(err) // this would indicate a bug in subset |
|||
} |
|||
// test for candidate Kaprekar number |
|||
if rk == rk2 { |
|||
s = append(s, ks) |
|||
} |
|||
} |
|||
return |
|||
} |
|||
var testCases = []struct { |
|||
base int |
|||
begin, end string |
|||
kaprekar []string |
|||
}{ |
|||
{10, "1", "100", []string{"1", "9", "45", "55", "99"}}, |
|||
{17, "10", "gg", []string{"3d", "d4", "gg"}}, |
|||
} |
|||
func main() { |
|||
for _, tc := range testCases { |
|||
fmt.Printf("\nTest case base = %d, begin = %s, end = %s:\n", |
|||
tc.base, tc.begin, tc.end) |
|||
s, err := subset(tc.base, tc.begin, tc.end) |
|||
if err != nil { |
|||
log.Fatal(err) |
|||
} |
|||
fmt.Println("Subset: ", s) |
|||
fmt.Println("Kaprekar:", tc.kaprekar) |
|||
sx := 0 |
|||
for _, k := range tc.kaprekar { |
|||
for { |
|||
if sx == len(s) { |
|||
fmt.Printf("Fail:", k, "not in subset") |
|||
return |
|||
} |
|||
if s[sx] == k { |
|||
sx++ |
|||
break |
|||
} |
|||
sx++ |
|||
} |
|||
} |
|||
fmt.Println("Valid subset.") |
|||
} |
|||
}</syntaxhighlight> |
|||
{{out}} |
{{out}} |
||
<pre> |
<pre> |
||
Test case base = 10, begin = 1, end = 100: |
|||
4> case_sensitivity_of_identifiers:task(). |
|||
Subset: [1 9 10 18 19 27 28 36 37 45 46 54 55 63 64 72 73 81 82 90 91 99 100] |
|||
The three dogs are named dog, Samba and Bernie |
|||
Kaprekar: [1 9 45 55 99] |
|||
Valid subset. |
|||
Test case base = 17, begin = 10, end = gg: |
|||
Subset: [10 1f 1g 2e 2f 3d 3e 4c 4d 5b 5c 6a 6b 79 7a 88 89 97 98 a6 a7 b5 b6 |
|||
c4 c5 d3 d4 e2 e3 f1 f2 g0 g1 gg] |
|||
Kaprekar: [3d d4 gg] |
|||
Valid subset. |
|||
</pre> |
</pre> |
||
=={{header| |
=={{header|Haskell}}== |
||
<syntaxhighlight lang="haskell">co9 n |
|||
{{works with|Euphoria|4.0.0}} |
|||
| n <= 8 = n |
|||
<syntaxhighlight lang="euphoria">-- These variables are all different |
|||
| otherwise = co9 $ sum $ filter (/= 9) $ digits 10 n |
|||
sequence dog = "Benjamin" |
|||
sequence Dog = "Samba" |
|||
sequence DOG = "Bernie" |
|||
printf( 1, "The three dogs are named %s, %s and %s\n", {dog, Dog, DOG} )</syntaxhighlight> |
|||
=={{header|F Sharp|F#}}== |
|||
F# is case-sensitive. |
|||
<syntaxhighlight lang="fsharp">let dog = "Benjamin" |
|||
let Dog = "Samba" |
|||
let DOG = "Bernie" |
|||
printfn "There are three dogs named %s, %s and %s" dog Dog DOG</syntaxhighlight> |
|||
=={{header|Factor}}== |
|||
Factor identifiers are case-sensitive. |
|||
<syntaxhighlight lang="factor">USING: formatting locals ; |
|||
IN: scratchpad |
|||
[let |
|||
"Benjamin" :> dog |
|||
"Samba" :> Dog |
|||
"Bernie" :> DOG |
|||
{ dog Dog DOG } "There are three dogs named %s, %s, and %s." vprintf |
|||
]</syntaxhighlight> |
|||
{{out}} |
|||
<pre> |
|||
There are three dogs named Benjamin, Samba, and Bernie. |
|||
</pre> |
|||
=={{header|Forth}}== |
|||
<syntaxhighlight lang="forth">: DOG ." Benjamin" ; |
|||
: Dog ." Samba" ; |
|||
: dog ." Bernie" ; |
|||
: HOWMANYDOGS ." There is just one dog named " DOG ; |
|||
HOWMANYDOGS</syntaxhighlight> |
|||
{{out}} |
|||
<pre>There is just one dog named Bernie</pre> |
|||
=={{header|Fortran}}== |
|||
{{works with|Fortran|90 and later}} |
|||
Fortran is case insensitive, and so the three "dog" variants name the same variable - which therefore is multiply declared and will likely evoke a compiler complaint. |
|||
<syntaxhighlight lang="fortran">program Example |
|||
implicit none |
|||
task2 = filter (\n -> co9 n == co9 (n ^ 2)) [1 .. 100] |
|||
character(8) :: dog, Dog, DOG |
|||
task3 k = filter (\n -> n `mod` k == n ^ 2 `mod` k) [1 .. 100]</syntaxhighlight> |
|||
dog = "Benjamin" |
|||
Dog = "Samba" |
|||
DOG = "Bernie" |
|||
Auxillary function, returning digits of a number for given base |
|||
if (dog == DOG) then |
|||
<syntaxhighlight lang="haskell">digits base = map (`mod` base) . takeWhile (> 0) . iterate (`div` base)</syntaxhighlight> |
|||
write(*,*) "There is just one dog named ", dog |
|||
else |
|||
write(*,*) "The three dogs are named ", dog, Dog, " and ", DOG |
|||
end if |
|||
or using unfolding: |
|||
end program Example</syntaxhighlight> |
|||
Output: |
|||
<pre> There is just one dog named Bernie</pre> |
|||
=={{header|FreeBASIC}}== |
|||
<syntaxhighlight lang="freebasic">' FB 1.05.0 Win64 |
|||
<syntaxhighlight lang="haskell">digits base = Data.List.unfoldr modDiv |
|||
' FreeBASIC is case-insensitive |
|||
where modDiv 0 = Nothing |
|||
Dim dog As String |
|||
modDiv n = let (q, r) = (n `divMod` base) in Just (r, q)</syntaxhighlight> |
|||
dog = "Benjamin" |
|||
Dog = "Samba" |
|||
'''Output''' |
|||
DOG = "Bernie" |
|||
Print "There is just one dog, named "; dog |
|||
Sleep</syntaxhighlight> |
|||
<pre>λ> co9 232345 |
|||
{{out}} |
|||
1 |
|||
<pre> |
|||
λ> co9 34234234 |
|||
There is just one dog, named Bernie |
|||
7 |
|||
</pre> |
|||
λ> co9 (232345 + 34234234) == co9 232345 + co9 34234234 |
|||
=={{header|Frink}}== |
|||
True |
|||
Frink is case-sensitive. |
|||
λ> co9 (232345 * 34234234) == co9 232345 * co9 34234234 |
|||
<syntaxhighlight lang="frink">dog = "Benjamin" |
|||
True |
|||
Dog = "Samba" |
|||
λ> task2 |
|||
DOG = "Bernie" |
|||
[1,9,10,18,19,27,28,36,37,45,46,54,55,63,64,72,73,81,82,90,91,99,100] |
|||
println["There are three dogs named $dog, $Dog and $DOG"]</syntaxhighlight> |
|||
λ> task2 == (task3 9) |
|||
=={{header|Gambas}}== |
|||
True |
|||
'''[https://gambas-playground.proko.eu/?gist=fed58074944b894f5d4cfb8e16c6819a Click this link to run this code]''' |
|||
λ> task3 16 |
|||
[1,16,17,32,33,48,49,64,65,80,81,96,97]</pre> |
|||
Finally it is possible to test usefull properties of <code>co9</code> with QuickCheck: |
|||
Gambas in case insensitive |
|||
<syntaxhighlight lang="gambas">Public Sub Main() |
|||
Dim dog As String |
|||
<pre>λ> :m Test.QuickCheck |
|||
Dog = "Benjamin" |
|||
λ> quickCheck (\a -> a > 0 ==> co9 a == a `mod` 9) |
|||
DOG = "Samba" |
|||
+++ OK, passed 100 tests. |
|||
dog = "Bernie" |
|||
λ> quickCheck (\a b -> a > 0 && b > 0 ==> co9 (co9 a + co9 b) == co9 (a+b)) |
|||
Print "There is just one dog, named "; dog |
|||
+++ OK, passed 100 tests. |
|||
λ> quickCheck (\a b -> a > 0 && b > 0 ==> co9 (co9 a * co9 b) == co9 (a*b)) |
|||
+++ OK, passed 100 tests.</pre> |
|||
=={{header|J}}== |
|||
This is an implementation of: "given two numbers which mark the beginning and end of a range of integers, and another number which denotes an integer base, return numbers from within the range where the number is equal (modulo the base minus 1) to its square". At the time of this writing, this task is a draft task and this description does not precisely match the task description on this page. Eventually, either the task description will change to match this implementation (which means this paragraph should be removed) or the task description will change to conflict with this implementation (so this entire section should be re-written). |
|||
<syntaxhighlight lang="j">castout=: 1 :0 |
|||
[: (#~ ] =&((m-1)&|) *:) <. + [: i. (+*)@-~ |
|||
)</syntaxhighlight> |
|||
Example use: |
|||
<syntaxhighlight lang="j"> 0 (10 castout) 100 |
|||
0 1 9 10 18 19 27 28 36 37 45 46 54 55 63 64 72 73 81 82 90 91 99 100</syntaxhighlight> |
|||
Alternate implementation: |
|||
<syntaxhighlight lang="j">castout=: 1 :0 |
|||
[: (#~ 0 = (m-1) | 0 _1 1&p.) <. + [: i. (+*)@-~ |
|||
)</syntaxhighlight> |
|||
Note that about half of the code here is the code that implements "range of numbers". If we factor that out, and represent the desired values directly the code becomes much simpler: |
|||
<syntaxhighlight lang="j"> (#~ 0=9|0 _1 1&p.) i.101 |
|||
0 1 9 10 18 19 27 28 36 37 45 46 54 55 63 64 72 73 81 82 90 91 99 100 |
|||
(#~ ] =&(9&|) *:) i. 101 |
|||
0 1 9 10 18 19 27 28 36 37 45 46 54 55 63 64 72 73 81 82 90 91 99 100</syntaxhighlight> |
|||
And, of course, we can name parts of these expressions. For example: |
|||
<syntaxhighlight lang="j"> (#~ ] =&(co9=: 9&|) *:) i. 101 |
|||
0 1 9 10 18 19 27 28 36 37 45 46 54 55 63 64 72 73 81 82 90 91 99 100</syntaxhighlight> |
|||
Or, if you prefer: |
|||
<syntaxhighlight lang="j">co9=: 9&| |
|||
(#~ ] =&co9 *:) i. 101 |
|||
0 1 9 10 18 19 27 28 36 37 45 46 54 55 63 64 72 73 81 82 90 91 99 100</syntaxhighlight> |
|||
=={{header|Java}}== |
|||
{{trans|D}} |
|||
{{works with|Java|8}} |
|||
<syntaxhighlight lang="java">import java.util.*; |
|||
import java.util.stream.IntStream; |
|||
public class CastingOutNines { |
|||
End</syntaxhighlight> |
|||
Output: |
|||
<pre> |
|||
There is just one dog, named Bernie |
|||
</pre> |
|||
=={{header|GAP}}== |
|||
<syntaxhighlight lang="gap"># GAP is case sensitive |
|||
ThreeDogs := function() |
|||
local dog, Dog, DOG; |
|||
dog := "Benjamin"; |
|||
Dog := "Samba"; |
|||
DOG := "Bernie"; |
|||
if dog = DOG then |
|||
Print("There is just one dog named ", dog, "\n"); |
|||
else |
|||
Print("The three dogs are named ", dog, ", ", Dog, " and ", DOG, "\n"); |
|||
fi; |
|||
end; |
|||
public static void main(String[] args) { |
|||
ThreeDogs(); |
|||
System.out.println(castOut(16, 1, 255)); |
|||
# The three dogs are named Benjamin, Samba and Bernie</syntaxhighlight> |
|||
System.out.println(castOut(10, 1, 99)); |
|||
=={{header|Go}}== |
|||
System.out.println(castOut(17, 1, 288)); |
|||
Go is case sensitive. Further, visibility depends on case. See the Go entry under the [[Scope_modifiers#Go|Scope modifiers]] task. |
|||
} |
|||
<syntaxhighlight lang="go">package dogs |
|||
static List<Integer> castOut(int base, int start, int end) { |
|||
import "fmt" |
|||
int[] ran = IntStream |
|||
.range(0, base - 1) |
|||
.filter(x -> x % (base - 1) == (x * x) % (base - 1)) |
|||
.toArray(); |
|||
int x = start / (base - 1); |
|||
// Three variables, three different names. |
|||
// (It wouldn't compile if the compiler saw the variable names as the same.) |
|||
var dog = "Salt" |
|||
var Dog = "Pepper" |
|||
var DOG = "Mustard" |
|||
List<Integer> result = new ArrayList<>(); |
|||
func PackageSees() map[*string]int { |
|||
while (true) { |
|||
for (int n : ran) { |
|||
fmt.Println("Package sees:", dog, Dog, DOG) |
|||
int k = (base - 1) * x + n; |
|||
// Return addresses of the variables visible from here. |
|||
if (k < start) |
|||
continue; |
|||
if (k > end) |
|||
// the variables really represent different places in memory. |
|||
return result; |
|||
return map[*string]int{&dog: 1, &Dog: 1, &DOG: 1} |
|||
result.add(k); |
|||
} |
|||
x++; |
|||
} |
|||
} |
|||
}</syntaxhighlight> |
}</syntaxhighlight> |
||
<syntaxhighlight lang="go">package main |
|||
<pre>[1, 6, 10, 15, 16, 21, 25, 30, 31, 36, 40, 45, 46, 51, 55, 60, 61, 66, |
|||
import ( |
|||
70, 75, 76, 81, 85, 90, 91, 96, 100, 105, 106, 111, 115, 120, 121, 126, 130, |
|||
. "dogs" |
|||
135, 136, 141, 145, 150, 151, 156, 160, 165, 166, 171, 175, 180, 181, 186, |
|||
"fmt" |
|||
190, 195, 196, 201, 205, 210, 211, 216, 220, 225, 226, 231, 235, 240, 241, 246, 250, 255] |
|||
) |
|||
[1, 9, 10, 18, 19, 27, 28, 36, 37, 45, 46, 54, 55, 63, 64, 72, 73, 81, 82, 90, 91, 99] |
|||
[1, 16, 17, 32, 33, 48, 49, 64, 65, 80, 81, 96, 97, 112, 113, 128, 129, 144, 145, 160, |
|||
161, 176, 177, 192, 193, 208, 209, 224, 225, 240, 241, 256, 257, 272, 273, 288]</pre> |
|||
=={{header|JavaScript}}== |
|||
===ES5=== |
|||
Assuming the context of a web page: |
|||
<syntaxhighlight lang="javascript">function main(s, e, bs, pbs) { |
|||
bs = bs || 10; |
|||
pbs = pbs || 10 |
|||
document.write('start:', toString(s), ' end:', toString(e), |
|||
' base:', bs, ' printBase:', pbs) |
|||
document.write('<br>castOutNine: '); |
|||
castOutNine() |
|||
document.write('<br>kaprekar: '); |
|||
kaprekar() |
|||
document.write('<br><br>') |
|||
function castOutNine() { |
|||
func main() { |
|||
for (var n = s, k = 0, bsm1 = bs - 1; n <= e; n += 1) |
|||
// with the dogs package imported, there are three dogs. |
|||
if (n % bsm1 == (n * n) % bsm1) k += 1, |
|||
d := PackageSees() |
|||
document.write(toString(n), ' ') |
|||
fmt.Println("There are", len(d), "dogs.\n") |
|||
document.write('<br>trying ', k, ' numbers instead of ', n = e - s + 1, |
|||
' numbers saves ', (100 - k / n * 100) |
|||
.toFixed(3), '%') |
|||
} |
|||
function kaprekar() { |
|||
// Declaration of new variable dog. It lives in this package, main. |
|||
for (var n = s; n <= e; n += 1) |
|||
dog := "Benjamin" |
|||
if (isKaprekar(n)) document.write(toString(n), ' ') |
|||
d = PackageSees() |
|||
fmt.Println("Main sees: ", dog, Dog, DOG) |
|||
// Four dogs now. two of the three visible from here are the |
|||
// the same as ones in the dogs package. |
|||
d[&dog] = 1 |
|||
d[&Dog] = 1 |
|||
d[&DOG] = 1 |
|||
fmt.Println("There are", len(d), "dogs.\n") |
|||
function isKaprekar(n) { |
|||
// Not a declaration, just an assigment. This assigns a new value to |
|||
if (n < 1) return false |
|||
if (n == 1) return true |
|||
// it begins with an upper case letter. |
|||
var s = (n * n) |
|||
.toString(bs) |
|||
for (var i = 1, e = s.length; i < e; i += 1) { |
|||
d = PackageSees() |
|||
var a = parseInt(s.substr(0, i), bs) |
|||
fmt.Println("Main sees: ", dog, Dog, DOG) |
|||
var b = parseInt(s.substr(i), bs) |
|||
d[&dog] = 1 |
|||
if (b && a + b == n) return true |
|||
d[&Dog] = 1 |
|||
} |
|||
return false |
|||
fmt.Println("There are", len(d), "dogs.\n") |
|||
} |
|||
} |
|||
function toString(n) { |
|||
// Of course you can still declare a variable if you want to. This |
|||
return n.toString(pbs) |
|||
// declares a new variable, shadowing DOG in the package and rendering |
|||
.toUpperCase() |
|||
// it inaccessable even though it begins with an upper case letter. |
|||
} |
|||
var DOG = "Bernie" |
|||
} |
|||
// five dogs now. three visible from here. |
|||
main(1, 10 * 10 - 1) |
|||
d = PackageSees() |
|||
main(1, 16 * 16 - 1, 16) |
|||
fmt.Println("Main sees: ", dog, Dog, DOG) |
|||
main(1, 17 * 17 - 1, 17) |
|||
d[&dog] = 1 |
|||
main(parseInt('10', 17), parseInt('gg', 17), 17, 17)</syntaxhighlight> |
|||
d[&Dog] = 1 |
|||
{{Out}} |
|||
d[&DOG] = 1 |
|||
<pre>start:1 end:99 base:10 printBase:10 |
|||
fmt.Println("There are", len(d), "dogs.") |
|||
castOutNine: 1 9 10 18 19 27 28 36 37 45 46 54 55 63 64 72 73 81 82 90 91 99 |
|||
}</syntaxhighlight> |
|||
trying 22 numbers instead of 99 numbers saves 77.778% |
|||
{{out}} |
|||
kaprekar: 1 9 45 55 99 |
|||
<pre> |
|||
Package sees: Salt Pepper Mustard |
|||
There are 3 dogs. |
|||
start:1 end:255 base:16 printBase:10 |
|||
Package sees: Salt Pepper Mustard |
|||
castOutNine: 1 6 10 15 16 21 25 30 31 36 40 45 46 51 55 60 61 66 70 75 76 81 85 90 91 96 100 105 106 111 115 120 121 126 130 135 136 |
|||
Main sees: Benjamin Pepper Mustard |
|||
141 145 150 151 156 160 165 166 171 175 180 181 186 190 195 196 201 205 210 211 216 220 225 226 231 235 240 241 246 250 255 |
|||
There are 4 dogs. |
|||
trying 68 numbers instead of 255 numbers saves 73.333% |
|||
kaprekar: 1 6 10 15 51 85 91 120 136 171 205 255 |
|||
start:1 end:288 base:17 printBase:10 |
|||
Package sees: Salt Samba Mustard |
|||
castOutNine: 1 16 17 32 33 48 49 64 65 80 81 96 97 112 113 128 129 144 145 160 161 176 177 192 193 208 209 224 225 240 241 256 257 272 273 288 |
|||
Main sees: Benjamin Samba Mustard |
|||
trying 36 numbers instead of 288 numbers saves 87.500% |
|||
There are 4 dogs. |
|||
kaprekar: 1 16 64 225 288 |
|||
start:10 end:GG base:17 printBase:17 |
|||
Package sees: Salt Samba Mustard |
|||
castOutNine: 10 1F 1G 2E 2F 3D 3E 4C 4D 5B 5C 6A 6B 79 7A 88 89 97 98 A6 A7 B5 B6 C4 C5 D3 D4 E2 E3 F1 F2 G0 G1 GG |
|||
Main sees: Benjamin Samba Bernie |
|||
trying 34 numbers instead of 272 numbers saves 87.500% |
|||
There are 5 dogs. |
|||
</pre> |
kaprekar: 3D D4 GG </pre> |
||
=={{header|Groovy}}== |
|||
Solution: |
|||
<syntaxhighlight lang="groovy">def dog = "Benjamin", Dog = "Samba", DOG = "Bernie" |
|||
println (dog == DOG ? "There is one dog named ${dog}" : "There are three dogs named ${dog}, ${Dog} and ${DOG}.")</syntaxhighlight> |
|||
===ES6=== |
|||
Output: |
|||
{{Trans|Haskell}} |
|||
<pre>There are three dogs named Benjamin, Samba and Bernie.</pre> |
|||
<syntaxhighlight lang="javascript">(() => { |
|||
=={{header|Haskell}}== |
|||
'use strict'; |
|||
Identifiers are case sensitive in Haskell, but must start with a lower case letter. |
|||
// co9 :: Int -> Int |
|||
<syntaxhighlight lang="haskell">import Text.Printf |
|||
const co9 = n => |
|||
n <= 8 ? n : co9( |
|||
digits(10, n) |
|||
.reduce((a, x) => x !== 9 ? a + x : a, 0) |
|||
); |
|||
// GENERIC FUNCTIONS |
|||
main = printf "The three dogs are named %s, %s and %s.\n" dog dOG dOg |
|||
where dog = "Benjamin" |
|||
dOG = "Samba" |
|||
dOg = "Bernie"</syntaxhighlight> |
|||
=={{header|Icon}} and {{header|Unicon}}== |
|||
The program below demonstrates the three dog task. All variants of Icon/Unicon have case sensitive variable names. But if one wasn't this would find it. |
|||
<syntaxhighlight lang="icon">procedure main() |
|||
// digits :: Int -> Int -> [Int] |
|||
dog := "Benjamin" |
|||
const digits = (base, n) => { |
|||
Dog := "Samba" |
|||
if (n < base) return [n]; |
|||
DOG := "Bernie" |
|||
const [q, r] = quotRem(n, base); |
|||
return [r].concat(digits(base, q)); |
|||
if dog == DOG then |
|||
}; |
|||
write("There is just one dog named ", dog,".") |
|||
else |
|||
write("The three dogs are named ", dog, ", ", Dog, " and ", DOG, ".") |
|||
// quotRem :: Integral a => a -> a -> (a, a) |
|||
end</syntaxhighlight> |
|||
const quotRem = (m, n) => [Math.floor(m / n), m % n]; |
|||
=={{header|J}}== |
|||
<syntaxhighlight lang="j"> NB. These variables are all different |
|||
dog=: 'Benjamin' |
|||
Dog=: 'Samba' |
|||
DOG=: 'Bernie' |
|||
'The three dogs are named ',dog,', ',Dog,', and ',DOG |
|||
The three dogs are named Benjamin, Samba, and Bernie </syntaxhighlight> |
|||
=={{header|Java}}== |
|||
<syntaxhighlight lang="java">String dog = "Benjamin"; |
|||
String Dog = "Samba"; //in general, identifiers that start with capital letters are class names |
|||
String DOG = "Bernie"; //in general, identifiers in all caps are constants |
|||
//the conventions listed in comments here are not enforced by the language |
|||
System.out.println("There are three dogs named " + dog + ", " + Dog + ", and " + DOG + "'");</syntaxhighlight> |
|||
=={{header|JavaScript}}== |
|||
Javascript is case sensitive. |
|||
<syntaxhighlight lang="javascript">var dog = "Benjamin"; |
|||
var Dog = "Samba"; |
|||
var DOG = "Bernie"; |
|||
document.write("The three dogs are named " + dog + ", " + Dog + ", and " + DOG + ".");</syntaxhighlight> |
|||
=={{header|jq}}== |
|||
jq identifiers are case-sensitive. |
|||
// range :: Int -> Int -> [Int] |
|||
'''Function parameters''': |
|||
const range = (m, n) => |
|||
<syntaxhighlight lang="jq">def task(dog; Dog; DOG): |
|||
Array.from({ |
|||
"The three dogs are named \(dog), \(Dog), and \(DOG)." ; |
|||
length: Math.floor(n - m) + 1 |
|||
}, (_, i) => m + i); |
|||
// squared :: Num a => a -> a |
|||
task("Benjamin"; "Samba"; "Bernie")</syntaxhighlight> |
|||
const squared = n => Math.pow(n, 2); |
|||
// show :: a -> String |
|||
const show = x => JSON.stringify(x, null, 2); |
|||
// TESTS |
|||
return show({ |
|||
test1: co9(232345), //-> 1 |
|||
test2: co9(34234234), //-> 7 |
|||
test3: co9(232345 + 34234234) === co9(232345) + co9(34234234), //-> true |
|||
test4: co9(232345 * 34234234) === co9(232345) * co9(34234234), //-> true, |
|||
task2: range(1, 100) |
|||
.filter(n => co9(n) === co9(squared(n))), |
|||
task3: (k => range(1, 100) |
|||
.filter(n => (n % k) === (squared(n) % k)))(16) |
|||
}); |
|||
})();</syntaxhighlight> |
|||
{{Out}} |
{{Out}} |
||
<pre>{ |
|||
$ jq -n -f Case-sensitivity.jq |
|||
"test1": 1, |
|||
"The three dogs are named Benjamin, Samba, and Bernie." |
|||
"test2": 7, |
|||
"test3": true, |
|||
"test4": true, |
|||
"task2": [ |
|||
1, |
|||
9, |
|||
10, |
|||
18, |
|||
19, |
|||
27, |
|||
28, |
|||
36, |
|||
37, |
|||
45, |
|||
46, |
|||
54, |
|||
55, |
|||
63, |
|||
64, |
|||
72, |
|||
73, |
|||
81, |
|||
82, |
|||
90, |
|||
91, |
|||
99, |
|||
100 |
|||
], |
|||
"task3": [ |
|||
1, |
|||
16, |
|||
17, |
|||
32, |
|||
33, |
|||
48, |
|||
49, |
|||
64, |
|||
65, |
|||
80, |
|||
81, |
|||
96, |
|||
97 |
|||
] |
|||
}</pre> |
|||
=={{header|jq}}== |
|||
{{ works with|jq|1.4}} |
|||
In the following, the filter is_kaprekar as defined at [[Kaprekar_numbers#jq]] is used. |
|||
'''Variable names''': |
|||
Since it is only defined for decimals, this section is correspondingly restricted. |
|||
<syntaxhighlight lang="jq">"Benjamin" as $dog | "Samba" as $Dog | "Bernie" as $DOG |
|||
| "The three dogs are named \($dog), \($Dog), and \($DOG)."</syntaxhighlight> |
|||
{{out}} |
|||
As above. |
|||
=={{header|Julia}}== |
|||
{{works with|Julia|0.6}} |
|||
Variable names are case sensitive. |
|||
<syntaxhighlight lang="julia">dog, Dog, DOG = "Benjamin", "Samba", "Bernie" |
|||
'''Definition of co9''': |
|||
if dog === Dog |
|||
<syntaxhighlight lang="jq">def co9: |
|||
println("There is only one dog, ", DOG) |
|||
def digits: tostring | explode | map(. - 48); # "0" is 48 |
|||
else |
|||
if . == 9 then 0 |
|||
println("The three dogs are: ", dog, ", ", Dog, " and ", DOG) |
|||
elif 0 <= . and . <= 8 then . |
|||
end</syntaxhighlight> |
|||
else digits | add | co9 |
|||
end;</syntaxhighlight> |
|||
For convenience, we also define a function to check whether co9(i) equals co9(i*i) |
|||
{{out}} |
|||
for a given integer, i: |
|||
<pre>The three dogs are: Benjamin, Samba and Bernie</pre> |
|||
<syntaxhighlight lang="jq">def co9_equals_co9_squared: co9 == ((.*.)|co9);</syntaxhighlight> |
|||
'''Example''': |
|||
Conventionally, variable names should be all lower case. Type and Macro names should be capitalized. |
|||
=={{header|K}}== |
|||
<syntaxhighlight lang="k"> |
|||
dog: "Benjamin" |
|||
Dog: "Samba" |
|||
DOG: "Bernie" |
|||
"There are three dogs named ",dog,", ",Dog," and ",DOG |
|||
"There are three dogs named Benjamin, Samba and Bernie" |
|||
</syntaxhighlight> |
|||
=={{header|Kotlin}}== |
|||
Kotlin is case-sensitive though (as in Java) the convention is for local variable names to begin with a lower case letter. The second and third identifiers would therefore be unlikely to be used in practice. |
|||
<syntaxhighlight lang="scala">fun main(args: Array<String>) { |
|||
val dog = "Benjamin" |
|||
val Dog = "Samba" |
|||
val DOG = "Bernie" |
|||
println("The three dogs are named $dog, $Dog and $DOG") |
|||
}</syntaxhighlight> |
|||
Integers in 1 .. 100 satisfying co9(i) == co9(i*i): |
|||
{{out}} |
|||
<pre> |
|||
The three dogs are named Benjamin, Samba and Bernie |
|||
</pre> |
|||
=={{header|Lasso}}== |
|||
Lasso is not case sensitive for names |
|||
<syntaxhighlight lang="lasso"> |
|||
local(dog = 'Benjamin') |
|||
local(Dog = 'Samba') |
|||
local(DOG = 'Bernie') |
|||
<syntaxhighlight lang="jq">[range (1;101) | select( co9_equals_co9_squared )</syntaxhighlight> |
|||
stdoutnl('There is just one dog named ' + #dog) |
|||
produces: |
|||
</syntaxhighlight> |
|||
[1,9,10,18,19,27,28,36,37,45,46,54,55,63,64,72,73,81,82,90,91,99,100] |
|||
Output: |
|||
<pre>There is just one dog named Bernie</pre> |
|||
'''Verification''': |
|||
Same with string comparisons. (Lasso maps can only contain unique keys) |
|||
<syntaxhighlight lang="lasso"> |
|||
local(dogs = map( |
|||
'dog' = 'Benjamin', |
|||
'Dog' = 'Samba', |
|||
'DOG' = 'Bernie' |
|||
)) |
|||
stdoutnl(#dogs -> size)</syntaxhighlight> |
|||
Output: |
|||
<pre>1</pre> |
|||
One way to verify that the Kaprekar numbers satisfy the |
|||
To get case sensitivity we need to use bytes |
|||
co9_equals_co9_squared condition is by inspection. For the range 1..100 considered above, we have: |
|||
<syntaxhighlight lang="lasso"> |
|||
local(dogs = map( |
|||
bytes('dog') = 'Benjamin', |
|||
bytes('Dog') = 'Samba', |
|||
bytes('DOG') = 'Bernie' |
|||
)) |
|||
<syntaxhighlight lang="jq">[ range(1;101) | select(is_kaprekar) ]</syntaxhighlight> |
|||
stdoutnl(#dogs -> size) |
|||
[1,9,45,55,99] |
|||
stdoutnl(#dogs -> find(bytes('Dog')))</syntaxhighlight> |
|||
Output: |
|||
<pre>3 |
|||
Samba </pre> |
|||
=={{header|Liberty BASIC}}== |
|||
NB the IDE warns you that there are similar variables named dog$, Dog$ & DOG$ |
|||
<syntaxhighlight lang="lb"> |
|||
dog$ = "Benjamin" |
|||
Dog$ = "Samba" |
|||
DOG$ = "Bernie" |
|||
print "The three dogs are "; dog$; ", "; Dog$; " and "; DOG$; "." |
|||
To check the condition programmatically for a given range of integers, we can |
|||
end |
|||
define a function which will emit any exceptions, e.g. |
|||
</syntaxhighlight> |
|||
<syntaxhighlight lang="jq">def verify: |
|||
The three dogs are Benjamin, Samba and Bernie. |
|||
range(1; .) |
|||
=={{header|Lua}}== |
|||
| select(is_kaprekar and (co9_equals_co9_squared | not));</syntaxhighlight> |
|||
<syntaxhighlight lang="lua">dog = "Benjamin" |
|||
Dog = "Samba" |
|||
DOG = "Bernie" |
|||
For example, running (1000 | verify) produces an empty stream. |
|||
print( "There are three dogs named "..dog..", "..Dog.." and "..DOG.."." )</syntaxhighlight> |
|||
<pre>There are three dogs named Benjamin, Samba and Bernie.</pre> |
|||
=={{header|M2000 Interpreter}}== |
|||
Labels are case sensitive, but identifiers are not case sensitive. |
|||
Keys in Inventory are case sensitive |
|||
Types in Enumeration are case sensitive, identifiers are not case sensitive. |
|||
'''Proportion of integers in 1 .. n satisfying the mod (b-1) condition''': |
|||
<syntaxhighlight lang="m2000 interpreter"> |
|||
MoDuLe CheckIT { |
|||
\\ keys as case sensitive if they are strings |
|||
Inventory A= "Dog":=1, "dog":=2,"DOG":="Hello", 100:="Dog" |
|||
Print A("Dog"), A("dog"), A$("DOG"), A$(100) |
|||
\\ Enumeration get type as defined (same case) |
|||
Enum Dogs {Benjamin, Samba, Bernie} |
|||
Print Type$(Bernie)="Dogs" |
|||
Print Type$(DOGS)="Dogs" |
|||
m=BenJamiN |
|||
m++ |
|||
Print Eval$(m)="Samba" ' same case as defined |
|||
DoG$="Benjamin" |
|||
DOG$="Samba" |
|||
doG$="Bernie" |
|||
PrinT "There is just one dog named "+Dog$+"." |
|||
goto Dog |
|||
dog: |
|||
Print "dog" |
|||
Exit |
|||
Dog: |
|||
Print "Dog" |
|||
GoTo dog |
|||
} |
|||
Checkit |
|||
</syntaxhighlight> |
|||
=={{header|Maple}}== |
|||
<syntaxhighlight lang="text">> dog, Dog, DOG := "Benjamin", "Samba", "Bernie": |
|||
> if nops( { dog, Dog, DOG } ) = 3 then |
|||
> printf( "There are three dogs named %s, %s and %s.\n", dog, Dog, DOG ) |
|||
> elif nops( { dog, Dog, DOG } ) = 2 then |
|||
> printf( "WTF? There are two dogs named %s and %s.\n", op( { dog, Dog, DOG } ) ) |
|||
> else |
|||
> printf( "There is one dog named %s.\n", dog ) |
|||
> end if: |
|||
There are three dogs named Benjamin, Samba and Bernie.</syntaxhighlight> |
|||
=={{header|Mathematica}} / {{header|Wolfram Language}}== |
|||
<syntaxhighlight lang="mathematica">dog = "Benjamin"; Dog = "Samba"; DOG = "Bernie"; |
|||
"The three dogs are named "<> dog <>", "<> Dog <>" and "<> DOG |
|||
For a given base, "b", the following function computes the |
|||
-> "The three dogs are named Benjamin, Samba and Bernie"</syntaxhighlight> |
|||
proportion of integers, i, in 1 .. n such that i % (b-1) == (i*i) % (b-1): |
|||
=={{header|MATLAB}} / {{header|Octave}}== |
|||
<syntaxhighlight lang=" |
<syntaxhighlight lang="jq">def proportion(base): |
||
def count(stream): reduce stream as $i (0; . + 1); |
|||
Dog = 'Samba'; |
|||
. as $n |
|||
| (base - 1) as $b |
|||
| count( range(1; 1+$n) | select( . % $b == (.*.) % $b) ) / $n ;</syntaxhighlight> |
|||
For example: |
|||
(10, 100, 1000, 10000, 100000) | proportion(16) |
|||
printf('There are three dogs %s, %s, %s.\n',dog, Dog, DOG); </syntaxhighlight> |
|||
produces: |
|||
Output |
|||
<syntaxhighlight lang="sh">0.3 |
|||
0.27 |
|||
0.267 |
|||
0.2667 |
|||
0.26667</syntaxhighlight> |
|||
=={{header|Julia}}== |
|||
<syntaxhighlight lang="julia">co9(x) = x == 9 ? 0 : |
|||
1<=x<=8 ? x : |
|||
co9(sum(digits(x)))</syntaxhighlight> |
|||
iskaprekar is defined in the task |
|||
[[Kaprekar_numbers#Julia]]. |
|||
{{Out}} |
|||
<pre>julia> show(filter(x->co9(x)==co9(x^2), 1:100)) |
|||
[1,9,10,18,19,27,28,36,37,45,46,54,55,63,64,72,73,81,82,90,91,99,100] |
|||
julia> show(filter(iskaprekar, 1:100)) |
|||
<pre> There are three dogs Benjamin, Samba, Bernie. </pre> |
|||
[1,9,45,55,99] |
|||
=={{header|Maxima}}== |
|||
<syntaxhighlight lang="maxima">/* Maxima is case sensitive */ |
|||
a: 1$ |
|||
A: 2$ |
|||
julia> show(filter(x->x%15 == (x^2)%15, 1:100)) # base 16 |
|||
is(a = A); |
|||
[1,6,10,15,16,21,25,30,31,36,40,45,46,51,55,60,61,66,70,75,76,81,85,90,91,96,100]</pre> |
|||
false</syntaxhighlight> |
|||
=={{header| |
=={{header|Kotlin}}== |
||
{{trans|D}} |
|||
{{works with|min|0.19.3}} |
|||
<syntaxhighlight lang="scala">// version 1.1.3 |
|||
min's symbols are case sensitive. |
|||
<syntaxhighlight lang="min">"Benjamin" :dog |
|||
fun castOut(base: Int, start: Int, end: Int): List<Int> { |
|||
"Samba" :Dog |
|||
val b = base - 1 |
|||
"Bernie" :DOG |
|||
val ran = (0 until b).filter { it % b == (it * it) % b } |
|||
var x = start / b |
|||
val result = mutableListOf<Int>() |
|||
while (true) { |
|||
for (n in ran) { |
|||
val k = b * x + n |
|||
if (k < start) continue |
|||
if (k > end) return result |
|||
result.add(k) |
|||
} |
|||
x++ |
|||
} |
|||
} |
|||
fun main(args: Array<String>) { |
|||
println(castOut(16, 1, 255)) |
|||
println() |
|||
println(castOut(10, 1, 99)) |
|||
println() |
|||
println(castOut(17, 1, 288)) |
|||
}</syntaxhighlight> |
|||
"There are three dogs named $1, $2, and $3." (dog Dog DOG)=> % print</syntaxhighlight> |
|||
{{out}} |
{{out}} |
||
<pre> |
<pre> |
||
[1, 6, 10, 15, 16, 21, 25, 30, 31, 36, 40, 45, 46, 51, 55, 60, 61, 66, 70, 75, 76, 81, 85, 90, 91, 96, 100, 105, 106, 111, 115, 120, 121, 126, 130, 135, 136, 141, 145, 150, 151, 156, 160, 165, 166, 171, 175, 180, 181, 186, 190, 195, 196, 201, 205, 210, 211, 216, 220, 225, 226, 231, 235, 240, 241, 246, 250, 255] |
|||
There are three dogs named Benjamin, Samba, and Bernie. |
|||
[1, 9, 10, 18, 19, 27, 28, 36, 37, 45, 46, 54, 55, 63, 64, 72, 73, 81, 82, 90, 91, 99] |
|||
[1, 16, 17, 32, 33, 48, 49, 64, 65, 80, 81, 96, 97, 112, 113, 128, 129, 144, 145, 160, 161, 176, 177, 192, 193, 208, 209, 224, 225, 240, 241, 256, 257, 272, 273, 288] |
|||
</pre> |
</pre> |
||
=={{header| |
=={{header|Lua}}== |
||
{{trans|C}} |
|||
<syntaxhighlight lang="miniscript">dog = "Benjamin" |
|||
<syntaxhighlight lang="lua">local N = 2 |
|||
Dog = "Samba" |
|||
local base = 10 |
|||
DOG = "Bernie" |
|||
local c1 = 0 |
|||
local c2 = 0 |
|||
for k = 1, math.pow(base, N) - 1 do |
|||
print "There are three dogs named " + dog + ", " + Dog + " and " + DOG</syntaxhighlight> |
|||
c1 = c1 + 1 |
|||
=={{header|Modula-2}}== |
|||
if k % (base - 1) == (k * k) % (base - 1) then |
|||
<syntaxhighlight lang="modula2">MODULE dog; |
|||
c2 = c2 + 1 |
|||
io.write(k .. ' ') |
|||
end |
|||
end |
|||
print() |
|||
IMPORT InOut; |
|||
print(string.format("Trying %d numbers instead of %d numbers saves %f%%", c2, c1, 100.0 - 100.0 * c2 / c1))</syntaxhighlight> |
|||
{{out}} |
|||
<pre>1 9 10 18 19 27 28 36 37 45 46 54 55 63 64 72 73 81 82 90 91 99 |
|||
Trying 22 numbers instead of 99 numbers saves 77.777778%</pre> |
|||
=={{header|Mathematica}}/{{header|Wolfram Language}}== |
|||
Task 1: Simple referenced implementation that handles any base: |
|||
<syntaxhighlight lang="mathematica">Co9[n_, b_: 10] := |
|||
With[{ans = FixedPoint[Total@IntegerDigits[#, b] &, n]}, |
|||
If[ans == b - 1, 0, ans]];</syntaxhighlight> |
|||
{{out|Task 1 output}} |
|||
TYPE String = ARRAY [0..31] OF CHAR; |
|||
<syntaxhighlight lang="mathematica">Co9 /@ (vals = {1235, 2345, 4753}) |
|||
{2, 5, 1} |
|||
Total[Co9 /@ vals] == Co9[Total[vals]] |
|||
VAR dog, Dog, DOG : String; |
|||
True</syntaxhighlight> |
|||
Task 2: |
|||
(* No compiler error, so the rest is simple *) |
|||
<syntaxhighlight lang="mathematica">task2 = Select[Range@100, Co9[#] == Co9[#^2] &] </syntaxhighlight> |
|||
{{out|Task 2 output}} |
|||
BEGIN |
|||
<pre> |
|||
InOut.WriteString ("Three happy dogs."); |
|||
{1, 9, 10, 18, 19, 27, 28, 36, 37, 45, 46, 54, 55, 63, 64, 72, 73, 81, 82, 90, 91, 99, 100} |
|||
InOut.WriteLn |
|||
</pre> |
|||
END dog.</syntaxhighlight> |
|||
=={{header|Nanoquery}}== |
|||
<syntaxhighlight lang="nanoquery">dog = "Benjamin" |
|||
Dog = "Samba" |
|||
DOG = "Bernie" |
|||
Task 3: |
|||
print format("The three dogs are named %s, %s, and %s.\n", dog, Dog, DOG)</syntaxhighlight> |
|||
Defines the efficient co9 using Mod. |
|||
{{out}} |
|||
<syntaxhighlight lang="mathematica">Co9eff[n_, b_: 10] := Mod[n, b - 1]; </syntaxhighlight> |
|||
<pre>The three dogs are named Benjamin, Samba, and Bernie.</pre> |
|||
=={{header|Nemerle}}== |
|||
<syntaxhighlight lang="nemerle">def dog = "Benjamin"; |
|||
def Dog = "Samba"; |
|||
def DOG = "Bernie"; |
|||
WriteLine($"The three dogs are named $dog, $Dog, and $DOG");</syntaxhighlight> |
|||
=={{header|NESL}}== |
|||
NESL is completely case-insensitive. |
|||
<syntaxhighlight lang="nesl">dog = "Benjamin"; |
|||
Dog = "Samba"; |
|||
DOG = "Bernie"; |
|||
"There is just one dog, named " ++ dog;</syntaxhighlight> |
|||
{{out}} |
|||
<pre>it = "There is just one dog, named Bernie" : [char]</pre> |
|||
=={{header|NetRexx}}== |
|||
NetRexx is not case sensitive: |
|||
<syntaxhighlight lang="netrexx">/* NetRexx */ |
|||
options replace format comments java crossref symbols nobinary |
|||
{{out|Task 3 output}} |
|||
dog = "Benjamin"; |
|||
Testing bases 10 and 17 |
|||
Dog = "Samba"; |
|||
<syntaxhighlight lang="mathematica">task2 == Select[Range@100, Co9eff[#] == Co9eff[#^2] &] |
|||
DOG = "Bernie"; |
|||
True |
|||
Select[Range@100, Co9eff[#, 17] == Co9eff[#^2, 17] &] |
|||
if dog == Dog & Dog == DOG & dog == DOG then do |
|||
{1, 16, 17, 32, 33, 48, 49, 64, 65, 80, 81, 96, 97}</syntaxhighlight> |
|||
say 'There is just one dog named' dog'.' |
|||
end |
|||
else do |
|||
say 'The three dogs are named' dog',' Dog 'and' DOG'.' |
|||
end |
|||
return |
|||
</syntaxhighlight> |
|||
'''Output:''' |
|||
<pre> |
|||
There is just one dog named Bernie. |
|||
</pre> |
|||
=={{header|Nim}}== |
=={{header|Nim}}== |
||
<syntaxhighlight lang="nim">import sequtils |
|||
Nim has peculiar rules regarding case and style sensitivity: |
|||
:– it is mainly a case insensitive language; |
|||
:– but keywords are all in lowercase; |
|||
:– and the first letter of an identifier is case sensitive; |
|||
:– moreover, underline is ignored in identifiers (style insensitivity). |
|||
iterator castOut(base = 10, start = 1, ending = 999_999): int = |
|||
With these rules, we don’t get one dog or three dogs: we get two dogs! |
|||
var ran: seq[int] = @[] |
|||
for y in 0 ..< base-1: |
|||
if y mod (base - 1) == (y*y) mod (base - 1): |
|||
ran.add(y) |
|||
var x = start div (base - 1) |
|||
<syntaxhighlight lang="nim">var dog, Dog: string |
|||
var y = start mod (base - 1) |
|||
(dog, Dog, DOG) = ("Benjamin", "Samba", "Bernie") |
|||
if dog == Dog: |
|||
if dog == DOG: |
|||
echo "There is only one dog, ", DOG) |
|||
else: |
|||
echo "There are two dogs: ", dog, " and ", DOG |
|||
elif Dog == DOG : |
|||
echo "There are two dogs: ", dog, " and ", DOG |
|||
else: |
|||
echo "There are three dogs: ", dog, ", ", Dog, " and ", DOG</syntaxhighlight> |
|||
block outer: |
|||
while true: |
|||
for n in ran: |
|||
let k = (base - 1) * x + n |
|||
if k < start: |
|||
continue |
|||
if k > ending: |
|||
break outer |
|||
yield k |
|||
inc x |
|||
echo toSeq(castOut(base=16, start=1, ending=255))</syntaxhighlight> |
|||
{{out}} |
{{out}} |
||
<pre>@[1, 6, 10, 15, 16, 21, 25, 30, 31, 36, 40, 45, 46, 51, 55, 60, 61, 66, 70, 75, 76, 81, 85, 90, 91, 96, 100, 105, 106, 111, 115, 120, 121, 126, 130, 135, 136, 141, 145, 150, 151, 156, 160, 165, 166, 171, 175, 180, 181, 186, 190, 195, 196, 201, 205, 210, 211, 216, 220, 225, 226, 231, 235, 240, 241, 246, 250, 255]</pre> |
|||
<pre>There are two dogs: Benjamin and Bernie</pre> |
|||
=={{header|Oberon-2}}== |
|||
{{Works with| oo2c Version 2}} |
|||
<syntaxhighlight lang="oberon2"> |
|||
MODULE CaseSensitivity; |
|||
IMPORT |
|||
Out; |
|||
VAR |
|||
dog, Dog, DOG: STRING; |
|||
BEGIN |
|||
dog := "Benjamin"; |
|||
Dog := "Samba"; |
|||
DOG := "Bernie"; |
|||
Out.Object("The three dogs are named " + dog + ", " + Dog + " and " + DOG); |
|||
Out.Ln |
|||
END CaseSensitivity. |
|||
</syntaxhighlight> |
|||
{{Out}} |
|||
<pre> |
|||
The three dogs are named Benjamin, Samba and Bernie |
|||
</pre> |
|||
=={{header|Objeck}}== |
=={{header|Objeck}}== |
||
<syntaxhighlight lang="objeck">class CastingNines { |
|||
Objeck is case sensitive |
|||
function : Main(args : String[]) ~ Nil { |
|||
base := 10; |
|||
N := 2; |
|||
c1 := 0; |
|||
c2 := 0; |
|||
for (k:=1; k<base->As(Float)->Power(N->As(Float)); k+=1;){ |
|||
<syntaxhighlight lang="objeck">class Program { |
|||
c1+=1; |
|||
function : Main(args : String[]) ~ Nil { |
|||
if (k%(base-1) = (k*k)%(base-1)){ |
|||
dog := "Benjamin"; |
|||
c2+=1; |
|||
IO.Console->Print(k)->Print(" "); |
|||
DOG := "Bernie"; |
|||
}; |
|||
"The three dogs are named {$dog}, {$Dog}, and {$DOG}."->PrintLine(); |
|||
}; |
|||
IO.Console->Print("\nTrying ")->Print(c2)->Print(" numbers instead of ") |
|||
->Print(c1)->Print(" numbers saves ")->Print(100 - (c2->As(Float)/c1 |
|||
->As(Float)*100))->PrintLine("%"); |
|||
} |
} |
||
}</syntaxhighlight> |
}</syntaxhighlight> |
||
=={{header|OCaml}}== |
|||
{{out}} |
|||
Identifiers in OCaml are lettercase sensitive, but the first letter has to be lowercase. |
|||
<pre>1 9 10 18 19 27 28 36 37 45 46 54 55 63 64 72 73 81 82 90 91 99 |
|||
Trying 22 numbers instead of 99 numbers saves 77.7777778%</pre> |
|||
=={{header|PARI/GP}}== |
|||
{{trans|C++}} |
|||
<syntaxhighlight lang="parigp">{base=10; |
|||
N=2; |
|||
c1=c2=0; |
|||
for(k=1,base^N-1, |
|||
c1++; |
|||
if (k%(base-1) == k^2%(base-1), |
|||
c2++; |
|||
print1(k" ") |
|||
); |
|||
); |
|||
print("\nTrying "c2" numbers instead of "c1" numbers saves " 100.-(c2/c1)*100 "%")} |
|||
</syntaxhighlight> |
|||
{{out|Produces}} |
|||
<pre> |
|||
1 9 10 18 19 27 28 36 37 45 46 54 55 63 64 72 73 81 82 90 91 99 |
|||
Trying 22 numbers instead of 99 numbers saves 77.77777777777777777777777778% |
|||
</pre> |
|||
Changing to: "<code>base = 16;</code>" produces: |
|||
<pre> |
|||
1 6 10 15 16 21 25 30 31 36 40 45 46 51 55 60 61 66 70 75 76 81 85 90 91 96 100 |
|||
105 106 111 115 120 121 126 130 135 136 141 145 150 151 156 160 165 166 171 175 |
|||
180 181 186 190 195 196 201 205 210 211 216 220 225 226 231 235 240 241 246 250 |
|||
255 |
|||
Trying 68 numbers instead of 255 numbers saves 73.33333333333333333333333333%</pre> |
|||
=={{header|Perl}}== |
|||
<syntaxhighlight lang="perl">sub co9 { # Follows the simple procedure asked for in Part 1 |
|||
my $n = shift; |
|||
return $n if $n < 10; |
|||
my $sum = 0; $sum += $_ for split(//,$n); |
|||
co9($sum); |
|||
} |
|||
sub showadd { |
|||
<syntaxhighlight lang="ocaml">let () = |
|||
my($n,$m) = @_; |
|||
let dog = "Benjamin" in |
|||
print "( $n [",co9($n),"] + $m [",co9($m),"] ) [",co9(co9($n)+co9($m)),"]", |
|||
let dOG = "Samba" in |
|||
" = ", $n+$m," [",co9($n+$m),"]\n"; |
|||
let dOg = "Bernie" in |
|||
} |
|||
Printf.printf "The three dogs are named %s, %s and %s.\n" dog dOG dOg</syntaxhighlight> |
|||
=={{header|Oforth}}== |
|||
sub co9filter { |
|||
Oforth is case-sensitive. |
|||
my $base = shift; |
|||
die unless $base >= 2; |
|||
my($beg, $end, $basem1) = (1, $base*$base-1, $base-1); |
|||
my @list = grep { $_ % $basem1 == $_*$_ % $basem1 } $beg .. $end; |
|||
($end, scalar(@list), @list); |
|||
} |
|||
print "Part 1: Create a simple filter and demonstrate using simple example.\n"; |
|||
<syntaxhighlight lang="oforth">: threeDogs |
|||
showadd(6395, 1259); |
|||
| dog Dog DOG | |
|||
print "\nPart 2: Use this to filter a range with co9(k) == co9(k^2).\n"; |
|||
"Benjamin" ->dog |
|||
print join(" ", grep { co9($_) == co9($_*$_) } 1..99), "\n"; |
|||
"Samba" ->Dog |
|||
"Bernie" ->DOG |
|||
print "\nPart 3: Use efficient method on range.\n"; |
|||
System.Out "The three dogs are named " << dog << ", " << Dog << " and " << DOG << "." << cr ;</syntaxhighlight> |
|||
for my $base (10, 17) { |
|||
=={{header|Ol}}== |
|||
my($N, $n, @l) = co9filter($base); |
|||
<syntaxhighlight lang="scheme"> |
|||
printf "[@l]\nIn base %d, trying %d numbers instead of %d saves %.4f%%\n\n", |
|||
(define dog "Benjamin") |
|||
$base, $n, $N, 100-($n/$N)*100; |
|||
(define Dog "Samba") |
|||
}</syntaxhighlight> |
|||
(define DOG "Bernie") |
|||
{{out}} |
|||
(print "The three dogs are named " dog ", " Dog " and " DOG ".\n") |
|||
</syntaxhighlight> |
|||
{{Out}} |
|||
<pre> |
<pre> |
||
Part 1: Create a simple filter and demonstrate using simple example. |
|||
The three dogs are named Benjamin, Samba and Bernie. |
|||
( 6395 [5] + 1259 [8] ) [4] = 7654 [4] |
|||
Part 2: Use this to filter a range with co9(k) == co9(k^2). |
|||
1 9 10 18 19 27 28 36 37 45 46 54 55 63 64 72 73 81 82 90 91 99 |
|||
Part 3: Use efficient method on range. |
|||
[1 9 10 18 19 27 28 36 37 45 46 54 55 63 64 72 73 81 82 90 91 99] |
|||
In base 10, trying 22 numbers instead of 99 saves 77.7778% |
|||
[1 16 17 32 33 48 49 64 65 80 81 96 97 112 113 128 129 144 145 160 161 176 177 192 193 208 209 224 225 240 241 256 257 272 273 288] |
|||
In base 17, trying 36 numbers instead of 288 saves 87.5000% |
|||
</pre> |
</pre> |
||
=={{header|PARI/GP}}== |
|||
<syntaxhighlight lang="parigp">dog="Benjamin"; |
|||
Dog="Samba"; |
|||
DOG="Bernie"; |
|||
printf("The three dogs are named %s, %s, and %s.", dog, Dog, DOG)</syntaxhighlight> |
|||
=={{header|Pascal}}== |
|||
See [[#Delphi|Delphi]] |
|||
=={{header|Perl}}== |
|||
<syntaxhighlight lang="perl"># These variables are all different |
|||
$dog='Benjamin'; |
|||
$Dog='Samba'; |
|||
$DOG='Bernie'; |
|||
print "The three dogs are named $dog, $Dog, and $DOG \n"</syntaxhighlight> |
|||
=={{header|Phix}}== |
=={{header|Phix}}== |
||
<!--<syntaxhighlight lang="phix">(phixonline)--> |
|||
{{libheader|Phix/basics}} |
|||
<span style="color: #008080;">with</span> <span style="color: #008080;">javascript_semantics</span> |
|||
Phix is case sensitive |
|||
<span style="color: #008080;">procedure</span> <span style="color: #000000;">co9</span><span style="color: #0000FF;">(</span><span style="color: #004080;">integer</span> <span style="color: #000000;">start</span><span style="color: #0000FF;">,</span> <span style="color: #004080;">integer</span> <span style="color: #000000;">base</span><span style="color: #0000FF;">,</span> <span style="color: #004080;">integer</span> <span style="color: #000000;">lim</span><span style="color: #0000FF;">,</span> <span style="color: #004080;">sequence</span> <span style="color: #000000;">kaprekars</span><span style="color: #0000FF;">)</span> |
|||
<span style="color: #004080;">integer</span> <span style="color: #000000;">c1</span><span style="color: #0000FF;">=</span><span style="color: #000000;">0</span><span style="color: #0000FF;">,</span> |
|||
<!--<syntaxhighlight lang="phix">--> |
|||
<span style="color: #000000;">c2</span><span style="color: #0000FF;">=</span><span style="color: #000000;">0</span> |
|||
<span style="color: #004080;">sequence</span> <span style="color: #000000;">s</span> <span style="color: #0000FF;">=</span> <span style="color: #0000FF;">{}</span> |
|||
<span style="color: #000000;"> |
<span style="color: #008080;">for</span> <span style="color: #000000;">k</span><span style="color: #0000FF;">=</span><span style="color: #000000;">start</span> <span style="color: #008080;">to</span> <span style="color: #000000;">lim</span> <span style="color: #008080;">do</span> |
||
<span style="color: #000000;">c1</span> <span style="color: #0000FF;">+=</span> <span style="color: #000000;">1</span> |
|||
<span style="color: #008080;">if</span> <span style="color: #7060A8;">mod</span><span style="color: #0000FF;">(</span><span style="color: #000000;">k</span><span style="color: #0000FF;">,</span><span style="color: #000000;">base</span><span style="color: #0000FF;">-</span><span style="color: #000000;">1</span><span style="color: #0000FF;">)=</span><span style="color: #7060A8;">mod</span><span style="color: #0000FF;">(</span><span style="color: #000000;">k</span><span style="color: #0000FF;">*</span><span style="color: #000000;">k</span><span style="color: #0000FF;">,</span><span style="color: #000000;">base</span><span style="color: #0000FF;">-</span><span style="color: #000000;">1</span><span style="color: #0000FF;">)</span> <span style="color: #008080;">then</span> |
|||
<span style="color: #000000;">c2</span> <span style="color: #0000FF;">+=</span> <span style="color: #000000;">1</span> |
|||
<span style="color: #000000;">s</span> <span style="color: #0000FF;">&=</span> <span style="color: #000000;">k</span> |
|||
<span style="color: #008080;">end</span> <span style="color: #008080;">if</span> |
|||
<span style="color: #008080;">end</span> <span style="color: #008080;">for</span> |
|||
<span style="color: #004080;">string</span> <span style="color: #000000;">msg</span> <span style="color: #0000FF;">=</span> <span style="color: #008000;">"valid subset"</span> |
|||
<span style="color: #008080;">for</span> <span style="color: #000000;">i</span><span style="color: #0000FF;">=</span><span style="color: #000000;">1</span> <span style="color: #008080;">to</span> <span style="color: #7060A8;">length</span><span style="color: #0000FF;">(</span><span style="color: #000000;">kaprekars</span><span style="color: #0000FF;">)</span> <span style="color: #008080;">do</span> |
|||
<span style="color: #008080;">if</span> <span style="color: #008080;">not</span> <span style="color: #7060A8;">find</span><span style="color: #0000FF;">(</span><span style="color: #000000;">kaprekars</span><span style="color: #0000FF;">[</span><span style="color: #000000;">i</span><span style="color: #0000FF;">],</span><span style="color: #000000;">s</span><span style="color: #0000FF;">)</span> <span style="color: #008080;">then</span> |
|||
<span style="color: #000000;">msg</span> <span style="color: #0000FF;">=</span> <span style="color: #008000;">"***INVALID***"</span> |
|||
<span style="color: #008080;">exit</span> |
|||
<span style="color: #008080;">end</span> <span style="color: #008080;">if</span> |
|||
<span style="color: #008080;">end</span> <span style="color: #008080;">for</span> |
|||
<span style="color: #008080;">if</span> <span style="color: #7060A8;">length</span><span style="color: #0000FF;">(</span><span style="color: #000000;">s</span><span style="color: #0000FF;">)></span><span style="color: #000000;">25</span> <span style="color: #008080;">then</span> <span style="color: #000000;">s</span><span style="color: #0000FF;">[</span><span style="color: #000000;">10</span><span style="color: #0000FF;">..-</span><span style="color: #000000;">10</span><span style="color: #0000FF;">]</span> <span style="color: #0000FF;">=</span> <span style="color: #0000FF;">{</span><span style="color: #008000;">"..."</span><span style="color: #0000FF;">}</span> <span style="color: #008080;">end</span> <span style="color: #008080;">if</span> |
|||
<span style="color: #7060A8;">printf</span><span style="color: #0000FF;">(</span><span style="color: #000000;">1</span><span style="color: #0000FF;">,</span><span style="color: #008000;">"%V\nKaprekar numbers: %V - %s\n"</span><span style="color: #0000FF;">,{</span><span style="color: #000000;">s</span><span style="color: #0000FF;">,</span><span style="color: #000000;">kaprekars</span><span style="color: #0000FF;">,</span><span style="color: #000000;">msg</span><span style="color: #0000FF;">})</span> |
|||
<span style="color: #7060A8;">printf</span><span style="color: #0000FF;">(</span><span style="color: #000000;">1</span><span style="color: #0000FF;">,</span><span style="color: #008000;">"Trying %d numbers instead of %d saves %3.2f%%\n\n"</span><span style="color: #0000FF;">,{</span><span style="color: #000000;">c2</span><span style="color: #0000FF;">,</span><span style="color: #000000;">c1</span><span style="color: #0000FF;">,</span><span style="color: #000000;">100</span><span style="color: #0000FF;">-(</span><span style="color: #000000;">c2</span><span style="color: #0000FF;">/</span><span style="color: #000000;">c1</span><span style="color: #0000FF;">)*</span><span style="color: #000000;">100</span><span style="color: #0000FF;">})</span> |
|||
<span style="color: #008080;">end</span> <span style="color: #008080;">procedure</span> |
|||
<span style="color: #000000;">co9</span><span style="color: #0000FF;">(</span><span style="color: #000000;">1</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">10</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">99</span><span style="color: #0000FF;">,</span> <span style="color: #0000FF;">{</span><span style="color: #000000;">1</span><span style="color: #0000FF;">,</span><span style="color: #000000;">9</span><span style="color: #0000FF;">,</span><span style="color: #000000;">45</span><span style="color: #0000FF;">,</span><span style="color: #000000;">55</span><span style="color: #0000FF;">,</span><span style="color: #000000;">99</span><span style="color: #0000FF;">})</span> |
|||
<span style="color: #000000;">co9</span><span style="color: #0000FF;">(</span><span style="color: #000000;">0(17)10</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">17</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">17</span><span style="color: #0000FF;">*</span><span style="color: #000000;">17</span><span style="color: #0000FF;">,</span> <span style="color: #0000FF;">{</span><span style="color: #000000;">0(17)3d</span><span style="color: #0000FF;">,</span><span style="color: #000000;">0(17)d4</span><span style="color: #0000FF;">,</span><span style="color: #000000;">0(17)gg</span><span style="color: #0000FF;">})</span> |
|||
<span style="color: #000000;">co9</span><span style="color: #0000FF;">(</span><span style="color: #000000;">1</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">10</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">1000</span><span style="color: #0000FF;">,</span> <span style="color: #0000FF;">{</span><span style="color: #000000;">1</span><span style="color: #0000FF;">,</span><span style="color: #000000;">9</span><span style="color: #0000FF;">,</span><span style="color: #000000;">45</span><span style="color: #0000FF;">,</span><span style="color: #000000;">55</span><span style="color: #0000FF;">,</span><span style="color: #000000;">99</span><span style="color: #0000FF;">,</span><span style="color: #000000;">297</span><span style="color: #0000FF;">,</span><span style="color: #000000;">703</span><span style="color: #0000FF;">,</span><span style="color: #000000;">999</span><span style="color: #0000FF;">})</span> |
|||
<!--</syntaxhighlight>--> |
<!--</syntaxhighlight>--> |
||
{{out}} |
{{out}} |
||
<pre> |
<pre> |
||
{1,9,10,18,19,27,28,36,37,45,46,54,55,63,64,72,73,81,82,90,91,99} |
|||
The three dogs are named Benjamin, Samba and Bernie |
|||
Kaprekar numbers: {1,9,45,55,99} - valid subset |
|||
Trying 22 numbers instead of 99 saves 77.78% |
|||
{17,32,33,48,49,64,65,80,81,"...",225,240,241,256,257,272,273,288,289} |
|||
Kaprekar numbers: {64,225,288} - valid subset |
|||
Trying 35 numbers instead of 273 saves 87.18% |
|||
{1,9,10,18,19,27,28,36,37,"...",964,972,973,981,982,990,991,999,1000} |
|||
Kaprekar numbers: {1,9,45,55,99,297,703,999} - valid subset |
|||
Trying 223 numbers instead of 1000 saves 77.70% |
|||
</pre> |
</pre> |
||
=={{header| |
=={{header|Picat}}== |
||
<syntaxhighlight lang=" |
<syntaxhighlight lang="picat">go => |
||
Base10 = 10, |
|||
(prinl "The three dogs are named " dog ", " Dog " and " DOG) )</syntaxhighlight> |
|||
foreach(N in [2,6]) |
|||
Output: |
|||
casting_out_nines(Base10,N) |
|||
<pre>The three dogs are named Benjamin, Samba and Bernie</pre> |
|||
end, |
|||
=={{header|PL/I}}== |
|||
nl, |
|||
<syntaxhighlight lang="pli">*process or(!) source xref attributes macro options; |
|||
Base16 = 16, |
|||
/********************************************************************* |
|||
foreach(N in [2,6]) |
|||
* Program to show that PL/I is case-insensitive |
|||
casting_out_nines(Base16,N) |
|||
* 28.05.2013 Walter Pachl |
|||
end, |
|||
*********************************************************************/ |
|||
nl. |
|||
case: proc options(main); |
|||
Dcl dog Char(20) Var; |
|||
casting_out_nines(Base,N) => |
|||
dog = "Benjamin"; |
|||
println([base=Base,n=N]), |
|||
Dog = "Samba"; |
|||
C1 = 0, |
|||
DOG = "Bernie"; |
|||
C2 = 0, |
|||
Put Edit(dog,Dog,DOG)(Skip,3(a,x(1))); |
|||
Ks = [], |
|||
End;</syntaxhighlight> |
|||
LimitN = 3, |
|||
'''Output''' |
|||
foreach(K in 1..Base**N-1) |
|||
<pre>Bernie Bernie Berni</pre> |
|||
C1 := C1 + 1, |
|||
=={{header|Plain English}}== |
|||
if K mod (Base-1) == (K*K) mod (Base-1) then |
|||
Plain English is NOT case sensitive. |
|||
C2 := C2+1, |
|||
<syntaxhighlight lang="plainenglish">To run: |
|||
if N <= LimitN then |
|||
Start up. |
|||
Ks := Ks ++ [K] |
|||
Put "Benjamin" into a DOG string. |
|||
end |
|||
Put "Samba" into the Dog string. |
|||
end |
|||
Put "Bernie" into the dog string. |
|||
end, |
|||
Write "There is just one dog named " then the DOG on the console. |
|||
if C2 <= 100 then |
|||
Wait for the escape key. |
|||
println(ks=Ks) |
|||
Shut down.</syntaxhighlight> |
|||
end, |
|||
printf("Trying %d numbers instead of %d numbers saves %2.3f%%\n", C2, C1, 100 - ((C2/C1)*100)), |
|||
nl.</syntaxhighlight> |
|||
{{out}} |
{{out}} |
||
<pre> |
<pre>[base = 10,n = 2] |
||
ks = [1,9,10,18,19,27,28,36,37,45,46,54,55,63,64,72,73,81,82,90,91,99] |
|||
There is just one dog named Bernie |
|||
Trying 22 numbers instead of 99 numbers saves 77.778% |
|||
</pre> |
|||
=={{header|PowerShell}}== |
|||
PowerShell is not case sensitive. |
|||
<syntaxhighlight lang="powershell"> |
|||
$dog = "Benjamin" |
|||
$Dog = "Samba" |
|||
$DOG = "Bernie" |
|||
[base = 10,n = 6] |
|||
"There is just one dog named {0}." -f $dOg |
|||
Trying 222222 numbers instead of 999999 numbers saves 77.778% |
|||
</syntaxhighlight> |
|||
{{Out}} |
|||
<pre> |
|||
There is just one dog named Bernie. |
|||
</pre> |
|||
=={{header|Prolog}}== |
|||
In Prolog, the initial of a variable must be a uppercase letter. So the task can't be completed but we can write this code : |
|||
<syntaxhighlight lang="prolog">three_dogs :- |
|||
DoG = 'Benjamin', |
|||
Dog = 'Samba', |
|||
DOG = 'Bernie', |
|||
format('The three dogs are named ~w, ~w and ~w.~n', [DoG, Dog, DOG]). |
|||
</syntaxhighlight> |
|||
The output is : |
|||
<pre>?- three_dogs. |
|||
The three dogs are named Benjamin, Samba and Bernie. |
|||
true. |
|||
[base = 16,n = 2] |
|||
</pre> |
|||
ks = [1,6,10,15,16,21,25,30,31,36,40,45,46,51,55,60,61,66,70,75,76,81,85,90,91,96,100,105,106,111,115,120,121,126,130,135,136,141,145,150,151,156,160,165,166,171,175,180,181,186,190,195,196,201,205,210,211,216,220,225,226,231,235,240,241,246,250,255] |
|||
=={{header|PureBasic}}== |
|||
Trying 68 numbers instead of 255 numbers saves 73.333% |
|||
<syntaxhighlight lang="purebasic">dog$="Benjamin" |
|||
Dog$="Samba" |
|||
DOG$="Bernie" |
|||
Debug "There is just one dog named "+dog$</syntaxhighlight> |
|||
=={{header|Python}}== |
|||
Python names are case sensitive: |
|||
<syntaxhighlight lang="python">>>> dog = 'Benjamin'; Dog = 'Samba'; DOG = 'Bernie' |
|||
>>> print ('The three dogs are named ',dog,', ',Dog,', and ',DOG) |
|||
The three dogs are named Benjamin , Samba , and Bernie |
|||
>>> </syntaxhighlight> |
|||
=={{header|Quackery}}== |
|||
<syntaxhighlight lang="quackery">[ $ 'Benjamin' ] is dog ( --> $ ) |
|||
[base = 16,n = 6] |
|||
[ $ 'Samba' ] is Dog ( --> $ ) |
|||
Trying 4473924 numbers instead of 16777215 numbers saves 73.333%</pre> |
|||
=={{header|PicoLisp}}== |
|||
<syntaxhighlight lang="picolisp">(de kaprekar (N) |
|||
(let L (cons 0 (chop (* N N))) |
|||
(for ((I . R) (cdr L) R (cdr R)) |
|||
(NIL (gt0 (format R))) |
|||
(T (= N (+ @ (format (head I L)))) N) ) ) ) |
|||
(de co9 (N) |
|||
(until |
|||
(> 9 |
|||
(setq N |
|||
(sum |
|||
'((N) (unless (= "9" N) (format N))) |
|||
(chop N) ) ) ) ) |
|||
N ) |
|||
(println 'Part1:) |
|||
(println |
|||
(= |
|||
(co9 (+ 6395 1259)) |
|||
(co9 (+ (co9 6395) (co9 1259))) ) ) |
|||
(println 'Part2:) |
|||
(println |
|||
(filter |
|||
'((N) (= (co9 N) (co9 (* N N)))) |
|||
(range 1 100) ) ) |
|||
(println |
|||
(filter kaprekar (range 1 100)) ) |
|||
(println 'Part3 '- 'base17:) |
|||
(println |
|||
(filter |
|||
'((N) (= (% N 16) (% (* N N) 16))) |
|||
(range 1 100) ) ) |
|||
(bye)</syntaxhighlight> |
|||
say 'There are three dogs named ' |
|||
dog echo$ say ', ' |
|||
Dog echo$ say ', and ' |
|||
DOG echo$ say '.' cr</syntaxhighlight> |
|||
{{out}} |
{{out}} |
||
<pre> |
<pre> |
||
Part1: |
|||
There are three dogs named Benjamin, Samba, and Bernie. |
|||
T |
|||
Part2: |
|||
(1 9 10 18 19 27 28 36 37 45 46 54 55 63 64 72 73 81 82 90 91 99 100) |
|||
(1 9 45 55 99) |
|||
Part3 - base17: |
|||
(1 16 17 32 33 48 49 64 65 80 81 96 97) |
|||
</pre> |
</pre> |
||
=={{header| |
=={{header|Python}}== |
||
This works slightly differently, generating the "wierd" (as defined by Counting Out Nines) numbers which may be Kaprekar, rather than filtering all numbers in a range. |
|||
<syntaxhighlight lang="r">dog <- 'Benjamin' |
|||
<syntaxhighlight lang="python"># Casting out Nines |
|||
Dog <- 'Samba' |
|||
# |
|||
DOG <- 'Bernie' |
|||
# Nigel Galloway: June 27th., 2012, |
|||
# |
|||
def CastOut(Base=10, Start=1, End=999999): |
|||
ran = [y for y in range(Base-1) if y%(Base-1) == (y*y)%(Base-1)] |
|||
x,y = divmod(Start, Base-1) |
|||
while True: |
|||
for n in ran: |
|||
k = (Base-1)*x + n |
|||
if k < Start: |
|||
continue |
|||
if k > End: |
|||
return |
|||
yield k |
|||
x += 1 |
|||
for V in CastOut(Base=16,Start=1,End=255): |
|||
# Having fun with cats and dogs |
|||
print(V, end=' ')</syntaxhighlight> |
|||
cat('The three dogs are named ') |
|||
Produces: |
|||
cat(dog) |
|||
cat(', ') |
|||
cat(Dog) |
|||
cat(' and ') |
|||
cat(DOG) |
|||
cat('.\n') |
|||
# In one line it would be: |
|||
# cat('The three dogs are named ', dog, ', ', Dog, ' and ', DOG, '.\n', sep = '')</syntaxhighlight> |
|||
Output: |
|||
<pre> |
<pre> |
||
1 6 10 15 16 21 25 30 31 36 40 45 46 51 55 60 61 66 70 75 76 81 85 90 91 96 100 105 106 111 115 120 121 126 130 135 136 141 145 150 151 156 160 165 166 171 175 180 181 186 190 195 196 201 205 210 211 216 220 225 226 231 235 240 241 246 250 255 |
|||
The three dogs are named Benjamin, Samba and Bernie. |
|||
</pre> |
</pre> |
||
<code>CastOut(Base=10,Start=1,End=99)</code> produces: |
|||
=={{header|Racket}}== |
|||
The default setting for the Racket reader is to be case sensitive: |
|||
<syntaxhighlight lang="racket"> |
|||
#lang racket |
|||
(define dog "Benjamin") |
|||
(define Dog "Samba") |
|||
(define DOG "Bernie") |
|||
(if (equal? dog DOG) |
|||
(displayln (~a "There is one dog named " DOG ".")) |
|||
(displayln (~a "The three dogs are named " dog ", " Dog ", and, " DOG "."))) |
|||
</syntaxhighlight> |
|||
Output: |
|||
<pre> |
<pre> |
||
1 9 10 18 19 27 28 36 37 45 46 54 55 63 64 72 73 81 82 90 91 99 |
|||
The three dogs are named Benjamin, Samba, and, Bernie. |
|||
</pre> |
</pre> |
||
<code>CastOut(Base=17,Start=1,End=288)</code> produces: |
|||
If you need case insensitive identifiers, then use #ci to turn on case insensitivity: |
|||
<syntaxhighlight lang="racket"> |
|||
#lang racket |
|||
#ci(module dogs racket |
|||
(define dog "Benjamin") |
|||
(set! Dog "Samba") |
|||
(set! DOG "Bernie") |
|||
(if (equal? dog DOG) |
|||
(displayln (~a "There is one dog named " DOG ".")) |
|||
(displayln (~a "The three dogs are named " dog ", " Dog ", and, " DOG ".")))) |
|||
(require 'dogs) |
|||
</syntaxhighlight> |
|||
Output: |
|||
<pre> |
<pre> |
||
1 16 17 32 33 48 49 64 65 80 81 96 97 112 113 128 129 144 145 160 161 176 177 192 193 208 209 224 225 240 241 256 257 272 273 288 |
|||
There is one dog named Bernie. |
|||
</pre> |
</pre> |
||
=={{header| |
=={{header|Quackery}}== |
||
(formerly Perl 6) |
|||
<syntaxhighlight lang="raku" line>my $dog = 'Benjamin'; |
|||
my $Dog = 'Samba'; |
|||
my $DOG = 'Bernie'; |
|||
say "The three dogs are named $dog, $Dog, and $DOG."</syntaxhighlight> |
|||
The only place that Raku pays any attention to the case of identifiers is that, for certain error messages, it will guess that an identifier starting lowercase is probably a function name, while one starting uppercase is probably a type or constant name. But this case distinction is merely a convention in Raku, not mandatory: |
|||
<syntaxhighlight lang="raku" line>constant dog = 'Benjamin'; |
|||
sub Dog() { 'Samba' } |
|||
my &DOG = { 'Bernie' } |
|||
say "The three dogs are named {dog}, {Dog}, and {DOG}."</syntaxhighlight> |
|||
=={{header|Retro}}== |
|||
Retro is case sensitive. |
|||
<code>kaprekar</code> is defined at [[Kaprekar numbers#Quackery]]. |
|||
<syntaxhighlight lang="retro">: dog ( -$ ) "Benjamin" ; |
|||
: Dog ( -$ ) "Samba" ; |
|||
: DOG ( -$ ) "Bernie" ; |
|||
<syntaxhighlight lang="quackery"> [ true unrot swap |
|||
DOG Dog dog "The three dogs are named %s, %s, and %s.\n" puts</syntaxhighlight> |
|||
witheach |
|||
=={{header|REXX}}== |
|||
[ over find |
|||
===simple variables=== |
|||
over found not if |
|||
The REXX language is case insensitive (with respect to simple variables). |
|||
[ dip not |
|||
<syntaxhighlight lang="rexx">/*REXX program demonstrate case insensitivity for simple REXX variable names. */ |
|||
conclude ] ] |
|||
drop ] is subset ( [ [ --> [ ) |
|||
[ abs 0 swap |
|||
/* ┌──◄── all 3 left─hand side REXX variables are identical (as far as assignments). */ |
|||
[ 10 /mod rot + |
|||
/* │ */ |
|||
dup 8 > if [ 9 - ] |
|||
/* ↓ */ |
|||
swap dup 0 = until ] |
|||
dog= 'Benjamin' /*assign a lowercase variable (dog)*/ |
|||
drop ] is co9 ( n --> n ) |
|||
DOG= 'Bernie' /* " an uppercase " DOG */ |
|||
say "Part 1: Examples from Dr Math page." cr cr |
|||
say center('using simple variables', 35, "─") /*title.*/ |
|||
say "6395 1259 + = " 6395 1259 + echo cr |
|||
say |
|||
say "6395 co9 = " 6395 co9 echo cr |
|||
say "1259 co9 = " 1259 co9 echo cr |
|||
say "5 8 + co9 = " 5 8 + co9 echo cr |
|||
say "7654 co9 = " 7654 co9 echo cr cr |
|||
say "6395 1259 * = " 6395 1259 * echo cr |
|||
say "6395 co9 = " 6395 co9 echo cr |
|||
say "1259 co9 = " 1259 co9 echo cr |
|||
say "5 8 * co9 = " 5 8 * co9 echo cr |
|||
say "8051305 co9 = " 7654 co9 echo cr cr |
|||
say "Part 2: Kaprekar numbers." cr cr |
|||
say "Kaprekar numbers less than one hundred: " |
|||
[] |
|||
100 times |
|||
[ i^ kaprekar if |
|||
[ i^ join ] ] |
|||
dup echo cr |
|||
say '0...99 with property "n co9 n 2 ** co9 =": ' |
|||
[] |
|||
100 times |
|||
[ i^ co9 |
|||
i^ 2 ** co9 = if |
|||
[ i^ join ] ] |
|||
dup echo cr |
|||
say "Is the former a subset of the latter? " |
|||
subset iff [ say "Yes." ] else [ say "No." ] cr cr |
|||
say "Part 3: Same as Part 2, but base 17." cr cr |
|||
say "Kaprekar (base 17) numbers less than one hundred: " |
|||
17 base put |
|||
[] |
|||
100 times |
|||
[ i^ kaprekar if |
|||
[ i^ join ] ] |
|||
base release |
|||
dup echo cr |
|||
say '0...99 with property "n 16 mod n 2 ** 16 mod =": ' |
|||
[] |
|||
100 times |
|||
[ i^ 16 mod |
|||
i^ 2 ** 16 mod = if |
|||
[ i^ join ] ] |
|||
dup echo cr |
|||
say "Is the former a subset of the latter? " |
|||
subset iff [ say "Yes." ] else [ say "No." ]</syntaxhighlight> |
|||
{{out}} |
|||
if dog\==Dog | DOG\==dog then say 'The three dogs are named:' dog"," Dog 'and' DOG"." |
|||
else say 'There is just one dog named:' dog"." |
|||
<pre>Part 1: Examples from Dr Math page. |
|||
/*stick a fork in it, we're all done. */</syntaxhighlight> |
|||
'''output''' |
|||
6395 1259 + = 7654 |
|||
<pre> |
|||
6395 co9 = 5 |
|||
──────using simple variables─────── |
|||
1259 co9 = 8 |
|||
5 8 + co9 = 4 |
|||
7654 co9 = 4 |
|||
6395 1259 * = 8051305 |
|||
6395 co9 = 5 |
|||
1259 co9 = 8 |
|||
5 8 * co9 = 4 |
|||
8051305 co9 = 4 |
|||
Part 2: Kaprekar numbers. |
|||
Kaprekar numbers less than one hundred: [ 1 9 45 55 99 ] |
|||
0...99 with property "n co9 n 2 ** co9 =": [ 0 1 9 10 18 19 27 28 36 37 45 46 54 55 63 64 72 73 81 82 90 91 99 ] |
|||
Is the former a subset of the latter? Yes. |
|||
Part 3: Same as Part 2, but base 17. |
|||
Kaprekar (base 17) numbers less than one hundred: [ 1 16 64 ] |
|||
There is just one dog named: Bernie. |
|||
0...99 with property "n 16 mod n 2 ** 16 mod =": [ 0 1 16 17 32 33 48 49 64 65 80 81 96 97 ] |
|||
Is the former a subset of the latter? Yes. |
|||
</pre> |
</pre> |
||
=={{header|Racket}}== |
|||
<syntaxhighlight lang="racket">#lang racket |
|||
(require math) |
|||
(define (digits n) |
|||
===compound variables=== |
|||
(map (compose1 string->number string) |
|||
However, the REXX language is case sensitive (with respect to compound variables, or indices). |
|||
(string->list (number->string n)))) |
|||
<syntaxhighlight lang="rexx">/*REXX program demonstrate case sensitive REXX index names (for compound variables). */ |
|||
(define (cast-out-nines n) |
|||
/* ┌──◄── all 3 indices (for an array variable) are unique (as far as array index). */ |
|||
(with-modulus 9 |
|||
/* │ */ |
|||
(for/fold ([sum 0]) ([d (digits n)]) |
|||
/* ↓ */ |
|||
(mod+ sum d))))</syntaxhighlight> |
|||
x= 'dog'; dogname.x= "Gunner" /*assign an array index, lowercase dog*/ |
|||
=={{header|Raku}}== |
|||
x= 'Dog'; dogname.x= "Thor" /* " " " " capitalized Dog*/ |
|||
(formerly Perl 6) |
|||
x= 'DOG'; dogname.x= "Jax" /* " " " " uppercase DOG*/ |
|||
{{trans|Python}} |
|||
x= 'doG'; dogname.x= "Rex" /* " " " " mixed doG*/ |
|||
{{works with|Rakudo|2015.12}} |
|||
<syntaxhighlight lang="raku" line>sub cast-out(\BASE = 10, \MIN = 1, \MAX = BASE**2 - 1) { |
|||
my \B9 = BASE - 1; |
|||
my @ran = ($_ if $_ % B9 == $_**2 % B9 for ^B9); |
|||
my $x = MIN div B9; |
|||
gather loop { |
|||
for @ran -> \n { |
|||
my \k = B9 * $x + n; |
|||
take k if k >= MIN; |
|||
} |
|||
$x++; |
|||
} ...^ * > MAX; |
|||
} |
|||
say cast-out; |
|||
say center('using compound variables', 35, "═") /*title.*/ |
|||
say cast-out 16; |
|||
say |
|||
say cast-out 17;</syntaxhighlight> |
|||
{{out}} |
|||
<pre>(1 9 10 18 19 27 28 36 37 45 46 54 55 63 64 72 73 81 82 90 91 99) |
|||
(1 6 10 15 16 21 25 30 31 36 40 45 46 51 55 60 61 66 70 75 76 81 85 90 91 96 100 105 106 111 115 120 121 126 130 135 136 141 145 150 151 156 160 165 166 171 175 180 181 186 190 195 196 201 205 210 211 216 220 225 226 231 235 240 241 246 250 255) |
|||
(1 16 17 32 33 48 49 64 65 80 81 96 97 112 113 128 129 144 145 160 161 176 177 192 193 208 209 224 225 240 241 256 257 272 273 288)</pre> |
|||
=={{header|REXX}}== |
|||
<syntaxhighlight lang="rexx">/*REXX program demonstrates the casting─out─nines algorithm (with Kaprekar numbers). */ |
|||
parse arg LO HI base . /*obtain optional arguments from the CL*/ |
|||
if LO=='' | LO=="," then do; LO=1; HI=1000; end /*Not specified? Then use the default*/ |
|||
if HI=='' | HI=="," then HI= LO /* " " " " " " */ |
|||
if base=='' | base=="," then base= 10 /* " " " " " " */ |
|||
numeric digits max(9, 2*length(HI**2) ) /*insure enough decimal digits for HI².*/ |
|||
numbers= castOut(LO, HI, base) /*generate a list of (cast out) numbers*/ |
|||
@cast_out= 'cast-out-' || (base-1) "test" /*construct a shortcut text for output.*/ |
|||
say 'For' LO "through" HI', the following passed the' @cast_out":" |
|||
say numbers; say /*display the list of cast out numbers.*/ |
|||
q= HI - LO + 1 /*Q: is the range of numbers in list.*/ |
|||
p= words(numbers) /*P" " " number " " " " */ |
|||
pc= format(p/q * 100, , 2) / 1 || '%' /*calculate the percentage (%) cast out*/ |
|||
say 'For' q "numbers," p 'passed the' @cast_out "("pc') for base' base"." |
|||
if base\==10 then exit /*if radix isn't ten, then exit program*/ |
|||
Kaps= Kaprekar(LO, HI) /*generate a list of Kaprekar numbers. */ |
|||
say; say 'The Kaprekar numbers in the same range are:' Kaps |
|||
say |
|||
do i=1 for words(Kaps); x= word(Kaps, i) /*verify 'em in list.*/ |
|||
if wordpos(x, numbers)\==0 then iterate /*it's OK so far ··· */ |
|||
say 'Kaprekar number' x "isn't in the numbers list." /*oops─ay! */ |
|||
exit 13 /*go spank the coder.*/ |
|||
end /*i*/ |
|||
say 'All Kaprekar numbers are in the' @cast_out "numbers list." /*OK*/ |
|||
_= 'dog'; say "dogname.dog=" dogname._ /*display an array index, lowercase dog*/ |
|||
exit 0 /*stick a fork in it, we're all done. */ |
|||
/*──────────────────────────────────────────────────────────────────────────────────────*/ |
|||
_= 'DOG'; say "dogname.DOG=" dogname._ /* " " " " uppercase DOG*/ |
|||
castOut: procedure; parse arg low,high,radix; rm= word(radix 10, 1) - 1; $= |
|||
_= 'doG'; say "dogname.doG=" dogname._ /* " " " " mixed doG*/ |
|||
do j=low to word(high low, 1) /*test a range of numbers. */ |
|||
if j//rm == j*j//rm then $= $ j /*did number pass the test?*/ |
|||
end /*j*/ /* [↑] Then add # to list.*/ |
|||
return strip($) /*strip and leading blanks from result.*/ |
|||
/*──────────────────────────────────────────────────────────────────────────────────────*/ |
|||
Kaprekar: procedure; parse arg L,H; $=; if L<=1 then $= 1 /*add unity if in range*/ |
|||
do j=max(2, L) to H; s= j*j /*a slow way to find Kaprekar numbers. */ |
|||
do m=1 for length(s)%2 |
|||
if j==left(s, m) + substr(s, m+1) then do; $= $ j; leave; end |
|||
end /*m*/ /* [↑] found a Kaprekar number. */ |
|||
end /*j*/ |
|||
return strip($) /*return Kaprekar numbers to invoker. */</syntaxhighlight> |
|||
{{out|output|text= when using the default inputs:}} |
|||
<pre> |
|||
For 1 through 1000, the following passed the cast-out-9 test: |
|||
1 9 10 18 19 27 28 36 37 45 46 54 55 63 64 72 73 81 82 90 91 99 100 108 109 117 118 126 127 135 136 144 145 153 154 162 163 171 172 180 181 189 190 198 199 207 208 216 217 225 226 234 235 243 244 252 |
|||
253 261 262 270 271 279 280 288 289 297 298 306 307 315 316 324 325 333 334 342 343 351 352 360 361 369 370 378 379 387 388 396 397 405 406 414 415 423 424 432 433 441 442 450 451 459 460 468 469 477 |
|||
478 486 487 495 496 504 505 513 514 522 523 531 532 540 541 549 550 558 559 567 568 576 577 585 586 594 595 603 604 612 613 621 622 630 631 639 640 648 649 657 658 666 667 675 676 684 685 693 694 702 |
|||
703 711 712 720 721 729 730 738 739 747 748 756 757 765 766 774 775 783 784 792 793 801 802 810 811 819 820 828 829 837 838 846 847 855 856 864 865 873 874 882 883 891 892 900 901 909 910 918 919 927 |
|||
928 936 937 945 946 954 955 963 964 972 973 981 982 990 991 999 1000 |
|||
For 1000 numbers, 223 passed the cast-out-9 test (22.3%) for base 10. |
|||
/*stick a fork in it, we're all done. */</syntaxhighlight> |
|||
'''output''' |
|||
The Kaprekar numbers in the same range are: 1 9 45 55 99 297 703 999 |
|||
All Kaprekar numbers are in the cast-out-9 test numbers list. |
|||
</pre> |
|||
{{out|output|text= when using the input of: <tt> 1 256 16 </tt>}} |
|||
<pre> |
<pre> |
||
For 1 through 256, the following passed the cast-out-15 test: |
|||
═════using compound variables══════ |
|||
1 6 10 15 16 21 25 30 31 36 40 45 46 51 55 60 61 66 70 75 76 81 85 90 91 96 100 105 106 111 115 120 121 126 130 135 136 141 145 150 151 156 160 165 166 171 175 180 181 186 190 195 196 201 205 210 211 |
|||
216 220 225 226 231 235 240 241 246 250 255 256 |
|||
For 256 numbers, 69 passed the cast-out-15 test (26.95%) for base 16. |
|||
dogname.dog= Gunner |
|||
dogname.Dog= Thor |
|||
dogname.DOG= Jax |
|||
dogname.doG= Rex |
|||
</pre> |
</pre> |
||
=={{header|Ring}}== |
=={{header|Ring}}== |
||
<syntaxhighlight lang="ring"> |
<syntaxhighlight lang="ring"> |
||
# Project : Casting out nines |
|||
dog = "Benjamin" |
|||
doG = "Smokey" |
|||
Dog = "Samba" |
|||
DOG = "Bernie" |
|||
see "The 4 dogs are : " + dog + ", " + doG + ", " + Dog + " and " + DOG + "." |
|||
</syntaxhighlight> |
|||
=={{header|Ruby}}== |
|||
Ruby gives a special meaning to the first letter of a name. A lowercase letter starts a local variable. An uppercase letter starts a constant. So <tt>dog</tt> is a local variable, but <tt>Dog</tt> and <tt>DOG</tt> are constants. To adapt this task to Ruby, I added <tt>dOg</tt> and <tt>doG</tt> so that I have more than one local variable. |
|||
co9(1, 10, 99, [1,9,45,55,99]) |
|||
<syntaxhighlight lang="ruby">module FiveDogs |
|||
co9(1, 10, 1000, [1,9,45,55,99,297,703,999]) |
|||
dog = "Benjamin" |
|||
dOg = "Dogley" |
|||
doG = "Fido" |
|||
Dog = "Samba" # this constant is FiveDogs::Dog |
|||
DOG = "Bernie" # this constant is FiveDogs::DOG |
|||
func co9(start,base,lim,kaprekars) |
|||
names = [dog, dOg, doG, Dog, DOG] |
|||
c1=0 |
|||
names.uniq! |
|||
c2=0 |
|||
puts "There are %d dogs named %s." % [names.length, names.join(", ")] |
|||
s = [] |
|||
for k = start to lim |
|||
puts "The local variables are %s." % local_variables.join(", ") |
|||
c1 = c1 + 1 |
|||
puts "The constants are %s." % constants.join(", ") |
|||
if k % (base-1) = (k*k) % (base-1) |
|||
end</syntaxhighlight> |
|||
c2 = c2 + 1 |
|||
add(s,k) |
|||
ok |
|||
next |
|||
msg = "Valid subset" + nl |
|||
for i = 1 to len(kaprekars) |
|||
if not find(s,kaprekars[i]) |
|||
msg = "***Invalid***" + nl |
|||
exit |
|||
ok |
|||
next |
|||
showarray(s) |
|||
see "Kaprekar numbers:" + nl |
|||
showarray(kaprekars) |
|||
see msg |
|||
see "Trying " + c2 + " numbers instead of " + c1 + " saves " + (100-(c2/c1)*100) + "%" + nl + nl |
|||
func showarray(vect) |
|||
Output: <pre>There are 5 dogs named Benjamin, Dogley, Fido, Samba, Bernie. |
|||
see "{" |
|||
svect = "" |
|||
The local variables are dog, dOg, doG, names. |
|||
for n = 1 to len(vect) |
|||
The constants are Dog, DOG.</pre> |
|||
svect = svect + vect[n] + ", " |
|||
=={{header|Run BASIC}}== |
|||
next |
|||
<syntaxhighlight lang="runbasic"> |
|||
svect = left(svect, len(svect) - 2) |
|||
dog$ = "Benjamin" |
|||
see svect + "}" + nl |
|||
doG$ = "Smokey" |
|||
Dog$ = "Samba" |
|||
DOG$ = "Bernie" |
|||
print "The 4 dogs are "; dog$; ", "; doG$; ", "; Dog$; " and "; DOG$; "." |
|||
</syntaxhighlight> |
</syntaxhighlight> |
||
Output: |
|||
=={{header|Rust}}== |
|||
<pre> |
|||
Rust style dictates that identifiers should be written in snake case, e.g. <tt>big_dog</tt>, <tt>small_dog</tt>; whereas types (structs and enums) should be written in camel case, e.g. <tt>BigDog</tt>, <tt>SmallDog</tt>. Failing to comply with this standard does not cause a compiler error, but it will trigger a compiler warning, and the culture is very strongly towards compliance with this standard. |
|||
{1, 9, 10, 18, 19, 27, 28, 36, 37, 45, 46, 54, 55, 63, 64, 72, 73, 81, 82, 90, 91, 99} |
|||
Kaprekar numbers: |
|||
{1, 9, 45, 55, 99} |
|||
Valid subset |
|||
Trying 22 numbers instead of 99 saves 77.78% |
|||
{1, 9, 10, 18, 19, 27, 28, 36, 37, 45, 46, 54, 55, 63, 64, 72, 73, 81, 82, 90, 91, 99, 100, 108, 109, 117, 118, 126, 127, 135, 136, 144, 145, 153, 154, 162, 163, 171, 172, 180, 181, 189, 190, 198, 199, 207, 208, 216, 217, 225, 226, 234, 235, 243, 244, 252, 253, 261, 262, 270, 271, 279, 280, 288, 289, 297, 298, 306, 307, 315, 316, 324, 325, 333, 334, 342, 343, 351, 352, 360, 361, 369, 370, 378, 379, 387, 388, 396, 397, 405, 406, 414, 415, 423, 424, 432, 433, 441, 442, 450, 451, 459, 460, 468, 469, 477, 478, 486, 487, 495, 496, 504, 505, 513, 514, 522, 523, 531, 532, 540, 541, 549, 550, 558, 559, 567, 568, 576, 577, 585, 586, 594, 595, 603, 604, 612, 613, 621, 622, 630, 631, 639, 640, 648, 649, 657, 658, 666, 667, 675, 676, 684, 685, 693, 694, 702, 703, 711, 712, 720, 721, 729, 730, 738, 739, 747, 748, 756, 757, 765, 766, 774, 775, 783, 784, 792, 793, 801, 802, 810, 811, 819, 820, 828, 829, 837, 838, 846, 847, 855, 856, 864, 865, 873, 874, 882, 883, 891, 892, 900, 901, 909, 910, 918, 919, 927, 928, 936, 937, 945, 946, 954, 955, 963, 964, 972, 973, 981, 982, 990, 991, 999, 1000} |
|||
<syntaxhighlight lang="rust">fn main() { |
|||
Kaprekar numbers: |
|||
let dog = "Benjamin"; |
|||
{1, 9, 45, 55, 99, 297, 703, 999} |
|||
let Dog = "Samba"; |
|||
Valid subset |
|||
let DOG = "Bernie"; |
|||
Trying 223 numbers instead of 1000 saves 77.70% |
|||
println!("The three dogs are named {}, {} and {}.", dog, Dog, DOG); |
|||
</pre> |
|||
}</syntaxhighlight> |
|||
=={{header|Ruby}}== |
|||
{{trans|C}} |
|||
<syntaxhighlight lang="ruby">N = 2 |
|||
base = 10 |
|||
c1 = 0 |
|||
c2 = 0 |
|||
for k in 1 .. (base ** N) - 1 |
|||
This triggers two warnings at compilation: |
|||
c1 = c1 + 1 |
|||
if k % (base - 1) == (k * k) % (base - 1) then |
|||
c2 = c2 + 1 |
|||
print "%d " % [k] |
|||
end |
|||
end |
|||
puts |
|||
<syntaxhighlight lang="text"><anon>:3:9: 3:12 warning: variable `Dog` should have a snake case name such as `dog`, #[warn(non_snake_case)] on by default |
|||
print "Trying %d numbers instead of %d numbers saves %f%%" % [c2, c1, 100.0 - 100.0 * c2 / c1]</syntaxhighlight> |
|||
<anon>:3 let Dog = "Samba"; |
|||
{{out}} |
|||
^~~ |
|||
<pre>1 9 10 18 19 27 28 36 37 45 46 54 55 63 64 72 73 81 82 90 91 99 |
|||
<anon>:4:9: 4:12 warning: variable `DOG` should have a snake case name such as `dog`, #[warn(non_snake_case)] on by default |
|||
Trying 22 numbers instead of 99 numbers saves 77.777778%</pre> |
|||
<anon>:4 let DOG = "Bernie"; |
|||
=={{header|Rust}}== |
|||
^~~</syntaxhighlight> |
|||
<syntaxhighlight lang="rust">fn compare_co9_efficiency(base: u64, upto: u64) { |
|||
let naive_candidates: Vec<u64> = (1u64..upto).collect(); |
|||
let co9_candidates: Vec<u64> = naive_candidates.iter().cloned() |
|||
.filter(|&x| x % (base - 1) == (x * x) % (base - 1)) |
|||
.collect(); |
|||
for candidate in &co9_candidates { |
|||
print!("{} ", candidate); |
|||
} |
|||
println!(); |
|||
println!( |
|||
"Trying {} numbers instead of {} saves {:.2}%", |
|||
co9_candidates.len(), |
|||
naive_candidates.len(), |
|||
100.0 - 100.0 * (co9_candidates.len() as f64 / naive_candidates.len() as f64) |
|||
); |
|||
} |
|||
fn main() { |
|||
The resulting program will compile and run just fine, producing the output: |
|||
compare_co9_efficiency(10, 100); |
|||
compare_co9_efficiency(16, 256); |
|||
}</syntaxhighlight> |
|||
{{out}} |
|||
<syntaxhighlight lang="text">The three dogs are named Benjamin, Samba and Bernie.</syntaxhighlight> |
|||
<pre>1 9 10 18 19 27 28 36 37 45 46 54 55 63 64 72 73 81 82 90 91 99 |
|||
=={{header|Sather}}== |
|||
Trying 22 numbers instead of 99 saves 77.78% |
|||
Though by convention Sather uses all uppercase letters for class names, a variable can be |
|||
1 6 10 15 16 21 25 30 31 36 40 45 46 51 55 60 61 66 70 75 76 81 85 90 91 96 100 105 106 111 115 120 121 126 130 135 136 141 145 150 151 156 160 165 166 171 175 180 181 186 190 195 196 201 205 210 211 216 220 225 226 231 235 240 241 246 250 255 |
|||
all uppercase. |
|||
Trying 68 numbers instead of 255 saves 73.33%</pre> |
|||
<syntaxhighlight lang="sather">class MAIN is |
|||
main is |
|||
dog ::= "Benjamin"; |
|||
Dog ::= "Samba"; |
|||
DOG ::= "Bernie"; |
|||
#OUT + #FMT("The three dogs are %s, %s and %s\n", |
|||
dog, Dog, DOG); |
|||
end; |
|||
end;</syntaxhighlight> |
|||
Outputs: |
|||
<pre>The three dogs are Benjamin, Samba and Bernie</pre> |
|||
=={{header|Scala}}== |
=={{header|Scala}}== |
||
Code written in scala follows functional paradigm of programming, finds list of candidates for Kaprekar numbers within given range. |
|||
<syntaxhighlight lang="scala">val dog = "Benjamin" |
|||
<syntaxhighlight lang="scala"> |
|||
val Dog = "Samba" |
|||
object kaprekar{ |
|||
val DOG = "Bernie" |
|||
// PART 1 |
|||
println("There are three dogs named " + dog + ", " + Dog + ", and " + DOG + ".")</syntaxhighlight> |
|||
val co_base = ((x:Int,base:Int) => (x%(base-1) == (x*x)%(base-1))) |
|||
Output: |
|||
//PART 2 |
|||
<pre>There are three dogs named Benjamin, Samba, and Bernie.</pre> |
|||
def get_cands(n:Int,base:Int):List[Int] = { |
|||
=={{header|Scheme}}== |
|||
if(n==1) List[Int]() |
|||
Output may differ depending on implementation. |
|||
else if (co_base(n,base)) n :: get_cands(n-1,base) |
|||
<syntaxhighlight lang="scheme">(define dog "Benjamin") |
|||
else get_cands(n-1,base) |
|||
(define Dog "Samba") |
|||
} |
|||
(define DOG "Bernie") |
|||
def main(args:Array[String]) : Unit = { |
|||
//PART 3 |
|||
val base = 31 |
|||
println("Candidates for Kaprekar numbers found by casting out method with base %d:".format(base)) |
|||
println(get_cands(1000,base)) |
|||
} |
|||
} |
|||
</syntaxhighlight> |
|||
{{out}} |
|||
<pre> |
|||
Output for base 10 within range of 100: |
|||
Candidates for Kaprekar numbers found by casting out method with base 10: |
|||
List(100, 99, 91, 90, 82, 81, 73, 72, 64, 63, 55, 54, 46, 45, 37, 36, 28, 27, 19, 18, 10, 9) |
|||
Output for base 17 with range 1000: |
|||
(if (eq? dog DOG) |
|||
Candidates for Kaprekar numbers found by casting out method with base 17: |
|||
(begin (display "There is one dog named ") |
|||
List(993, 992, 977, 976, 961, 960, 945, 944, 929, 928, 913, 912, 897, 896, 881, 880, 865, 864, 849, 848, 833, 832, 817, 816, 801, 800, 785, 784, 769, 768, 753, 752, 737, 736, 721, 720, 705, 704, 689, 688, 673, 672, 657, 656, 641, 640, 625, 624, 609, 608, 593, 592, 577, 576, 561, 560, 545, 544, 529, 528, 513, 512, 497, 496, 481, 480, 465, 464, 449, 448, 433, 432, 417, 416, 401, 400, 385, 384, 369, 368, 353, 352, 337, 336, 321, 320, 305, 304, 289, 288, 273, 272, 257, 256, 241, 240, 225, 224, 209, 208, 193, 192, 177, 176, 161, 160, 145, 144, 129, 128, 113, 112, 97, 96, 81, 80, 65, 64, 49, 48, 33, 32, 17, 16) |
|||
(display DOG) |
|||
</pre> |
|||
(display ".") |
|||
(newline)) |
|||
(begin (display "The three dogs are named ") |
|||
(display dog) (display ", ") |
|||
(display Dog) (display " and ") |
|||
(display DOG) |
|||
(display ".") |
|||
(newline)))</syntaxhighlight> |
|||
=={{header|Seed7}}== |
=={{header|Seed7}}== |
||
<syntaxhighlight lang="seed7">$ include "seed7_05.s7i"; |
<syntaxhighlight lang="seed7">$ include "seed7_05.s7i"; |
||
const func bitset: castOut (in integer: base, in integer: start, in integer: ending) is func |
|||
const string: dog is "Benjamin"; |
|||
result |
|||
const string: Dog is "Samba"; |
|||
var bitset: casted is {}; |
|||
const string: DOG is "Bernie"; |
|||
local |
|||
var bitset: ran is {}; |
|||
var integer: x is 0; |
|||
var integer: n is 0; |
|||
var integer: k is 0; |
|||
var boolean: finished is FALSE; |
|||
begin |
|||
for x range 0 to base - 2 do |
|||
if x rem pred(base) = x ** 2 rem pred(base) then |
|||
incl(ran, x); |
|||
end if; |
|||
end for; |
|||
x := start div pred(base); |
|||
repeat |
|||
for n range ran until finished do |
|||
k := pred(base) * x + n; |
|||
if k >= start then |
|||
if k > ending then |
|||
finished := TRUE; |
|||
else |
|||
incl(casted, k); |
|||
end if; |
|||
end if; |
|||
end for; |
|||
incr(x); |
|||
until finished; |
|||
end func; |
|||
const proc: main is func |
const proc: main is func |
||
begin |
begin |
||
writeln(castOut(16, 1, 255)); |
|||
writeln("The three dogs are named " <& dog <& ", " <& Dog <& " and " <& DOG <& "."); |
|||
end func;</syntaxhighlight> |
end func;</syntaxhighlight> |
||
=={{header|SenseTalk}}== |
|||
As a People Oriented Programming language, SenseTalk's variable names are case-insensitive. |
|||
<syntaxhighlight lang="sensetalk"> |
|||
set dog to "Benjamin" |
|||
set Dog to "Samba" |
|||
set DOG to "Bernie" |
|||
put !"There is just one dog named [[dog]]." |
|||
</syntaxhighlight> |
|||
{{out}} |
{{out}} |
||
<pre> |
|||
<pre>There is just one dog named Bernie.</pre> |
|||
{1, 6, 10, 15, 16, 21, 25, 30, 31, 36, 40, 45, 46, 51, 55, 60, 61, 66, 70, 75, 76, 81, 85, 90, 91, 96, 100, 105, 106, 111, 115, 120, 121, 126, 130, 135, 136, 141, 145, 150, 151, 156, 160, 165, 166, 171, 175, 180, 181, 186, 190, 195, 196, 201, 205, 210, 211, 216, 220, 225, 226, 231, 235, 240, 241, 246, 250, 255} |
|||
=={{header|SETL}}== |
|||
</pre> |
|||
<syntaxhighlight lang="pascal">dog := 'Benjamin'; |
|||
Dog := 'Samba'; |
|||
DOG := 'Bernie'; |
|||
print( 'There is just one dog named', dOg );</syntaxhighlight> |
|||
{{out}} |
|||
<pre>There is just one dog named Bernie</pre> |
|||
=={{header|Sidef}}== |
=={{header|Sidef}}== |
||
{{trans|Raku}} |
|||
<syntaxhighlight lang="ruby">var dog = 'Benjamin'; |
|||
<syntaxhighlight lang="ruby">func cast_out(base = 10, min = 1, max = (base**2 - 1)) { |
|||
var Dog = 'Samba'; |
|||
var DOG = 'Bernie'; |
|||
say "The three dogs are named #{dog}, #{Dog}, and #{DOG}.";</syntaxhighlight> |
|||
{{out}} |
|||
<pre>The three dogs are named Benjamin, Samba, and Bernie.</pre> |
|||
=={{header|Simula}}== |
|||
Simula identifiers are case-insensitive, and the compiler will indignantly reject a program that tries to declare multiple variables with names differing only in case. (Same with ''key words'': Case of a character in Simula ''code'' generally only matters in [http://simula67.at.ifi.uio.no/Standard-86/chap_1.htm| a simple string or a character constant].) |
|||
<syntaxhighlight lang="simula">begin |
|||
text dog; |
|||
dog :- blanks( 8 ); |
|||
dog := "Benjamin"; |
|||
Dog := "Samba"; |
|||
DOG := "Bernie"; |
|||
outtext( "There is just one dog, named " ); |
|||
outtext( dog ); |
|||
outimage |
|||
end</syntaxhighlight> |
|||
{{out}} |
|||
<pre>There is just one dog, named Bernie</pre> |
|||
=={{header|Smalltalk}}== |
|||
{{works with|GNU Smalltalk}} |
|||
var b9 = base-1 |
|||
Smalltalk's symbols are case sensitive. |
|||
var ran = b9.range.grep {|n| n%b9 == (n*n % b9) } |
|||
var x = min//b9 |
|||
<syntaxhighlight lang="smalltalk">|dog Dog DOG| |
|||
var r = [] |
|||
dog := 'Benjamin'. |
|||
Dog := 'Samba'. |
|||
DOG := 'Bernie'. |
|||
( 'The three dogs are named %1, %2 and %3' % |
|||
{ dog . Dog . DOG } ) displayNl.</syntaxhighlight> |
|||
loop { |
|||
Outputs: |
|||
ran.each {|n| |
|||
var k = (b9*x + n) |
|||
return r if (k > max) |
|||
r << k if (k >= min) |
|||
} |
|||
++x |
|||
} |
|||
return r |
|||
<pre>The three dogs are named Benjamin, Samba and Bernie</pre> |
|||
} |
|||
=={{header|SNOBOL4}}== |
|||
<syntaxhighlight lang="snobol4"> DOG = 'Benjamin' |
|||
Dog = 'Samba' |
|||
dog = 'Bernie' |
|||
OUTPUT = 'The three dogs are named ' DOG ', ' Dog ', and ' dog |
|||
END</syntaxhighlight> |
|||
{{out}} |
|||
<pre>The three dogs are named Benjamin, Samba, and Bernie</pre> |
|||
=={{header|Standard ML}}== |
|||
Standard ML is case sensitive. |
|||
<syntaxhighlight lang="sml">let |
|||
val dog = "Benjamin" |
|||
val Dog = "Samba" |
|||
val DOG = "Bernie" |
|||
in |
|||
print("The three dogs are named " ^ dog ^ ", " ^ Dog ^ ", and " ^ DOG ^ ".\n") |
|||
end;</syntaxhighlight> |
|||
{{out}} |
|||
<pre>The three dogs are named Benjamin, Samba, and Bernie.</pre> |
|||
=={{header|Stata}}== |
|||
Stata is case-sensitive. |
|||
say cast_out().join(' ') |
|||
<syntaxhighlight lang="stata">. local dog Benjamin |
|||
say cast_out(16).join(' ') |
|||
. local Dog Samba |
|||
say cast_out(17).join(' ')</syntaxhighlight> |
|||
. local DOG Bernie |
|||
{{out}} |
|||
. display "The three dogs are named $_dog, $_Dog, and $_DOG." |
|||
<pre> |
|||
The three dogs are named Benjamin, Samba, and Bernie.</syntaxhighlight> |
|||
1 9 10 18 19 27 28 36 37 45 46 54 55 63 64 72 73 81 82 90 91 99 |
|||
=={{header|Swift}}== |
|||
1 6 10 15 16 21 25 30 31 36 40 45 46 51 55 60 61 66 70 75 76 81 85 90 91 96 100 105 106 111 115 120 121 126 130 135 136 141 145 150 151 156 160 165 166 171 175 180 181 186 190 195 196 201 205 210 211 216 220 225 226 231 235 240 241 246 250 255 |
|||
<syntaxhighlight lang="swift">let dog = "Benjamin" |
|||
1 16 17 32 33 48 49 64 65 80 81 96 97 112 113 128 129 144 145 160 161 176 177 192 193 208 209 224 225 240 241 256 257 272 273 288 |
|||
let Dog = "Samba" |
|||
</pre> |
|||
let DOG = "Bernie" |
|||
println("The three dogs are named \(dog), \(Dog), and \(DOG).")</syntaxhighlight> |
|||
=={{header|Tcl}}== |
=={{header|Tcl}}== |
||
<syntaxhighlight lang="tcl">proc co9 {x} { |
|||
Tcl variable names are case sensitive: |
|||
while {[string length $x] > 1} { |
|||
<syntaxhighlight lang="tcl">set dog "Benjamin" |
|||
set x [tcl::mathop::+ {*}[split $x ""]] |
|||
set Dog "Samba" |
|||
} |
|||
set DOG "Bernie" |
|||
return $x |
|||
puts "The three dogs are named $dog, $Dog and $DOG"</syntaxhighlight> |
|||
} |
|||
Which prints... |
|||
# Extended to the general case |
|||
<pre>The three dogs are named Benjamin, Samba and Bernie</pre> |
|||
proc coBase {x {base 10}} { |
|||
=={{header|True BASIC}}== |
|||
while {$x >= $base} { |
|||
{{works with|QBasic}} |
|||
for {set digits {}} {$x} {set x [expr {$x / $base}]} { |
|||
True Basic is case-insensitive |
|||
lappend digits [expr {$x % $base}] |
|||
<syntaxhighlight lang="qbasic">LET dog$ = "Benjamin" |
|||
} |
|||
LET Dog$ = "Samba" |
|||
set x [tcl::mathop::+ {*}$digits] |
|||
LET DOG$ = "Bernie" |
|||
} |
|||
PRINT "There is just one dog, named "; dog$ |
|||
return $x |
|||
END</syntaxhighlight> |
|||
} |
|||
=={{header|UNIX Shell}}== |
|||
<syntaxhighlight lang="sh">dog="Benjamin" |
|||
Dog="Samba" |
|||
DOG="Bernie" |
|||
echo "The three dogs are named $dog, $Dog and $DOG."</syntaxhighlight> |
|||
# Simple helper |
|||
The three dogs are named Benjamin, Samba and Bernie. |
|||
proc percent {part whole} {format "%.2f%%" [expr {($whole - $part) * 100.0 / $whole}]} |
|||
=={{header|Ursa}}== |
|||
Ursa names are case sensitive: |
|||
<syntaxhighlight lang="ursa">> decl string dog Dog DOG |
|||
> set dog "Benjamin" |
|||
> set Dog "Samba" |
|||
> set DOG "Bernie" |
|||
> out "The three dogs are named " dog ", " Dog ", and " DOG endl console |
|||
The three dogs are named Benjamin, Samba, and Bernie |
|||
></syntaxhighlight> |
|||
=={{header|VBA}}== |
|||
VBA is case sensitive case insensitive. The variable names 'dog', 'Dog' and 'DOG' can not co-exist. |
|||
<syntaxhighlight lang="vb">Public Sub case_sensitivity() |
|||
'VBA does not allow variables that only differ in case |
|||
'The VBA IDE vbe will rename variable 'dog' to 'DOG' |
|||
'when trying to define a second variable 'DOG' |
|||
Dim DOG As String |
|||
DOG = "Benjamin" |
|||
DOG = "Samba" |
|||
DOG = "Bernie" |
|||
Debug.Print "There is just one dog named " & DOG |
|||
End Sub</syntaxhighlight>{{out}} |
|||
<pre>There is just one dog named Bernie</pre> |
|||
=={{header|Wren}}== |
|||
Identifiers in Wren are case sensitive. |
|||
<syntaxhighlight lang="ecmascript">var dog = "Benjamin" |
|||
var Dog = "Samba" |
|||
var DOG = "Bernie" |
|||
System.print("The three dogs are named %(dog), %(Dog) and %(DOG).")</syntaxhighlight> |
|||
puts "In base 10..." |
|||
{{out}} |
|||
set satisfying {} |
|||
for {set i 1} {$i < 100} {incr i} { |
|||
if {[co9 $i] == [co9 [expr {$i*$i}]]} { |
|||
lappend satisfying $i |
|||
} |
|||
} |
|||
puts $satisfying |
|||
puts "Trying [llength $satisfying] numbers instead of 99 numbers saves [percent [llength $satisfying] 99]" |
|||
puts "In base 16..." |
|||
set satisfying {} |
|||
for {set i 1} {$i < 256} {incr i} { |
|||
if {[coBase $i 16] == [coBase [expr {$i*$i}] 16]} { |
|||
lappend satisfying $i |
|||
} |
|||
} |
|||
puts $satisfying |
|||
puts "Trying [llength $satisfying] numbers instead of 255 numbers saves [percent [llength $satisfying] 255]"</syntaxhighlight> |
|||
{{out}}With some newlines inserted… |
|||
<pre> |
<pre> |
||
In base 10... |
|||
The three dogs are named Benjamin, Samba and Bernie. |
|||
1 9 10 18 19 27 28 36 37 45 46 54 55 63 64 72 73 81 82 90 91 99 |
|||
Trying 22 numbers instead of 99 numbers saves 77.78% |
|||
In base 16... |
|||
1 6 10 15 16 21 25 30 31 36 40 45 46 51 55 60 61 66 70 75 76 81 85 90 91 96 100 |
|||
105 106 111 115 120 121 126 130 135 136 141 145 150 151 156 160 165 166 171 175 |
|||
180 181 186 190 195 196 201 205 210 211 216 220 225 226 231 235 240 241 246 250 255 |
|||
Trying 68 numbers instead of 255 numbers saves 73.33% |
|||
</pre> |
</pre> |
||
=={{header| |
=={{header|Visual Basic .NET}}== |
||
{{trans|Java}} |
|||
In XBS variable names are case-sensitive. |
|||
<syntaxhighlight lang=" |
<syntaxhighlight lang="vbnet">Module Module1 |
||
Sub Print(ls As List(Of Integer)) |
|||
set DOG="Samba"; |
|||
Dim iter = ls.GetEnumerator |
|||
set Dog="Bernie"; |
|||
Console.Write("[") |
|||
log(`The three dogs are named {dog}, {DOG} and {Dog}.`);</syntaxhighlight> |
|||
If iter.MoveNext Then |
|||
Console.Write(iter.Current) |
|||
End If |
|||
While iter.MoveNext |
|||
Console.Write(", ") |
|||
Console.Write(iter.Current) |
|||
End While |
|||
Console.WriteLine("]") |
|||
End Sub |
|||
Function CastOut(base As Integer, start As Integer, last As Integer) As List(Of Integer) |
|||
Dim ran = Enumerable.Range(0, base - 1).Where(Function(y) y Mod (base - 1) = (y * y) Mod (base - 1)).ToArray() |
|||
Dim x = start \ (base - 1) |
|||
Dim result As New List(Of Integer) |
|||
While True |
|||
For Each n In ran |
|||
Dim k = (base - 1) * x + n |
|||
If k < start Then |
|||
Continue For |
|||
End If |
|||
If k > last Then |
|||
Return result |
|||
End If |
|||
result.Add(k) |
|||
Next |
|||
x += 1 |
|||
End While |
|||
Return result |
|||
End Function |
|||
Sub Main() |
|||
Print(CastOut(16, 1, 255)) |
|||
Print(CastOut(10, 1, 99)) |
|||
Print(CastOut(17, 1, 288)) |
|||
End Sub |
|||
End Module</syntaxhighlight> |
|||
{{out}} |
|||
<pre>[1, 6, 10, 15, 16, 21, 25, 30, 31, 36, 40, 45, 46, 51, 55, 60, 61, 66, 70, 75, 76, 81, 85, 90, 91, 96, 100, 105, 106, 111, 115, 120, 121, 126, 130, 135, 136, 141, 145, 150, 151, 156, 160, 165, 166, 171, 175, 180, 181, 186, 190, 195, 196, 201, 205, 210, 211, 216, 220, 225, 226, 231, 235, 240, 241, 246, 250, 255] |
|||
[1, 9, 10, 18, 19, 27, 28, 36, 37, 45, 46, 54, 55, 63, 64, 72, 73, 81, 82, 90, 91, 99] |
|||
[1, 16, 17, 32, 33, 48, 49, 64, 65, 80, 81, 96, 97, 112, 113, 128, 129, 144, 145, 160, 161, 176, 177, 192, 193, 208, 209, 224, 225, 240, 241, 256, 257, 272, 273, 288]</pre> |
|||
=={{header|Wren}}== |
|||
{{trans|D}} |
|||
<syntaxhighlight lang="ecmascript">var castOut = Fn.new { |base, start, end| |
|||
var b = base - 1 |
|||
var ran = (0...b).where { |n| n % b == (n * n) % b } |
|||
var x = (start/b).floor |
|||
var result = [] |
|||
while (true) { |
|||
for (n in ran) { |
|||
var k = b*x + n |
|||
if (k >= start) { |
|||
if (k > end) return result |
|||
result.add(k) |
|||
} |
|||
} |
|||
x = x + 1 |
|||
} |
|||
} |
|||
System.print(castOut.call(16, 1, 255)) |
|||
System.print() |
|||
System.print(castOut.call(10, 1, 99)) |
|||
System.print() |
|||
System.print(castOut.call(17, 1, 288))</syntaxhighlight> |
|||
{{out}} |
{{out}} |
||
<pre> |
<pre> |
||
[1, 6, 10, 15, 16, 21, 25, 30, 31, 36, 40, 45, 46, 51, 55, 60, 61, 66, 70, 75, 76, 81, 85, 90, 91, 96, 100, 105, 106, 111, 115, 120, 121, 126, 130, 135, 136, 141, 145, 150, 151, 156, 160, 165, 166, 171, 175, 180, 181, 186, 190, 195, 196, 201, 205, 210, 211, 216, 220, 225, 226, 231, 235, 240, 241, 246, 250, 255] |
|||
The three dogs are named Benjamin, Samba and Bernie. |
|||
[1, 9, 10, 18, 19, 27, 28, 36, 37, 45, 46, 54, 55, 63, 64, 72, 73, 81, 82, 90, 91, 99] |
|||
[1, 16, 17, 32, 33, 48, 49, 64, 65, 80, 81, 96, 97, 112, 113, 128, 129, 144, 145, 160, 161, 176, 177, 192, 193, 208, 209, 224, 225, 240, 241, 256, 257, 272, 273, 288] |
|||
</pre> |
</pre> |
||
=={{header|XLISP}}== |
|||
XLISP is entirely case-insensitive. The user can decide whether to have the system print symbols, etc., in capitals or in lower case, by assigning to the variable <tt>*PRINT-CASE*</tt>. |
|||
<syntaxhighlight lang="xlisp">(SETQ DOG 'BENJAMIN) |
|||
(SETQ Dog 'SAMBA) |
|||
(SETQ dog 'BERNIE) |
|||
(DISPLAY `(THERE IS JUST ONE DOG NAMED ,DOG))</syntaxhighlight> |
|||
There is, in any event, only one dog. |
|||
<pre>(THERE IS JUST ONE DOG NAMED BERNIE)</pre> |
|||
=={{header|XPL0}}== |
|||
XPL0 is normally case-insensitive, so there is really just one dog named |
|||
Bernie. However, it has a command-line switch (/c) that turns case |
|||
sensitivity on. All names must start with a capital letter (or an underline, so they can't |
|||
clash with command words such as 'for'). Thus "dog" cannot be used as a |
|||
name, but Dog, DOG and DoG (and For) can. The intent of the command-line |
|||
switch (/c) is to detect inconsistent capitalizing of names such as |
|||
Ascii and ASCII or CpuReg and CPUReg. |
|||
=={{header|Yabasic}}== |
|||
Yabasic names are case sensitive: |
|||
<syntaxhighlight lang="yabasic"> |
|||
dog$ = "Benjamin" |
|||
Dog$ = "Samba" |
|||
DOG$ = "Bernie" |
|||
print "The three dogs are named ", dog$, ", ", Dog$, " and ", DOG$ |
|||
end</syntaxhighlight> |
|||
=={{header|zkl}}== |
=={{header|zkl}}== |
||
{{trans|D}} |
|||
<syntaxhighlight lang="zkl">var dog = "Benjamin", Dog = "Samba", DOG = "Bernie";</syntaxhighlight> |
|||
<syntaxhighlight lang="zkl">fcn castOut(base=10, start=1, end=999999){ |
|||
base-=1; |
|||
ran:=(0).filter(base,'wrap(n){ n%base == (n*n)%base }); |
|||
result:=Sink(List); |
|||
foreach a,b in ([start/base ..],ran){ // foreach{ foreach {} } |
|||
k := base*a + b; |
|||
if (k < start) continue; |
|||
if (k > end) return(result.close()); |
|||
result.write(k); |
|||
} |
|||
// doesn't get here |
|||
}</syntaxhighlight> |
|||
<syntaxhighlight lang="zkl">castOut(16, 1, 255).toString(*).println("\n-----"); |
|||
castOut(10, 1, 99).toString(*).println("\n-----"); |
|||
castOut(17, 1, 288).toString(*).println();</syntaxhighlight> |
|||
{{out}} |
{{out}} |
||
<pre> |
<pre> |
||
L(1,6,10,15,16,21,25,30,31,36,40,45,46,51,55,60,61,66,70,75, |
|||
vars |
|||
76,81,85,90,91,96,100,105,106,111,115,120,121,126,130,135,136, |
|||
L(L("DOG","Bernie"),L("Dog","Samba"),L("dog","Benjamin")) |
|||
141,145,150,151,156,160,165,166,171,175,180,181,186,190,195,196, |
|||
201,205,210,211,216,220,225,226,231,235,240,241,246,250,255) |
|||
----- |
|||
L(1,9,10,18,19,27,28,36,37,45,46,54,55,63,64,72,73,81,82,90,91,99) |
|||
----- |
|||
L(1,16,17,32,33,48,49,64,65,80,81,96,97,112,113,128, |
|||
129,144,145,160,161,176,177,192,193,208,209,224,225,240, |
|||
241,256,257,272,273,288) |
|||
</pre> |
</pre> |
||
=={{header|ZX Spectrum Basic}}== |
=={{header|ZX Spectrum Basic}}== |
||
{{trans|C++}} |
|||
<syntaxhighlight lang="basic">10 LET D$="Benjamin" |
|||
<syntaxhighlight lang="zxbasic">10 LET Base=10 |
|||
20 PRINT "There is just one dog named ";d$</syntaxhighlight> |
|||
20 LET N=2 |
|||
{{omit from|360 Assembly}} |
|||
30 LET c1=0 |
|||
{{omit from|6502 Assembly|Depends on assembler. Some have a -nocase command line argument that ignores sensitivity of labels.}} |
|||
40 LET c2=0 |
|||
{{omit from|8051 Assembly}} |
|||
50 LET k=1 |
|||
{{omit from|8080 Assembly}} |
|||
60 IF k>=(Base^N)-1 THEN GO TO 150 |
|||
{{omit from|8086 Assembly}} |
|||
70 LET c1=c1+1 |
|||
{{omit from|68000 Assembly}} |
|||
80 IF FN m(k,Base-1)=FN m(k*k,Base-1) THEN LET c2=c2+1: PRINT k;" "; |
|||
{{omit from|AArch64 Assembly}} |
|||
90 LET k=k+1 |
|||
{{omit from|ARM Assembly}} |
|||
100 GO TO 60 |
|||
{{omit from|MIPS Assembly}} |
|||
150 PRINT '"Trying ";c2;" numbers instead of ";c1;" numbers saves ";100-(c2/c1)*100;"%" |
|||
{{omit from|sed|No variables.}} |
|||
160 STOP |
|||
{{omit from|x86 Assembly}} |
|||
170 DEF FN m(a,b)=a-INT (a/b)*b |
|||
{{omit from|Z80 Assembly}} |
|||
</syntaxhighlight> |
|||
{{omit from|GUISS}} |
Revision as of 22:47, 30 August 2022
You are encouraged to solve this task according to the task description, using any language you may know.
- Task (in three parts)
- Part 1
Write a procedure (say ) which implements Casting Out Nines as described by returning the checksum for . Demonstrate the procedure using the examples given there, or others you may consider lucky.
- Part 2
Notwithstanding past Intel microcode errors, checking computer calculations like this would not be sensible. To find a computer use for your procedure:
- Consider the statement "318682 is 101558 + 217124 and squared is 101558217124" (see: Kaprekar numbers#Casting Out Nines (fast)).
- note that has the same checksum as ();
- note that has the same checksum as () because for a Kaprekar they are made up of the same digits (sometimes with extra zeroes);
- note that this implies that for Kaprekar numbers the checksum of equals the checksum of .
Demonstrate that your procedure can be used to generate or filter a range of numbers with the property and show that this subset is a small proportion of the range and contains all the Kaprekar in the range.
- Part 3
Considering this MathWorld page, produce a efficient algorithm based on the more mathematical treatment of Casting Out Nines, and realizing:
- is the residual of mod ;
- the procedure can be extended to bases other than 9.
Demonstrate your algorithm by generating or filtering a range of numbers with the property and show that this subset is a small proportion of the range and contains all the Kaprekar in the range.
- related tasks
11l
F CastOut(Base, Start, End)
V ran = (0 .< Base - 1).filter(y -> y % (@Base - 1) == (y * y) % (@Base - 1))
V (x, y) = divmod(Start, Base - 1)
[Int] r
L
L(n) ran
V k = (Base - 1) * x + n
I k < Start
L.continue
I k > End
R r
r.append(k)
x++
L(v) CastOut(Base' 16, Start' 1, End' 255)
print(v, end' ‘ ’)
print()
L(v) CastOut(Base' 10, Start' 1, End' 99)
print(v, end' ‘ ’)
print()
L(v) CastOut(Base' 17, Start' 1, End' 288)
print(v, end' ‘ ’)
print()
- Output:
1 6 10 15 16 21 25 30 31 36 40 45 46 51 55 60 61 66 70 75 76 81 85 90 91 96 100 105 106 111 115 120 121 126 130 135 136 141 145 150 151 156 160 165 166 171 175 180 181 186 190 195 196 201 205 210 211 216 220 225 226 231 235 240 241 246 250 255 1 9 10 18 19 27 28 36 37 45 46 54 55 63 64 72 73 81 82 90 91 99 1 16 17 32 33 48 49 64 65 80 81 96 97 112 113 128 129 144 145 160 161 176 177 192 193 208 209 224 225 240 241 256 257 272 273 288
360 Assembly
The program uses two ASSIST macros (XDECO,XPRNT) to keep the code as short as possible.
* Casting out nines 08/02/2017
CASTOUT CSECT
USING CASTOUT,R13 base register
B 72(R15) skip savearea
DC 17F'0' savearea
STM R14,R12,12(R13) prolog
ST R13,4(R15) " <-
ST R15,8(R13) " ->
LR R13,R15 " addressability
L R1,LOW low
XDECO R1,XDEC edit low
MVC PGT+4(4),XDEC+8 output low
L R1,HIGH high
XDECO R1,XDEC edit high
MVC PGT+12(4),XDEC+8 output low
L R1,BASE base
XDECO R1,XDEC edit base
MVC PGT+24(4),XDEC+8 output base
XPRNT PGT,L'PGT print buffer
L R2,BASE base
BCTR R2,0 -1
ST R2,RM rm=base-1
LA R8,PG ipg=0
SR R7,R7 j=0
L R6,LOW i=low
DO WHILE=(C,R6,LE,HIGH) do i=low to high
LR R5,R6 i
SR R4,R4 clear for div
D R4,RM /rm
LR R2,R4 r2=i mod rm
LR R5,R6 i
MR R4,R6 i*i
SR R4,R4 clear for div
D R4,RM /rm
IF CR,R2,EQ,R4 THEN if (i//rm)=(i*i//rm) then
LA R7,1(R7) j=j+1
XDECO R6,XDEC edit i
MVC 0(4,R8),XDEC+8 output i
LA R8,4(R8) ipg=ipg+4
IF C,R7,EQ,=F'20' THEN if j=20 then
XPRNT PG,L'PG print buffer
LA R8,PG ipg=0
SR R7,R7 j=0
MVC PG,=CL80' ' clear buffer
ENDIF , end if
ENDIF , end if
LA R6,1(R6) i=i+1
ENDDO , end do i
IF LTR,R7,NE,R7 THEN if j<>0 then
XPRNT PG,L'PG print buffer
ENDIF , end if
L R13,4(0,R13) epilog
LM R14,R12,12(R13) " restore
XR R15,R15 " rc=0
BR R14 exit
LOW DC F'1' low
HIGH DC F'500' high
BASE DC F'10' base
RM DS F rm
PGT DC CL80'for ... to ... base ...' buffer
PG DC CL80' ' buffer
XDEC DS CL12 temp for xdeco
YREGS
END CASTOUT
- Output:
for 1 to 500 base 10 1 9 10 18 19 27 28 36 37 45 46 54 55 63 64 72 73 81 82 90 91 99 100 108 109 117 118 126 127 135 136 144 145 153 154 162 163 171 172 180 181 189 190 198 199 207 208 216 217 225 226 234 235 243 244 252 253 261 262 270 271 279 280 288 289 297 298 306 307 315 316 324 325 333 334 342 343 351 352 360 361 369 370 378 379 387 388 396 397 405 406 414 415 423 424 432 433 441 442 450 451 459 460 468 469 477 478 486 487 495 496
Action!
INT FUNC Power(INT a,b)
INT i,res
res=1
FOR i=1 TO b
DO
res==*a
OD
RETURN (res)
PROC Main()
DEFINE BASE="10"
DEFINE N="2"
INT i,max,count,total,perc
max=Power(BASE,N)
count=0 total=0
FOR i=1 TO max
DO
total==+1
IF i MOD (BASE-1)=(i*i) MOD (BASE-1) THEN
count==+1
PrintI(i) Put(32)
FI
OD
perc=100-100*count/total
PrintF("%E%ETrying %I numbers instead of %I numbers saves %I%%",count,total,perc)
RETURN
- Output:
Screenshot from Atari 8-bit computer
1 9 10 18 19 27 28 36 37 45 46 54 55 63 64 72 73 81 82 90 91 99 100 Trying 23 numbers instead of 100 numbers saves 77%
ALGOL 68
BEGIN # casting out nines - translated from the Action! sample #
INT base = 10;
INT n = 2;
INT count := 0;
INT total := 0;
FOR i TO base ^ n DO
total +:= 1;
IF i MOD ( base - 1 ) = ( i * i ) MOD ( base - 1 ) THEN
count +:= 1;
print( ( whole( i, 0 ), " " ) )
FI
OD;
print( ( newline, newline, "Trying ", whole( count, 0 )
, " numbers instead of ", whole( total, 0 )
, " numbers saves ", fixed( 100 - ( ( 100 * count ) / total ), -6, 2 )
, "%", newline
)
)
END
- Output:
1 9 10 18 19 27 28 36 37 45 46 54 55 63 64 72 73 81 82 90 91 99 100 Trying 23 numbers instead of 100 numbers saves 77.00%
Arturo
N: 2
base: 10
c1: 0
c2: 0
loop 1..(base^N)-1 'k [
c1: c1 + 1
if (k%base-1)= (k*k)%base-1 [
c2: c2 + 1
prints ~"|k| "
]
]
print ""
print ["Trying" c2 "numbers instead of" c1 "numbers saves" 100.0 - 100.0*c2//c1 "%"]
- Output:
1 9 10 18 19 27 28 36 37 45 46 54 55 63 64 72 73 81 82 90 91 99 Trying 22 numbers instead of 99 numbers saves 77.77777777777777 %
AWK
# syntax: GAWK -f CASTING_OUT_NINES.AWK
# converted from C
BEGIN {
base = 10
for (k=1; k<=base^2; k++) {
c1++
if (k % (base-1) == (k*k) % (base-1)) {
c2++
printf("%d ",k)
}
}
printf("\nTrying %d numbers instead of %d numbers saves %.2f%%\n",c2,c1,100-(100*c2/c1))
exit(0)
}
- Output:
1 9 10 18 19 27 28 36 37 45 46 54 55 63 64 72 73 81 82 90 91 99 100 Trying 23 numbers instead of 100 numbers saves 77.00%
C
#include <stdio.h>
#include <math.h>
int main() {
const int N = 2;
int base = 10;
int c1 = 0;
int c2 = 0;
int k;
for (k = 1; k < pow(base, N); k++) {
c1++;
if (k % (base - 1) == (k * k) % (base - 1)) {
c2++;
printf("%d ", k);
}
}
printf("\nTring %d numbers instead of %d numbers saves %f%%\n", c2, c1, 100.0 - 100.0 * c2 / c1);
return 0;
}
- Output:
1 9 10 18 19 27 28 36 37 45 46 54 55 63 64 72 73 81 82 90 91 99 Tring 22 numbers instead of 99 numbers saves 77.777778%
C#
using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
namespace CastingOutNines {
public static class Helper {
public static string AsString<T>(this IEnumerable<T> e) {
var it = e.GetEnumerator();
StringBuilder builder = new StringBuilder();
builder.Append("[");
if (it.MoveNext()) {
builder.Append(it.Current);
}
while (it.MoveNext()) {
builder.Append(", ");
builder.Append(it.Current);
}
builder.Append("]");
return builder.ToString();
}
}
class Program {
static List<int> CastOut(int @base, int start, int end) {
int[] ran = Enumerable
.Range(0, @base - 1)
.Where(a => a % (@base - 1) == (a * a) % (@base - 1))
.ToArray();
int x = start / (@base - 1);
List<int> result = new List<int>();
while (true) {
foreach (int n in ran) {
int k = (@base - 1) * x + n;
if (k < start) {
continue;
}
if (k > end) {
return result;
}
result.Add(k);
}
x++;
}
}
static void Main() {
Console.WriteLine(CastOut(16, 1, 255).AsString());
Console.WriteLine(CastOut(10, 1, 99).AsString());
Console.WriteLine(CastOut(17, 1, 288).AsString());
}
}
}
- Output:
[1, 6, 10, 15, 16, 21, 25, 30, 31, 36, 40, 45, 46, 51, 55, 60, 61, 66, 70, 75, 76, 81, 85, 90, 91, 96, 100, 105, 106, 111, 115, 120, 121, 126, 130, 135, 136, 141, 145, 150, 151, 156, 160, 165, 166, 171, 175, 180, 181, 186, 190, 195, 196, 201, 205, 210, 211, 216, 220, 225, 226, 231, 235, 240, 241, 246, 250, 255] [1, 9, 10, 18, 19, 27, 28, 36, 37, 45, 46, 54, 55, 63, 64, 72, 73, 81, 82, 90, 91, 99] [1, 16, 17, 32, 33, 48, 49, 64, 65, 80, 81, 96, 97, 112, 113, 128, 129, 144, 145, 160, 161, 176, 177, 192, 193, 208, 209, 224, 225, 240, 241, 256, 257, 272, 273, 288]
C++
Filter
// Casting Out Nines
//
// Nigel Galloway. June 24th., 2012
//
#include <iostream>
int main() {
int Base = 10;
const int N = 2;
int c1 = 0;
int c2 = 0;
for (int k=1; k<pow((double)Base,N); k++){
c1++;
if (k%(Base-1) == (k*k)%(Base-1)){
c2++;
std::cout << k << " ";
}
}
std::cout << "\nTrying " << c2 << " numbers instead of " << c1 << " numbers saves " << 100 - ((double)c2/c1)*100 << "%" <<std::endl;
return 0;
}
- Produces:
1 9 10 18 19 27 28 36 37 45 46 54 55 63 64 72 73 81 82 90 91 99 Trying 22 numbers instead of 99 numbers saves 77.7778%
The kaprekar numbers in this range 1 9 45 55 and 99 are included.
Changing: "int Base = 16;
" Produces:
1 6 10 15 16 21 25 30 31 36 40 45 46 51 55 60 61 66 70 75 76 81 85 90 91 96 100 105 106 111 115 120 121 126 130 135 136 141 145 150 151 156 160 165 166 171 175 180 181 186 190 195 196 201 205 210 211 216 220 225 226 231 235 240 241 246 250 255 Trying 68 numbers instead of 255 numbers saves 73.3333%
The kaprekar numbers:
- 1 is 1
- 6 is 6
- a is 10
- f is 15
- 33 is 51
- 55 is 85
- 5b is 91
- 78 is 120
- 88 is 136
- ab is 171
- cd is 205
- ff is 255
in this range are included.
Changing: "int Base = 17;
" Produces:
1 16 17 32 33 48 49 64 65 80 81 96 97 112 113 128 129 144 145 160 161 176 177 19 2 193 208 209 224 225 240 241 256 257 272 273 288 Trying 36 numbers instead of 288 numbers saves 87.5%
The kaprekar numbers:
- 1 is 1
- g is 16
- 3d is 64
- d4 is 225
- gg is 288
in this range are included.
C++11 For Each Generator
// Casting Out Nines Generator - Compiles with gcc4.6, MSVC 11, and CLang3
//
// Nigel Galloway. June 24th., 2012
//
#include <iostream>
#include <vector>
struct ran {
const int base;
std::vector<int> rs;
ran(const int base) : base(base) { for (int nz=0; nz<base-1; nz++) if(nz*(nz-1)%(base-1) == 0) rs.push_back(nz); }
};
class co9 {
private:
const ran* _ran;
const int _end;
int _r,_x,_next;
public:
bool operator!=(const co9& other) const {return operator*() <= _end;}
co9 begin() const {return *this;}
co9 end() const {return *this;}
int operator*() const {return _next;}
co9(const int start, const int end, const ran* r)
:_ran(r)
,_end(end)
,_r(1)
,_x(start/_ran->base)
,_next((_ran->base-1)*_x + _ran->rs[_r])
{
while (operator*() < start) operator++();
}
const co9& operator++() {
const int oldr = _r;
_r = ++_r%_ran->rs.size();
if (_r<oldr) _x++;
_next = (_ran->base-1)*_x + _ran->rs[_r];
return *this;
}
};
int main() {
ran r(10);
for (int i : co9(1,99,&r)) { std::cout << i << ' '; }
return 0;
}
- Produces:
1 9 10 18 19 27 28 36 37 45 46 54 55 63 64 72 73 81 82 90 91 99
An alternative implementation for struct ran using http://rosettacode.org/wiki/Sum_digits_of_an_integer#C.2B.2B which produces the same result is:
struct ran {
const int base;
std::vector<int> rs;
ran(const int base) : base(base) { for (int nz=0; nz<base-1; nz++) if(SumDigits(nz) == SumDigits(nz*nz)) rs.push_back(nz); }
};
Changing main:
int main() {
ran r(16);
for (int i : co9(1,255,&r)) { std::cout << i << ' '; }
return 0;
}
- Produces:
1 6 10 15 16 21 25 30 31 36 40 45 46 51 55 60 61 66 70 75 76 81 85 90 91 96 100 105 106 111 115 120 121 126 130 135 136 141 145 150 151 156 160 165 166 171 175 180 181 186 190 195 196 201 205 210 211 216 220 225 226 231 235 240 241 246 250 255
Changing main:
int main() {
ran r(17);
for (int i : co9(1,288,&r)) { std::cout << i << ' '; }
return 0;
}
- Produces:
1 16 17 32 33 48 49 64 65 80 81 96 97 112 113 128 129 144 145 160 161 176 177 192 193 208 209 224 225 240 241 256 257 272 273 288
Common Lisp
;;A macro was used to ensure that the filter is inlined.
;;Larry Hignight. Last updated on 7/3/2012.
(defmacro kaprekar-number-filter (n &optional (base 10))
`(= (mod ,n (1- ,base)) (mod (* ,n ,n) (1- ,base))))
(defun test (&key (start 1) (stop 10000) (base 10) (collect t))
(let ((count 0)
(nums))
(loop for i from start to stop do
(when (kaprekar-number-filter i base)
(if collect (push i nums))
(incf count)))
(format t "~d potential Kaprekar numbers remain (~~~$% filtered out).~%"
count (* (/ (- stop count) stop) 100))
(if collect (reverse nums))))
- Output:
CL-USER> (test :stop 99) 22 potential Kaprekar numbers remain (~77.78% filtered out). (1 9 10 18 19 27 28 36 37 45 ...) CL-USER> (test :stop 10000 :collect nil) 2223 potential Kaprekar numbers remain (~77.77% filtered out). NIL CL-USER> (test :stop 1000000 :collect nil) 222223 potential Kaprekar numbers remain (~77.78% filtered out). NIL CL-USER> (test :stop 255 :base 16) 68 potential Kaprekar numbers remain (~73.33% filtered out). (1 6 10 15 16 21 25 30 31 36 ...) CL-USER> (test :stop 288 :base 17) 36 potential Kaprekar numbers remain (~87.50% filtered out). (1 16 17 32 33 48 49 64 65 80 ...)
D
import std.stdio, std.algorithm, std.range;
uint[] castOut(in uint base=10, in uint start=1, in uint end=999999) {
auto ran = iota(base - 1)
.filter!(x => x % (base - 1) == (x * x) % (base - 1));
auto x = start / (base - 1);
immutable y = start % (base - 1);
typeof(return) result;
while (true) {
foreach (immutable n; ran) {
immutable k = (base - 1) * x + n;
if (k < start)
continue;
if (k > end)
return result;
result ~= k;
}
x++;
}
}
void main() {
castOut(16, 1, 255).writeln;
castOut(10, 1, 99).writeln;
castOut(17, 1, 288).writeln;
}
- Output (some newlines added):
[1, 6, 10, 15, 16, 21, 25, 30, 31, 36, 40, 45, 46, 51, 55, 60, 61, 66, 70, 75, 76, 81, 85, 90, 91, 96, 100, 105, 106, 111, 115, 120, 121, 126, 130, 135, 136, 141, 145, 150, 151, 156, 160, 165, 166, 171, 175, 180, 181, 186, 190, 195, 196, 201, 205, 210, 211, 216, 220, 225, 226, 231, 235, 240, 241, 246, 250, 255] [1, 9, 10, 18, 19, 27, 28, 36, 37, 45, 46, 54, 55, 63, 64, 72, 73, 81, 82, 90, 91, 99] [1, 16, 17, 32, 33, 48, 49, 64, 65, 80, 81, 96, 97, 112, 113, 128, 129, 144, 145, 160, 161, 176, 177, 192, 193, 208, 209, 224, 225, 240, 241, 256, 257, 272, 273, 288]
Free Pascal
program castout9;
{$ifdef fpc}{$mode delphi}{$endif}
uses generics.collections;
type
TIntegerList = TSortedList<integer>;
procedure co9(const start,base,lim:integer;kaprekars:array of integer);
var
C1:integer = 0;
C2:integer = 0;
S:TIntegerlist;
k,i:integer;
begin
S:=TIntegerlist.Create;
for k := start to lim do
begin
inc(C1);
if k mod (base-1) = (k*k) mod (base-1) then
begin
inc(C2);
S.Add(k);
end;
end;
writeln('Valid subset: ');
for i in Kaprekars do
if not s.contains(i) then
writeln('invalid ',i);
for i in s do write(i:4);
writeln;
write('The Kaprekars in this range [');
for i in kaprekars do write(i:4);
writeln('] are included');
writeln('Trying ',C2, ' numbers instead of ', C1,' saves ',100-(C2 * 100 /C1):3:2,',%.');
writeln;
S.Free;
end;
begin
co9(1, 10, 99, [1,9,45,55,99]);
co9(1, 10, 1000, [1,9,45,55,99,297,703,999]);
end.
Output: Valid subset: 1 9 10 18 19 27 28 36 37 45 46 54 55 63 64 72 73 81 82 90 91 99 The Kaprekars in this range [ 1 9 45 55 99] are included Trying 22 numbers instead of 99 saves 77.78,%. Valid subset: 1 9 10 18 19 27 28 36 37 45 46 54 55 63 64 72 73 81 82 90 91 99 100 108 109 117 118 126 127 135 136 144 145 153 154 162 163 171 172 180 181 189 190 198 199 207 208 216 217 225 226 234 235 243 244 252 253 261 262 270 271 279 280 288 289 297 298 306 307 315 316 324 325 333 334 342 343 351 352 360 361 369 370 378 379 387 388 396 397 405 406 414 415 423 424 432 433 441 442 450 451 459 460 468 469 477 478 486 487 495 496 504 505 513 514 522 523 531 532 540 541 549 550 558 559 567 568 576 577 585 586 594 595 603 604 612 613 621 622 630 631 639 640 648 649 657 658 666 667 675 676 684 685 693 694 702 703 711 712 720 721 729 730 738 739 747 748 756 757 765 766 774 775 783 784 792 793 801 802 810 811 819 820 828 829 837 838 846 847 855 856 864 865 873 874 882 883 891 892 900 901 909 910 918 919 927 928 936 937 945 946 954 955 963 964 972 973 981 982 990 991 9991000 The Kaprekars in this range [ 1 9 45 55 99 297 703 999] are included Trying 223 numbers instead of 1000 saves 77.70,%.
FreeBASIC
Const base10 = 10
Dim As Integer c1 = 0, c2 = 0, k = 1
For k = 1 To base10^2
c1 += 1
If (k Mod (base10-1) = (k*k) Mod (base10-1)) Then c2 += 1: Print k;" ";
Next k
Print
Print Using "Intentar ## numeros en lugar de ### numeros ahorra un ##.##%"; c2; c1; 100-(100*c2/c1)
Sleep
- Output:
1 9 10 18 19 27 28 36 37 45 46 54 55 63 64 72 73 81 82 90 91 99 100 Intentar 23 numeros en lugar de 100 numeros ahorra un 77.00%
Go
package main
import (
"fmt"
"log"
"strconv"
)
// A casting out nines algorithm.
// Quoting from: http://mathforum.org/library/drmath/view/55926.html
/*
First, for any number we can get a single digit, which I will call the
"check digit," by repeatedly adding the digits. That is, we add the
digits of the number, then if there is more than one digit in the
result we add its digits, and so on until there is only one digit
left.
...
You may notice that when you add the digits of 6395, if you just
ignore the 9, and the 6+3 = 9, you still end up with 5 as your check
digit. This is because any 9's make no difference in the result.
That's why the process is called "casting out" nines. Also, at any
step in the process, you can add digits, not just at the end: to do
8051647, I can say 8 + 5 = 13, which gives 4; plus 1 is 5, plus 6 is
11, which gives 2, plus 4 is 6, plus 7 is 13 which gives 4. I never
have to work with numbers bigger than 18.
*/
// The twist is that co9Peterson returns a function to do casting out nines
// in any specified base from 2 to 36.
func co9Peterson(base int) (cob func(string) (byte, error), err error) {
if base < 2 || base > 36 {
return nil, fmt.Errorf("co9Peterson: %d invalid base", base)
}
// addDigits adds two digits in the specified base.
// People perfoming casting out nines by hand would usually have their
// addition facts memorized. In a program, a lookup table might be
// analogous, but we expediently use features of the programming language
// to add digits in the specified base.
addDigits := func(a, b byte) (string, error) {
ai, err := strconv.ParseInt(string(a), base, 64)
if err != nil {
return "", err
}
bi, err := strconv.ParseInt(string(b), base, 64)
if err != nil {
return "", err
}
return strconv.FormatInt(ai+bi, base), nil
}
// a '9' in the specified base. that is, the greatest digit.
s9 := strconv.FormatInt(int64(base-1), base)
b9 := s9[0]
// define result function. The result function may return an error
// if n is not a valid number in the specified base.
cob = func(n string) (r byte, err error) {
r = '0'
for i := 0; i < len(n); i++ { // for each digit of the number
d := n[i]
switch {
case d == b9: // if the digit is '9' of the base, cast it out
continue
// if the result so far is 0, the digit becomes the result
case r == '0':
r = d
continue
}
// otherwise, add the new digit to the result digit
s, err := addDigits(r, d)
if err != nil {
return 0, err
}
switch {
case s == s9: // if the sum is "9" of the base, cast it out
r = '0'
continue
// if the sum is a single digit, it becomes the result
case len(s) == 1:
r = s[0]
continue
}
// otherwise, reduce this two digit intermediate result before
// continuing.
r, err = cob(s)
if err != nil {
return 0, err
}
}
return
}
return
}
// Subset code required by task. Given a base and a range specified with
// beginning and ending number in that base, return candidate Kaprekar numbers
// based on the observation that k%(base-1) must equal (k*k)%(base-1).
// For the % operation, rather than the language built-in operator, use
// the method of casting out nines, which in fact implements %(base-1).
func subset(base int, begin, end string) (s []string, err error) {
// convert begin, end to native integer types for easier iteration
begin64, err := strconv.ParseInt(begin, base, 64)
if err != nil {
return nil, fmt.Errorf("subset begin: %v", err)
}
end64, err := strconv.ParseInt(end, base, 64)
if err != nil {
return nil, fmt.Errorf("subset end: %v", err)
}
// generate casting out nines function for specified base
cob, err := co9Peterson(base)
if err != nil {
return
}
for k := begin64; k <= end64; k++ {
ks := strconv.FormatInt(k, base)
rk, err := cob(ks)
if err != nil { // assertion
panic(err) // this would indicate a bug in subset
}
rk2, err := cob(strconv.FormatInt(k*k, base))
if err != nil { // assertion
panic(err) // this would indicate a bug in subset
}
// test for candidate Kaprekar number
if rk == rk2 {
s = append(s, ks)
}
}
return
}
var testCases = []struct {
base int
begin, end string
kaprekar []string
}{
{10, "1", "100", []string{"1", "9", "45", "55", "99"}},
{17, "10", "gg", []string{"3d", "d4", "gg"}},
}
func main() {
for _, tc := range testCases {
fmt.Printf("\nTest case base = %d, begin = %s, end = %s:\n",
tc.base, tc.begin, tc.end)
s, err := subset(tc.base, tc.begin, tc.end)
if err != nil {
log.Fatal(err)
}
fmt.Println("Subset: ", s)
fmt.Println("Kaprekar:", tc.kaprekar)
sx := 0
for _, k := range tc.kaprekar {
for {
if sx == len(s) {
fmt.Printf("Fail:", k, "not in subset")
return
}
if s[sx] == k {
sx++
break
}
sx++
}
}
fmt.Println("Valid subset.")
}
}
- Output:
Test case base = 10, begin = 1, end = 100: Subset: [1 9 10 18 19 27 28 36 37 45 46 54 55 63 64 72 73 81 82 90 91 99 100] Kaprekar: [1 9 45 55 99] Valid subset. Test case base = 17, begin = 10, end = gg: Subset: [10 1f 1g 2e 2f 3d 3e 4c 4d 5b 5c 6a 6b 79 7a 88 89 97 98 a6 a7 b5 b6 c4 c5 d3 d4 e2 e3 f1 f2 g0 g1 gg] Kaprekar: [3d d4 gg] Valid subset.
Haskell
co9 n
| n <= 8 = n
| otherwise = co9 $ sum $ filter (/= 9) $ digits 10 n
task2 = filter (\n -> co9 n == co9 (n ^ 2)) [1 .. 100]
task3 k = filter (\n -> n `mod` k == n ^ 2 `mod` k) [1 .. 100]
Auxillary function, returning digits of a number for given base
digits base = map (`mod` base) . takeWhile (> 0) . iterate (`div` base)
or using unfolding:
digits base = Data.List.unfoldr modDiv
where modDiv 0 = Nothing
modDiv n = let (q, r) = (n `divMod` base) in Just (r, q)
Output
λ> co9 232345 1 λ> co9 34234234 7 λ> co9 (232345 + 34234234) == co9 232345 + co9 34234234 True λ> co9 (232345 * 34234234) == co9 232345 * co9 34234234 True λ> task2 [1,9,10,18,19,27,28,36,37,45,46,54,55,63,64,72,73,81,82,90,91,99,100] λ> task2 == (task3 9) True λ> task3 16 [1,16,17,32,33,48,49,64,65,80,81,96,97]
Finally it is possible to test usefull properties of co9
with QuickCheck:
λ> :m Test.QuickCheck λ> quickCheck (\a -> a > 0 ==> co9 a == a `mod` 9) +++ OK, passed 100 tests. λ> quickCheck (\a b -> a > 0 && b > 0 ==> co9 (co9 a + co9 b) == co9 (a+b)) +++ OK, passed 100 tests. λ> quickCheck (\a b -> a > 0 && b > 0 ==> co9 (co9 a * co9 b) == co9 (a*b)) +++ OK, passed 100 tests.
J
This is an implementation of: "given two numbers which mark the beginning and end of a range of integers, and another number which denotes an integer base, return numbers from within the range where the number is equal (modulo the base minus 1) to its square". At the time of this writing, this task is a draft task and this description does not precisely match the task description on this page. Eventually, either the task description will change to match this implementation (which means this paragraph should be removed) or the task description will change to conflict with this implementation (so this entire section should be re-written).
castout=: 1 :0
[: (#~ ] =&((m-1)&|) *:) <. + [: i. (+*)@-~
)
Example use:
0 (10 castout) 100
0 1 9 10 18 19 27 28 36 37 45 46 54 55 63 64 72 73 81 82 90 91 99 100
Alternate implementation:
castout=: 1 :0
[: (#~ 0 = (m-1) | 0 _1 1&p.) <. + [: i. (+*)@-~
)
Note that about half of the code here is the code that implements "range of numbers". If we factor that out, and represent the desired values directly the code becomes much simpler:
(#~ 0=9|0 _1 1&p.) i.101
0 1 9 10 18 19 27 28 36 37 45 46 54 55 63 64 72 73 81 82 90 91 99 100
(#~ ] =&(9&|) *:) i. 101
0 1 9 10 18 19 27 28 36 37 45 46 54 55 63 64 72 73 81 82 90 91 99 100
And, of course, we can name parts of these expressions. For example:
(#~ ] =&(co9=: 9&|) *:) i. 101
0 1 9 10 18 19 27 28 36 37 45 46 54 55 63 64 72 73 81 82 90 91 99 100
Or, if you prefer:
co9=: 9&|
(#~ ] =&co9 *:) i. 101
0 1 9 10 18 19 27 28 36 37 45 46 54 55 63 64 72 73 81 82 90 91 99 100
Java
import java.util.*;
import java.util.stream.IntStream;
public class CastingOutNines {
public static void main(String[] args) {
System.out.println(castOut(16, 1, 255));
System.out.println(castOut(10, 1, 99));
System.out.println(castOut(17, 1, 288));
}
static List<Integer> castOut(int base, int start, int end) {
int[] ran = IntStream
.range(0, base - 1)
.filter(x -> x % (base - 1) == (x * x) % (base - 1))
.toArray();
int x = start / (base - 1);
List<Integer> result = new ArrayList<>();
while (true) {
for (int n : ran) {
int k = (base - 1) * x + n;
if (k < start)
continue;
if (k > end)
return result;
result.add(k);
}
x++;
}
}
}
[1, 6, 10, 15, 16, 21, 25, 30, 31, 36, 40, 45, 46, 51, 55, 60, 61, 66, 70, 75, 76, 81, 85, 90, 91, 96, 100, 105, 106, 111, 115, 120, 121, 126, 130, 135, 136, 141, 145, 150, 151, 156, 160, 165, 166, 171, 175, 180, 181, 186, 190, 195, 196, 201, 205, 210, 211, 216, 220, 225, 226, 231, 235, 240, 241, 246, 250, 255] [1, 9, 10, 18, 19, 27, 28, 36, 37, 45, 46, 54, 55, 63, 64, 72, 73, 81, 82, 90, 91, 99] [1, 16, 17, 32, 33, 48, 49, 64, 65, 80, 81, 96, 97, 112, 113, 128, 129, 144, 145, 160, 161, 176, 177, 192, 193, 208, 209, 224, 225, 240, 241, 256, 257, 272, 273, 288]
JavaScript
ES5
Assuming the context of a web page:
function main(s, e, bs, pbs) {
bs = bs || 10;
pbs = pbs || 10
document.write('start:', toString(s), ' end:', toString(e),
' base:', bs, ' printBase:', pbs)
document.write('<br>castOutNine: ');
castOutNine()
document.write('<br>kaprekar: ');
kaprekar()
document.write('<br><br>')
function castOutNine() {
for (var n = s, k = 0, bsm1 = bs - 1; n <= e; n += 1)
if (n % bsm1 == (n * n) % bsm1) k += 1,
document.write(toString(n), ' ')
document.write('<br>trying ', k, ' numbers instead of ', n = e - s + 1,
' numbers saves ', (100 - k / n * 100)
.toFixed(3), '%')
}
function kaprekar() {
for (var n = s; n <= e; n += 1)
if (isKaprekar(n)) document.write(toString(n), ' ')
function isKaprekar(n) {
if (n < 1) return false
if (n == 1) return true
var s = (n * n)
.toString(bs)
for (var i = 1, e = s.length; i < e; i += 1) {
var a = parseInt(s.substr(0, i), bs)
var b = parseInt(s.substr(i), bs)
if (b && a + b == n) return true
}
return false
}
}
function toString(n) {
return n.toString(pbs)
.toUpperCase()
}
}
main(1, 10 * 10 - 1)
main(1, 16 * 16 - 1, 16)
main(1, 17 * 17 - 1, 17)
main(parseInt('10', 17), parseInt('gg', 17), 17, 17)
- Output:
start:1 end:99 base:10 printBase:10 castOutNine: 1 9 10 18 19 27 28 36 37 45 46 54 55 63 64 72 73 81 82 90 91 99 trying 22 numbers instead of 99 numbers saves 77.778% kaprekar: 1 9 45 55 99 start:1 end:255 base:16 printBase:10 castOutNine: 1 6 10 15 16 21 25 30 31 36 40 45 46 51 55 60 61 66 70 75 76 81 85 90 91 96 100 105 106 111 115 120 121 126 130 135 136 141 145 150 151 156 160 165 166 171 175 180 181 186 190 195 196 201 205 210 211 216 220 225 226 231 235 240 241 246 250 255 trying 68 numbers instead of 255 numbers saves 73.333% kaprekar: 1 6 10 15 51 85 91 120 136 171 205 255 start:1 end:288 base:17 printBase:10 castOutNine: 1 16 17 32 33 48 49 64 65 80 81 96 97 112 113 128 129 144 145 160 161 176 177 192 193 208 209 224 225 240 241 256 257 272 273 288 trying 36 numbers instead of 288 numbers saves 87.500% kaprekar: 1 16 64 225 288 start:10 end:GG base:17 printBase:17 castOutNine: 10 1F 1G 2E 2F 3D 3E 4C 4D 5B 5C 6A 6B 79 7A 88 89 97 98 A6 A7 B5 B6 C4 C5 D3 D4 E2 E3 F1 F2 G0 G1 GG trying 34 numbers instead of 272 numbers saves 87.500% kaprekar: 3D D4 GG
ES6
(() => {
'use strict';
// co9 :: Int -> Int
const co9 = n =>
n <= 8 ? n : co9(
digits(10, n)
.reduce((a, x) => x !== 9 ? a + x : a, 0)
);
// GENERIC FUNCTIONS
// digits :: Int -> Int -> [Int]
const digits = (base, n) => {
if (n < base) return [n];
const [q, r] = quotRem(n, base);
return [r].concat(digits(base, q));
};
// quotRem :: Integral a => a -> a -> (a, a)
const quotRem = (m, n) => [Math.floor(m / n), m % n];
// range :: Int -> Int -> [Int]
const range = (m, n) =>
Array.from({
length: Math.floor(n - m) + 1
}, (_, i) => m + i);
// squared :: Num a => a -> a
const squared = n => Math.pow(n, 2);
// show :: a -> String
const show = x => JSON.stringify(x, null, 2);
// TESTS
return show({
test1: co9(232345), //-> 1
test2: co9(34234234), //-> 7
test3: co9(232345 + 34234234) === co9(232345) + co9(34234234), //-> true
test4: co9(232345 * 34234234) === co9(232345) * co9(34234234), //-> true,
task2: range(1, 100)
.filter(n => co9(n) === co9(squared(n))),
task3: (k => range(1, 100)
.filter(n => (n % k) === (squared(n) % k)))(16)
});
})();
- Output:
{ "test1": 1, "test2": 7, "test3": true, "test4": true, "task2": [ 1, 9, 10, 18, 19, 27, 28, 36, 37, 45, 46, 54, 55, 63, 64, 72, 73, 81, 82, 90, 91, 99, 100 ], "task3": [ 1, 16, 17, 32, 33, 48, 49, 64, 65, 80, 81, 96, 97 ] }
jq
In the following, the filter is_kaprekar as defined at Kaprekar_numbers#jq is used. Since it is only defined for decimals, this section is correspondingly restricted.
Definition of co9:
def co9:
def digits: tostring | explode | map(. - 48); # "0" is 48
if . == 9 then 0
elif 0 <= . and . <= 8 then .
else digits | add | co9
end;
For convenience, we also define a function to check whether co9(i) equals co9(i*i) for a given integer, i:
def co9_equals_co9_squared: co9 == ((.*.)|co9);
Example:
Integers in 1 .. 100 satisfying co9(i) == co9(i*i):
[range (1;101) | select( co9_equals_co9_squared )
produces:
[1,9,10,18,19,27,28,36,37,45,46,54,55,63,64,72,73,81,82,90,91,99,100]
Verification:
One way to verify that the Kaprekar numbers satisfy the co9_equals_co9_squared condition is by inspection. For the range 1..100 considered above, we have:
[ range(1;101) | select(is_kaprekar) ]
[1,9,45,55,99]
To check the condition programmatically for a given range of integers, we can define a function which will emit any exceptions, e.g.
def verify:
range(1; .)
| select(is_kaprekar and (co9_equals_co9_squared | not));
For example, running (1000 | verify) produces an empty stream.
Proportion of integers in 1 .. n satisfying the mod (b-1) condition:
For a given base, "b", the following function computes the proportion of integers, i, in 1 .. n such that i % (b-1) == (i*i) % (b-1):
def proportion(base):
def count(stream): reduce stream as $i (0; . + 1);
. as $n
| (base - 1) as $b
| count( range(1; 1+$n) | select( . % $b == (.*.) % $b) ) / $n ;
For example:
(10, 100, 1000, 10000, 100000) | proportion(16)
produces:
0.3
0.27
0.267
0.2667
0.26667
Julia
co9(x) = x == 9 ? 0 :
1<=x<=8 ? x :
co9(sum(digits(x)))
iskaprekar is defined in the task Kaprekar_numbers#Julia.
- Output:
julia> show(filter(x->co9(x)==co9(x^2), 1:100)) [1,9,10,18,19,27,28,36,37,45,46,54,55,63,64,72,73,81,82,90,91,99,100] julia> show(filter(iskaprekar, 1:100)) [1,9,45,55,99] julia> show(filter(x->x%15 == (x^2)%15, 1:100)) # base 16 [1,6,10,15,16,21,25,30,31,36,40,45,46,51,55,60,61,66,70,75,76,81,85,90,91,96,100]
Kotlin
// version 1.1.3
fun castOut(base: Int, start: Int, end: Int): List<Int> {
val b = base - 1
val ran = (0 until b).filter { it % b == (it * it) % b }
var x = start / b
val result = mutableListOf<Int>()
while (true) {
for (n in ran) {
val k = b * x + n
if (k < start) continue
if (k > end) return result
result.add(k)
}
x++
}
}
fun main(args: Array<String>) {
println(castOut(16, 1, 255))
println()
println(castOut(10, 1, 99))
println()
println(castOut(17, 1, 288))
}
- Output:
[1, 6, 10, 15, 16, 21, 25, 30, 31, 36, 40, 45, 46, 51, 55, 60, 61, 66, 70, 75, 76, 81, 85, 90, 91, 96, 100, 105, 106, 111, 115, 120, 121, 126, 130, 135, 136, 141, 145, 150, 151, 156, 160, 165, 166, 171, 175, 180, 181, 186, 190, 195, 196, 201, 205, 210, 211, 216, 220, 225, 226, 231, 235, 240, 241, 246, 250, 255] [1, 9, 10, 18, 19, 27, 28, 36, 37, 45, 46, 54, 55, 63, 64, 72, 73, 81, 82, 90, 91, 99] [1, 16, 17, 32, 33, 48, 49, 64, 65, 80, 81, 96, 97, 112, 113, 128, 129, 144, 145, 160, 161, 176, 177, 192, 193, 208, 209, 224, 225, 240, 241, 256, 257, 272, 273, 288]
Lua
local N = 2
local base = 10
local c1 = 0
local c2 = 0
for k = 1, math.pow(base, N) - 1 do
c1 = c1 + 1
if k % (base - 1) == (k * k) % (base - 1) then
c2 = c2 + 1
io.write(k .. ' ')
end
end
print()
print(string.format("Trying %d numbers instead of %d numbers saves %f%%", c2, c1, 100.0 - 100.0 * c2 / c1))
- Output:
1 9 10 18 19 27 28 36 37 45 46 54 55 63 64 72 73 81 82 90 91 99 Trying 22 numbers instead of 99 numbers saves 77.777778%
Mathematica/Wolfram Language
Task 1: Simple referenced implementation that handles any base:
Co9[n_, b_: 10] :=
With[{ans = FixedPoint[Total@IntegerDigits[#, b] &, n]},
If[ans == b - 1, 0, ans]];
- Task 1 output:
Co9 /@ (vals = {1235, 2345, 4753})
{2, 5, 1}
Total[Co9 /@ vals] == Co9[Total[vals]]
True
Task 2:
task2 = Select[Range@100, Co9[#] == Co9[#^2] &]
- Task 2 output:
{1, 9, 10, 18, 19, 27, 28, 36, 37, 45, 46, 54, 55, 63, 64, 72, 73, 81, 82, 90, 91, 99, 100}
Task 3: Defines the efficient co9 using Mod.
Co9eff[n_, b_: 10] := Mod[n, b - 1];
- Task 3 output:
Testing bases 10 and 17
task2 == Select[Range@100, Co9eff[#] == Co9eff[#^2] &]
True
Select[Range@100, Co9eff[#, 17] == Co9eff[#^2, 17] &]
{1, 16, 17, 32, 33, 48, 49, 64, 65, 80, 81, 96, 97}
Nim
import sequtils
iterator castOut(base = 10, start = 1, ending = 999_999): int =
var ran: seq[int] = @[]
for y in 0 ..< base-1:
if y mod (base - 1) == (y*y) mod (base - 1):
ran.add(y)
var x = start div (base - 1)
var y = start mod (base - 1)
block outer:
while true:
for n in ran:
let k = (base - 1) * x + n
if k < start:
continue
if k > ending:
break outer
yield k
inc x
echo toSeq(castOut(base=16, start=1, ending=255))
- Output:
@[1, 6, 10, 15, 16, 21, 25, 30, 31, 36, 40, 45, 46, 51, 55, 60, 61, 66, 70, 75, 76, 81, 85, 90, 91, 96, 100, 105, 106, 111, 115, 120, 121, 126, 130, 135, 136, 141, 145, 150, 151, 156, 160, 165, 166, 171, 175, 180, 181, 186, 190, 195, 196, 201, 205, 210, 211, 216, 220, 225, 226, 231, 235, 240, 241, 246, 250, 255]
Objeck
class CastingNines {
function : Main(args : String[]) ~ Nil {
base := 10;
N := 2;
c1 := 0;
c2 := 0;
for (k:=1; k<base->As(Float)->Power(N->As(Float)); k+=1;){
c1+=1;
if (k%(base-1) = (k*k)%(base-1)){
c2+=1;
IO.Console->Print(k)->Print(" ");
};
};
IO.Console->Print("\nTrying ")->Print(c2)->Print(" numbers instead of ")
->Print(c1)->Print(" numbers saves ")->Print(100 - (c2->As(Float)/c1
->As(Float)*100))->PrintLine("%");
}
}
- Output:
1 9 10 18 19 27 28 36 37 45 46 54 55 63 64 72 73 81 82 90 91 99 Trying 22 numbers instead of 99 numbers saves 77.7777778%
PARI/GP
{base=10;
N=2;
c1=c2=0;
for(k=1,base^N-1,
c1++;
if (k%(base-1) == k^2%(base-1),
c2++;
print1(k" ")
);
);
print("\nTrying "c2" numbers instead of "c1" numbers saves " 100.-(c2/c1)*100 "%")}
- Produces:
1 9 10 18 19 27 28 36 37 45 46 54 55 63 64 72 73 81 82 90 91 99 Trying 22 numbers instead of 99 numbers saves 77.77777777777777777777777778%
Changing to: "base = 16;
" produces:
1 6 10 15 16 21 25 30 31 36 40 45 46 51 55 60 61 66 70 75 76 81 85 90 91 96 100 105 106 111 115 120 121 126 130 135 136 141 145 150 151 156 160 165 166 171 175 180 181 186 190 195 196 201 205 210 211 216 220 225 226 231 235 240 241 246 250 255 Trying 68 numbers instead of 255 numbers saves 73.33333333333333333333333333%
Perl
sub co9 { # Follows the simple procedure asked for in Part 1
my $n = shift;
return $n if $n < 10;
my $sum = 0; $sum += $_ for split(//,$n);
co9($sum);
}
sub showadd {
my($n,$m) = @_;
print "( $n [",co9($n),"] + $m [",co9($m),"] ) [",co9(co9($n)+co9($m)),"]",
" = ", $n+$m," [",co9($n+$m),"]\n";
}
sub co9filter {
my $base = shift;
die unless $base >= 2;
my($beg, $end, $basem1) = (1, $base*$base-1, $base-1);
my @list = grep { $_ % $basem1 == $_*$_ % $basem1 } $beg .. $end;
($end, scalar(@list), @list);
}
print "Part 1: Create a simple filter and demonstrate using simple example.\n";
showadd(6395, 1259);
print "\nPart 2: Use this to filter a range with co9(k) == co9(k^2).\n";
print join(" ", grep { co9($_) == co9($_*$_) } 1..99), "\n";
print "\nPart 3: Use efficient method on range.\n";
for my $base (10, 17) {
my($N, $n, @l) = co9filter($base);
printf "[@l]\nIn base %d, trying %d numbers instead of %d saves %.4f%%\n\n",
$base, $n, $N, 100-($n/$N)*100;
}
- Output:
Part 1: Create a simple filter and demonstrate using simple example. ( 6395 [5] + 1259 [8] ) [4] = 7654 [4] Part 2: Use this to filter a range with co9(k) == co9(k^2). 1 9 10 18 19 27 28 36 37 45 46 54 55 63 64 72 73 81 82 90 91 99 Part 3: Use efficient method on range. [1 9 10 18 19 27 28 36 37 45 46 54 55 63 64 72 73 81 82 90 91 99] In base 10, trying 22 numbers instead of 99 saves 77.7778% [1 16 17 32 33 48 49 64 65 80 81 96 97 112 113 128 129 144 145 160 161 176 177 192 193 208 209 224 225 240 241 256 257 272 273 288] In base 17, trying 36 numbers instead of 288 saves 87.5000%
Phix
with javascript_semantics procedure co9(integer start, integer base, integer lim, sequence kaprekars) integer c1=0, c2=0 sequence s = {} for k=start to lim do c1 += 1 if mod(k,base-1)=mod(k*k,base-1) then c2 += 1 s &= k end if end for string msg = "valid subset" for i=1 to length(kaprekars) do if not find(kaprekars[i],s) then msg = "***INVALID***" exit end if end for if length(s)>25 then s[10..-10] = {"..."} end if printf(1,"%V\nKaprekar numbers: %V - %s\n",{s,kaprekars,msg}) printf(1,"Trying %d numbers instead of %d saves %3.2f%%\n\n",{c2,c1,100-(c2/c1)*100}) end procedure co9(1, 10, 99, {1,9,45,55,99}) co9(0(17)10, 17, 17*17, {0(17)3d,0(17)d4,0(17)gg}) co9(1, 10, 1000, {1,9,45,55,99,297,703,999})
- Output:
{1,9,10,18,19,27,28,36,37,45,46,54,55,63,64,72,73,81,82,90,91,99} Kaprekar numbers: {1,9,45,55,99} - valid subset Trying 22 numbers instead of 99 saves 77.78% {17,32,33,48,49,64,65,80,81,"...",225,240,241,256,257,272,273,288,289} Kaprekar numbers: {64,225,288} - valid subset Trying 35 numbers instead of 273 saves 87.18% {1,9,10,18,19,27,28,36,37,"...",964,972,973,981,982,990,991,999,1000} Kaprekar numbers: {1,9,45,55,99,297,703,999} - valid subset Trying 223 numbers instead of 1000 saves 77.70%
Picat
go =>
Base10 = 10,
foreach(N in [2,6])
casting_out_nines(Base10,N)
end,
nl,
Base16 = 16,
foreach(N in [2,6])
casting_out_nines(Base16,N)
end,
nl.
casting_out_nines(Base,N) =>
println([base=Base,n=N]),
C1 = 0,
C2 = 0,
Ks = [],
LimitN = 3,
foreach(K in 1..Base**N-1)
C1 := C1 + 1,
if K mod (Base-1) == (K*K) mod (Base-1) then
C2 := C2+1,
if N <= LimitN then
Ks := Ks ++ [K]
end
end
end,
if C2 <= 100 then
println(ks=Ks)
end,
printf("Trying %d numbers instead of %d numbers saves %2.3f%%\n", C2, C1, 100 - ((C2/C1)*100)),
nl.
- Output:
[base = 10,n = 2] ks = [1,9,10,18,19,27,28,36,37,45,46,54,55,63,64,72,73,81,82,90,91,99] Trying 22 numbers instead of 99 numbers saves 77.778% [base = 10,n = 6] Trying 222222 numbers instead of 999999 numbers saves 77.778% [base = 16,n = 2] ks = [1,6,10,15,16,21,25,30,31,36,40,45,46,51,55,60,61,66,70,75,76,81,85,90,91,96,100,105,106,111,115,120,121,126,130,135,136,141,145,150,151,156,160,165,166,171,175,180,181,186,190,195,196,201,205,210,211,216,220,225,226,231,235,240,241,246,250,255] Trying 68 numbers instead of 255 numbers saves 73.333% [base = 16,n = 6] Trying 4473924 numbers instead of 16777215 numbers saves 73.333%
PicoLisp
(de kaprekar (N)
(let L (cons 0 (chop (* N N)))
(for ((I . R) (cdr L) R (cdr R))
(NIL (gt0 (format R)))
(T (= N (+ @ (format (head I L)))) N) ) ) )
(de co9 (N)
(until
(> 9
(setq N
(sum
'((N) (unless (= "9" N) (format N)))
(chop N) ) ) ) )
N )
(println 'Part1:)
(println
(=
(co9 (+ 6395 1259))
(co9 (+ (co9 6395) (co9 1259))) ) )
(println 'Part2:)
(println
(filter
'((N) (= (co9 N) (co9 (* N N))))
(range 1 100) ) )
(println
(filter kaprekar (range 1 100)) )
(println 'Part3 '- 'base17:)
(println
(filter
'((N) (= (% N 16) (% (* N N) 16)))
(range 1 100) ) )
(bye)
- Output:
Part1: T Part2: (1 9 10 18 19 27 28 36 37 45 46 54 55 63 64 72 73 81 82 90 91 99 100) (1 9 45 55 99) Part3 - base17: (1 16 17 32 33 48 49 64 65 80 81 96 97)
Python
This works slightly differently, generating the "wierd" (as defined by Counting Out Nines) numbers which may be Kaprekar, rather than filtering all numbers in a range.
# Casting out Nines
#
# Nigel Galloway: June 27th., 2012,
#
def CastOut(Base=10, Start=1, End=999999):
ran = [y for y in range(Base-1) if y%(Base-1) == (y*y)%(Base-1)]
x,y = divmod(Start, Base-1)
while True:
for n in ran:
k = (Base-1)*x + n
if k < Start:
continue
if k > End:
return
yield k
x += 1
for V in CastOut(Base=16,Start=1,End=255):
print(V, end=' ')
Produces:
1 6 10 15 16 21 25 30 31 36 40 45 46 51 55 60 61 66 70 75 76 81 85 90 91 96 100 105 106 111 115 120 121 126 130 135 136 141 145 150 151 156 160 165 166 171 175 180 181 186 190 195 196 201 205 210 211 216 220 225 226 231 235 240 241 246 250 255
CastOut(Base=10,Start=1,End=99)
produces:
1 9 10 18 19 27 28 36 37 45 46 54 55 63 64 72 73 81 82 90 91 99
CastOut(Base=17,Start=1,End=288)
produces:
1 16 17 32 33 48 49 64 65 80 81 96 97 112 113 128 129 144 145 160 161 176 177 192 193 208 209 224 225 240 241 256 257 272 273 288
Quackery
kaprekar
is defined at Kaprekar numbers#Quackery.
[ true unrot swap
witheach
[ over find
over found not if
[ dip not
conclude ] ]
drop ] is subset ( [ [ --> [ )
[ abs 0 swap
[ 10 /mod rot +
dup 8 > if [ 9 - ]
swap dup 0 = until ]
drop ] is co9 ( n --> n )
say "Part 1: Examples from Dr Math page." cr cr
say "6395 1259 + = " 6395 1259 + echo cr
say "6395 co9 = " 6395 co9 echo cr
say "1259 co9 = " 1259 co9 echo cr
say "5 8 + co9 = " 5 8 + co9 echo cr
say "7654 co9 = " 7654 co9 echo cr cr
say "6395 1259 * = " 6395 1259 * echo cr
say "6395 co9 = " 6395 co9 echo cr
say "1259 co9 = " 1259 co9 echo cr
say "5 8 * co9 = " 5 8 * co9 echo cr
say "8051305 co9 = " 7654 co9 echo cr cr
say "Part 2: Kaprekar numbers." cr cr
say "Kaprekar numbers less than one hundred: "
[]
100 times
[ i^ kaprekar if
[ i^ join ] ]
dup echo cr
say '0...99 with property "n co9 n 2 ** co9 =": '
[]
100 times
[ i^ co9
i^ 2 ** co9 = if
[ i^ join ] ]
dup echo cr
say "Is the former a subset of the latter? "
subset iff [ say "Yes." ] else [ say "No." ] cr cr
say "Part 3: Same as Part 2, but base 17." cr cr
say "Kaprekar (base 17) numbers less than one hundred: "
17 base put
[]
100 times
[ i^ kaprekar if
[ i^ join ] ]
base release
dup echo cr
say '0...99 with property "n 16 mod n 2 ** 16 mod =": '
[]
100 times
[ i^ 16 mod
i^ 2 ** 16 mod = if
[ i^ join ] ]
dup echo cr
say "Is the former a subset of the latter? "
subset iff [ say "Yes." ] else [ say "No." ]
- Output:
Part 1: Examples from Dr Math page. 6395 1259 + = 7654 6395 co9 = 5 1259 co9 = 8 5 8 + co9 = 4 7654 co9 = 4 6395 1259 * = 8051305 6395 co9 = 5 1259 co9 = 8 5 8 * co9 = 4 8051305 co9 = 4 Part 2: Kaprekar numbers. Kaprekar numbers less than one hundred: [ 1 9 45 55 99 ] 0...99 with property "n co9 n 2 ** co9 =": [ 0 1 9 10 18 19 27 28 36 37 45 46 54 55 63 64 72 73 81 82 90 91 99 ] Is the former a subset of the latter? Yes. Part 3: Same as Part 2, but base 17. Kaprekar (base 17) numbers less than one hundred: [ 1 16 64 ] 0...99 with property "n 16 mod n 2 ** 16 mod =": [ 0 1 16 17 32 33 48 49 64 65 80 81 96 97 ] Is the former a subset of the latter? Yes.
Racket
#lang racket
(require math)
(define (digits n)
(map (compose1 string->number string)
(string->list (number->string n))))
(define (cast-out-nines n)
(with-modulus 9
(for/fold ([sum 0]) ([d (digits n)])
(mod+ sum d))))
Raku
(formerly Perl 6)
sub cast-out(\BASE = 10, \MIN = 1, \MAX = BASE**2 - 1) {
my \B9 = BASE - 1;
my @ran = ($_ if $_ % B9 == $_**2 % B9 for ^B9);
my $x = MIN div B9;
gather loop {
for @ran -> \n {
my \k = B9 * $x + n;
take k if k >= MIN;
}
$x++;
} ...^ * > MAX;
}
say cast-out;
say cast-out 16;
say cast-out 17;
- Output:
(1 9 10 18 19 27 28 36 37 45 46 54 55 63 64 72 73 81 82 90 91 99) (1 6 10 15 16 21 25 30 31 36 40 45 46 51 55 60 61 66 70 75 76 81 85 90 91 96 100 105 106 111 115 120 121 126 130 135 136 141 145 150 151 156 160 165 166 171 175 180 181 186 190 195 196 201 205 210 211 216 220 225 226 231 235 240 241 246 250 255) (1 16 17 32 33 48 49 64 65 80 81 96 97 112 113 128 129 144 145 160 161 176 177 192 193 208 209 224 225 240 241 256 257 272 273 288)
REXX
/*REXX program demonstrates the casting─out─nines algorithm (with Kaprekar numbers). */
parse arg LO HI base . /*obtain optional arguments from the CL*/
if LO=='' | LO=="," then do; LO=1; HI=1000; end /*Not specified? Then use the default*/
if HI=='' | HI=="," then HI= LO /* " " " " " " */
if base=='' | base=="," then base= 10 /* " " " " " " */
numeric digits max(9, 2*length(HI**2) ) /*insure enough decimal digits for HI².*/
numbers= castOut(LO, HI, base) /*generate a list of (cast out) numbers*/
@cast_out= 'cast-out-' || (base-1) "test" /*construct a shortcut text for output.*/
say 'For' LO "through" HI', the following passed the' @cast_out":"
say numbers; say /*display the list of cast out numbers.*/
q= HI - LO + 1 /*Q: is the range of numbers in list.*/
p= words(numbers) /*P" " " number " " " " */
pc= format(p/q * 100, , 2) / 1 || '%' /*calculate the percentage (%) cast out*/
say 'For' q "numbers," p 'passed the' @cast_out "("pc') for base' base"."
if base\==10 then exit /*if radix isn't ten, then exit program*/
Kaps= Kaprekar(LO, HI) /*generate a list of Kaprekar numbers. */
say; say 'The Kaprekar numbers in the same range are:' Kaps
say
do i=1 for words(Kaps); x= word(Kaps, i) /*verify 'em in list.*/
if wordpos(x, numbers)\==0 then iterate /*it's OK so far ··· */
say 'Kaprekar number' x "isn't in the numbers list." /*oops─ay! */
exit 13 /*go spank the coder.*/
end /*i*/
say 'All Kaprekar numbers are in the' @cast_out "numbers list." /*OK*/
exit 0 /*stick a fork in it, we're all done. */
/*──────────────────────────────────────────────────────────────────────────────────────*/
castOut: procedure; parse arg low,high,radix; rm= word(radix 10, 1) - 1; $=
do j=low to word(high low, 1) /*test a range of numbers. */
if j//rm == j*j//rm then $= $ j /*did number pass the test?*/
end /*j*/ /* [↑] Then add # to list.*/
return strip($) /*strip and leading blanks from result.*/
/*──────────────────────────────────────────────────────────────────────────────────────*/
Kaprekar: procedure; parse arg L,H; $=; if L<=1 then $= 1 /*add unity if in range*/
do j=max(2, L) to H; s= j*j /*a slow way to find Kaprekar numbers. */
do m=1 for length(s)%2
if j==left(s, m) + substr(s, m+1) then do; $= $ j; leave; end
end /*m*/ /* [↑] found a Kaprekar number. */
end /*j*/
return strip($) /*return Kaprekar numbers to invoker. */
- output when using the default inputs:
For 1 through 1000, the following passed the cast-out-9 test: 1 9 10 18 19 27 28 36 37 45 46 54 55 63 64 72 73 81 82 90 91 99 100 108 109 117 118 126 127 135 136 144 145 153 154 162 163 171 172 180 181 189 190 198 199 207 208 216 217 225 226 234 235 243 244 252 253 261 262 270 271 279 280 288 289 297 298 306 307 315 316 324 325 333 334 342 343 351 352 360 361 369 370 378 379 387 388 396 397 405 406 414 415 423 424 432 433 441 442 450 451 459 460 468 469 477 478 486 487 495 496 504 505 513 514 522 523 531 532 540 541 549 550 558 559 567 568 576 577 585 586 594 595 603 604 612 613 621 622 630 631 639 640 648 649 657 658 666 667 675 676 684 685 693 694 702 703 711 712 720 721 729 730 738 739 747 748 756 757 765 766 774 775 783 784 792 793 801 802 810 811 819 820 828 829 837 838 846 847 855 856 864 865 873 874 882 883 891 892 900 901 909 910 918 919 927 928 936 937 945 946 954 955 963 964 972 973 981 982 990 991 999 1000 For 1000 numbers, 223 passed the cast-out-9 test (22.3%) for base 10. The Kaprekar numbers in the same range are: 1 9 45 55 99 297 703 999 All Kaprekar numbers are in the cast-out-9 test numbers list.
- output when using the input of: 1 256 16
For 1 through 256, the following passed the cast-out-15 test: 1 6 10 15 16 21 25 30 31 36 40 45 46 51 55 60 61 66 70 75 76 81 85 90 91 96 100 105 106 111 115 120 121 126 130 135 136 141 145 150 151 156 160 165 166 171 175 180 181 186 190 195 196 201 205 210 211 216 220 225 226 231 235 240 241 246 250 255 256 For 256 numbers, 69 passed the cast-out-15 test (26.95%) for base 16.
Ring
# Project : Casting out nines
co9(1, 10, 99, [1,9,45,55,99])
co9(1, 10, 1000, [1,9,45,55,99,297,703,999])
func co9(start,base,lim,kaprekars)
c1=0
c2=0
s = []
for k = start to lim
c1 = c1 + 1
if k % (base-1) = (k*k) % (base-1)
c2 = c2 + 1
add(s,k)
ok
next
msg = "Valid subset" + nl
for i = 1 to len(kaprekars)
if not find(s,kaprekars[i])
msg = "***Invalid***" + nl
exit
ok
next
showarray(s)
see "Kaprekar numbers:" + nl
showarray(kaprekars)
see msg
see "Trying " + c2 + " numbers instead of " + c1 + " saves " + (100-(c2/c1)*100) + "%" + nl + nl
func showarray(vect)
see "{"
svect = ""
for n = 1 to len(vect)
svect = svect + vect[n] + ", "
next
svect = left(svect, len(svect) - 2)
see svect + "}" + nl
Output:
{1, 9, 10, 18, 19, 27, 28, 36, 37, 45, 46, 54, 55, 63, 64, 72, 73, 81, 82, 90, 91, 99} Kaprekar numbers: {1, 9, 45, 55, 99} Valid subset Trying 22 numbers instead of 99 saves 77.78% {1, 9, 10, 18, 19, 27, 28, 36, 37, 45, 46, 54, 55, 63, 64, 72, 73, 81, 82, 90, 91, 99, 100, 108, 109, 117, 118, 126, 127, 135, 136, 144, 145, 153, 154, 162, 163, 171, 172, 180, 181, 189, 190, 198, 199, 207, 208, 216, 217, 225, 226, 234, 235, 243, 244, 252, 253, 261, 262, 270, 271, 279, 280, 288, 289, 297, 298, 306, 307, 315, 316, 324, 325, 333, 334, 342, 343, 351, 352, 360, 361, 369, 370, 378, 379, 387, 388, 396, 397, 405, 406, 414, 415, 423, 424, 432, 433, 441, 442, 450, 451, 459, 460, 468, 469, 477, 478, 486, 487, 495, 496, 504, 505, 513, 514, 522, 523, 531, 532, 540, 541, 549, 550, 558, 559, 567, 568, 576, 577, 585, 586, 594, 595, 603, 604, 612, 613, 621, 622, 630, 631, 639, 640, 648, 649, 657, 658, 666, 667, 675, 676, 684, 685, 693, 694, 702, 703, 711, 712, 720, 721, 729, 730, 738, 739, 747, 748, 756, 757, 765, 766, 774, 775, 783, 784, 792, 793, 801, 802, 810, 811, 819, 820, 828, 829, 837, 838, 846, 847, 855, 856, 864, 865, 873, 874, 882, 883, 891, 892, 900, 901, 909, 910, 918, 919, 927, 928, 936, 937, 945, 946, 954, 955, 963, 964, 972, 973, 981, 982, 990, 991, 999, 1000} Kaprekar numbers: {1, 9, 45, 55, 99, 297, 703, 999} Valid subset Trying 223 numbers instead of 1000 saves 77.70%
Ruby
N = 2
base = 10
c1 = 0
c2 = 0
for k in 1 .. (base ** N) - 1
c1 = c1 + 1
if k % (base - 1) == (k * k) % (base - 1) then
c2 = c2 + 1
print "%d " % [k]
end
end
puts
print "Trying %d numbers instead of %d numbers saves %f%%" % [c2, c1, 100.0 - 100.0 * c2 / c1]
- Output:
1 9 10 18 19 27 28 36 37 45 46 54 55 63 64 72 73 81 82 90 91 99 Trying 22 numbers instead of 99 numbers saves 77.777778%
Rust
fn compare_co9_efficiency(base: u64, upto: u64) {
let naive_candidates: Vec<u64> = (1u64..upto).collect();
let co9_candidates: Vec<u64> = naive_candidates.iter().cloned()
.filter(|&x| x % (base - 1) == (x * x) % (base - 1))
.collect();
for candidate in &co9_candidates {
print!("{} ", candidate);
}
println!();
println!(
"Trying {} numbers instead of {} saves {:.2}%",
co9_candidates.len(),
naive_candidates.len(),
100.0 - 100.0 * (co9_candidates.len() as f64 / naive_candidates.len() as f64)
);
}
fn main() {
compare_co9_efficiency(10, 100);
compare_co9_efficiency(16, 256);
}
- Output:
1 9 10 18 19 27 28 36 37 45 46 54 55 63 64 72 73 81 82 90 91 99 Trying 22 numbers instead of 99 saves 77.78% 1 6 10 15 16 21 25 30 31 36 40 45 46 51 55 60 61 66 70 75 76 81 85 90 91 96 100 105 106 111 115 120 121 126 130 135 136 141 145 150 151 156 160 165 166 171 175 180 181 186 190 195 196 201 205 210 211 216 220 225 226 231 235 240 241 246 250 255 Trying 68 numbers instead of 255 saves 73.33%
Scala
Code written in scala follows functional paradigm of programming, finds list of candidates for Kaprekar numbers within given range.
object kaprekar{
// PART 1
val co_base = ((x:Int,base:Int) => (x%(base-1) == (x*x)%(base-1)))
//PART 2
def get_cands(n:Int,base:Int):List[Int] = {
if(n==1) List[Int]()
else if (co_base(n,base)) n :: get_cands(n-1,base)
else get_cands(n-1,base)
}
def main(args:Array[String]) : Unit = {
//PART 3
val base = 31
println("Candidates for Kaprekar numbers found by casting out method with base %d:".format(base))
println(get_cands(1000,base))
}
}
- Output:
Output for base 10 within range of 100: Candidates for Kaprekar numbers found by casting out method with base 10: List(100, 99, 91, 90, 82, 81, 73, 72, 64, 63, 55, 54, 46, 45, 37, 36, 28, 27, 19, 18, 10, 9) Output for base 17 with range 1000: Candidates for Kaprekar numbers found by casting out method with base 17: List(993, 992, 977, 976, 961, 960, 945, 944, 929, 928, 913, 912, 897, 896, 881, 880, 865, 864, 849, 848, 833, 832, 817, 816, 801, 800, 785, 784, 769, 768, 753, 752, 737, 736, 721, 720, 705, 704, 689, 688, 673, 672, 657, 656, 641, 640, 625, 624, 609, 608, 593, 592, 577, 576, 561, 560, 545, 544, 529, 528, 513, 512, 497, 496, 481, 480, 465, 464, 449, 448, 433, 432, 417, 416, 401, 400, 385, 384, 369, 368, 353, 352, 337, 336, 321, 320, 305, 304, 289, 288, 273, 272, 257, 256, 241, 240, 225, 224, 209, 208, 193, 192, 177, 176, 161, 160, 145, 144, 129, 128, 113, 112, 97, 96, 81, 80, 65, 64, 49, 48, 33, 32, 17, 16)
Seed7
$ include "seed7_05.s7i";
const func bitset: castOut (in integer: base, in integer: start, in integer: ending) is func
result
var bitset: casted is {};
local
var bitset: ran is {};
var integer: x is 0;
var integer: n is 0;
var integer: k is 0;
var boolean: finished is FALSE;
begin
for x range 0 to base - 2 do
if x rem pred(base) = x ** 2 rem pred(base) then
incl(ran, x);
end if;
end for;
x := start div pred(base);
repeat
for n range ran until finished do
k := pred(base) * x + n;
if k >= start then
if k > ending then
finished := TRUE;
else
incl(casted, k);
end if;
end if;
end for;
incr(x);
until finished;
end func;
const proc: main is func
begin
writeln(castOut(16, 1, 255));
end func;
- Output:
{1, 6, 10, 15, 16, 21, 25, 30, 31, 36, 40, 45, 46, 51, 55, 60, 61, 66, 70, 75, 76, 81, 85, 90, 91, 96, 100, 105, 106, 111, 115, 120, 121, 126, 130, 135, 136, 141, 145, 150, 151, 156, 160, 165, 166, 171, 175, 180, 181, 186, 190, 195, 196, 201, 205, 210, 211, 216, 220, 225, 226, 231, 235, 240, 241, 246, 250, 255}
Sidef
func cast_out(base = 10, min = 1, max = (base**2 - 1)) {
var b9 = base-1
var ran = b9.range.grep {|n| n%b9 == (n*n % b9) }
var x = min//b9
var r = []
loop {
ran.each {|n|
var k = (b9*x + n)
return r if (k > max)
r << k if (k >= min)
}
++x
}
return r
}
say cast_out().join(' ')
say cast_out(16).join(' ')
say cast_out(17).join(' ')
- Output:
1 9 10 18 19 27 28 36 37 45 46 54 55 63 64 72 73 81 82 90 91 99 1 6 10 15 16 21 25 30 31 36 40 45 46 51 55 60 61 66 70 75 76 81 85 90 91 96 100 105 106 111 115 120 121 126 130 135 136 141 145 150 151 156 160 165 166 171 175 180 181 186 190 195 196 201 205 210 211 216 220 225 226 231 235 240 241 246 250 255 1 16 17 32 33 48 49 64 65 80 81 96 97 112 113 128 129 144 145 160 161 176 177 192 193 208 209 224 225 240 241 256 257 272 273 288
Tcl
proc co9 {x} {
while {[string length $x] > 1} {
set x [tcl::mathop::+ {*}[split $x ""]]
}
return $x
}
# Extended to the general case
proc coBase {x {base 10}} {
while {$x >= $base} {
for {set digits {}} {$x} {set x [expr {$x / $base}]} {
lappend digits [expr {$x % $base}]
}
set x [tcl::mathop::+ {*}$digits]
}
return $x
}
# Simple helper
proc percent {part whole} {format "%.2f%%" [expr {($whole - $part) * 100.0 / $whole}]}
puts "In base 10..."
set satisfying {}
for {set i 1} {$i < 100} {incr i} {
if {[co9 $i] == [co9 [expr {$i*$i}]]} {
lappend satisfying $i
}
}
puts $satisfying
puts "Trying [llength $satisfying] numbers instead of 99 numbers saves [percent [llength $satisfying] 99]"
puts "In base 16..."
set satisfying {}
for {set i 1} {$i < 256} {incr i} {
if {[coBase $i 16] == [coBase [expr {$i*$i}] 16]} {
lappend satisfying $i
}
}
puts $satisfying
puts "Trying [llength $satisfying] numbers instead of 255 numbers saves [percent [llength $satisfying] 255]"
- Output:
With some newlines inserted…
In base 10... 1 9 10 18 19 27 28 36 37 45 46 54 55 63 64 72 73 81 82 90 91 99 Trying 22 numbers instead of 99 numbers saves 77.78% In base 16... 1 6 10 15 16 21 25 30 31 36 40 45 46 51 55 60 61 66 70 75 76 81 85 90 91 96 100 105 106 111 115 120 121 126 130 135 136 141 145 150 151 156 160 165 166 171 175 180 181 186 190 195 196 201 205 210 211 216 220 225 226 231 235 240 241 246 250 255 Trying 68 numbers instead of 255 numbers saves 73.33%
Visual Basic .NET
Module Module1
Sub Print(ls As List(Of Integer))
Dim iter = ls.GetEnumerator
Console.Write("[")
If iter.MoveNext Then
Console.Write(iter.Current)
End If
While iter.MoveNext
Console.Write(", ")
Console.Write(iter.Current)
End While
Console.WriteLine("]")
End Sub
Function CastOut(base As Integer, start As Integer, last As Integer) As List(Of Integer)
Dim ran = Enumerable.Range(0, base - 1).Where(Function(y) y Mod (base - 1) = (y * y) Mod (base - 1)).ToArray()
Dim x = start \ (base - 1)
Dim result As New List(Of Integer)
While True
For Each n In ran
Dim k = (base - 1) * x + n
If k < start Then
Continue For
End If
If k > last Then
Return result
End If
result.Add(k)
Next
x += 1
End While
Return result
End Function
Sub Main()
Print(CastOut(16, 1, 255))
Print(CastOut(10, 1, 99))
Print(CastOut(17, 1, 288))
End Sub
End Module
- Output:
[1, 6, 10, 15, 16, 21, 25, 30, 31, 36, 40, 45, 46, 51, 55, 60, 61, 66, 70, 75, 76, 81, 85, 90, 91, 96, 100, 105, 106, 111, 115, 120, 121, 126, 130, 135, 136, 141, 145, 150, 151, 156, 160, 165, 166, 171, 175, 180, 181, 186, 190, 195, 196, 201, 205, 210, 211, 216, 220, 225, 226, 231, 235, 240, 241, 246, 250, 255] [1, 9, 10, 18, 19, 27, 28, 36, 37, 45, 46, 54, 55, 63, 64, 72, 73, 81, 82, 90, 91, 99] [1, 16, 17, 32, 33, 48, 49, 64, 65, 80, 81, 96, 97, 112, 113, 128, 129, 144, 145, 160, 161, 176, 177, 192, 193, 208, 209, 224, 225, 240, 241, 256, 257, 272, 273, 288]
Wren
var castOut = Fn.new { |base, start, end|
var b = base - 1
var ran = (0...b).where { |n| n % b == (n * n) % b }
var x = (start/b).floor
var result = []
while (true) {
for (n in ran) {
var k = b*x + n
if (k >= start) {
if (k > end) return result
result.add(k)
}
}
x = x + 1
}
}
System.print(castOut.call(16, 1, 255))
System.print()
System.print(castOut.call(10, 1, 99))
System.print()
System.print(castOut.call(17, 1, 288))
- Output:
[1, 6, 10, 15, 16, 21, 25, 30, 31, 36, 40, 45, 46, 51, 55, 60, 61, 66, 70, 75, 76, 81, 85, 90, 91, 96, 100, 105, 106, 111, 115, 120, 121, 126, 130, 135, 136, 141, 145, 150, 151, 156, 160, 165, 166, 171, 175, 180, 181, 186, 190, 195, 196, 201, 205, 210, 211, 216, 220, 225, 226, 231, 235, 240, 241, 246, 250, 255] [1, 9, 10, 18, 19, 27, 28, 36, 37, 45, 46, 54, 55, 63, 64, 72, 73, 81, 82, 90, 91, 99] [1, 16, 17, 32, 33, 48, 49, 64, 65, 80, 81, 96, 97, 112, 113, 128, 129, 144, 145, 160, 161, 176, 177, 192, 193, 208, 209, 224, 225, 240, 241, 256, 257, 272, 273, 288]
zkl
fcn castOut(base=10, start=1, end=999999){
base-=1;
ran:=(0).filter(base,'wrap(n){ n%base == (n*n)%base });
result:=Sink(List);
foreach a,b in ([start/base ..],ran){ // foreach{ foreach {} }
k := base*a + b;
if (k < start) continue;
if (k > end) return(result.close());
result.write(k);
}
// doesn't get here
}
castOut(16, 1, 255).toString(*).println("\n-----");
castOut(10, 1, 99).toString(*).println("\n-----");
castOut(17, 1, 288).toString(*).println();
- Output:
L(1,6,10,15,16,21,25,30,31,36,40,45,46,51,55,60,61,66,70,75, 76,81,85,90,91,96,100,105,106,111,115,120,121,126,130,135,136, 141,145,150,151,156,160,165,166,171,175,180,181,186,190,195,196, 201,205,210,211,216,220,225,226,231,235,240,241,246,250,255) ----- L(1,9,10,18,19,27,28,36,37,45,46,54,55,63,64,72,73,81,82,90,91,99) ----- L(1,16,17,32,33,48,49,64,65,80,81,96,97,112,113,128, 129,144,145,160,161,176,177,192,193,208,209,224,225,240, 241,256,257,272,273,288)
ZX Spectrum Basic
10 LET Base=10
20 LET N=2
30 LET c1=0
40 LET c2=0
50 LET k=1
60 IF k>=(Base^N)-1 THEN GO TO 150
70 LET c1=c1+1
80 IF FN m(k,Base-1)=FN m(k*k,Base-1) THEN LET c2=c2+1: PRINT k;" ";
90 LET k=k+1
100 GO TO 60
150 PRINT '"Trying ";c2;" numbers instead of ";c1;" numbers saves ";100-(c2/c1)*100;"%"
160 STOP
170 DEF FN m(a,b)=a-INT (a/b)*b
- Checksums
- Programming Tasks
- Solutions by Programming Task
- 11l
- 360 Assembly
- Action!
- ALGOL 68
- Arturo
- AWK
- C
- C sharp
- C++
- Common Lisp
- D
- Free Pascal
- FreeBASIC
- Go
- Haskell
- J
- Java
- JavaScript
- Jq
- Julia
- Kotlin
- Lua
- Mathematica
- Wolfram Language
- Nim
- Objeck
- PARI/GP
- Perl
- Phix
- Picat
- PicoLisp
- Python
- Quackery
- Racket
- Raku
- REXX
- Ring
- Ruby
- Rust
- Scala
- Seed7
- Sidef
- Tcl
- Visual Basic .NET
- Wren
- Zkl
- ZX Spectrum Basic
- GUISS/Omit
- Pages that use a deprecated format of the math tags