Activity for trichoplax
| Type | On... | Excerpt | Status | Date |
|---|---|---|---|---|
| Comment | Post #287928 |
As we don't have any prior examples of [fastest-code](https://codegolf.codidact.com/categories/50/tags/5329 "Posts tagged fastest-code") challenges, I've posted in the Q&A section asking for general advice on [Hosting fastest code challenges](https://codegolf.codidact.com/posts/287927) to see what id... (more) |
— | over 1 year ago |
| Edit | Post #287927 | Initial revision | — | over 1 year ago |
| Question | — |
Hosting fastest code challenges When posting a fastest-code challenge, what do I need to bear in mind? Unlike with code-golf challenges, where the score is simply the number of bytes in the source code, for a fastest-code challenge the time taken to run will be different on different machines. What options are there for defining... (more) |
— | over 1 year ago |
| Comment | Post #287925 |
(You can always "undelete" your own posts that you have deleted, so it works as a way of temporarily preventing answers.) (more) |
— | over 1 year ago |
| Comment | Post #287925 |
I missed your post while typing - sounds like you're fine with running on your own machine. Once you have copied this into the sandbox you can simply press delete on this one - it will remain visible to you but no one will be able to post an answer which means you'll be free to change whatever you ch... (more) |
— | over 1 year ago |
| Comment | Post #287925 |
We don't yet have any examples of [fastest-code](https://codegolf.codidact.com/categories/49/tags/5329) challenges - yours would be the first.
If you made this a code golf challenge (shortest code) then it would be simpler for you, but would still benefit from some test cases.
If you keep it as... (more) |
— | over 1 year ago |
| Comment | Post #287925 |
Welcome to Code Golf Codidact! This looks like an interesting challenge.
It might need some fine tuning to make it clear how to calculate the score for generating the automated leaderboard. For example, the run time will differ on different machines. We usually post our challenge ideas in the [San... (more) |
— | over 1 year ago |
| Comment | Post #287816 |
If we label an answer as invalid but don't delete it, then currently I'm guessing it still appears on the automated leaderboard? If it's decided to go with this approach maybe we could look into amending the leaderboard to not include invalid answers. (more) |
— | almost 2 years ago |
| Comment | Post #287816 |
Is it straightforward to remove this reaction once the answer has been fixed? I guess the thread could remain as history as long as the reaction badge can be removed? (more) |
— | almost 2 years ago |
| Edit | Post #287794 | Initial revision | — | almost 2 years ago |
| Answer | — |
A: How should we handle incorrect answers? Respect both sides We should consider how an approach would affect the poster of the incorrect answer, and how it would affect the posters of correct answers. Correct answers In general, allowing an incorrect answer to remain leaves some or all of the correct answers lower in the automated per l... (more) |
— | almost 2 years ago |
| Comment | Post #287790 |
I think it's worth taking into account that an answer appears in the per language leaderboard below the question, so allowing it to remain in place can give a casual observer (particularly one not familiar with that language) the impression that it is officially approved and correct.
For example, ... (more) |
— | almost 2 years ago |
| Edit | Post #287403 |
Post edited: Formatting |
— | almost 2 years ago |
| Comment | Post #287087 |
There is a guide on Wikipedia to [Converting repeating decimals to fractions](https://en.wikipedia.org/wiki/Repeating_decimal#Converting_repeating_decimals_to_fractions), which also mentions application to other bases. (more) |
— | almost 2 years ago |
| Edit | Post #287403 |
Post edited: Fix missing backticks |
— | about 2 years ago |
| Edit | Post #287403 |
Post edited: Typo |
— | about 2 years ago |
| Edit | Post #287403 | Initial revision | — | about 2 years ago |
| Article | — |
Shortest representation in generalised Roman numerals [FINALIZED] Posted Given an integer, find its shortest representation in generalised Roman numerals. Since there is more than one way to generalise, only the definition shown below applies to this challenge. Definition The digits used are the same as for standard Roman numerals, with the same values: Dig... (more) |
— | about 2 years ago |
| Edit | Post #287377 |
Post edited: Mark as finalized |
— | about 2 years ago |
| Edit | Post #287386 | Initial revision | — | about 2 years ago |
| Question | — |
Digit antitranspose Convert a matrix or grid of digits to its antitranspose. For a square matrix , this is its reflection in its antidiagonal. More generally, for a rectangular matrix, this is its reflection in its skew diagonal. Less formally, the line to reflect in is from South West to North East, at 45 degrees re... (more) |
— | about 2 years ago |
| Edit | Post #287377 |
Post edited: Specify input is rectangular |
— | about 2 years ago |
| Edit | Post #287376 |
Post edited: Mark as finalized |
— | about 2 years ago |
| Edit | Post #287381 | Initial revision | — | about 2 years ago |
| Question | — |
Encode with ROT13.5 Given a string, convert all of its letters using ROT13, and all of its digits using ROT5. This is sometimes referred to as ROT13.5. Input - A sequence of printable ASCII characters (character codes 32 to 126 inclusive) - This may be a string or any data structure of characters Output - A seq... (more) |
— | about 2 years ago |
| Edit | Post #287377 |
Post edited: Add more test cases |
— | about 2 years ago |
| Edit | Post #287377 |
Post edited: Move example out of bullet point list |
— | about 2 years ago |
| Edit | Post #287376 |
Post edited: Add hope for explanations |
— | about 2 years ago |
| Edit | Post #287377 | Initial revision | — | about 2 years ago |
| Article | — |
Digit antitranspose [FINALIZED] Now posted: Digit antitranspose Convert a matrix or grid of digits to its antitranspose. For a square matrix , this is its reflection in its antidiagonal. More generally, for a rectangular matrix, this is its reflection in its skew diagonal. Less formally, the line to reflect in is from Sou... (more) |
— | about 2 years ago |
| Edit | Post #287376 |
Post edited: Slight adjustment to a test case |
— | about 2 years ago |
| Edit | Post #287376 |
Post edited: Amend test cases |
— | about 2 years ago |
| Edit | Post #287376 | Initial revision | — | about 2 years ago |
| Article | — |
Encode with ROT13.5 [FINALIZED] Now posted: Encode with ROT13.5 Given a string, convert all of its letters using ROT13, and all of its digits using ROT5. This is sometimes referred to as ROT13.5. Input - A sequence of printable ASCII characters (character codes 32 to 126 inclusive) - This may be a string or any data str... (more) |
— | about 2 years ago |
| Edit | Post #287238 |
Post edited: Remove trailing comma from test cases |
— | about 2 years ago |
| Edit | Post #287329 |
Post edited: Conclude switching to 0-bits for knights would be longer |
— | about 2 years ago |
| Edit | Post #287329 |
Post edited: Forgot to update Rust Playground link |
— | about 2 years ago |
| Edit | Post #287329 |
Post edited: Combine bitmask pairs into single applications |
— | about 2 years ago |
| Edit | Post #287329 |
Post edited: No need to stop knights moving off the top of bottom of the board, only the sides |
— | about 2 years ago |
| Edit | Post #287341 |
Post edited: Mark code block as text to avoid syntax highlighting making the first letter bold |
— | about 2 years ago |
| Edit | Post #287238 |
Post edited: Make test case explanations a hidden section |
— | about 2 years ago |
| Suggested Edit | Post #287341 |
Suggested edit: Mark code block as text to avoid syntax highlighting making the first letter bold (more) |
helpful | about 2 years ago |
| Edit | Post #287329 |
Post edited: Further golfing |
— | about 2 years ago |
| Edit | Post #287329 | Initial revision | — | about 2 years ago |
| Answer | — |
A: Knight safe squares Rust, 236 184 166 142 bytes ```rust |i:u64|{let s=0x101010101010101;let(a,b,c,d)=(i&252s,i&254s,i&127s,i&63s);(i|a>6|c>>15|b>>17|a>>10).countzeros()} ``` All test cases on Rust Playground Takes input as a 64 bit unsigned integer where each 1-bit represents a knight and each 0-bit represent... (more) |
— | about 2 years ago |
| Edit | Post #287323 |
Post edited: Mark as finalized |
— | about 2 years ago |
| Edit | Post #287324 | Initial revision | — | about 2 years ago |
| Question | — |
Sort letters by height Given a sequence of lower case letters, sort them into order of height. Heights The heights of letters are dependent on font, so for this challenge the height order to be used is as defined below: ```text acemnorsuvwxz t i bdfghklpqy j ``` Letters on the same line are defined to be ... (more) |
— | about 2 years ago |
| Edit | Post #287323 |
Post edited: Add test case |
— | about 2 years ago |
| Edit | Post #287323 |
Post edited: Add test cases |
— | about 2 years ago |