Communities

Writing
Writing
Codidact Meta
Codidact Meta
The Great Outdoors
The Great Outdoors
Photography & Video
Photography & Video
Scientific Speculation
Scientific Speculation
Cooking
Cooking
Electrical Engineering
Electrical Engineering
Judaism
Judaism
Languages & Linguistics
Languages & Linguistics
Software Development
Software Development
Mathematics
Mathematics
Christianity
Christianity
Code Golf
Code Golf
Music
Music
Physics
Physics
Linux Systems
Linux Systems
Power Users
Power Users
Tabletop RPGs
Tabletop RPGs
Community Proposals
Community Proposals
tag:snake search within a tag
answers:0 unanswered questions
user:xxxx search by author id
score:0.5 posts with 0.5+ score
"snake oil" exact phrase
votes:4 posts with 4+ votes
created:<1w created < 1 week ago
post_type:xxxx type of post
Search help
Notifications
Mark all as read See all your notifications »

Activity for Sylvester‭

Type On... Excerpt Status Date
Edit Post #292935 Post edited:
Updated rounding rules.
15 days ago
Comment Post #292935 The rule means that 33.x can be rounded either down to 33 or up to 34, no matter what digit x is. I can add second test cases if needed.
(more)
15 days ago
Edit Post #292920 Post edited:
Marked as finalized.
about 1 month ago
Edit Post #292935 Initial revision about 1 month 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)
about 1 month ago
Edit Post #292920 Post edited:
about 1 month ago
Comment Post #292920 Alright, I'll update it haha
(more)
about 1 month ago
Edit Post #292920 Post edited:
about 1 month ago
Comment Post #292920 True, I'll change it.
(more)
about 1 month ago
Comment Post #292920 Thanks for catching that! I edited the post and chose rounding up since that's simpler.
(more)
about 1 month ago
Edit Post #292920 Post edited:
about 1 month ago
Edit Post #292920 Post edited:
about 1 month ago
Edit Post #292920 Post edited:
about 1 month ago
Edit Post #292920 Initial revision about 1 month 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)
about 1 month ago
Edit Post #292910 Post edited:
about 1 month ago
Comment Post #292910 Alright, edited!
(more)
about 1 month ago
Edit Post #292910 Post edited:
about 1 month ago
Edit Post #292910 Post edited:
about 1 month ago
Edit Post #292910 Initial revision about 1 month 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)
about 1 month 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.
6 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)
6 months ago
Comment Post #291761 Good tips! I updated the answer.
(more)
6 months ago
Edit Post #291761 Post edited:
Saved four bytes.
6 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)
6 months ago
Edit Post #291761 Post edited:
Fixed a typo.
6 months ago
Edit Post #291761 Initial revision 6 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)
6 months ago
Edit Post #291723 Post edited:
Marked as finalized.
6 months ago
Edit Post #291759 Initial revision 6 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)
6 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)
6 months ago
Comment Post #291723 I decided that the input will just be greater than zero. I also added another test case.
(more)
6 months ago
Edit Post #291723 Post edited:
6 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)
6 months ago
Comment Post #291723 I've set the minimum number of unique characters to five, I think that should be good :)
(more)
6 months ago
Edit Post #291723 Post edited:
Updated rules based on comments.
6 months ago
Edit Post #291723 Initial revision 6 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)
6 months ago