Colorful numbers: Difference between revisions

=={{header|C}}==

The <code>count_colorful</code> function is based on [[#Phix|Phix]].

#include <stdbool.h>

#include <stdio.h>

(end - start + 0.0) / CLOCKS_PER_SEC);

return 0;

 

{{out}}

=={{header|Factor}}==

{{works with|Factor|0.99 2021-06-02}}

math.combinatorics math.ranges prettyprint project-euler.common

sequences sequences.extras sets ;

"Count of colorful numbers by number of digits:" print

8 [1..b] [ oom-count ] zip-with dup .

{{out}}

<pre>

{{trans|Phix}}

{{libheader|Go-rcu}}

 

import (

}

fmt.Printf("\nTotal colorful numbers: %s\n", rcu.Commatize(sum))

 

{{out}}

=={{header|Haskell}}==

{{incorrect|Haskell|10 is not a Colorful number; nor is 98765432: <nowiki>6×5×4 == 5×4×3×2 == 120</nowiki>}}

import Data.List.Split ( divvy )

import Data.Char ( digitToInt )

 

solution2 :: Integer

{{out}}

<pre>[0,1,2,3,4,5,6,7,8,9,10,23,24,25,26,27,28,29,32,34,35,36,37,38,39,42,43,45,46,47,48,49,52,53,54,56,57,58,59,62,63,64,65,67,68,69,72,73,74,75,76,78,79,82,83,84,85,86,87,89,92,93,94,95,96,97,98](solution1)

=={{header|Haskell (alternate version)}}==

An alternate Haskell version, which some may consider to be in a more idiomatic style. No attempt at optimization has been made, so we don't attempt the stretch goals.

 

-- Non-empty subsequences containing only consecutive elements from the

let start = 98765432

largest = head $ dropWhile (not . isColorful) [start, start-1 ..]

{{out}}

<pre>

=={{header|J}}==

 

I.colorful i.100

0 1 2 3 4 5 6 7 8 9 23 24 25 26 27 28 29 32 34 35 36 37 38 39 42 43 45 46 47 48 49 52 53 54 56 57 58 59 62 63 64 65 67 68 69 72 73 74 75 76 78 79 82 83 84 85 86 87 89 92 93 94 95 96 97 98

7 14256

#C

 

(Note that 0, here is a different order of magnitude than 1.)

=={{header|Java}}==

{{trans|C}}

private int count[] = new int[8];

private boolean used[] = new boolean[10];

}

}

 

{{out}}

 

=={{header|Julia}}==

 

function iscolorful(n, base=10)

testcolorfuls()

<pre>

Colorful numbers for 1:25, 26:50, 51:75, and 76:100:

 

=={{header|Mathematica}}/{{header|Wolfram Language}}==

ColorfulNumberQ[n_Integer?NonNegative] := Module[{digs, parts},

If[n > 98765432,

Tally[IntegerDigits/*Length /@ cns] // Grid

 

{{out}}

<pre>1 2 3 4 5 6 7 8

=={{header|Perl}}==

{{trans|Raku}}

use warnings;

use feature 'say';

my $total= 10;

map { is_colorful(join '', @$_) and $total++ } map { permutations $_ } combinations [2..9], $_ for 2..8;

{{out}}

<pre>Colorful numbers less than 100:

{{libheader|Phix/online}}

You can run this online [http://phix.x10.mx/p2js/colourful.htm here].

<span style="color: #008080;">with</span> <span style="color: #008080;">javascript_semantics</span>

<span style="color: #008080;">function</span> <span style="color: #000000;">colourful</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: #7060A8;">printf</span><span style="color: #0000FF;">(</span><span style="color: #000000;">1</span><span style="color: #0000FF;">,</span><span style="color: #008000;">"\nTotal colourful numbers: %,d\n"</span><span style="color: #0000FF;">,</span> <span style="color: #7060A8;">sum</span><span style="color: #0000FF;">(</span><span style="color: #000000;">count</span><span style="color: #0000FF;">))</span>

<span style="color: #0000FF;">?</span><span style="color: #7060A8;">elapsed</span><span style="color: #0000FF;">(</span><span style="color: #7060A8;">time</span><span style="color: #0000FF;">()-</span><span style="color: #000000;">t0</span><span style="color: #0000FF;">)</span>

{{out}}

<pre>

 

=={{header|Picat}}==

N < 10 ;

(X = N.to_string,

 

distinct(L) =>

 

'''All colorful numbers <= 100.'''

Colorful = [N : N in 0..100, colorful_number(N)],

Len = Colorful.len,

end,

nl,

 

{{out}}

 

'''Largest colorful number.'''

N = 98765431,

Found = false,

end,

N := N - 1

 

{{out}}

 

'''Count of colorful numbers in each magnitude and of total colorful numbers.'''

TotalC = 0,

foreach(I in 1..8)

% For N=3: lb=123 and ub=987

lb(N) = cond(N < 2, 0, [I.to_string : I in 1..N].join('').to_int).

 

{{out}}

 

=={{header|Python}}==

 

largest = [0]

print(f'The largest possible colorful number is {largest[0]}.')

print(f'The total number of colorful numbers is {csum}.')

<pre>

Colorful numbers for 1:25, 26:50, 51:75, and 76:100:

 

=={{header|Raku}}==

return True if 0 <= $n <= 9;

return False if $n.contains(0) || $n.contains(1) || $n < 0;

}

 

{{out}}

<pre>Colorful numbers less than 100:

{{libheader|Wren-seq}}

{{libheader|Wren-fmt}}

import "./set" for Set

import "./seq" for Lst

}

 

 

{{out}}

 

=={{header|XPL0}}==

int A, B, T, I;

[T:= 1;

IntOut(0, Total);

CrLf(0);

 

{{out}}