« first day (3677 days earlier)      last day (1151 days later) » 

1:41 AM
CMP: What is your rarest tag badge, regardless of the level (bronze/silver/gold)?
I recently earned a bronze in combinatorics, which is owned by 13 including me
 
@Bubbler I have bronze in date, which is owned by 11 including me.
 
-1
Q: your challenge is to make a script that reverses a word then replaces letters

Justiniscodingmake a script with the shortest amount of unicode characters to reverse a word then change every letter with the letter next in the alphabet. examples: input: hi output: ji input hello output pmmfi input test output utfu

 
2:38 AM
@Bubbler I noticed that the other day, and meant to congratulate you. I guess I forgot, but congrats!
@Bubbler Sequence bronze with 75 :/
CMQ: Martin has 62 gold badges, more than any other CGCC user. I almost beat him with my silver vs his gold, but I do beat him with bronze. For you, does silver, bronze or neither beat his gold?
 
@Bubbler sequence bronze
 
3:01 AM
@cairdcoinheringaahing I have 67 silver, so I guess I already beat his gold with my silver?
 
@cairdcoinheringaahing none :P
 
For the record, my main sources of silvers seem to be Necromancer, Good Question, and Notable Question
 
3:26 AM
@Bubbler :P. It’s my only tag badge.
 
3:38 AM
@user We respect a laser-like focus on one topic.
 
@Bubbler My necromancer record is better on Meta, but Good and Notable questions are also my bread and butter on Main
 
0
Q: Is this an anagram of its own source code?

HyperboleKillsMeI like anagrams. I like programs that reference their own source code. So this challenge combines them! Input. The input to the program could be anything, including letters, numbers, symbols, you name it. Output. A truthy value if the input's characters can be rearranged to give the source code, ...

 
@NewMainPosts Seems interesting but might turn out to be a dupe
 
It is indeed a dupe of a dupe
 
@Bubbler Great
 
3:51 AM
it's debatable if the dupe should be a dupe but this is a dupe of a dupe
 
Looks like the first one doesn’t involve quines, though
 
Yeah, I guess the second can be reopened, and the third should be closed as dupe of the second
 
^
 
Personally, I don’t think the second or the third should stay open
 
Why not?
 
3:53 AM
As Peter said like 5 years ago, they’re basically just generalised Quine versions of the “Is it an anagram?” challenge, so the core of the challenge doesn’t change
 
i feel like there could be solutions that aren't just straightforward quine techniques composed with permutation checking but it's hard to say how many
 
Most quines can be easily adapted to fit “output if X”, which is why we discourage generalised quines
@UnrelatedString Maybe in golfing languages, but anything more will just use standard Quine modifications
 
"It's a quine...but wait, there's more!" is pretty much as bad as "print X without Y" in my opinion
 
^
Sometimes they can be interesting, but not often
 
Nevertheless the dupe target for the third should be the second
 
3:57 AM
yeah
 
Except you can’t VTC as a dupe of a closed question
We could reopen 2, close 3 as a dupe then close 2 as a dupe
3
 
@cairdcoinheringaahing I can
 
@Bubbler Us peasants without gold badges will have to make do with VTCing as dupe of 1 then :P
 
Can't gold badge holders do the dupe hammer thing?
Or is that only on SO
 
No, that's not the restriction. Apparently a dupe target should have "an upvoted or accepted answer", so I upvoted the existing 0-score answer on 2nd and hammered the 3rd
 
4:02 AM
“ I don't know golfscript, [...] – Peter Taylor”, famous for his golfscript answers in the site’s infancy :P
@Bubbler I could’ve sworn dupe targets had to be open...
 
Wait, so does this mean it's possible for two questions to be closed as dupes of each other?
2
 
@RedwolfPrograms That seemd like a real problem
 
@Bubbler shame, because it doesn't seem like a good answer
it's not as poorly golfed as i thought since i forgot python 2 doesn't have splatting but wait you don't have to convert to a list for sorted anyways
 
