Rosetta Code

Numbers with same digit set in base 10 and base 16: Difference between revisions

Page Discussion

Numbers with same digit set in base 10 and base 16 (view source)

Revision as of 17:21, 7 January 2024

39,573 bytes added ,  4 months ago
m
→‎{{header|Wren}}: Minor tidy
m (→‎{{header|Wren}}: Minor tidy)
(45 intermediate revisions by 24 users not shown)
Line 10:
The set of digits used,   ignoring order and duplicates,   is   '''{2, 3, 9}'''   in both cases and hence this number satisfies the task requirements.
<br><br>
 
=={{header|11l}}==
{{trans|Python}}
 
<syntaxhighlight lang="11l">V col = 0
L(i) 100000
I Set(Array(String(i))) == Set(Array(hex(i)))
col++
print(‘#7’.format(i), end' "\n"[0 .< Int(col % 10 == 0)])
print()</syntaxhighlight>
 
{{out}}
<pre>
0 1 2 3 4 5 6 7 8 9
53 371 913 1040 2080 2339 4100 5141 5412 5441
6182 8200 9241 13593 13665 13969 16406 20530 26946 30979
32803 33638 33840 33841 33842 33843 33844 33845 33846 33847
33848 33849 34883 37943 38931 38966 38995 66310 71444 71497
71511 75120 75121 75122 75123 75124 75125 75126 75127 75128
75129 75621 86150 88165 91465 91769 96617 98711 99481
</pre>
 
=={{header|Ada}}==
<syntaxhighlight lang="ada">with Ada.Text_Io;
 
procedure Same_Digits is
 
Columns : constant := 10;
Width : constant := 8;
 
type Set_Type is array (0 .. 15) of Boolean;
 
function Digit_Set_Of (N : Natural; Base : Natural) return Set_Type is
Nn : Natural := N;
Set : Set_Type := (others => False);
begin
while Nn /= 0 loop
Set (Nn mod Base) := True;
Nn := Nn / Base;
end loop;
return Set;
end Digit_Set_Of;
 
package Natural_Io is new Ada.Text_Io.Integer_Io (Natural);
use Ada.Text_Io, Natural_Io;
 
Count : Natural := 0;
begin
for N in 0 .. 99_999 loop
if Digit_Set_Of (N, Base => 10) = Digit_Set_Of (N, Base => 16) then
Count := Count + 1;
Put (N, Width => Width);
if Count mod Columns = 0 then
New_Line;
end if;
end if;
end loop;
New_Line;
Put ("Total numbers: "); Put (Count, Width => 3); New_Line;
end Same_Digits;</syntaxhighlight>
{{out}}
<pre>
0 1 2 3 4 5 6 7 8 9
53 371 913 1040 2080 2339 4100 5141 5412 5441
6182 8200 9241 13593 13665 13969 16406 20530 26946 30979
32803 33638 33840 33841 33842 33843 33844 33845 33846 33847
33848 33849 34883 37943 38931 38966 38995 66310 71444 71497
71511 75120 75121 75122 75123 75124 75125 75126 75127 75128
75129 75621 86150 88165 91465 91769 96617 98711 99481
Total numbers: 69
</pre>
 
=={{header|ALGOL W}}==
Generates the candidate numbers (ones that only have the digits 0-9 in their hexadecimal representation) to cut down the numbers to check.
<langsyntaxhighlight lang="algolw">begin % find numbers that use the same digits in decimal and hexadecimal %
integer hdCount, h20, h300, h4000, h50000;
logical array hex, dec ( 0 :: 9 );
Line 74 ⟶ 145:
, "representations use the same digits"
);
end.</langsyntaxhighlight>
{{out}}
<pre>
Line 86 ⟶ 157:
Found 69 numbers up to 100000
where the decimal and hexadecimal representations use the same digits
</pre>
 
=={{header|APL}}==
{{works with|Dyalog APL}}
<syntaxhighlight lang="apl">(⊢(/⍨)(≡/((⊂∘⍋⌷⊢)∘∪¨10 16(⊥⍣¯1)¨⊂))¨)0,⍳99999</syntaxhighlight>
{{out}}
<pre>0 1 2 3 4 5 6 7 8 9 53 371 913 1040 2080 2339 4100 5141 5412 5441 6182
8200 9241 13593 13665 13969 16406 20530 26946 30979 32803 33638
33840 33841 33842 33843 33844 33845 33846 33847 33848 33849 34883
37943 38931 38966 38995 66310 71444 71497 71511 75120 75121 75122
75123 75124 75125 75126 75127 75128 75129 75621 86150 88165 91465
91769 96617 98711 99481</pre>
 
=={{header|AppleScript}}==
<syntaxhighlight lang="applescript">use AppleScript version "2.3.1" -- Mac OS X 10.9 (Mavericks) or later.
use sorter : script "Insertion sort" -- <https://www.rosettacode.org/wiki/Sorting_algorithms/Insertion_sort#AppleScript>
 
on sameDigitSetDecHex(n)
(* Integer number input assumed.
Numbers whose hex LSD > 9 are eliminated immediately. Ditto negatives.
Thereafter the hex form's tested first so that the dec form doesn't have to be if the hex is unsuitable. *)
tell n mod 16 to if ((it > 9) or (it < 0)) then return false
script o
on digitsOf(n, base)
set digits to {n mod base}
set n to n div base
repeat until (n = 0)
set d to n mod base
if (d > 9) then return false
if (d is not in digits) then set end of digits to d
set n to n div base
end repeat
tell sorter to sort(digits, 1, -1)
return digits
end digitsOf
end script
tell o's digitsOf(n, 16) to return ((it is not false) and (it = o's digitsOf(n, 10)))
end sameDigitSetDecHex
 
local output, n
set output to {}
repeat with n from 0 to 99999
if (sameDigitSetDecHex(n)) then set end of output to n
end repeat
return output</syntaxhighlight>
 
{{output}}
<syntaxhighlight lang="applescript">{0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 53, 371, 913, 1040, 2080, 2339, 4100, 5141, 5412, 5441, 6182, 8200, 9241, 13593, 13665, 13969, 16406, 20530, 26946, 30979, 32803, 33638, 33840, 33841, 33842, 33843, 33844, 33845, 33846, 33847, 33848, 33849, 34883, 37943, 38931, 38966, 38995, 66310, 71444, 71497, 71511, 75120, 75121, 75122, 75123, 75124, 75125, 75126, 75127, 75128, 75129, 75621, 86150, 88165, 91465, 91769, 96617, 98711, 99481}</syntaxhighlight>
 
=={{header|Arturo}}==
 
<syntaxhighlight lang="rebol">valid?: function [n][
equal? sort unique digits n
sort unique digits.base:16 n
]
 
print select 0..100000 => valid?</syntaxhighlight>
 
{{out}}
 
<pre>0 1 2 3 4 5 6 7 8 9 53 371 913 1040 2080 2339 4100 5141 5412 5441 6182 8200 9241 13593 13665 13969 16406 20530 26946 30979 32803 33638 33840 33841 33842 33843 33844 33845 33846 33847 33848 33849 34883 37943 38931 38966 38995 66310 71444 71497 71511 75120 75121 75122 75123 75124 75125 75126 75127 75128 75129 75621 86150 88165 91465 91769 96617 98711 99481</pre>
 
