« first day (3352 days earlier)      last day (56 days later) » 

12:18 AM
@Neil Do you mean remove [H-O] or H.*O?
@Neil QuadR: 6 or 5 or 7 bytes.
 
 
2 hours later…
2:32 AM
CMC: Without using the word "chameleon", rephrase the title of this meta question as short as possible.
 
I am still for using the word "chameleon". I think "chameleon question" describes precisely what the question is about. Changing it might make it a chameleon meta-question!
I'm open to suggestions on changing the chameleon challenges thing-to-avoid post to make it clearer. I did intend it to apply to situations like this, and if that doesn't come across, then I think I did a bad job there.
 
3:15 AM
I agree that "chameleon" fits here.
 
@Bubbler How to cope with an unintentional onion competition.
("synonym" doesn't really fit here.)
 
 
1 hour later…
4:29 AM
I've been considering for this sandbox challenge. Would it be a good idea?
 
5:05 AM
4
A: Sandbox for Proposed Challenges

petStormIs it a Happy Number? code-golf decision-problem A repost of this challenge (if I got the policy right). Given a single positive integer (which can also be taken as a list of digits or a string), output whether the number terminates at 1 . Truthy/falsy follows the language's convention, or you ...

Any more feedback for this?
 
5:23 AM
@petStorm Looks fine to me, though it's still unclear whether we should close the old one as a dupe of the new one.
 
6:00 AM
0
A: Sandbox for Proposed Challenges

petStormWhat is the group? code-golf integer Given a single list as an input (always uniquified having 2 items), determine whether all items in that list only belong to a single group. All items in the input lists will always be positive integers. To start with, natural numbers will be splitted in grou...

@Bubbler What about this one? Is it easy or hard?
 
0
A: Sandbox for Proposed Challenges

petStormWhat is the group? code-golf integer Given a single list as an input (always uniquified, sorted, having 2 items), determine whether all items in that list only belong to a single group. All items in the input lists will always be positive integers. To start with, natural numbers will be splitte...

 
@petStorm Super easy, because (a,b)=>a%2*(a+1==b)*b/2 in JS, not even golfed.
 
@Bubbler Do you think the list should involve repeated items?
 
@petStorm I don't know. Trivial challenge is not necessarily a bad one.
 
@Bubbler ... Since length 1 or length 3 lists might make the challenge more interesting.
 
6:11 AM
@petStorm It's totally your pick.
 
0
Q: The uncrackable cipher

user94132Ran this through reddit yesterday and nobody could figure it out. Honestly don't know what this is. Originally received this in a body of an email sent by a really shady guy. This is a temp account but I'll be checking back every so often. If you wanna talk to me, PM u/DDoS_Me on reddit. Here it...

 
 
3 hours later…
8:58 AM
hi all!
 
Hi.
 
9:14 AM
but I am not sure how to copy and paste strings of length 100,000 into TIO
I just want one string of all 0s and one that is one shorter and with one of the 0s changed to a 1
can anyone help?
 
Download the interpreter on TIO and write into a text file.
 
hmm...
I don't know how to do step 1 of that
 
@Anush there's a nice tutorial here but i'm pretty sure it'd be way simpler to just install Haskell :p
 
@dzaima Right! I don't want to install retina though
although I believe the retina solution. It's very nice and simple
the haskell one I am not so sure about
 
That's your problem. You shouldn't use TIO for very large inputs.
 
9:23 AM
@petStorm Thanks :)
I am just trying to see if their code can really be linear time where I don't fully understand their explanation
 
@Anush why can't you? i ran it just fine..
 
@dzaima you managed to run it on strings of length 100k?
 
@Anush yeah
 
oh cool. What did you do? Copy and paste the strings into TIO?
 
100,000 isn't a very large length indeed.
 
9:25 AM
@Anush ...yeah? :|
 
nice
@dzaima how long did they take to run?
 
@Anush 1.1s
 
@Anush You can directly copy-paste a 100k length text on TIO. Try it online!
It's not really hard to do.
 
thanks very much both
@dzaima 1.1s is an interesting run time. I wonder why it is taking so long given that it is linear
 
i'm curious, what browser/OS were you using that you couldn't copy-paste 100k strings?
 
9:34 AM
@dzaima It was simpler than that. I wasn't sure how to start. I guess I could have written them to a file. Then opened them in emacs and edited the end of the second string?
Presumably there is a python one-liner. In the told days of perl it would have been very easy
python -c "print(''.join(str(x) for x in [0]*10000))"
ok that's what I should have done
but with 100000
very nice
then to make the second string that is one character shorter but with one of the 0s changed to a 1?
 
@Anush ah, i just used APL and 1e6⍴'0', manually copied out of the terminal & manipulated inside the slow chrome textbox
ಠ_ಠ SE chat
 
got youi
the retina code is much faster. I just tested it
everyone should just copy what the retina code does :)
 
9:56 AM
@Adám or 7?
but thanks for both answers, also both polyglot with Retina I guess
 
10:37 AM
of course I am now wondering want answers we would get for edit distance 10 :)
 
10:53 AM
@dzaima You can't copy/paste if you don't have an OS.
 
@petStorm it'd be a bit hard to use TIO then though.
 
@dzaima Ahh, really impressive, nice golfing!
@Anush I guess I should be starting to make a levenshtein library for solving your challenges.
 
@petStorm Yes!
 
@Anush Just for clarification: does your "edit" distance implicitly mean levenshtein distance?
 
@petStorm Yes. And vice versa :)
 
