Problem 2320. Pandigital number n°2 (Inspired by Project Euler 32)

Created by Jean-Marie Sainthillier

Solve Later

An n-digit number is pandigital if it makes use of all the digits 1 to n exactly ONCE.

For example, the 5-digit number 15234, is 1 through 5 pandigital.

Find the number of pandigital numbers in a given interval (between xlower and xupper).

The test suite is simple here, but how to compute this number with BIG interval (pandigital number length > 7) in Cody time?

For example, between 58755 and 99899923?

Solve

Solution Stats

Last solution submitted on Jul 25, 2019

Last 200 Solutions

Problem Comments

Solution Comments

Solution 495758

1 Comment

1 Comment

Peter Cook on 4 Sep 2014

Kind of tailored to the orders of magnitude approach of the test suite; complexity would have to increase significantly if you split the intervals say [10000 50000] instead of [1e4 1e5-1].

Solution 443006

1 Comment

1 Comment

Jean-Marie Sainthillier on 15 May 2014

Everything is perfect in this code.

Solution 442877

3 Comments

3 Comments

Alfonso Nieto-Castanon on 15 May 2014

this is not really a general solution, perhaps you could add more complicated cases in the testsuite? for example pandigital_nb(2200,4000)==10, pandigital_nb(250,40000)==98, pandigital_nb(35327,43854637)==23030

Jean-Marie Sainthillier on 15 May 2014

I hesitated to add tests that I can't solve by myself.

Alfonso Nieto-Castanon on 15 May 2014

I see, check solution 443089, that should be a general and relatively fast solution

Problem 2320. Pandigital number n°2 (Inspired by Project Euler 32)

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Recent Solvers15

Suggested Problems

More from this Author45

Tags

Problem 2320. Pandigital number n°2 (Inspired by Project Euler 32)

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Recent Solvers15

Suggested Problems

More from this Author45

Tags

Players