=={{header|AWK}}==
<syntaxhighlight lang="awk">
# syntax: GAWK -f DECIMAL_-_HEXADECIMAL_NUMBERS.AWK
BEGIN {
start = 0
stop = 99999
for (i=start; i<=stop; i++) {
tmp = sprintf("%X",i)
leng_dec = length(i)
leng_hex = length(tmp)
hits_dec = hits_hex = 0
for (j=1; j<=leng_dec; j++) {
if (tmp ~ substr(i,j,1)) {
hits_dec++
}
}
if (leng_dec == hits_dec) {
for (j=1; j<=leng_hex; j++) {
if (i ~ substr(tmp,j,1)) {
hits_hex++
}
}
}
if (leng_hex == hits_hex) {
printf("%6d%1s",i,++count%10?"":"\n")
}
}
printf("\nDecimal matches hexadecimal %d-%d: %d\n",start,stop,count)
exit(0)
}
</syntaxhighlight>
{{out}}
<pre>
0 1 2 3 4 5 6 7 8 9
53 371 913 1040 2080 2339 4100 5141 5412 5441
6182 8200 9241 13593 13665 13969 16406 20530 26946 30979
32803 33638 33840 33841 33842 33843 33844 33845 33846 33847
33848 33849 34883 37943 38931 38966 38995 66310 71444 71497
71511 75120 75121 75122 75123 75124 75125 75126 75127 75128
75129 75621 86150 88165 91465 91769 96617 98711 99481
Decimal matches hexadecimal 0-99999: 69
</pre>
 
=={{header|C}}==
<syntaxhighlight lang="c">#include <stdio.h>
#define LIMIT 100000
 
int digitset(int num, int base) {
int set;
for (set = 0; num; num /= base)
set |= 1 << num % base;
return set;
}
 
int main() {
int i, c = 0;
for (i = 0; i < LIMIT; i++)
if (digitset(i,10) == digitset(i,16))
printf("%6d%c", i, ++c%10 ? ' ' : '\n');
printf("\n");
return 0;
}</syntaxhighlight>
{{out}}
<pre> 0 1 2 3 4 5 6 7 8 9
53 371 913 1040 2080 2339 4100 5141 5412 5441
6182 8200 9241 13593 13665 13969 16406 20530 26946 30979
32803 33638 33840 33841 33842 33843 33844 33845 33846 33847
33848 33849 34883 37943 38931 38966 38995 66310 71444 71497
71511 75120 75121 75122 75123 75124 75125 75126 75127 75128
75129 75621 86150 88165 91465 91769 96617 98711 99481</pre>
 
=={{header|C++}}==
<syntaxhighlight lang="cpp">#include <iostream>
#include <iomanip>
#include <bitset>
 
const int LIMIT = 100000;
 
std::bitset<16> digitset(int num, int base) {
std::bitset<16> set;
for (; num; num /= base) set.set(num % base);
return set;
}
 
int main() {
int c = 0;
for (int i=0; i<LIMIT; i++) {
if (digitset(i,10) == digitset(i,16)) {
std::cout << std::setw(7) << i;
if (++c % 10 == 0) std::cout << std::endl;
}
}
std::cout << std::endl;
return 0;
}</syntaxhighlight>
{{out}}
<pre> 0 1 2 3 4 5 6 7 8 9
53 371 913 1040 2080 2339 4100 5141 5412 5441
6182 8200 9241 13593 13665 13969 16406 20530 26946 30979
32803 33638 33840 33841 33842 33843 33844 33845 33846 33847
33848 33849 34883 37943 38931 38966 38995 66310 71444 71497
71511 75120 75121 75122 75123 75124 75125 75126 75127 75128
75129 75621 86150 88165 91465 91769 96617 98711 99481</pre>
 
=={{header|Cowgol}}==
<syntaxhighlight lang="cowgol">include "cowgol.coh";
 
const LIMIT := 100000;
 
sub digitset(n: uint32, base: uint8): (set: uint16) is
var one: uint16 := 1;
set := 0;
while n != 0 loop
set := set | (one << (n % base as uint32) as uint8);
n := n / base as uint32;
end loop;
end sub;
 
var i: uint32 := 0;
var c: uint8 := 0;
while i < LIMIT loop
if digitset(i,10) == digitset(i,16) then
print_i32(i);
if c<9 then
c := c + 1;
print_char('\t');
else
c := 0;
print_nl();
end if;
end if;
i := i + 1;
end loop;
print_nl();</syntaxhighlight>
{{out}}
<pre>0 1 2 3 4 5 6 7 8 9
53 371 913 1040 2080 2339 4100 5141 5412 5441
6182 8200 9241 13593 13665 13969 16406 20530 26946 30979
32803 33638 33840 33841 33842 33843 33844 33845 33846 33847
33848 33849 34883 37943 38931 38966 38995 66310 71444 71497
71511 75120 75121 75122 75123 75124 75125 75126 75127 75128
75129 75621 86150 88165 91465 91769 96617 98711 99481</pre>
 
=={{header|Draco}}==
<syntaxhighlight lang="draco">proc nonrec digitset(ulong n; byte b) word:
word set;
set := 0;
while n ~= 0 do
set := set | 1 << make(n % b, byte);
n := n / b
od;
set
corp
 
proc nonrec main() void:
ulong MAX = 100000;
ulong n;
byte col;
n := 0;
col := 0;
while n<MAX do
if digitset(n,10) = digitset(n,16) then
write(n:8);
col := col + 1;
if col % 10 = 0 then writeln() fi
fi;
n := n + 1;
od;
writeln()
corp</syntaxhighlight>
{{out}}
<pre> 0 1 2 3 4 5 6 7 8 9
53 371 913 1040 2080 2339 4100 5141 5412 5441
6182 8200 9241 13593 13665 13969 16406 20530 26946 30979
32803 33638 33840 33841 33842 33843 33844 33845 33846 33847
33848 33849 34883 37943 38931 38966 38995 66310 71444 71497
71511 75120 75121 75122 75123 75124 75125 75126 75127 75128
75129 75621 86150 88165 91465 91769 96617 98711 99481</pre>
 
=={{header|Delphi}}==
{{works with|Delphi|6.0}}
{{libheader|SysUtils,StdCtrls}}
 
 
<syntaxhighlight lang="Delphi">
function HasSameDigits1016(N: integer): boolean;
{Return true if base-10 string and base-16 string have same characters}
var S10,S16: string;
var I: integer;
begin
Result:=False;
{Get base-10 and -16 string}
S10:=IntToStr(N);
S16:=Format('%x',[N]);
{Compare S10 to S16}
for I:=1 to Length(S10) do
if Pos(S10[I],S16)=0 then exit;
{Compare S16 to S10}
for I:=1 to Length(S16) do
if Pos(S16[I],S10)=0 then exit;
Result:=True;
end;
 
 
procedure ShowSameDigits1016(Memo: TMemo);
var I,Cnt: integer;
var S: string;
begin
Cnt:=0;
for I:=0 to 100000-1 do
if HasSameDigits1016(I) then
begin
Inc(Cnt);
S:=S+Format('%8D',[I]);
If (Cnt mod 5)=0 then S:=S+CRLF;
end;
Memo.Lines.Add(S);
Memo.Lines.Add('Count='+IntToStr(Cnt));
end;
 
 
</syntaxhighlight>
{{out}}
<pre>
0 1 2 3 4
5 6 7 8 9
53 371 913 1040 2080
2339 4100 5141 5412 5441
6182 8200 9241 13593 13665
13969 16406 20530 26946 30979
32803 33638 33840 33841 33842
33843 33844 33845 33846 33847
33848 33849 34883 37943 38931
38966 38995 66310 71444 71497
71511 75120 75121 75122 75123
75124 75125 75126 75127 75128
75129 75621 86150 88165 91465
91769 96617 98711 99481
Count=69
Elapsed Time: 41.373 ms.
 
