Timeline for Number of characters skipped determines code printed [closed]
Current License: CC BY-SA 4.0
17 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 16, 2019 at 14:33 | comment | added | Draco18s no longer trusts SE | @AlienAtSystem That might be the one I was thinking of. | |
| Oct 16, 2019 at 14:26 | history | closed |
AdmBorkBork caird coinheringaahin g♦ xnor Arnauld hyperneutrino♦ |
Needs details or clarity | |
| Oct 16, 2019 at 12:48 | comment | added | AlienAtSystem | Still, I think a minimum length requirement would improve this challenge as well | |
| Oct 16, 2019 at 12:46 | comment | added | Wheat Wizard♦ | @AlienAtSystem Those are actually pretty different. This one is remove every \$kn+1\$th character while that one is keep every \$k\$th character. | |
| Oct 16, 2019 at 8:54 | comment | added | AlienAtSystem | Seems to be a duplicate of codegolf.stackexchange.com/questions/36397/… except this one lacks a minimum length | |
| Oct 15, 2019 at 22:23 | comment | added | rpGYNay0wNR7Qikd0I |
I'm trying to understand this challenge a bit better.Are you portraying that foobar is the theoretical source code, and skipping every character of the original source code, foobar, resulting in foa, would print a different result?
|
|
| Oct 15, 2019 at 18:17 | answer | added | Wheat Wizard♦ | timeline score: 10 | |
| Oct 15, 2019 at 18:14 | history | edited | Wheat Wizard♦ |
edited tags
|
|
| Oct 15, 2019 at 18:10 | review | Close votes | |||
| Oct 15, 2019 at 18:14 | |||||
| S Oct 15, 2019 at 18:06 | history | edited | caird coinheringaahin g♦ | CC BY-SA 4.0 |
added 3 characters in body
|
| Oct 15, 2019 at 18:03 | review | Suggested edits | |||
| S Oct 15, 2019 at 18:06 | |||||
| Oct 15, 2019 at 18:01 | comment | added | AdmBorkBork | Welcome to Code Golf SE! We have a sandbox where you can post a potential challenge and get meaningful feedback before posting it to Main, which can help clear up questions such as the ones currently in the comments. | |
| Oct 15, 2019 at 17:51 | comment | added | Veskah | Ooooh, this is a radiation-hardening type problem. I thought it was printing every n characters of the input or something. | |
| Oct 15, 2019 at 17:50 | comment | added | DJMcMayhem |
How is n=1 "fobr"? If I understand the challenge it should be "foa" because you remove each character in parenthesis: f(o)o(b)a(r)
|
|
| Oct 15, 2019 at 17:47 | comment | added | Draco18s no longer trusts SE |
I'm sure I've seen a challenge like this before, but I have to question the "code golf" aspect: Fewer characters (say, a 2 byte program) would never need to output 3 because there would be no 3rd character. I'm pretty sure the older challenge was to output as many different results as when programs got longer there were more collisions to deal with. Shorter just gives an advantage to languages that can output 0 with 0 or 1 bytes (and is not challenging).
|
|
| Oct 15, 2019 at 17:45 | review | First posts | |||
| Oct 15, 2019 at 17:47 | |||||
| Oct 15, 2019 at 17:43 | history | asked | John L | CC BY-SA 4.0 |