Find the missing permutation: Difference between revisions

← Older editNewer edit →
Content deleted Content added
Added Erlang
Line 1,014:
 
=={{header|Perl 6}}==
<lang perl6>my @givens = <ABCD CABD ACDB DACB BCDA ACBD ADCB CDAB DABC BCAD CADB CDBA CBAD ABDC ADBC BDCA DCBA BACD BADC BDAC CBDA DBCA DCAB>;▼
Tested on Rakudo perl6 version 2012.10-153-gbf472b0 built on parrot 4.10.0
CBAD ABDC ADBC BDCA DCBA BACD BADC BDAC CBDA DBCA DCAB>;
<lang perl6># The givens from Rosetta Code:
 
▲my @givens = <ABCD CABD ACDB DACB BCDA ACBD ADCB CDAB DABC BCAD CADB CDBA CBAD ABDC ADBC BDCA DCBA BACD BADC BDAC CBDA DBCA DCAB>;
my @perms = [<A B C D>].permutations.tree.map: *.join;
 
# Get all the unique permutations of ABCD
.say for grepwhen none(@givens), for @perms;</lang>▼
my @letters = <A B C D>;
my @perms = (@letters X~ @letters X~ @letters X~ @letters).grep: {
.chars == .split('').uniq.elems
};
# Print out the missing value:
▲.say for grep none(@givens), @perms;</lang>
{{out}}<pre>DBAC</pre>
Of course, all of these solutions are working way too hard, when you can just xor all the bits,
Retrieved from "https://rosettacode.org/wiki/Find_the_missing_permutation"