4:33 AM
Idea: since an error quine is so easy, you have to make a error non-quine.
So, "write a program T0. Define T_{i+1} = the output of T_i on stderr. A submission is valid if there does not exist any T_i == T_{i+1}"
@RedwolfPrograms Yes it's possible.
 
@user202729 That part is covered by this
though I don't expect many solutions there satisfy your second requirement
Indeed many plain error quines were found as a fixpoint of each compiler, so I guess there aren't many compilers that do not have a fixpoint (mainly because they restrict the number of errors printed, or the amount of source code around the error)
 
If the requirement is "printed on stderr", then they can still employ typical quine techniques.
But yes, error are not well-defined for all languages.
 
4:51 AM
@LuisMendo because there are no viable solutions to this challenge except combining the language's standard generalised quine with the shortest solution from the other challenge. There's no good way to solve this except by tacking the string processing problem onto a normal quine, so this challenge doesn't add anything new. — Martin Ender Aug 17 '16 at 20:26
That's bad. There should be a good way.
Just like how the challenge "print the length of your source code" can be solved without standard quine techniques.
Actually there might be some very interesting techniques.
Because, say, padding the source code makes the frequency list shorter, but the code itself longer.
And there might be no fix point.
 
5:05 AM
Afternoon y'all
 
Afternoon
Would you rather have no copy/paste, or have to indent each line by hand after pressing enter?
 
Latter
Because I can copy paste spaces
Besides that's how tio works anyway
 
I just realized Ash has no newlines in the code page
 
Well done
I told you to make sure there weren't issues
And what is there?
An issue.
I tell you things for a reason buckaroo
 
I can just change the to some other character, and replace ¤ (0x00) with a newline
 
5:11 AM
@user202729 Doing something about frequency of characters in the source code has been done multiple times
 
5:52 AM
What should a golfing language's primality test operator return for 0 and 1?
They're not prime, but they aren't composite either so false seems wrong to me
 
If the operator's name is "is_prime" or "primality test", obviously they should be false because they're not prime
I don't see "is_prime" as a built-in-worthy though, since you can easily implement something like (n!+1)%n==0?
given that whatever%0 doesn't error
 
Well then codegolf.stackexchange.com/questions/209319/… is a better duplicate.
there might be languages with interesting approaches to that one. Python quines are too short.
 
@RedwolfPrograms husk returns index in the list of primes or 0
 
Oh, that's a cool idea
 
husk does that with everything instead of a 1 or 0
gets in the way of some operations, but I think it's still a neat idea
 
6:11 AM
@RedwolfPrograms generally, the length of a list of a number's factors is 2 if it is prime
 
I was going to try to finish the number operators tomorrow, but I've only got four left so I'm going to finish them tonight
All I have to do is fibonacci number stuff, GCD/LCM, and some code point stuff
 
 
3 hours later…
8:48 AM
0
A: Sandbox for Proposed Challenges

Alex briesClose the case NO CasE ShoulD StaY OpeN, ClosE ThE CasE Given a sentence as input, close every uppercased word at letter i by changing letter -i to upperCase. Rules: Every case in a word should be followed up by a case on the mirrored position of the word. In case the case is in the middle of...

 
9:11 AM
codegolf.stackexchange.com/questions/196824/… can someone explain to me which one is the longest answer here, and why?
 
9:26 AM
@Razetime The current winner is this one, which is way, way far above mine
Once you start using double arrows and higher, the parameters to the arrows no longer matter much. The only thing that matters is the number of arrows itself
 
9:43 AM
@Bubbler I was the first to get gold ; Arnauld has since earned it, but that was over 3 years later. I am the only other holder of gold other than Dennis who earned it about 8 months earlier. I am the only other holder of bronze other than Arnauld who earned it about 3 months earlier. On current standings, I am in line to be the first holder of silver .
 
10:21 AM
@Bubbler holy moly
 
 
2 hours later…
11:55 AM
Should I post my question in the sandbox, or is it ok to just post it immediately?
 
@pxeger Should be fine directly.
 
@WheatWizard shouldn't it be T_1∊O(T_0) and vice-versa for the other one?
i probably am misunderstanding big o though
and yes i realise i have misunderstood the notation, so nvm
 
