Activity for user
| Type | On... | Excerpt | Status | Date |
|---|---|---|---|---|
| Edit | Post #283204 | Initial revision | — | over 2 years ago |
| Answer | — |
A: "Hello, World!" Scala, 42 bytes object>extends App{print("Hello, World!")} Attempt This Online! (more) |
— | over 2 years ago |
| Edit | Post #283175 |
Post edited: Fixed rong tyop |
— | over 2 years ago |
| Edit | Post #283175 |
Post edited: Mead a tyop |
— | over 2 years ago |
| Comment | Post #283076 |
I suspect this works in most golfing languages because so many have implicit input and automatically close strings and other structures 8=}. (more) |
— | over 2 years ago |
| Comment | Post #283035 |
Right, but it's your answer, so there was never any competition between us: it's not as if you could've beaten me to cracking your own answer. (more) |
— | over 2 years ago |
| Edit | Post #281284 |
Post edited: |
— | over 2 years ago |
| Suggested Edit | Post #279660 |
Suggested edit: There's no need for a single code-golf-tips tag when there's two separate tags for it. (more) |
helpful | over 2 years ago |
| Suggested Edit | Post #282951 |
Suggested edit: (more) |
helpful | over 2 years ago |
| Comment | Post #283175 |
@#54114 I've clarified what a blackbox function is, let me know if there's anything else I need to add. (btw, how did you write [blackbox-function] like that?) (more) |
— | over 2 years ago |
| Edit | Post #283175 |
Post edited: Add some clarifications |
— | over 2 years ago |
| Comment | Post #283175 |
@#53588 Yes, anything reasonable is allowed. The challenge explicitly allows "A string that can be evaluated to get a function," actually. (more) |
— | over 2 years ago |
| Comment | Post #283176 |
Of course, this question is about replacing [tag:code-golf-tips] entirely. If all [tag:code-golf-tips] questions are retagged, then it should go away. (more) |
— | over 2 years ago |
| Edit | Post #283176 | Initial revision | — | over 2 years ago |
| Question | — |
Should [code-golf-tips] be replaced with [tips] + [code-golf]? Instead of the code-golf-tips tag, could we tag "Tips for golfing" questions with tips and code-golf instead? They can still be searched for, so I don't see a reason to make a special tag to represent two distinct tags. (more) |
— | over 2 years ago |
| Edit | Post #283175 | Initial revision | — | over 2 years ago |
| Article | — |
Reduce over the range [1..n] [FINALIZED] Task I often need to find the factorial of a number or the sum of all numbers up to a number when cheating on math tests. To help me with this, your task is to write $F$, a generalized version of those functions: $$F(n) = 1 2 \space ... \space (n-1) n$$ Please note that the operator $ $... (more) |
— | over 2 years ago |
| Comment | Post #283166 |
That's true. I was going to go with the (n×"super") factorial question on SE that got closed, but I don't know if the author will let me repost that yet. I'll think up something to change it up a little. (more) |
— | over 2 years ago |
| Edit | Post #283166 |
Post edited: |
— | over 2 years ago |
| Edit | Post #283166 |
Post edited: |
— | over 2 years ago |
| Edit | Post #283166 | Initial revision | — | over 2 years ago |
| Article | — |
Obligatory factorial challenge It looks like we don't have a simple factorial challenge yet, so here's one. Task Given a non-negative number, output the factorial of that number ($n!$). The factorial of a number can be defined as such: $$f(0)=1$$ $$f(n)=n \times f(n-1)$$ Test cases ``` Input! = Output 0! = 1 1! ... (more) |
— | over 2 years ago |
| Comment | Post #283135 |
A p p r o v e d i t ! (more) |
— | over 2 years ago |
| Edit | Post #283143 |
Post edited: |
— | over 2 years ago |
| Edit | Post #283143 | Initial revision | — | over 2 years ago |
| Answer | — |
A: 99 Shortened Bottles of Beer [Scala], 242 bytes =>99 to(1,-1)map{b=>s"${w(b)} on the wall, ${w(b)}. \n${if(b>1)"Take one down and pass it around"else "Go to the store and buy some more"}, ${w((b+97)%99+1)} on the wall."}mkString "\n\n" def w(b:Int)=s"$b bottle${if(b>1)"s"else ""} of beer" Try it online! ... (more) |
— | over 2 years ago |
| Comment | Post #283135 |
I know, I read the docs right after you suggested the golf :) (more) |
— | over 2 years ago |
| Edit | Post #283136 | Initial revision | — | over 2 years ago |
| Answer | — |
A: It's Hip to be Square [Prolog (SWI)], 42 bytes R-S:-S is RR;R<S,M is R+1,M-S. f(S):-0-S. Try it online! (more) |
— | over 2 years ago |
| Edit | Post #283135 |
Post edited: |
— | over 2 years ago |
| Comment | Post #283135 |
Thanks! (pad pad) (more) |
— | over 2 years ago |
| Edit | Post #283135 | Initial revision | — | over 2 years ago |
| Answer | — |
A: It's Hip to be Square Japt, 6 3 bytes Cut in half thanks to Shaggy! ``` ¬v1 ``` Try it online! Golfed thanks to Shaggy's interpreter auto-golf feature. ``` ¬v1 ¬ //Square root v1 //Is that an integer? ``` (more) |
— | over 2 years ago |
| Edit | Post #283106 | Initial revision | — | over 2 years ago |
| Answer | — |
A: Answering challenges with languages newer than the challenge Answering with languages newer than the challenge should absolutely be allowed Most of the time, when a language is newer than a challenge, it's just a coincidence. By not allowing people to answer using them, we're discouraging people from creating and using esolangs. That would be far more detri... (more) |
— | over 2 years ago |
| Edit | Post #283035 |
Post edited: |
— | over 2 years ago |
| Comment | Post #283094 |
Feels like JSFuck, but it doesn't work on TIO :/. *Might* be brainflak, but given the fact that you're Shaggy, JS seems more likely :P (more) |
— | over 2 years ago |
| Edit | Post #283100 | Initial revision | — | over 2 years ago |
| Answer | — |
A: Evaluate a single variable polynomial equation Scala, 18 bytes ``` x=>.:\(.0)(+x) ``` Try it online! Not too complicated. Takes the list of coefficients and folds from the right, multiplying the accumulator by x each time and adding the next coefficient. `reduceRight` would've worked instead of `:\(0)`, but it's golfier, and I haven't used... (more) |
— | over 2 years ago |
| Suggested Edit | Post #279159 |
Suggested edit: Use [] because it wasn't clear where the list ended and where x was (more) |
helpful | over 2 years ago |
| Edit | Post #283036 |
Post edited: |
— | over 2 years ago |
| Comment | Post #283036 |
Actually, it's `(w-11)>>1`, or `(w-11)/2`, but that can still be `w/2-5`, I guess. (more) |
— | over 2 years ago |
| Comment | Post #283036 |
Oh wow, that was dumb (the `11>1` thing, I mean). Thanks! (more) |
— | over 2 years ago |
| Comment | Post #282798 |
This is already banned, I think, since any macros, functions, or variables you use have to be included in the byte count if they're not available otherwise. (more) |
— | over 2 years ago |
| Comment | Post #283035 |
What do you mean? (more) |
— | over 2 years ago |
| Edit | Post #279209 |
Post edited: Use fence so that leaderboard can detect code |
— | over 2 years ago |
| Edit | Post #283039 | Initial revision | — | over 2 years ago |
| Answer | — |
A: Bytes to Segfault [Rust], 47 bytes fn main(){unsafe{print!("{}",(0 asmut i8));}} Try it online! (more) |
— | over 2 years ago |
| Suggested Edit | Post #279209 |
Suggested edit: Use fence so that leaderboard can detect code (more) |
helpful | over 2 years ago |
| Comment | Post #283007 |
Oh, and you can post an answer [here](https://codegolf.codidact.com/posts/283034). (more) |
— | over 2 years ago |