Anonymous user
Dinesman's multiple-dwelling problem: Difference between revisions
Dinesman's multiple-dwelling problem (view source)
Revision as of 20:30, 13 February 2012
, 12 years ago→{{header|D}}
(→{{header|D}}: generate permutations lazily) |
m (→{{header|D}}) |
||
Line 145:
this (size_t num) {
enforce(num > 1, "LazyPermutation: num must be > 1");
this.seq = array(iota(
this.tot = fact(num);
this.num = num;
| |||