First perfect square in base n with n unique digits: Difference between revisions

Fix C solution for slightly more clarity
(Added 11l)
(Fix C solution for slightly more clarity)
Line 95:
if (buffer[pos] > ' ') {
count++;
for (nxt = pos + 1; buffer[nxt] != 0; nxt++) {
}
for (nxt = pos + 1; if (buffer[nxt] !== 0; nxt++buffer[pos]) {
if (buffer[nxt] > ' ' && buffer[pos] == buffer[nxt]) {= 1;
buffer[nxt] = 1;}
}
}
1,481

edits