network profile
| bio | website | |
|---|---|---|
| location | ||
| age | ||
| visits | member for | 1 year, 11 months |
| seen | May 12 at 6:25 | |
| stats | profile views | 17 |
|
Mar 11 |
answered | The world ends in ed |
|
Oct 23 |
answered | Print this diamond |
|
Jun 4 |
awarded | Nice Answer |
|
Jun 2 |
awarded | Yearling |
|
May 31 |
comment |
We're no strangers to code golf, you know the rules, and so do I @ugoren - Indeed; Scala is too verbose in that regard, and there are not >62 productive substitutions to make. Still, I thought this was an interesting approach (as was yours). |
|
May 31 |
answered | We're no strangers to code golf, you know the rules, and so do I |
|
Sep 5 |
answered | Flag Semaphore Encoder |
|
Jun 20 |
comment |
Implement Sleep Sort But there was a set of ()s that could be replaced by {}! |
|
Jun 20 |
revised |
Implement Sleep Sort added 17 characters in body; added 1 characters in body |
|
Jun 17 |
comment |
Implement Sleep Sort @flying sheep - Agreed about line breaks, but there are no {} that can be replaced with () in my answer, so why did you bring it up? |
|
Jun 17 |
comment |
Implement Sleep Sort @flying sheep - You're misinformed. You can use () for single statements. Try entering (1 to 9).map(i => {val j = i+1; i*j}) in the REPL and then see what happens if you use (1 to 9).map(i => (val j = i+1; i*j)). |
|
Jun 16 |
comment |
Implement Sleep Sort @flying sheep - You can omit {} with one statement, but you still need it to group things separated by ;, one line or no. And you can write multi-line statements without {} in some cases (if/else for instance). |
|
Jun 6 |
revised |
Score counter for Skat added 15 characters in body |
|
Jun 6 |
answered | Score counter for Skat |
|
Jun 6 |
awarded | Editor |
|
Jun 6 |
revised |
Expanding Expressions deleted 11 characters in body |
|
Jun 6 |
comment |
Expanding Expressions I don't think there is a unique reduction, or not all formulae can be reduced. Note: (a & b)(c+d) = (a & b)x = ax & bx = a(c+d) & b(c+d) = ac+ad & bc+bd but (a & b)(c+d) = y(c+d) = yc+yd = (a & b)c+(a & b)d = (ac & bc)+(ad & bd) = z+(ad & bd) = z+ad & z+bd = (ac & bc)+ad & (ac & bc)+bd = ac+ad & bc+ad & ac+bd & bc+bd. In contrast, if you only allow right-associativity or left-associativity and not both, then any expression with the other (given with parens) cannot be unfolded. |
|
Jun 6 |
answered | Expanding Expressions |
|
Jun 3 |
answered | LED Numbers and Letters |
|
Jun 2 |
answered | Square Number Digit Density |