11:02 AM
TADA! Feel free to import it.
 
:)
You just wait until I start asking about the number of insertions needed :)
 
@Anush Thanks you for presenting us your thought process. Implementing...
 
:)
the minimum number of insertions needed to achieve the minimum edit distance :)
 
Wasn't that the same thing?
 
not exactly.. you can achieve the same edit distance with different numbers of insertions...maybe
at least I think you can
that needs checking as I am not 100% sure
 
11:25 AM
0
A: Sandbox for Proposed Challenges

petStormThe crackable cipher cops-and-robbers cipher Task: You need to write a program that is a valid answer to any challenge on CGCC (Including closed ones, like the do nothing challenge). If you encode your cop using any ciphering system introduced before this challenge that is not an identity ciphe...

 
 
1 hour later…
12:45 PM
@AdHocGarfHunter I tried to create a separated chat room, but didn't really work out. So I'll ask it here instead.. Is there a reason why Lost lacks division/modulo operators? Also, a suggestion for a new flag: one where you can give the direction and starting position to test a certain program flow. I know we have the -V and -Q flags to test the entire program from all possible flows, but for large programs this usually times out on TIO. In the mean time I'll install Python to try local runs.
 
@KevinCruijssen I can't remember if there is a reason, perhaps because the characters slash and percent were already occupied. As for the suggstion I have made a new version of the interpreter that allows that along with a bunch of other useful features, I should release it to the public.
 
@AdHocGarfHunter Oh, nice to hear about new features. :) And that indeed makes sense regarding / and % already being in use. Btw, one more suggestion: something that cleans the entire stack. We now usually use ? to clean a single value on the stack before the actual program flow we directed towards starts, but it's possible multiple values are on the stack we want to wipe before starting.
 
Hm, yes that makes sense, I will have to think about it though, I am a little hesitant since it could be a bit "cheaty" in my opinion. I would have to play around with it to see how powerful it is.
 
@AdHocGarfHunter Hmm, good point. Hadn't really thought about its consequences for use in the middle of the program. Maybe a clean-stack which can only be used once per program run.. Just thinking out loud here, no idea if it's feasible.
@AdHocGarfHunter Hmm, you know, maybe that builtin isn't necessary after all. Just creating a loop with ? until the entire stack is cleaned and the default 0 is used isn't too hard.
 
1:38 PM
0
A: Sandbox for Proposed Challenges

petStormFight with the controller! [needs-suggestions] king-of-the-hill Unlike most king of the hill challenges, the controller is also an example bot fighting with other bots. If your bot beats the controller, your bot automatically wins. Any ideas would be appreciated.

I have got a hilarious idea on a KoTH challenge... the controller is a bot that fights with other bots.
Any ideas would be appreciated.
 
0
A: Sandbox for Proposed Challenges

petStormFight with the controller! [needs-suggestions] king-of-the-hill Unlike most king of the hill challenges, the controller is also an example bot fighting with other bots. If your bot beats the controller, your bot automatically wins. Any ideas would be appreciated.

 
@KevinCruijssen Are you working on something in lost?
 
2:08 PM
@AdHocGarfHunter Already posted it actually. Every now and then I look for relatively easy challenges I could do in Lost, since it's a fun language. :)
 
2:54 PM
2
Q: Does base n have any Rotate-Left-Double numbers?

BubblerTask A Rotate-Left-Double number in base \$n\$ is a number \$m\$, when its base-\$n\$ digits are rotated left once, equals \$2m\$. The base-\$n\$ representation of \$m\$ cannot have leading zeros. One example in base 7 is the number 480, or \$1254_7\$. When rotated left once, the value becomes ...

Relatively easy challenge for y'all
:(
 
 
1 hour later…
4:14 PM
I am trying to run codegolf.stackexchange.com/a/202987/9207 . But if I just copy what is in TIO there are syntax errors. I.e. bpaste.net/GM3A
what should it be?
 
4:34 PM
I mean how do I make a standalone python program?
 
 
2 hours later…
6:24 PM
-1
A: Sandbox for Proposed Challenges

Ad Hoc Garf HunterCheck membership As input you will receive An integer \$a\$ A list of integers that is infinite and strictly-monotonic Your program should check (in finite time) if \$a\$ appears the list. You should output one of two disctinct values. One if \$a\$ appears in the list and the other if \$a\...

Does anyone actually have anything to say about this? I don't have an idea why someone downvoted it and I would like to post it.
Eh, I'm just going to post it.
 
1
Q: Check membership of an infinite list

Ad Hoc Garf HunterAs input you will receive An integer \$a\$ A list of integers that is infinite and strictly-monotonic Your program should check in finite time if \$a\$ appears the list. You should output one of two disctinct values. One if \$a\$ appears in the list and the other if \$a\$ does not. This is...

 
 
1 hour later…
7:42 PM
@Bubbler I am curious if you have any ideas to improve on this very nice J solution by FrownyFrog here. I was not able to.
 
 
4 hours later…
11:18 PM
0
Q: Decode Arabic to Arabic Presentation Form

Dannyu NDosObjective Given an Arabic string consisting of ISO/IEC 8859-6 Arabic letters (U+0621–063A, 0640–064A), decode it to Arabic Presentation Form-B (U+FE70–FEFF). Behavior of Arabic letters ISO/IEC 8859-6 Arabic letters change their displayed form to letters in Arabic Presentation Form-B, which are...

 
11:32 PM
@Anush you have to run it in python 3.8
 

« first day (3352 days earlier)      last day (56 days later) »