fork download 
  1. n, m = 6, 3
  2. import itertools; import operator; print '\n'.join(sorted('{}={}'.format(reduced, '*'.join(map(str,fangs))) for fangs, reduced in ((fangs, reduce(operator.mul, fangs)) for fangs in itertools.combinations_with_replacement(range(10**(n/m-1), 10**(n/m)), m)) if sorted(str(reduced)) == sorted(''.join(map(str, fangs)))))
Success #stdin #stdout 0.8s 9016KB
comments ()
stdin 
Standard input is empty
stdout 
114390=31*41*90
121695=21*61*95
127428=21*74*82
127680=21*76*80
127980=20*79*81
137640=31*60*74
139500=31*50*90
163680=31*66*80
178920=28*71*90
197925=29*75*91
198450=49*50*81
247680=40*72*86
294768=46*72*89
376680=60*73*86
397575=57*75*93
457968=56*87*94
479964=69*74*94
498960=60*84*99
https://ideone.com/iq8rv9
language:
Python (cpython 2.7.16)
created:
9 years ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!