Please in order to save solutions and appear on the leaderboards.

Vampire Numbers

Details

A vampire number is a non-negative number that can be factored into two numbers (fangs) each with half as many digits as the original where the two factors contain all the digits of the original, in any order. One but not both fangs may have trailing zeros.

For example 1260 = 21×60, 1395 = 15×93, 1435 = 35×41, 1530 = 30×51, etc.

Print all the vampire numbers from 1 to 1,000,000 inclusive, each on their own line.

Be careful with the algorithmic complexity of your solution to avoid timing out.

0 bytes, 0 chars
Restore solution
All
Compiled from AT&T syntax to x86-64 Linux. Use syscalls to write output.
Fennel is an experimental language, no solutions will be saved. Please leave feedback on the GitHub issue.
Uiua is an experimental language, no solutions will be saved. Please leave feedback on the GitHub issue.
ctrl + enter or

Delete Solution

Are you sure you want to delete your solution(s) for Vampire Numbers?

If you have separate bytes and chars solutions then both will be deleted.

This is irreversible, please backup any code you care about.

Type I understand and press confirm to continue.