</pre>
 
 
=={{header|F_Sharp|F#}}==
<syntaxhighlight lang="fsharp">
// Decimal-Hexdecimal: Nigel Galloway. June 7th., 2021
let rec fN g=function n when n<10->Some(Set.add n g)|n when n%16<10->fN(g.Add(n%16))(n/16) |_->None
let rec fG n g=match n/10,n%10 with (0,n)->Some(Set.add n g)|(n,i)->fG n (Set.add i g)
let g=Set.empty in seq{0..100000}|>Seq.filter(fun n->fN g n=fG n g)|>Seq.iter(printf "%d "); printfn ""
</syntaxhighlight>
{{out}}
<pre>
0 1 2 3 4 5 6 7 8 9 53 371 913 1040 2080 2339 4100 5141 5412 5441 6182 8200 9241 13593 13665 13969 16406 20530 26946 30979 32803 33638 33840 33841 33842 33843 33844 33845 33846 33847 33848 33849 34883 37943 38931 38966 38995 66310 71444 71497 71511 75120 75121 75122 75123 75124 75125 75126 75127 75128 75129 75621 86150 88165 91465 91769 96617 98711 99481
</pre>
 
=={{header|Factor}}==
{{works with|Factor|0.99 2021-02-05}}
<langsyntaxhighlight lang="factor">USING: formatting grouping io kernel math.parser present
sequences sets ;
 
100,000 <iota> [ dup present swap >hex set= ] filter
10 group [ [ "%5d " printf ] each nl ] each</langsyntaxhighlight>
{{out}}
<pre>
Line 106 ⟶ 496:
</pre>
 
=={{header|JuliaFreeBASIC}}==
<syntaxhighlight lang="freebasic">function is_sds( byval n as integer ) as boolean
The requirements seem to depend upon interpretations of set and duplicates. Hex number is shown to demonstrate how numbers fit the revised task. The revised task may or may not disallow leading zeros for the base 16 number.
dim as boolean in_dec(0 to 9), in_hex(0 to 9)
<lang Julia>using Combinatorics
dim as integer nd = n, dh
while nd
in_dec( nd mod 10 ) = true
nd \= 10
wend
while n
dh = n mod 16
if dh > 9 then return false
in_hex( dh ) = true
n \= 16
wend
for i as uinteger = 0 to 9
if in_dec(i) <> in_hex(i) then return false
next i
return true
end function
 
dim as integer i, c=0
function dheq(N)
found = 0
for i in 0:N
d = digits(i)
dlen = length(unique(d))
for j in dlen:length(d), c in Iterators.filter(x -> length(unique(x)) == dlen,
Combinatorics.with_replacement_combinations(d, j)), p in permutations(c)
if evalpoly(16, p) == i && (length(p) == 1 || p[end] != 0 || count(x -> x == 0, p) > 1)
print(rpad(i, 5), " = 0x", rpad(evalpoly(10, p), 8), (found += 1) % 5 == 0 ? "\n" : "")
break
end
end
end
end
 
for i = 0 to 99999
dheq(100000)
if is_sds(i) then
</lang>{{out}}
print using "##### ";i;
c+=1
if c mod 10 = 0 then print
end if
next i</syntaxhighlight>
{{out}}<pre> 0 1 2 3 4 5 6 7 8 9
53 371 913 1040 2080 2339 4100 5141 5412 5441
6182 8200 9241 13593 13665 13969 16406 20530 26946 30979
32803 33638 33840 33841 33842 33843 33844 33845 33846 33847
33848 33849 34883 37943 38931 38966 38995 66310 71444 71497
71511 75120 75121 75122 75123 75124 75125 75126 75127 75128
75129 75621 86150 88165 91465 91769 96617 98711 99481
</pre>
 
=={{header|Go}}==
{{trans|Wren}}
<syntaxhighlight lang="go">package main
 
import (
"fmt"
"rcu"
"strconv"
)
 
func equalSets(s1, s2 map[rune]bool) bool {
if len(s1) != len(s2) {
return false
}
for k, _ := range s1 {
_, ok := s2[k]
if !ok {
return false
}
}
return true
}
 
func main() {
const limit = 100_000
count := 0
fmt.Println("Numbers under 100,000 which use the same digits in decimal or hex:")
for n := 0; n < limit; n++ {
h := strconv.FormatInt(int64(n), 16)
hs := make(map[rune]bool)
for _, c := range h {
hs[c] = true
}
ns := make(map[rune]bool)
for _, c := range strconv.Itoa(n) {
ns[c] = true
}
if equalSets(hs, ns) {
count++
fmt.Printf("%6s ", rcu.Commatize(n))
if count%10 == 0 {
fmt.Println()
}
}
}
fmt.Printf("\n\n%d such numbers found.\n", count)
}</syntaxhighlight>
 
{{out}}
<pre>
Numbers under 100,000 which use the same digits in decimal or hex:
0 = 0x0 1 = 0x1 2 = 0x2 3 = 0x3 4 = 0x4
5 =0 0x5 1 6 2 = 0x6 3 7 4 = 0x7 5 8 6 = 0x8 7 9 = 0x98 9
53 = 0x35 53 371 = 0x173 913 = 0x391 1040 = 0x4101,040 2,080 2,339 2080 4,100 = 0x8205,141 5,412 5,441
6,182 8,200 9,241 13,593 13,665 13,969 16,406 20,530 26,946 30,979
2339 = 0x923 4100 = 0x1004 5141 = 0x1415 5412 = 0x1524 5441 = 0x1541
32,803 33,638 33,840 33,841 33,842 33,843 33,844 33,845 33,846 33,847
6182 = 0x1826 8200 = 0x2008 9241 = 0x2419 13593 = 0x3519 13665 = 0x3561
33,848 33,849 34,883 37,943 38,931 38,966 38,995 66,310 71,444 71,497
13969 = 0x3691 16406 = 0x4016 20530 = 0x5032 26946 = 0x6942 30979 = 0x7903
71,511 75,120 75,121 75,122 75,123 75,124 75,125 75,126 75,127 75,128
32803 = 0x8023 33638 = 0x8366 33840 = 0x8430 33841 = 0x8431 33842 = 0x8432
75,129 75,621 86,150 88,165 91,465 91,769 96,617 98,711 99,481
33843 = 0x8433 33844 = 0x8434 33845 = 0x8435 33846 = 0x8436 33847 = 0x8437
 
33848 = 0x8438 33849 = 0x8439 34883 = 0x8843 37943 = 0x9437 38931 = 0x9813
69 such numbers found.
38966 = 0x9836 38995 = 0x9853 66310 = 0x10306 71444 = 0x11714 71497 = 0x11749
71511 = 0x11757 75120 = 0x12570 75121 = 0x12571 75122 = 0x12572 75123 = 0x12573
75124 = 0x12574 75125 = 0x12575 75126 = 0x12576 75127 = 0x12577 75128 = 0x12578
75129 = 0x12579 75621 = 0x12765 86150 = 0x15086 88165 = 0x15865 91465 = 0x16549
91769 = 0x16679 96617 = 0x17969 98711 = 0x18197 99481 = 0x18499
</pre>
 
== with string representation ==
=={{header|Haskell}}==
<lang julia>dhstring(N) = [i for i in 0:N if sort(unique(collect(string(i)))) == sort(unique(collect(string(i, base=16))))]
<syntaxhighlight lang="haskell">import qualified Data.Set as S
import Numeric (showHex)
 
---- NUMBERS WITH THE SAME DIGIT SET IN DECIMAL AND HEX --
 
sameDigitSet :: (Integral a, Show a) => a -> [(a, String)]
sameDigitSet n =
[ (n, h)
| let h = showHex n "",
S.fromList h == S.fromList (show n)
]
 
--------------------------- TEST -------------------------
main = do
print ("decimal", "hex")
mapM_ print $ [0 .. 100000] >>= sameDigitSet</syntaxhighlight>
{{Out}}
<pre>("decimal","hex")
(0,"0")
(1,"1")
(2,"2")
(3,"3")
(4,"4")
(5,"5")
(6,"6")
(7,"7")
(8,"8")
(9,"9")
(53,"35")
(371,"173")
(913,"391")
(1040,"410")
(2080,"820")
(2339,"923")
(4100,"1004")
(5141,"1415")
(5412,"1524")
(5441,"1541")
(6182,"1826")
(8200,"2008")
(9241,"2419")
(13593,"3519")
(13665,"3561")
(13969,"3691")
(16406,"4016")
(20530,"5032")
(26946,"6942")
(30979,"7903")
(32803,"8023")
(33638,"8366")
(33840,"8430")
(33841,"8431")
(33842,"8432")
(33843,"8433")
(33844,"8434")
(33845,"8435")
(33846,"8436")
(33847,"8437")
(33848,"8438")
(33849,"8439")
(34883,"8843")
(37943,"9437")
(38931,"9813")
(38966,"9836")
(38995,"9853")
(66310,"10306")
(71444,"11714")
(71497,"11749")
(71511,"11757")
(75120,"12570")
(75121,"12571")
(75122,"12572")
(75123,"12573")
(75124,"12574")
(75125,"12575")
(75126,"12576")
(75127,"12577")
(75128,"12578")
(75129,"12579")
(75621,"12765")
(86150,"15086")
(88165,"15865")
(91465,"16549")
(91769,"16679")
(96617,"17969")
(98711,"18197")
(99481,"18499")</pre>
 
=={{header|J}}==
 
Decimal numbers on left:<syntaxhighlight lang="j"> require'convert'
(":,.' ',.;@hfd"1),.I.(": -:&~.&(/:~) hfd)"0 i.1e5
0 0
1 1
2 2
3 3
4 4
5 5
6 6
7 7
8 8
9 9
53 35
371 173
913 391
1040 410
2080 820
2339 923
4100 1004
5141 1415
5412 1524
5441 1541
6182 1826
8200 2008
9241 2419
13593 3519
13665 3561
13969 3691
16406 4016
20530 5032
26946 6942
30979 7903
32803 8023
33638 8366
33840 8430
33841 8431
33842 8432
33843 8433
33844 8434
33845 8435
33846 8436
33847 8437
33848 8438
33849 8439
34883 8843
37943 9437
38931 9813
38966 9836
38995 9853
66310 10306
71444 11714
71497 11749
71511 11757
75120 12570
75121 12571
75122 12572
75123 12573
75124 12574
75125 12575
75126 12576
75127 12577
75128 12578
75129 12579
75621 12765
86150 15086
88165 15865
91465 16549
91769 16679
96617 17969
98711 18197
99481 18499</syntaxhighlight>
 
=={{header|JavaScript}}==
<syntaxhighlight lang="javascript">(() => {
"use strict";
 
const main = () => [
"(dec, hex)",
...enumFromTo(1)(100000).flatMap(n => {
const
d = n.toString(10),
h = n.toString(16);
 
return eqSet(new Set(d))(
new Set(h)
) ? [
`(${d}, ${h})`
] : [];
})
].join("\n");
 
 
// --------------------- GENERIC ---------------------
 
// enumFromTo :: Int -> Int -> [Int]
const enumFromTo = m =>
n => Array.from({
length: 1 + n - m
}, (_, i) => m + i);
 
 
// eqSet :: Set a -> Set a -> Bool
const eqSet = a =>
// True if the two sets have
// the same size and members.
b => a.size === b.size && (
Array.from(a).every(x => b.has(x))
);
 
// MAIN ---
return main();
})();</syntaxhighlight>
{{Out}}
<pre>(dec, hex)
(1, 1)
(2, 2)
(3, 3)
(4, 4)
(5, 5)
(6, 6)
(7, 7)
(8, 8)
(9, 9)
(53, 35)
(371, 173)
(913, 391)
(1040, 410)
(2080, 820)
(2339, 923)
(4100, 1004)
(5141, 1415)
(5412, 1524)
(5441, 1541)
(6182, 1826)
(8200, 2008)
(9241, 2419)
(13593, 3519)
(13665, 3561)
(13969, 3691)
(16406, 4016)
(20530, 5032)
(26946, 6942)
(30979, 7903)
(32803, 8023)
(33638, 8366)
(33840, 8430)
(33841, 8431)
(33842, 8432)
(33843, 8433)
(33844, 8434)
(33845, 8435)
(33846, 8436)
(33847, 8437)
(33848, 8438)
(33849, 8439)
(34883, 8843)
(37943, 9437)
(38931, 9813)
(38966, 9836)
(38995, 9853)
(66310, 10306)
(71444, 11714)
(71497, 11749)
(71511, 11757)
(75120, 12570)
(75121, 12571)
(75122, 12572)
(75123, 12573)
(75124, 12574)
(75125, 12575)
(75126, 12576)
(75127, 12577)
(75128, 12578)
(75129, 12579)
(75621, 12765)
(86150, 15086)
(88165, 15865)
(91465, 16549)
(91769, 16679)
(96617, 17969)
(98711, 18197)
(99481, 18499)</pre>
 
=={{header|jq}}==
{{works with|jq}}
'''Also works with gojq, the Go implementation of jq'''.
 
'''Also works with fq, a Go implementation of a large subset of jq'''
<syntaxhighlight lang=jq>
# The def of _nwise/1 is included here in case gojq or fq is used.
def _nwise($n):
def nw: if length <= $n then . else .[0:$n] , (.[$n:] | nw) end;
nw;
 
def chars: explode[] | [.] | implode;
 
# decimal number to hex string using lower-case letters
def hex:
def stream:
recurse(if . > 0 then ./16|floor else empty end) | . % 16 ;
if . == 0 then "0"
else [stream] | reverse | .[1:]
| map(if . < 10 then 48 + . else . + 87 end) | implode
end;
 
def lpad($len): tostring | ($len - length) as $l | (" " * $l)[:$l] + .;
 
# Emit a stream of same-digit numbers, up to .
def sameDigitSettasktask:
def u: [tostring|chars] | unique;
range(0; .) | select((hex|u) == u);
# The task
1e5
| "Numbers under \(.) which use the same digits in decimal as in hex:",
( [sameDigitSettasktask]
| map(lpad(6))
| ((_nwise(10) | join(" ")),
"\n\(length) such numbers found." ) )
</syntaxhighlight>
{{output}}
<pre>
Numbers under 100000 which use the same digits in decimal as in hex:
0 1 2 3 4 5 6 7 8 9
53 371 913 1040 2080 2339 4100 5141 5412 5441
6182 8200 9241 13593 13665 13969 16406 20530 26946 30979
32803 33638 33840 33841 33842 33843 33844 33845 33846 33847
33848 33849 34883 37943 38931 38966 38995 66310 71444 71497
71511 75120 75121 75122 75123 75124 75125 75126 75127 75128
75129 75621 86150 88165 91465 91769 96617 98711 99481
 
69 such numbers found.
</pre>
 
=={{header|Julia}}==
<syntaxhighlight lang="julia">dhstring(N) = [i for i in 0:N if sort(unique(digits(i))) == sort(unique(digits(i, base=16)))]
 
foreach(p -> print(rpad(p[2], 6), p[1] % 10 == 0 ? "\n" : ""), enumerate(dhstring(100000)))
</langsyntaxhighlight>{{out}}
<pre>
0 1 2 3 4 5 6 7 8 9
Line 156 ⟶ 934:
71511 75120 75121 75122 75123 75124 75125 75126 75127 75128
75129 75621 86150 88165 91465 91769 96617 98711 99481
</pre>
 
=={{header|Mathematica}}/{{header|Wolfram Language}}==
<syntaxhighlight lang="mathematica">ClearAll[Base1016SameDigitsQ]
Base1016SameDigitsQ[n_Integer] := Module[{id10, id16},
id10 = Union[IntegerDigits[n, 10]];
id16 = Union[IntegerDigits[n, 16]];
id10 === id16
]
Multicolumn[Select[Range[0, 10^5 - 1], Base1016SameDigitsQ], Appearance -> "Horizontal"]</syntaxhighlight>
{{out}}
<pre>0 1 2 3 4 5 6 7
8 9 53 371 913 1040 2080 2339
4100 5141 5412 5441 6182 8200 9241 13593
13665 13969 16406 20530 26946 30979 32803 33638
33840 33841 33842 33843 33844 33845 33846 33847
33848 33849 34883 37943 38931 38966 38995 66310
71444 71497 71511 75120 75121 75122 75123 75124
75125 75126 75127 75128 75129 75621 86150 88165
91465 91769 96617 98711 99481
</pre>
 
Line 161 ⟶ 959:
There are many ways to find the numbers. We chose to build directly the set of digits in base 10 and base 16 rather than using the string representations (more code but more efficient).
 
<langsyntaxhighlight Nimlang="nim">import strutils, sugar
 
const Lim = 99_999
Line 185 ⟶ 983:
for i, n in list:
stdout.write ($n).align(5), if (i + 1) mod 10 == 0: '\n' else: ' '
echo()</langsyntaxhighlight>
 
{{out}}
Line 196 ⟶ 994:
71511 75120 75121 75122 75123 75124 75125 75126 75127 75128
75129 75621 86150 88165 91465 91769 96617 98711 99481 </pre>
 
=={{header|OCaml}}==
 
<syntaxhighlight lang="ocaml">module CSet = Set.Make(struct
type t = char
let compare = compare
end)
 
let str2cset str = CSet.add_seq (String.to_seq str) CSet.empty
 
let has_same_digits n =
let deci = Format.sprintf "%d" n in
let hexa = Format.sprintf "%x" n in
(* Don't use '=' to compare sets, it only returns true
for sets that are structurally the same, (same elements added in same order)
use CSet.equal to check they have the same elements *)
CSet.equal (str2cset deci) (str2cset hexa)
 
let rec list_similar ?(acc=[]) n =
if n < 0 then acc
else if has_same_digits n then list_similar ~acc:(n::acc) (n-1)
else list_similar ~acc (n-1)
 
let () =
let same_digits = list_similar 100_000 in
List.iteri (fun i x ->
Format.printf "%6d:%#8x%s" x x (if i mod 6 = 5 then "\n" else " ")) same_digits;
print_newline ()</syntaxhighlight>
 
{{out}}
<pre> 0: 0 1: 0x1 2: 0x2 3: 0x3 4: 0x4 5: 0x5
6: 0x6 7: 0x7 8: 0x8 9: 0x9 53: 0x35 371: 0x173
913: 0x391 1040: 0x410 2080: 0x820 2339: 0x923 4100: 0x1004 5141: 0x1415
5412: 0x1524 5441: 0x1541 6182: 0x1826 8200: 0x2008 9241: 0x2419 13593: 0x3519
13665: 0x3561 13969: 0x3691 16406: 0x4016 20530: 0x5032 26946: 0x6942 30979: 0x7903
32803: 0x8023 33638: 0x8366 33840: 0x8430 33841: 0x8431 33842: 0x8432 33843: 0x8433
33844: 0x8434 33845: 0x8435 33846: 0x8436 33847: 0x8437 33848: 0x8438 33849: 0x8439
34883: 0x8843 37943: 0x9437 38931: 0x9813 38966: 0x9836 38995: 0x9853 66310: 0x10306
71444: 0x11714 71497: 0x11749 71511: 0x11757 75120: 0x12570 75121: 0x12571 75122: 0x12572
75123: 0x12573 75124: 0x12574 75125: 0x12575 75126: 0x12576 75127: 0x12577 75128: 0x12578
75129: 0x12579 75621: 0x12765 86150: 0x15086 88165: 0x15865 91465: 0x16549 91769: 0x16679
96617: 0x17969 98711: 0x18197 99481: 0x18499 </pre>
 
=={{header|Pascal}}==
simply adding 1 to a number and convert as if hex digits.
<syntaxhighlight lang="pascal">program Dec_Hex_same_UsedDigits;
{$IFDEF FPC}
{$MODE DELPHI} {$OPTIMIZATION ON,ALL} {$COPERATORS ON}
{$ELSE}
{$APPTYPE CONSOLE}
{$ENDIF}
const
UpperLimit = 100*1000;//1000*1000*1000
type
tUsedDigits = array[0..15] of byte;
var
FormCnt: Int32;
UsedDigits : tUsedDigits;
 
procedure Out_(n,h:Uint32);
Begin
write(n:11,':',h:7);
inc(FormCnt);
If FormCnt >= 4 then
Begin
FormCnt := 0;
writeln;
end;
end;
 
function DecHexToDec(n:Uint32):UInt32;
//convert n as its decimal digits are a hex number
//marking used Digits
var
pD : pUint64;
q,r,pot16 : UInt32;
begin
//clear UsedDigits
//For q := Low(UsedDigits) to High(UsedDigits) do UsedDigits[q] := 0;
//much faster
pD := @UsedDigits;pD[0]:= 0;pD[1]:= 0;
 
result := 0;
pot16 := 0;
repeat
q := n Div 10;
r := n - 10* q;//n mod 10
//marked by hex
UsedDigits[r] := 2;
result := result+ r shl pot16;
inc(pot16,4);
n := q;
until n = 0;
end;
 
var
DecHex,n:Uint32;
i,q,r,count : Uint32;
Begin
FormCnt := 0;
count := 0;
DecHex := 0;
repeat
n := DecHexToDec(DecHex);
if n > UpperLimit then
break;
//check UsedDigits
i := n;
repeat
q := i Div 10;
r := i - 10* q;
//if unused digit then break
if UsedDigits[r] = 0 then
BREAK;
//marked by dec
UsedDigits[r] := 1;
i := q;
until i = 0;
if i = 0 then
Begin
repeat
//was marked only by hex
if UsedDigits[i]>1 then
break;
inc(i);
until i > 9;
if i > 9 then
Begin
if n< 100*1000 then
Out_(n,DecHex);
inc(count);
end;
end;
inc(DecHex);
until false;
writeln;
writeln('count : ',count);
END.
</syntaxhighlight>
{{out}}
<pre>TIO.RUN
0: 0 1: 1 2: 2 3: 3
4: 4 5: 5 6: 6 7: 7
8: 8 9: 9 53: 35 371: 173
913: 391 1040: 410 2080: 820 2339: 923
4100: 1004 5141: 1415 5412: 1524 5441: 1541
6182: 1826 8200: 2008 9241: 2419 13593: 3519
13665: 3561 13969: 3691 16406: 4016 20530: 5032
26946: 6942 30979: 7903 32803: 8023 33638: 8366
33840: 8430 33841: 8431 33842: 8432 33843: 8433
33844: 8434 33845: 8435 33846: 8436 33847: 8437
33848: 8438 33849: 8439 34883: 8843 37943: 9437
38931: 9813 38966: 9836 38995: 9853 66310: 10306
71444: 11714 71497: 11749 71511: 11757 75120: 12570
75121: 12571 75122: 12572 75123: 12573 75124: 12574
75125: 12575 75126: 12576 75127: 12577 75128: 12578
75129: 12579 75621: 12765 86150: 15086 88165: 15865
91465: 16549 91769: 16679 96617: 17969 98711: 18197
99481: 18499
count : 69
//1000*1000*1000
966366598:39999586 966366853:39999685
count : 54558 Real time: 1.666 s</pre>
 
=={{header|Perl}}==
<syntaxhighlight lang="perl">use strict;
no warnings;
use feature 'say';
 
sub eqv { (join '', sort split '', $_[0]) eq (join '', sort split '', $_[1]) }
say join ' ', grep { eqv $_, sprintf '%x', $_ } 1..100_000;</syntaxhighlight>
{{out}}
<pre>1 2 3 4 5 6 7 8 9 53 371 913 4100 5141 5412 6182 8200 9241 75120 75121 75122 75123 75124 75125 75126 75127 75128 75129 75621 86150 91465 98711 99481</pre>
 
=={{header|Phix}}==
<!--<langsyntaxhighlight Phixlang="phix">(phixonline)-->
<span style="color: #008080;">function</span> <span style="color: #000000;">handusc</span><span style="color: #0000FF;">(</span><span style="color: #004080;">integer</span> <span style="color: #000000;">n</span><span style="color: #0000FF;">)</span> <span style="color: #008080;">return</span> <span style="color: #7060A8;">unique</span><span style="color: #0000FF;">(</span><span style="color: #7060A8;">sprintf</span><span style="color: #0000FF;">(</span><span style="color: #008000;">"%x"</span><span style="color: #0000FF;">,</span><span style="color: #000000;">n</span><span style="color: #0000FF;">))=</span><span style="color: #7060A8;">unique</span><span style="color: #0000FF;">(</span><span style="color: #7060A8;">sprintf</span><span style="color: #0000FF;">(</span><span style="color: #008000;">"%d"</span><span style="color: #0000FF;">,</span><span style="color: #000000;">n</span><span style="color: #0000FF;">))</span> <span style="color: #008080;">end</span> <span style="color: #008080;">function</span>
<span style="color: #0000FF;">?</span><span style="color: #7060A8;">shorten</span><span style="color: #0000FF;">(</span><span style="color: #7060A8;">filter</span><span style="color: #0000FF;">(</span><span style="color: #7060A8;">tagset</span><span style="color: #0000FF;">(</span><span style="color: #000000;">100000</span><span style="color: #0000FF;">,</span><span style="color: #000000;">0</span><span style="color: #0000FF;">),</span><span style="color: #000000;">handusc</span><span style="color: #0000FF;">),</span><span style="color: #008000;">"found"</span><span style="color: #0000FF;">,</span><span style="color: #000000;">10</span><span style="color: #0000FF;">)</span>
<!--</langsyntaxhighlight>-->
{{out}}
<pre>
{0,1,2,3,4,5,6,7,8,9,"...",75128,75129,75621,86150,88165,91465,91769,96617,98711,99481," (69 found)"}
</pre>
 
=={{header|Python}}==
===Procedural===
<syntaxhighlight lang="python">col = 0
for i in range(100000):
if set(str(i)) == set(hex(i)[2:]):
col += 1
print("{:7}".format(i), end='\n'[:col % 10 == 0])
print()</syntaxhighlight>
{{out}}
<pre> 0 1 2 3 4 5 6 7 8 9
53 371 913 1040 2080 2339 4100 5141 5412 5441
6182 8200 9241 13593 13665 13969 16406 20530 26946 30979
32803 33638 33840 33841 33842 33843 33844 33845 33846 33847
33848 33849 34883 37943 38931 38966 38995 66310 71444 71497
71511 75120 75121 75122 75123 75124 75125 75126 75127 75128
75129 75621 86150 88165 91465 91769 96617 98711 99481</pre>
 
===Functional===
<syntaxhighlight lang="python">'''Decimal - Hexadecimal numbers'''
 
 
# p :: Int -> Bool
def p(n):
'''True if the hex and dec representations
of n use the same set of digits.
'''
return set(hex(n)[2:]) == set(str(n))
 
 
# ------------------------- TEST -------------------------
# main :: IO ()
def main():
'''Matches below 100000'''
print(
table(10)([
str(x) for x in range(100000)
if p(x)
])
)
 
 
# ----------------------- GENERIC ------------------------
 
# chunksOf :: Int -> [a] -> [[a]]
def chunksOf(n):
'''A series of lists of length n, subdividing the
contents of xs. Where the length of xs is not evenly
divisible, the final list will be shorter than n.
'''
def go(xs):
return (
xs[i:n + i] for i in range(0, len(xs), n)
) if 0 < n else None
return go
 
 
# table :: Int -> [a] -> String
def table(n):
'''A list of values formatted as
right-justified rows of n columns.
'''
def go(xs):
w = len(xs[-1])
return '\n'.join(
' '.join(row) for row in chunksOf(n)([
x.rjust(w, ' ') for x in xs
])
)
return go
 
 
# MAIN ---
if __name__ == '__main__':
main()</syntaxhighlight>
{{Out}}
<pre> 0 1 2 3 4 5 6 7 8 9
53 371 913 1040 2080 2339 4100 5141 5412 5441
6182 8200 9241 13593 13665 13969 16406 20530 26946 30979
32803 33638 33840 33841 33842 33843 33844 33845 33846 33847
33848 33849 34883 37943 38931 38966 38995 66310 71444 71497
71511 75120 75121 75122 75123 75124 75125 75126 75127 75128
75129 75621 86150 88165 91465 91769 96617 98711 99481</pre>
 
or in terms of a list comprehension:
 
<syntaxhighlight lang="python">for nh in ([
(n, h) for n in range(0, 1 + 100000)
if (
(h := hex(n)[2:])
and set(str(n)) == set(h)
)
]):
print(nh)</syntaxhighlight>
<pre>(0, '0')
(1, '1')
(2, '2')
(3, '3')
(4, '4')
(5, '5')
(6, '6')
(7, '7')
(8, '8')
(9, '9')
(53, '35')
(371, '173')
(913, '391')
(1040, '410')
(2080, '820')
(2339, '923')
(4100, '1004')
(5141, '1415')
(5412, '1524')
(5441, '1541')
(6182, '1826')
(8200, '2008')
(9241, '2419')
(13593, '3519')
(13665, '3561')
(13969, '3691')
(16406, '4016')
(20530, '5032')
(26946, '6942')
(30979, '7903')
(32803, '8023')
(33638, '8366')
(33840, '8430')
(33841, '8431')
(33842, '8432')
(33843, '8433')
(33844, '8434')
(33845, '8435')
(33846, '8436')
(33847, '8437')
(33848, '8438')
(33849, '8439')
(34883, '8843')
(37943, '9437')
(38931, '9813')
(38966, '9836')
(38995, '9853')
(66310, '10306')
(71444, '11714')
(71497, '11749')
(71511, '11757')
(75120, '12570')
(75121, '12571')
(75122, '12572')
(75123, '12573')
(75124, '12574')
(75125, '12575')
(75126, '12576')
(75127, '12577')
(75128, '12578')
(75129, '12579')
(75621, '12765')
(86150, '15086')
(88165, '15865')
(91465, '16549')
(91769, '16679')
(96617, '17969')
(98711, '18197')
(99481, '18499')</pre>
 
=={{header|Quackery}}==
 
<langsyntaxhighlight Quackerylang="quackery"> [ 0 swap witheach [ bit | ] ] is ->set ( [ --> s )
 
[ 10 base put
Line 223 ⟶ 1,357:
[ i^ number$
nested join ] ]
60 wrap$</langsyntaxhighlight>
 
{{out}}
Line 237 ⟶ 1,371:
 
=={{header|Raku}}==
Only bother to check numbers that could possibly match.
Much is left open to interpretation.
 
Several different interpretations of the (originally very vague) task instructions. It has now been clarified to mean the second.
Numbers which when expressed in decimal and in hexadecimal are composed '''of''' the same digit glyphs.
<lang perl6>say (^100000).hyper(:5000batch).grep( { [eqv] ($_, .fmt: '%x').map( *.comb.Bag ) } ).batch(10)».fmt('%5d').join("\n")</lang>
{{out}}
<pre> 0 1 2 3 4 5 6 7 8 9
53 371 913 4100 5141 5412 6182 8200 9241 75120
75121 75122 75123 75124 75125 75126 75127 75128 75129 75621
86150 91465 98711 99481</pre>
 
<syntaxhighlight lang="raku" line>say "Numbers up to 100,000 which when expressed in decimalhexadecimal and in hexadecimal are composed '''from''' the same digit glyphs.decimal
are composed of the same digit glyphs. (All the same glyphs, all the same
<lang perl6>say (^100000).hyper(:5000batch).grep( { [eqv] ($_, .fmt: '%x').map( *.comb.Set ) } ).batch(10)».fmt('%5d').join("\n")</lang>
quantity.)\n";
display-numbers calculated-with &infix:<eqv>, <Bag>;
 
say "\nNumbers up to 100,000 which when expressed in hexadecimal and in decimal
are composed from the same digit glyphs. (All the same glyphs are present,
possibly different quantity.)\n";
display-numbers calculated-with &infix:<eqv>, <Set>;
 
say "\nNumbers up to 100,000 which, when expressed in hexadecimal use glyphs
that are a subset of those used when expressed in decimal. (Every glyph in
decimal is present in hexadecimal the same or fewer (possibly zero) times)\n";
display-numbers calculated-with &infix:<⊆>, <Bag>;
 
say "\nNumbers up to 100,000 which, when expressed in hexadecimal use glyphs
that are a subset of those used when expressed in decimal. (Every glyph in
decimal is present in hexadecimal in some quantity, possibly zero, possibly more
than in decimal)\n";
display-numbers calculated-with &infix:<⊆>, <Set>;
 
sub display-numbers ($_) { say .elems ~ " found:\n" ~ .batch(20)».fmt('%5d').join: "\n" }
 
sub calculated-with ( &op, $container ) {
cache ^18699 .map( {:16(.Str)} ).hyper(:1000batch).grep( {
reduce( &op, (.fmt('%x'), $_).map: { .comb."$container"() } )
} )
}</syntaxhighlight>
{{out}}
<pre>Numbers which when expressed in hexadecimal and in decimal are composed of
<pre> 0 1 2 3 4 5 6 7 8 9
the same digit glyphs. (All the same glyphs, all the same quantity.)
53 371 913 1040 2080 2339 4100 5141 5412 5441
 
6182 8200 9241 13593 13665 13969 16406 20530 26946 30979
34 found:
32803 33638 33840 33841 33842 33843 33844 33845 33846 33847
0 1 2 3 4 5 6 7 8 9 53 371 913 4100 5141 5412 6182 8200 9241 75120
33848 33849 34883 37943 38931 38966 38995 66310 71444 71497
71511 75120 75121 75122 75123 75124 75125 75126 75127 75128 75129 75621 86150 91465 98711 99481
 
75129 75621 86150 88165 91465 91769 96617 98711 99481</pre>
Numbers which when expressed in hexadecimal and in decimal are composed
from the same digit glyphs. (All the same glyphs are present, possibly
different quantity.)
 
69 found:
0 1 2 3 4 5 6 7 8 9 53 371 913 1040 2080 2339 4100 5141 5412 5441
6182 8200 9241 13593 13665 13969 16406 20530 26946 30979 32803 33638 33840 33841 33842 33843 33844 33845 33846 33847
33848 33849 34883 37943 38931 38966 38995 66310 71444 71497 71511 75120 75121 75122 75123 75124 75125 75126 75127 75128
75129 75621 86150 88165 91465 91769 96617 98711 99481
 
Numbers which, when expressed in hexadecimal use glyphs that are a subset
of those used when expressed in decimal. (Every glyph in decimal is present in
hexadecimal the same or fewer (possibly zero) times)
 
141 found:
0 1 2 3 4 5 6 7 8 9 53 371 913 1040 1041 1042 1043 1044 1045 1046
1047 1048 1049 1345 1937 2080 2081 2082 2083 2084 2085 2086 2087 2088 2089 2339 4100 5141 5412 6182
8200 9241 12306 13593 13665 13969 16400 16401 16402 16403 16404 16405 16406 16407 16408 16409 16743 18453 20513 20530
20546 21025 25169 25896 25986 26370 26738 26913 26930 26946 29217 29714 30768 30784 30979 32800 32801 32802 32803 32804
32805 32806 32807 32808 32809 32850 33589 33840 33841 33842 33843 33844 33845 33846 33847 33848 33849 34868 34880 34881
34882 34883 34884 34885 34886 34887 34888 34889 36902 36950 37492 37943 38931 38960 38961 38962 38963 38964 38965 38966
38967 38968 38969 38984 38995 39298 75120 75121 75122 75123 75124 75125 75126 75127 75128 75129 75621 86150 91465 98711
99481
 
Numbers which, when expressed in hexadecimal use glyphs that are a subset
of those used when expressed in decimal. (Every glyph in decimal is present in
hexadecimal in some quantity, possibly zero, possibly more than in decimal)
 
514 found:
0 1 2 3 4 5 6 7 8 9 17 53 85 371 853 913 1024 1040 1041 1042
1043 1044 1045 1046 1047 1048 1049 1345 1365 1604 1633 1635 1638 1689 1937 2048 2080 2081 2082 2083
2084 2085 2086 2087 2088 2089 2178 2184 2339 4100 4160 4371 4417 4471 4481 4721 4913 4931 5140 5141
5412 5441 5461 6168 6182 8200 8210 8320 8721 9241 9284 9523 9625 9762 9826 9862 10248 10258 10280 10529
12304 12305 12306 12307 12320 12340 12563 12593 12643 12803 12833 12834 12835 12853 12953 13056 13057 13059 13062 13072
13073 13075 13079 13080 13104 13105 13107 13124 13171 13175 13185 13187 13209 13364 13384 13427 13448 13459 13585 13587
13589 13593 13651 13653 13654 13665 13846 13862 13926 13969 14385 14387 14388 14739 16400 16401 16402 16403 16404 16405
16406 16407 16408 16409 16420 16480 16640 16704 16740 16742 16743 17408 17409 17425 17426 17428 17431 17442 17463 17473
17476 17479 17480 17495 17524 17745 18247 18440 18449 18452 18453 18456 18472 18483 18497 18504 18564 20485 20501 20512
20513 20514 20517 20530 20531 20533 20544 20546 20548 20549 20560 20561 20562 20563 20564 20565 20566 20567 20568 20569
20576 20597 21025 21395 21504 21524 21540 21541 21845 21905 22357 22568 22658 24608 24610 24630 24640 24680 25106 25126
25169 25186 25361 25604 25634 25684 25896 25961 25986 26129 26130 26131 26134 26145 26146 26148 26150 26163 26184 26208
26210 26214 26248 26370 26407 26470 26471 26487 26658 26728 26738 26758 26913 26914 26918 26921 26930 26931 26934 26937
26946 26948 26965 26978 26982 26984 26985 28704 28706 28740 28807 29217 29337 29714 29764 29847 30467 30471 30517 30547
30567 30576 30579 30728 30768 30784 30976 30979 31097 32800 32801 32802 32803 32804 32805 32806 32807 32808 32809 32840
32850 33280 33587 33589 33638 33689 33840 33841 33842 33843 33844 33845 33846 33847 33848 33849 33864 34678 34820 34852
34867 34868 34871 34872 34880 34881 34882 34883 34884 34885 34886 34887 34888 34889 34948 34968 36902 36950 36960 37139
37169 37492 37529 37689 37779 37924 37940 37943 37945 38195 38791 38792 38793 38920 38931 38952 38960 38961 38962 38963
38964 38965 38966 38967 38968 38969 38984 38995 39048 39185 39187 39193 39200 39201 39202 39203 39204 39205 39206 39207
39208 39209 39217 39218 39219 39225 39234 39241 39250 39251 39253 39257 39266 39267 39287 39298 39313 39315 39321 66310
67140 67190 69910 69913 69921 70001 70162 70513 71025 71206 71265 71266 71286 71440 71441 71442 71443 71444 71445 71446
71447 71448 71449 71462 71473 71489 71492 71495 71497 71504 71505 71509 71511 71526 71537 71539 71540 71541 71543 71569
71680 71748 71800 71808 71809 71815 71816 71940 71953 71957 71959 71961 71993 74129 75120 75121 75122 75123 75124 75125
75126 75127 75128 75129 75621 76129 78103 78131 78135 78136 78193 79153 79731 81940 82194 82241 82471 82514 84100 84104
86150 87315 87351 87415 88145 88152 88165 90163 91465 91665 91670 91671 91673 91682 91760 91761 91762 91763 91764 91765
91766 91767 91768 91769 92561 94617 95761 96017 96617 98581 98711 98712 98713 99481</pre>
 
=={{header|REXX}}==
<langsyntaxhighlight lang="rexx">/*REXX pgm finds integers when shown in decimal and hexadecimal use the same numerals.*/
parse arg n cols . /*obtain optional argument from the CL.*/
if n=='' | n=="," then n = 100000 /*Not specified? Then use the default.*/
Line 286 ⟶ 1,495:
exit 0 /*stick a fork in it, we're all done. */
/*──────────────────────────────────────────────────────────────────────────────────────*/
commas: parse arg ?; do jc=length(?)-3 to 1 by -3; ?=insert(',', ?, jc); end; return ?</langsyntaxhighlight>
{{out|output|text=&nbsp; when using the default inputs:}}
<pre>
Line 304 ⟶ 1,513:
 
=={{header|Ring}}==
<langsyntaxhighlight lang="ring">
see "working..." + nl
 
Line 340 ⟶ 1,549:
see nl + "Found " + row + " numbers" + nl
see "done..." + nl
</syntaxhighlight>
</lang>
{{out}}
<pre>
Line 360 ⟶ 1,569:
Found 69 numbers
done...
</pre>
 
=={{header|RPL}}==
{{works with|HP|49}}
« → b
« #0
'''WHILE''' OVER '''REPEAT'''
SWAP b IDIV2
ROT SWAP ALOG R→B OR
'''END''' NIP
» » '<span style="color:blue">DIGSET</span>' STO
« { }
0 99999 '''FOR''' n
'''IF''' n 10 <span style="color:blue">DIGSET</span> n 16 <span style="color:blue">DIGSET</span> == '''THEN''' n + '''END'''
'''NEXT'''
» '<span style="color:blue">TASK</span>' STO
{{out}}
<pre>
1: { 0 1 2 3 4 5 6 7 8 9 53 371 913 1040 2080 2339 4100 5141 5412 5441 6182 8200 9241 13593 13665 13969 16406 20530 26946 30979 32803 33638 33840 33841 33842 33843 33844 33845 33846 33847 33848 33849 34883 37943 38931 38966 38995 66310 71444 71497 71511 75120 75121 75122 75123 75124 75125 75126 75127 75128 75129 75621 86150 88165 91465 91769 96617 98711 99481 }
</pre>
 
=={{header|Ruby}}==
<syntaxhighlight lang="ruby">p (1..100_000).select{|n| n.digits.to_set == n.digits(16).to_set}</syntaxhighlight>
{{out}}
<pre>
[0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 53, 371, 913, 1040, 2080, 2339, 4100, 5141, 5412, 5441, 6182, 8200, 9241, 13593, 13665, 13969, 16406, 20530, 26946, 30979, 32803, 33638, 33840, 33841, 33842, 33843, 33844, 33845, 33846, 33847, 33848, 33849, 34883, 37943, 38931, 38966, 38995, 66310, 71444, 71497, 71511, 75120, 75121, 75122, 75123, 75124, 75125, 75126, 75127, 75128, 75129, 75621, 86150, 88165, 91465, 91769, 96617, 98711, 99481]
</pre>
 
=={{header|Sidef}}==
Simple solution:
<syntaxhighlight lang="ruby">^1e5 -> grep { Set(.digits...) == Set(.digits(16)...) }.say</syntaxhighlight>
 
Recursively generate the numbers (2x faster):
<syntaxhighlight lang="ruby">func generate_from_prefix(limit, p, base, digits) {
 
var seq = [p]
 
for d in (digits) {
var t = [d, p...]
if (t.digits2num(base) <= limit) {
seq << __FUNC__(limit, t, base, digits)...
}
}
 
return seq
}
 
func numbers_with_same_digitset(limit, base = 10) {
 
(1..9).map {|p| generate_from_prefix(limit, [p], base, @(0..9))... }\
.map {|t| digits2num(t, base) }\
.grep {|t| Set(t.digits...) == Set(t.digits(base)...) }\
.sort\
.prepend(0)
}
 
say numbers_with_same_digitset(1e5, 16)</syntaxhighlight>
{{out}}
<pre>
[0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 53, 371, 913, 1040, 2080, 2339, 4100, 5141, 5412, 5441, 6182, 8200, 9241, 13593, 13665, 13969, 16406, 20530, 26946, 30979, 32803, 33638, 33840, 33841, 33842, 33843, 33844, 33845, 33846, 33847, 33848, 33849, 34883, 37943, 38931, 38966, 38995, 66310, 71444, 71497, 71511, 75120, 75121, 75122, 75123, 75124, 75125, 75126, 75127, 75128, 75129, 75621, 86150, 88165, 91465, 91769, 96617, 98711, 99481]
</pre>
 
Line 365 ⟶ 1,635:
{{libheader|Wren-fmt}}
{{libheader|Wren-set}}
<langsyntaxhighlight ecmascriptlang="wren">import "./fmt" for Conv, Fmt
import "./set" for Set
 
var limit = 1e5
Line 381 ⟶ 1,651:
}
}
System.print("\n\n%(count) such numbers found.")</langsyntaxhighlight>
 
{{out}}
Line 398 ⟶ 1,668:
 
=={{header|XPL0}}==
<langsyntaxhighlight XPL0lang="xpl0">func DigitSet(N, D);
\Return a bit array containing the set of digits in N divisible by D
int N, D;
Line 420 ⟶ 1,690:
CrLf(0); IntOut(0, Count); Text(0, " such numbers found.
")
]</langsyntaxhighlight>
 
{{out}}
Line 433 ⟶ 1,703:
69 such numbers found.
</pre>
 
=={{header|Zig}}==
{{trans|C}}
<syntaxhighlight lang="zig">const print = @import("std").debug.print;
fn digitset(numinp: u32, base: u32) u32 {
var set: u32 = 0;
var num: u32 = numinp;
while (num != 0) : (num /= base) {
set |= @as(u32, 1) << @truncate(u5, num % base);
}
return set;
}
pub fn main() void {
var i: u32 = 0;
const LIMIT: u32 = 100000;
while (i < LIMIT) : (i += 1) {
if (digitset(i, 10) == digitset(i, 16)) {
print("{}\n", .{i});
}
}
}</syntaxhighlight>
PureFox
9,476

edits

Retrieved from "https://rosettacode.org/wiki/Special:MobileDiff/312929...354859"