aparler/RosettaCodeData
1
0
Fork 0
Code Issues 12 Pull requests 3 Projects Releases Packages Wiki Activity Actions

March 2014 update

Browse source
This commit is contained in:
Ingy döt Net 2014-04-02 16:56:35 +00:00
parent 09687c4926
commit a25938f123
1846 changed files with 21876 additions and 5203 deletions
Download patch file Download diff file Expand all files Collapse all files

16
Task/Find-the-missing-permutation/D/find-the-missing-permutation.d
View file

@ -1,8 +1,6 @@
import std.stdio, std.string, std.algorithm, std.range;
alias sum = reduce!q{a + b};
void main() {
import std.stdio, std.string, std.algorithm, std.range, std.conv;
const perms = "ABCD CABD ACDB DACB BCDA ACBD ADCB CDAB DABC
BCAD CADB CDBA CBAD ABDC ADBC BDCA DCBA BACD
BADC BDAC CBDA DBCA DCAB".split;
@ -25,12 +23,10 @@ void main() {
// Version 3 : Sum ASCII values.
immutable rowSum = perms[0].sum;
foreach (immutable i; 0 .. len) {
immutable sumCols = sum(0, perms.transversal(i));
// See how much it falls short.
write(cast(char)(rowSum - sumCols % rowSum));
}
writeln;
len
.iota
.map!(i => to!char(rowSum - perms.transversal(i).sum % rowSum))
.writeln;
// Version 4: some sort of checksum, Java translation.
// maxCode will be 36.