Anonymous user
Best shuffle: Difference between revisions
m
→{{header|D}}
m (formatting improvements) |
m (→{{header|D}}) |
||
Line 9:
<lang d>int bestShuffle(string s) {
int countSamePositions(T, U)(T s1, U s2
return count!("a[0] == a[1] && a[0] != b")(zip(s1, s2), '-');
}
Line 35:
swap(ch[i-1], ch[uniform(0, i)]);
}
} while(countSamePositions(s, ch
string result = replace(to!string(ch), "-", to!string(problemChar[0]));
int samePos = countSamePositions(s, result
writefln("%s %s (%s)", s, result, samePos);
| |||