0
Q: Tips for restricted source in zsh

pxegerAdapted from tips for restricted-source in Python Just like code-golf, restricted-source pushes one to exploit quirks and hidden features of the zsh language. While we already have a place to collect all these tips for code-golf, those for restricted-source remain transmitted by word of mouth or ...

 
@user41805 Yeah, but thanks for making me double check anyways. :)
 
1:10 PM
shouldn't this be 4503599627370496 bytes instead of 9007199254741154
idu
 
 
1 hour later…
2:36 PM
0
Q: Isolated web space for users using apache

Learner33I am wondering If docker could be used to perform this. So I have a website which I want to use as a cloud-storage provider (friends and family). But what is getting me annoyed is that maybe, some friend uploads a virus, a malicious php executable or something that could harm the root system. I a...

 
3:24 PM
0
Q: 1, 2, miss a few, 99, 100

rybo111When I was a kid, there was a "really cool" shortcut to count to 100: 1, 2, miss a few, 99, 100 Output the exact string above, in the fewest characters possible, without using these characters: 0, 1, 2, 9

 
 
2 hours later…
5:00 PM
0
Q: Johny Johny yes papa

DaemonWe (nearly) all know about the rhyme "Johny Johny yes papa", that's johny johny yes papa eating sugar no papa telling lies no papa open your mouth hahaha Print out this poem in shortest bytes possible!

 
5:18 PM
@NewMainPosts My internet's so bad I lost both the close vote I was trying to cast and the First Posts review :/
 
 
1 hour later…
6:58 PM
@cairdcoinheringaahing Neither. In fact, even with gold, silver, and bronze combined, I just have 55 badges :(
 
1
Q: Can you spot the liar?

zdimensionIt's the end of the year, you and your friends have just received your grades and ranks for the GOLF101 class. On a chat group, everyone sends their grade and rank to see who's got the best one. Problem: someone is lying. Here is an excerpt from the chat: <A> I'm ranked 1 with a grade of 85. <B> ...

 
7:37 PM
0
A: Sandbox for Proposed Challenges

GammaFunctioncode-golf file-system Sandbox Questions: Is this unambiguous? Any other tags? Filetype colors For anyone who has spent a headache trying to understand dir_colors with GNU ls, this may be the post for you! We're going to ignore parsing LS_COLORS, or matching globs, and instead we'll focus sole...

 
8:13 PM
4
Q: What's next, Achilles?

caird coinheringaahingPowerful numbers are positive integers such that, when expressed as a prime factorisation: $$a = p_1^{e_1} \times p_2^{e_2} \times p_3^{e_3} \cdots \times p_k^{e_k}$$ all exponents \$e_1, e_2, ...\$ are greater than or equal to \$2\$. Note that the exponents do not include zero exponents, as exam...

 
8:29 PM
Q: What's the best way to take an infinite list as input in languages that don't have infinite lists? A generating black box function?
 
I think that's what usually gets done
you could also do an infinite stream of program input
 
8:49 PM
0
A: Sandbox for Proposed Challenges

BeefsterIs it zero- or one- indexed? code-golf array Your task is to determine whether some arbitrary programming language has zero-indexed or one-indexed arrays based on sample inputs and outputs Inputs An array of integers with at least 2 elements A positive integer index The value of the array at th...

 
9:12 PM
@HyperNeutrino Are you still ok to offer some Best Of bounties? It's just me and you left who offered but not started, and I'm waiting to clean up any loose ends at the end
 
10:02 PM
0
A: Sandbox for Proposed Challenges

caird coinheringaahingI ain't no Fortunate Prime The primorial \$p_n\#\$ is the product of the first \$n\$ primes. The sequence begins \$2, 6, 30, 210, 2310\$. A Fortunate number, \$F_n\$, is the smallest integer \$m > 1\$ such that \$p_n\# + m\$ is prime. For example \$F_7 = 19\$ as: $$p_7\# = 2\times3\times5\times7\...

 

« first day (3677 days earlier)      last day (1151 days later) »