Activity for Sylvesterâ€
| Type | On... | Excerpt | Status | Date |
|---|---|---|---|---|
| Edit | Post #292920 |
Post edited: Marked as finalized. |
— | 13 days ago |
| Edit | Post #292935 | Initial revision | — | 13 days ago |
| Question | — |
Display a Progress Bar The goal of this challenge is simple: given a ratio of whole numbers, output a 50-character long progress bar representing the ratio. Rules Input - Your program must take two numbers as input. These numbers will be the numerator and denominator of the ratio, in that order. Your program cannot ... (more) |
— | 13 days ago |
| Edit | Post #292920 |
Post edited: |
— | 15 days ago |
| Comment | Post #292920 |
Alright, I'll update it haha (more) |
— | 15 days ago |
| Edit | Post #292920 |
Post edited: |
— | 18 days ago |
| Comment | Post #292920 |
True, I'll change it. (more) |
— | 18 days ago |
| Comment | Post #292920 |
Thanks for catching that! I edited the post and chose rounding up since that's simpler. (more) |
— | 19 days ago |
| Edit | Post #292920 |
Post edited: |
— | 19 days ago |
| Edit | Post #292920 |
Post edited: |
— | 20 days ago |
| Edit | Post #292920 |
Post edited: |
— | 20 days ago |
| Edit | Post #292920 | Initial revision | — | 20 days ago |
| Article | — |
Display a Progress Bar [FINALIZED] Now finalized: Display a Progress Bar The goal of this challenge is simple: given a ratio of whole numbers, output a 50-character long progress bar representing the ratio. Rules Input - Your program must take two numbers as input. These numbers will be the numerator and denominator of the r... (more) |
— | 20 days ago |
| Edit | Post #292910 |
Post edited: |
— | 21 days ago |
| Comment | Post #292910 |
Alright, edited! (more) |
— | 21 days ago |
| Edit | Post #292910 |
Post edited: |
— | 21 days ago |
| Edit | Post #292910 |
Post edited: |
— | 22 days ago |
| Edit | Post #292910 | Initial revision | — | 22 days ago |
| Answer | — |
A: Source with the whole alphabet in order of appearance TI-BASIC, 23 bytes Like lyxal's answer, this program exits immediately, so nothing after the `Stop` is executed. The program ``` Stop GarbageCollectDetectAsymOffDispGraphiconj(BLACKClrfHomenormalpdf(SeqaClrAllListsFullvwAxesgetKeyZStandard ``` For those who are wondering, the reason th... (more) |
— | 22 days ago |
| Edit | Post #291759 |
Post edited: |
— | 5 months ago |
| Edit | Post #291759 |
Post edited: Fixed erroneous example. |
— | 5 months ago |
| Comment | Post #291759 |
Oh yes, my mistake, I'll fix that. (more) |
— | 5 months ago |
| Edit | Post #291759 |
Post edited: Added a rule allowing for different orientations based on input. |
— | 5 months ago |
| Comment | Post #291759 |
Hmmm, I don't really see anything against this, so I'll make it allowed. It seems to me like adding code to support multiple different orientations would hurt one's byte score, but then, I'm not an expert in golfing languages :P (more) |
— | 5 months ago |
| Comment | Post #291761 |
Good tips! I updated the answer. (more) |
— | 5 months ago |
| Edit | Post #291761 |
Post edited: Saved four bytes. |
— | 5 months ago |
| Comment | Post #291761 |
Thanks for pointing that out! I thought I'd fixed it, but I guess not lol. It's fixed now. (more) |
— | 5 months ago |
| Edit | Post #291761 |
Post edited: Fixed a typo. |
— | 5 months ago |
| Edit | Post #291761 | Initial revision | — | 5 months ago |
| Answer | — |
A: The 50 substrings that validate any string of Roman numerals Rust, 258 254 bytes - Saved four bytes thanks to trichoplax. ```rust fn v(s:&str)->&str{for b in "CCCC CCD CCM CDC CMC CMD CMM DCD DCM DD DM IC ID IIII IIV IIX IL IM IVI IXC IXI IXL IXV IXX LC LD LL LM LXC LXL MMMM VC VD VIV VIX VL VM VV VX XCC XCD XCL ... (more) |
— | 5 months ago |
| Edit | Post #291723 |
Post edited: Marked as finalized. |
— | 5 months ago |
| Edit | Post #291759 | Initial revision | — | 5 months ago |
| Question | — |
Fibonascii Squares The Challenge Your job is to, given input positive non-zero integer $n$, output an ASCII representation of the tiled Fibonacci squares up to the $n$th number of the Fibonacci sequence. Rules Input: - Input will be an integer $n$ such that $n \gt 0$. Output: - Output will be an ASCII... (more) |
— | 5 months ago |
| Comment | Post #291723 |
Thanks! Yes, I'm always happy when I can sneak in a little pun :)
Yeah, I do know about the syntax highlighting. I noticed it was highlighting the text but it didn't particularly bother me. You can change it so that there's no highlighting if you like, I'm good with it either way. Thanks for all y... (more) |
— | 5 months ago |
| Comment | Post #291723 |
I decided that the input will just be greater than zero. I also added another test case. (more) |
— | 5 months ago |
| Edit | Post #291723 |
Post edited: |
— | 5 months ago |
| Comment | Post #291723 |
I think it would be okay for code golfers to be able to change the orientation. I've updated the rules accordingly. (more) |
— | 5 months ago |
| Comment | Post #291723 |
I've set the minimum number of unique characters to five, I think that should be good :) (more) |
— | 5 months ago |
| Edit | Post #291723 |
Post edited: Updated rules based on comments. |
— | 5 months ago |
| Edit | Post #291723 | Initial revision | — | 5 months ago |
| Article | — |
Fibonascii Squares [FINALIZED] Finalized: Fibonascii Squares The Challenge Your job is to, given input positive non-zero integer $n$, output an ASCII representation of the tiled Fibonacci squares up to the $n$th number of the Fibonacci sequence. Rules Input: - Input will be an integer $n$ such that $n \gt 0$. ... (more) |
— | 5 months ago |