Print all lexicographically increasing numbers under 10000

Question

A lexicographically increasing number is an integer whose digits are in strictly increasing order. Print all lexicographically increasing numbers under 10000.

Here are lines of the expected output:

This is a code golf challenge! Shortest answer wins!

(P.S. looking for a python solution)

do we need to print them on separate lines or is space-separated OK? — Giuseppe, Nov 16, 2018 at 19:29
Welcome to PPCG! Nice first challenge. For future challenges, I can recommend using the Sandbox to refine a challenge and get meaningful feedback before posting it to main. — AdmBorkBork, Nov 16, 2018 at 19:38
To expand on @Giuseppe's question, can we output separated by commas, spaces, in array format [0,1,...], etc. or must we output each number on a separate line? — ETHproductions, Nov 16, 2018 at 19:42
Do the numbers need to be in a specific order, or do they just need to all exist? — Kamil Drakari, Nov 16, 2018 at 19:56
@VarunPatro, please update the challenge to explicitly state that each number by on a separate line (although I'd recommend against that requirement) and make sure to inform any existing solutions that don't do so. — Shaggy, Nov 16, 2018 at 20:32

Jonathan Allan · Accepted Answer · 2018-11-17 17:07:27Z

1

Jelly, 7 bytes

<ƝẠ$⁹#Y

Try it online!

How?

<ƝẠ$⁹#Y - Main Link: no arguments (implicit z=0)
    ⁹   - literal 256
     #  - count up from n=z (0) finding the first 256 for which this is truthy:
   $    -   last two links as a monad:
 Ɲ      -     neighbours (implicitly gets digits of n):
<       -       less than?
  Ạ     -     all truthy? (N.B. yields 1 for an empty list)
      Y - join with newlines

answered Nov 17, 2018 at 17:07

Jonathan Allan

106k7 gold badges63 silver badges275 bronze badges

Add a comment |

Luis Mendo · Accepted Answer · 2018-11-19 15:40:42Z

1

MATLAB, 52 bytes

arrayfun(@(n)disp(n(all(diff(num2str(n))>0))),0:1e4)

edited Nov 19, 2018 at 15:40

answered Nov 17, 2018 at 1:07

Luis Mendo

104k9 gold badges133 silver badges370 bronze badges

Add a comment |

G B · Accepted Answer · 2018-11-20 09:19:42Z

1

Ruby, 39 bytes

puts (?0..?9*4).grep /^#{[*0..9]*??}?$/

Try it online!

answered Nov 20, 2018 at 9:19

G B

21.9k1 gold badge20 silver badges53 bronze badges

Add a comment |

guest271314 · Accepted Answer · 2018-11-20 21:41:21Z

1

JavaScript, 83 bytes

Borrowed some ideas from @Shaggy, but without recursion.

[...Array(1e4)].reduce((s,_,n)=>s+=([...n+''].every(x=>y<(y=x),y=0))?'\n'+n:'','0')

Try it online!

edited Nov 20, 2018 at 21:41

guest271314

2092 silver badges12 bronze badges

answered Nov 20, 2018 at 10:43

Alvin Li

415 bronze badges

Add a comment |

Community · Accepted Answer · 2020-06-17 09:04:33Z

1

T-SQL, 188 185 bytes

WITH a AS(SELECT 0n UNION ALL SELECT n+1FROM a WHERE n<9)
SELECT CONCAT(a.n,b.n,c.n,d.n)+0
FROM a,a b,a c,a d
WHERE(a.n<b.n OR a.n+b.n=0)
AND(b.n<c.n OR b.n+c.n=0)
AND(c.n<d.n OR c.n+d.n=0)

Line breaks are for readability only.

I'm certain there must be more efficient ways to do this in SQL, but this was the first thing I thought of. Explanation:

Declare an in-memory table with values 0 to 9
Cross-join 4 copies of this table for all possible values from 0000 to 9999
Messy WHERE clause to ensure the digits are strictly increasing (or both 0)
Smash the digits together (CONCAT) and convert to integer (+0)
The resulting rows may or may not be sorted, but the challenge doesn't appear to require that.

edited Jun 17, 2020 at 9:04

CommunityBot

1

answered Nov 16, 2018 at 20:53

BradC

6,7871 gold badge13 silver badges34 bronze badges

1

\$\begingroup\$ You can convert to number by adding zero x+0 instead of abs(x). \$\endgroup\$
– Dr Y Wit
Nov 26, 2018 at 17:55
\$\begingroup\$ Thanks, @DrYWit, saved 3 bytes. Looks like x*1 works as well. \$\endgroup\$
– BradC
Nov 26, 2018 at 18:27

Add a comment |

maxb · Accepted Answer · 2018-11-28 15:49:09Z

1

MathGolf, 10 bytes

♫rgÆ▒_s▀=n

Try it online!

Explanation

♫            push 10000
 r           range(0, n)
  g          pop a, (b), pop operator from code, filter
   Æ         start block of length 5
    ▒        split to list of chars/digits
     _       duplicate TOS
      s      sort(array)
       ▀     unique elements of string/list
        =    pop(a, b), push(a==b)
         n   newline char, or map array with newlines

answered Nov 28, 2018 at 15:49

maxb

6,8873 gold badges31 silver badges41 bronze badges

Add a comment |

Unrelated String · Accepted Answer · 2019-03-11 05:34:20Z

1

Brachylog, 12 bytes

7jj⟦{ẹ<₁cẉ}ˢ

Try it online!

         ẉ      Write on its own line
    {     }ˢ    every
        c       concatenated
      <₁        strictly increasing
     ẹ          list of digits of
   ⟦            numbers from the range from 0 to
7jj             7777.

7jj⟦{ṫ⊆Ị&ẉ}ˢ also works.

answered Mar 11, 2019 at 5:34

Unrelated String

21.3k3 gold badges29 silver badges55 bronze badges

Add a comment |

MarcMush · Accepted Answer · 2022-07-02 15:42:58Z

1

Julia, 44 bytes

0:6^5 .|>x->issorted("$x",lt=<=)&&println(x)

\$(6^5 = 7776)\$

Attempt This Online!

answered Jul 2, 2022 at 15:42

MarcMush

6,49511 silver badges17 bronze badges

Add a comment |

naffetS · Accepted Answer · 2022-07-02 17:04:41Z

1

Vyxal `jM`, 5 bytes

k2'Þ⇧

Try it Online!

Flagless:

Vyxal, 7 bytes

k2ʀ~Þ⇧⁋

Try it Online!

edited Jul 2, 2022 at 17:04

answered Jul 2, 2022 at 15:12

naffetS

12.4k2 gold badges18 silver badges48 bronze badges

Add a comment |

Neil · Accepted Answer · 2018-11-17 12:57:42Z

0

Retina 0.8.2, 38 bytes


9999$*
.
$.`¶
.
$*_$&
A`(_*)\d\1\d
_

Try it online! Explanation:


9999$*

Insert 9999 characters.

.
$.`¶

Convert into a list of numbers 0..9998

.
$*_$&

Prefix each digit with its value in _s.

A`(_*)\d\1\d

Delete lines containing nonincreasing digits.

Remove the now unnecessary _s.

answered Nov 17, 2018 at 12:57

Neil

170k12 gold badges72 silver badges275 bronze badges

Add a comment |

Erik the Outgolfer · Accepted Answer · 2018-11-17 13:49:35Z

0

Pyth, 15 bytes

jf.A<V`Tt`TU^T4

Try it here!

answered Nov 17, 2018 at 13:49

Erik the Outgolfer

40.6k5 gold badges42 silver badges122 bronze badges

Add a comment |

markasoftware · Accepted Answer · 2018-11-18 02:13:03Z

0

Bash + GNU Core Utilities, 57 bytes

seq 1e4|grep -vP `seq 0 9|sed 's/./(&[0-&])/'|tr '
' \|`p

Uses some meta-regex-generation shit

answered Nov 18, 2018 at 2:13

markasoftware

3461 silver badge7 bronze badges

\$\begingroup\$ Your output is missing the 0. \$\endgroup\$
– Dennis
Nov 18, 2018 at 3:07
\$\begingroup\$ 47 bytes \$\endgroup\$
– Dennis
Nov 18, 2018 at 3:21

Add a comment |

Community · Accepted Answer · 2020-06-17 09:04:33Z

0

K4, 19 bytes

Solution:

-1@$&&/'>':'$!9999;

Explanation:

-1@$&&/'>':'$!9999; / the solution
             !9999  / range 0..9998
            $       / string
        >':'        / greater-than (>) each-previous (':) each (')
     &/'            / max (&) over (/)
    &               / indices where true
   $                / string
  @                 / apply
-1                ; / print to stdout and swallow return value (-1)

edited Jun 17, 2020 at 9:04

CommunityBot

1

answered Nov 20, 2018 at 7:42

mkst

5,17511 silver badges19 bronze badges

Add a comment |

Dr Y Wit · Accepted Answer · 2018-11-26 17:52:39Z

Oracle SQL, 163 bytes

Various ways to generate combinations

with a(n)as(select level-1 from dual connect by level<11),r(i,x,s)as(select 1,n,n||''from a union all select i+1,n,s||n from r,a where(x<n or n+x=0)and i<4)select s+0 from r where i=4;

with a(n)as(select level-1 from dual connect by level<11)select a.n||b.n||c.n||d.n+0 from a,a b,a c,a d where(a.n<b.n or a.n+b.n=0)and(b.n<c.n or b.n+c.n=0)and(c.n<d.n or c.n+d.n=0);

with a(n)as(select level from dual connect by level<11)select unique replace(sys_connect_by_path(n-1,'#'),'#')+0 from(a)connect by level<5and prior n<n order by 1;

Rec with (CTE), 184 bytes
Self joins, 182 bytes
Connect by, 163 bytes

Just for fun

with t(c)as(select ku$_vcnt(1,2,3,4,5,6,7,8,9) from dual)
select listagg(value(z)) within group (order by 0) + 0 n
  from (select rownum r, value(r) v
          from t, table(powermultiset(c)) r),
       table(v) z
 where cardinality(v) < 5
group by r union select 0 from dual

.

with a(n)as(select decode(level,10,null,level) from dual connect by level<11)
select nvl(a.n || b.n || c.n || d.n + 0, 0) n
  from a, a b, a c, a d
 where nvl2(b.n, sign(b.n - a.n), 1) = 1
   and nvl2(c.n, sign(c.n - b.n), 1) = 1
   and nvl2(d.n, sign(d.n - c.n), 1) = 1
 order by 1

Community · Accepted Answer · 2020-06-17 09:04:33Z

0

PHP, 51 bytes

while($n<1e4)count_chars($n,3)-$n++||print~-$n."
";

Run with -nr or try it online.

count_chars($string,$mode=3) returns a string of all used characters in ascending order.
This equals the input if, and only if, its characters (in this case: digits) are strictly increasing.

$n is NULL in the first iteration; count_chars returns an empty string; NULL-"" is evaluated as 0-0.

edited Jun 17, 2020 at 9:04

CommunityBot

1

answered Nov 26, 2018 at 18:14

Titus

14.7k1 gold badge23 silver badges41 bronze badges

Add a comment |

Kromzem · Accepted Answer · 2018-11-27 07:48:57Z

0

Kotlin, 132 131 bytes

Edit: -1 Byte thanks to @Giuseppe

fun main(){(0..9999).forEach{it.toString().let{var b=1;it.forEachIndexed{i,c->if(i>0&&it[i-1]<c)b++};if(b==it.length)println(it)}}}

Try it online!

edited Nov 27, 2018 at 7:48

answered Nov 20, 2018 at 8:07

Kromzem

314 bronze badges

1

\$\begingroup\$ I don't know Kotlin, but a trivial golf is replacing 10000 with 9999 \$\endgroup\$
– Giuseppe
Nov 26, 2018 at 17:35
\$\begingroup\$ alternative 131 \$\endgroup\$
– ASCII-only
Mar 11, 2019 at 1:44
\$\begingroup\$ 96 \$\endgroup\$
– ASCII-only
Mar 11, 2019 at 1:49
\$\begingroup\$ 95 \$\endgroup\$
– ASCII-only
Mar 11, 2019 at 2:59

Add a comment |

sergiol · Accepted Answer · 2018-11-28 15:59:46Z

0

Tcl, 116 bytes

set i 0
time {set m -1;lmap n [split $i ""] {if $n>$m {set m $n} {set m X;break}}
if \$m!="X" {puts $i}
incr i} 9999

Try it online!

edited Nov 28, 2018 at 15:59

answered Nov 28, 2018 at 15:19

sergiol

3,3961 gold badge14 silver badges31 bronze badges

Add a comment |

voidhawk · Accepted Answer · 2019-03-11 01:34:34Z

APL (Dyalog Extended), 28 bytes

{(⍵≡∪⍵)∧⍵≡∧⍵:⎕←⍵⋄⍬}∘⍕¨⍳10000

Try it online!

Explanation:

{(⍵≡∪⍵)∧⍵≡∧⍵:⎕←⍵⋄⍬}∘⍕¨⍳10000 ⍝ Full program
                          ⍳10000 ⍝ Generate integers from 1 to 10000
                      ∘⍕¨       ⍝ For each number, convert to string and apply left function
         ⍵≡∧⍵                   ⍝ If the string equals itself sorted...
 (⍵≡∪⍵)∧                        ⍝ ...and the string contains only unique elements...
               ⎕←⍵              ⍝ ...print the string to output with trailing newline
                   ⋄⍬            ⍝ Otherwise, do nothing

\$\begingroup\$ ↑c/⍨(,⍨≡∧,∪)¨c←⍕¨⍳1E4 \$\endgroup\$
– Adám
Mar 11, 2019 at 5:39 — Adám, Mar 11, 2019 at 5:39

X1M4L · Accepted Answer · 2019-04-17 13:09:54Z

0

C++ (gcc), 113 bytes

bool y(int a){return(a==0||a%10>(a/=10)%10&&y(a))?true:false;}void z(int i){while(++i<7e3)if(y(i))cout<<i<<endl;}

Try it online!

Pretty Layout:

#include<iostream>
using namespace std;

bool y(int a){
    return(a==0||a%10>(a/=10)%10&&y(a))?true:false;
}

void z(int i){
    while(++i<7e3){
        !y(i)?:cout<<i<<endl;
    }
}

int main(){
    z(-1);
}

answered Apr 17, 2019 at 13:09

X1M4L

1,83611 silver badges17 bronze badges

\$\begingroup\$ 97 bytes \$\endgroup\$
– ceilingcat
Apr 18, 2019 at 1:10

Add a comment |

Benjamin Urquhart · Accepted Answer · 2019-04-17 17:03:50Z

0

Java 8

Full program: 186 bytes

interface M{static void main(String[]a){for(int i=-1;i++<9999;System.out.print((i+"").chars().distinct().sorted().mapToObj(c->(c-48)+"").reduce("",(x,y)->x+y).equals(i+"")?i+"\n":""));}}

Function: 149 bytes

v->{for(int i=-1;i++<9999;System.out.print((i+"").chars().distinct().sorted().mapToObj(c->(c-48)+"").reduce("",(x,y)->x+y).equals(i+"")?i+"\n":""));}

answered Apr 17, 2019 at 17:03

Benjamin Urquhart

1,5247 silver badges25 bronze badges

Add a comment |

DeathIncarnate · Accepted Answer · 2020-02-08 10:39:54Z

0

Burlesque, 11 bytes

1e4qsoFO:U_

Equivalently

1e4ro:so:U_

Try it online!

1e4 # 10000
qso # Boxed is sorted?
FO  # Filter from 1..10000 if sorted
:U_ # Filter for unique digits

answered Feb 8, 2020 at 10:39

DeathIncarnate

2,5507 silver badges9 bronze badges

Add a comment |

Stack Exchange Network

Print all lexicographically increasing numbers under 10000

51 Answers 51

Jelly, 7 bytes

How?

MATLAB, 52 bytes

Ruby, 39 bytes

JavaScript, 83 bytes

T-SQL, 188 185 bytes

MathGolf, 10 bytes

Explanation

Brachylog, 12 bytes

Julia, 44 bytes

Vyxal `jM`, 5 bytes

Vyxal, 7 bytes

Retina 0.8.2, 38 bytes

Pyth, 15 bytes

Bash + GNU Core Utilities, 57 bytes

K4, 19 bytes

Oracle SQL, 163 bytes

PHP, 51 bytes

Kotlin, 132 131 bytes

Tcl, 116 bytes

APL (Dyalog Extended), 28 bytes

C++ (gcc), 113 bytes

Java 8

Burlesque, 11 bytes

Your Answer

Not the answer you're looking for? Browse other questions tagged
code-golf
number
sequence
kolmogorov-complexity
or ask your own question.

Linked

Hot Network Questions

Print all lexicographically increasing numbers under 10000

51 Answers 51

Jelly, 7 bytes

How?

MATLAB, 52 bytes

Ruby, 39 bytes

JavaScript, 83 bytes

T-SQL, 188 185 bytes

MathGolf, 10 bytes

Explanation

Brachylog, 12 bytes

Julia, 44 bytes

Vyxal jM, 5 bytes

Vyxal, 7 bytes

Retina 0.8.2, 38 bytes

Pyth, 15 bytes

Bash + GNU Core Utilities, 57 bytes

K4, 19 bytes

Oracle SQL, 163 bytes

PHP, 51 bytes

Kotlin, 132 131 bytes

Tcl, 116 bytes

APL (Dyalog Extended), 28 bytes

C++ (gcc), 113 bytes

Java 8

Burlesque, 11 bytes

Your Answer

Sign up or log in

Post as a guest

Not the answer you're looking for? Browse other questions tagged code-golfnumbersequencekolmogorov-complexity or ask your own question.

Linked

Related

Hot Network Questions

Vyxal `jM`, 5 bytes

Not the answer you're looking for? Browse other questions tagged
code-golf
number
sequence
kolmogorov-complexity
or ask your own question.