Best shuffle: Difference between revisions

(Added PicoLisp)
Line 11:
 
int countSamePositions(T, U)(T s1, U s2, uint len) {
return count!("a[0] == a[1] && a[0] != b")(zip(s1, s2), '-');
int count;
for (int i; i < len; i++) {
if (s2[i] != '-' && s2[i] == s1[i]) {
count++;
}
}
return count;
}
 
Anonymous user