« first day (2349 days earlier)      last day (2497 days later) » 

9:01 AM
I have successfully installed Arch Linux
Again
On the replaced SSD
 
dear math people.. if I write d|x-y as in d divides x - y, do I need brackets?
 
@Lembik I suppose |, being a form of division, has precedence over -.
@Lembik It is exactly confusion like that which APL prevents by not having an arbitrary precedence order.
 
hmm.. thanks
 
I'm back
 
@Adám Why is APL?
 
9:09 AM
| and % have higher precedence that ±, hence you need to write d|(x-y) or (x-y)%d=0
 
@Lembik what do you mean?
 
@Mr.Xcoder thanks
@V.Courtois about which part?
I made two points
 
x) i thought the "reply" would notify
the second one
 
@Lembik The pleasure's on my side.
 
Math is not a programming language, if it's clearer to use parentheses then use them
 
9:10 AM
@Mr.Xcoder :)
 
and in that case, it clears any possible confusion
 
@Mendeleev Why is APL?
 
@V.Courtois oh right.. you say there are two parts to your challenge
but you don't mention the part where they have to sample according to the pmf they just made
 
@Adám Is a joke. Don't kill me please
 
@Fatalize I answered @Lembik because I had some trouble in the past with this confusion
 
9:11 AM
@Mr.Xcoder is that so? but "If (sum of all numbers since the previous lennyface) is equal to zero or negative, you must do as if the numerator is equal to 1 in f's definition." and "positive AND negative integers"
 
@V.Courtois Why ping me?
 
you just removed your question...
 
I did not..
What question?
 
@V.Courtois I am asking you two questions :)
 
@V.Courtois I see it doesn't have a negative score anymore :P
 
9:13 AM
first, shouldn't you add in the part about doing the sampling
 
That was @Lembik
 
second, do your probabilities actually sum to 1
 
ooh
 
You cannot offend me (try!), but I just don't understand your question, even as a joke. Why is APL [in existence]? Why is APL [like that]? Why is APL [not like that]?
Why[,] is APL [different]?
 
@V.Courtois Yes, the sandbox post has 0 now, it doesn't have -1 anymore!
 
9:14 AM
face1 -1 face2 -1 face3
what are the probabities in that csae?
 
ahh ok @Mr xcoder
 
please tell me :)
 
@Adám What is the best way to lean APL? Why should I use APL?
 
face1 -1 face2 -1 face3 => face1 1/3 face2 1/3 face3 1/3
 
@Mendeleev First get a keyboard for APL
 
9:15 AM
ah*
it's not clear xD
 
@Mr.Xcoder I use an Apple wireless keyboard. Is that a problem?
 
Else you won't be able to type anything unless you copy-paste
 
face1 -1 face2 10 face3 -1 ?
what are the probs there?
 
@SIGSEGV Finally a new question of yours
 
@Adám What the heck is wrong with [people who don't use] you[r language correctly]?
 
9:16 AM
face1 -1 face2 10 face3 -1 => face1 1/12, face2 1/12, face3 10/12
what i meant by 'it's not clear' was 'i don't say it well'
 
@SIGSEGV Are we allowed to print to STDERR?
 
umm
compile-time
 
ah, right
pfff
 
@V.Courtois Right... please clear that up :)
 
doin it
 
9:20 AM
also my examples might be helpful
 
-1
Q: "Hello, World", Even before it runs

SIGSEGV Warning: This challenge is only valid for languages with a compiler. Make a program (which is perfectly valid code) that outputs Hello, World, even before runtime. How? Let me explain. Many languages have a compiler. Some operations are made in the compile-time, and others, in runtime. You...

 
@Mendeleev Best way depends on the audience. In general, I'd say going through Mastering Dyalog APL (or some other quality Book) while having an interactive APL session at hand (not TIO) and keeping a browser window open with the APL chat room, is a pretty safe bet.
 
f(l)=(sum of all numbers since the previous lennyface)/(sum of f(u) for each lennyface u in the list)
 
Can anyone help me understand PeterTaylor's comment: "You should floor the densities, such that you don't have to handle decimal precision errors" ?! sgn(sum(m)/count(m) - sum(n)/count(n)) = sgn(sum(m)*count(n) - sum(n)*count(m)) so it can be done exactly and entirely in integers."?
This is the post we were talking about:
1
A: Sandbox for Proposed Challenges

Mr. XcoderCompare the densities of my numbers SANDBOX Test case suggestions Relevant tags Formatting / Wording Improvements I/O suggestions You will be given two positive integers N and M, your task is to compare their densities. How to determine how dense a number is (e.g: N=267)? ...

 
poor @SIGSEGV
sorry your question is being murdered
 
9:31 AM
@Mr.Xcoder can you explain where is confusiong about it?
 
;-;
 
What is the best way to ask for help with a proposed challange?
When it is in the really vague stage?
Should I discuss it here and then once it is what I think is good put in in the sandbox for a bit til it is properly neat and clear?
Or should I just go straight to the sand box
Right now I'm not sure if my proposal is best served as codegolf or as a popularity contest.
 
(I meant the latter)
 
@LyndonWhite I discuss it a little here.. then people say "For the hundreth time, sandbox it!" then I do that
then I discuss it here again :)
but pointing to the sandbox
:)
 
So I should skip the first part and go straight to the second?
 
9:36 AM
"Sandbox it"
Do it
 
'what i did, and sandbox helped me quite a lot
 
Just do it
Ignore the former option
gogogogogogo
to the sandbox
good
whew
 
Cool
Makes sense, otherwise main chat would be nothing but people sandboxing via converstation
 
Oh no
My comeback is always bad
this was the second time
 
"Fatal Error: Your start menu doesn't work. Sign out and we'll fix it". Guess what, it's not fixed, every time I try to open my start menu now, I get signed out. God damn it Windows....
 
9:46 AM
8 or 10?
 
@LyndonWhite I talked to them and understood what they meant. Sorry for disrupting you
 
@mınxomaτ it's easy to escape that ₩indo₩$ hell...
 
It isn't if you need to work for MS. Privately, I'm all Linux.
 
9:51 AM
oh you work there? yeah they pay goooood
I suppose
because I dunno how well they pay regular workers...
 
@Mr.Xcoder Python is compiled (to bytecode) before being interpreted, so it falls in the category of "languages with a compiler".
(in reaction to this comment)
 
umm...I think that "bytecode" is actually some form of cache
also I think op disallowed errors
 
yes, the answer isn't valid, but not for the reason given by Mr.Xcoder
what do you mean "some form of cache" ?
 
well, it's still the python interpreter running the program, not some executable by itself
 
indeed, but it's compiled nevertheless (not to native code, but still).
 
10:00 AM
yet only syntax errors appear at "compile time" and I don't think there's any errorless way to output anything
 
and the python interpreter could be called, more accurately, the python bytecode intepreter.
maybe it's true in Python; I'm not familiar with the language well enough
but for instance, in Perl (which is compiled to bytecode, same as Python); you can execute code at compile time
 
in Python you're already in runtime afaik
 
A compile-time warning could do. (but maybe Python's compiler doesn't issue any warnings)
(about some ambiguity, some unitialized values, some unreachable code.. there are a lot of good reasons to issue warnings, and if the compiler show something like "warning: near XXXX", then you could arrange for XXX to be "Hello, World" and it's won)
(but once again, I don't know if Python's compiler issues warnings for such things)
 
python compiler doesn't issue warnings at all
it looks like it's doing everything in runtime
and the bytecode stuff you refer to aren't python bytecode but cache
 
10:26 AM
0
A: Sandbox for Proposed Challenges

TheLethalCoderCreate The Correct Path Which would be better code golf with shortest code and being able to run on at least two operating systems or code challenge and scoring by how many operating systems it can run on? (code-golf OR code-challenge) file-system Given an input create a program that when ran ...

0
A: Sandbox for Proposed Challenges

Lyndon WhiteLorum Ipsum Generator Lorum Ipsum is placeholder text used when preparing layout without wanted to have content already filled. One of it's key features over using some arbitrary text is that it is nonsense. It isn't even valid latin (though it is close). This prevents anyone being shown the la...

 
0
Q: Draw a probability road

MayubeBackground I'm conducting a probability experiment. I have a collection of live rats, and I'm going to assign each rat a probability as a percentage integer from 1 to 99 (inclusive). The experiment will last 10 weeks, and at the end of each week, I'll roll a 100-sided die. Any rats who have a hi...

 
@mınxomaτ Yeah. I miss my Win7 Start menu. 10's explorer is flaky, and the Start menu doesn't anyway isn't a proper Explorer instance, so I cannot interact with the files it shows (e.g. to drag them into an email), as I only get .lnk files.
 
10:58 AM
0
A: Sandbox for Proposed Challenges

MayubeDraw a Probability Road code-golf ascii-art probability-theory Background I'm conducting a probability experiment. I have a collection of live rats, and I'm going to assign each rat a probability as a percentage integer from 1 to 99 (inclusive). The experiment will last 10 weeks, and at the end...

 
@Adám I would like to work at all right now. Nothing fixes this error. This was introduced by the cumulative update 1703 and/or the recent 'urgen' flash player fix.
 
11:45 AM
0
Q: Compress a sparse matrix

PureferretCompress a sparse matrix Compress a sparse matrix using Compressed sparse row (CSR, CRS or Yale format). These are all the same form of compression (ignore new Yale). Input may be any 2d data structure (list of lists, etc): e.g [[0 0 0 0], [5 8 0 0], [0 0 3 0], [0 6 0 0]] And the output ...

2
Q: It was just an input-bug

Kevin CruijssenContinuing my It was just a bug challenge: Input: A string consisting of printable ASCII characters without white-spaces nor new-lines. Output: First turn the input into a palindrome by reverting the input, and adding it before itself, excluding the middle character (i.e. with an input 123456...

 
12:05 PM
how long should you leave a question before accepting an answer if it has lots of answers?
 
~5-7 days
 
thanks :)
and what if it has only 1 answer?
 
~3 weeks
 
I love the clarity of your answers :)
thanks
it's not so hard
especially since isaacg has explained how to do it :)
hmm.. tempted to pose a discrete log challenge
 
2
Q: Counting from 1 to n without any consecutive numbers

PhilippeGoal You are given an integer n. You need to count from 1 to n without any consecutive numbers. Your program must output how many combinations can achieve this. We will call f(n) the function that takes in n and output the numbers of valid combinations. Example For n = 6, a possible solutio...

 
12:20 PM
@Lembik Or you could not accept any answer, that might be even better.
 
ah ok
but then I feel bad for people who love to have their answers accepted
 
the competition shouldn't be over all programming languages, but rather between "comparable" ones (ie. python vs JS vs ruby for instance), so it's better not to accept any answer
 
Omg, trying to solve "It was just an input bug", I got this:
0        9        8        7        6        5        4        3        2        1        2        3        4        5        6        7        8        9        0
0       9       8       7       6       5       4       3       2       1       2       3       4       5       6       7       8       9       0
0      9      8      7      6      5      4      3      2      1      2      3      4      5      6      7      8      9      0
0     9     8     7     6     5     4     3     2     1     2     3     4     5     6     7     8     9     0
 
@Mr.Xcoder it was only a bug 2: golflectric boogaloo
 
I changed on character, I got this:
 
12:29 PM
@KevinCruijssen
 
0        9        8        7        6        5        4        3        2        1        2        3        4        5        6        7        8        9        0
0       9       8       7       6       5       4       3       2       1       2       3       4       5       6       7       8       9       0
0      9      8      7      6      5      4      3      2      1      2      3      4      5      6      7      8      9      0
0     9     8     7     6     5     4     3     2     1     2     3     4     5     6     7     8     9     0
 
@Mr.Xcoder now it's just the original It was just a bug
 
No, It's palindromic
 
The link again
 
12:51 PM
0
A: Sandbox for Proposed Challenges

NeilAbbreviate a rename After you commit a rename, git reminds you but tries to avoid showing the full source and target path. It does this by splitting the path into components, extracting identical leading and trailing components, then using them to abbreviate the rename. (Other output that git pr...

 
4
Q: Regex, Paper, Scissors, Lizard, Spock

Martin EnderWarm up: Regex, Paper, Scissors This is the challenge I originally wanted to post, before realising that some very short solution exist. Nevertheless, it can be an interesting problem to think about in preparation for the actual challenge below. Write three regexes R, P and S such that they mat...

 
Oh noes regex golf
 
1:33 PM
Wow 4 upvotes in 1 minute :O
 
was just about to say that
 
hi.. which languages have a function for discrete log? I want to pose a discrete log challenge
 
^ probably Mathematica
 
ah yes
it seems sympy in theory except I can't get it to import
 
what would the challenge be asking for?
 
1:52 PM
1
Q: BASKETBALL FRVR?

officialaimmYou might already be familiar with the game: Basketball FRVR in facebook. There are two types of score you can make: A virgin-shot:(we call it so in our country :D) When the ball enters the basket without touching the rim or A stale shot: When the ball enters the basket, but after touching the...

 
@Lembik many languages have base conversion, and discrete log is really just base convert + length
 
@MartinEnder that has confused me slightly. Discrete log is computationally hard
but base conversion is easy
much of cryptography relies on the hardness of discrete log
 
Could anyone explain this sequence? I want to make a challenge out of it but I'm having trouble explaining it.
 
@Lembik then I'm probably thinking of the wrong concept
 
@MartinEnder ok np
 
2:02 PM
I thought you just meant integer logarithm
 
say I know r and r^i and I want to compute i but we are working modulo for some large q
 
ah okay, yeah the modulo part would make that a tough problem
 
My guess is that Lembik's challenge will have another one of those time limits
 
@Fatalize you are guessing well
@Fatalize do you hate the time limits?
 
I don't like them, no, but I was saying that here because it explains why you think it'll be a difficult challenge
 
2:07 PM
@Lembik We generally prefer 1 indicator of the validity of a submission
 
because otherwise the formula itself is very simple, and you can just brute force
 
"Your program must do X, your score is based on Y", not "Your program must do X and Z, your score is based on Y"
 
well it could be a fastest-time challenge, in that case it's perfectly fine
 
@Mayube the shortest code that is reasonably fast.. is that really bad?
or.. the shortest non-naive solution
@Fatalize thanks
I personally just don't find code-golf for brute force solutions very interesting in general
of course we can all like different things!
 
I am biased againt time-based challenges, so my opinion is definitely not representative of all people here
 
2:13 PM
 
@Fatalize right but then that's still "Do X, scored with Y", it's just that now Y is time taken instead of code length
 
@dzaima it's definitely a variant of that but not exactly that
maybe we could have a new tag
@Mayube to be fair, write code that is correct according to my spec scored by length is also Do X, scored by Y :)
@dzaima the issue that I don't want to specify the complexity. Just the rough maximum running time on real inputs
 
@Lembik but you're asking "Do X and Z, scored by Y", where X is complete a task, Y is code length, and Z is "it must complete in under X time"
 
@Mayube right ... but you could say it is do X (the spec includes the max running time) scored by Y which is code length
it's a question of what you think a spec is
specs often have many parts
but it's just a matter of taste. You don't have to want to answer those questions but many people do it seems
and if we had a more appropriate tag that would be even better
I should say it's not just me asking this type of code-golf question
there a number of advantages of this over fastest-code for example
in particular, it allows more languages to be competitive
 
The problem with that idea is that there has to be some one person who has to test all the submissions and compiled & optimized languages have a big advantage
 
2:33 PM
@dzaima why do they have an advantage?
TIO is really helpful for this
fastest-code on the other hand does have the problem that one person has to run all the code
 
10
Q: Is TIO acceptable for fastest-code questions?

LembikI like to ask fastest-code questions. However, I don't want to run everyone's code on my PC, partly because I only have access to a slow Windows laptop at the moment and I can't imagine I could even run most code in most languages. Is it acceptable to ask people to include a TIO link in their...

 
that's my question!
why have you posted it?
 
oh
lol
 
:)
 
well someone's gotta be able to test if it succeeds to do it in the time limit
 
2:35 PM
but for the "code-golf but it can't be too slow" questions TIO is great
@dzaima right but because clever solutions are normally way under the time limit TIO tells you
for most of the answers
you win some and you lose some with every type of question of course
 
Maybe you can just tell them it can't exceed 3s or sth.
 
@V.Courtois that's what I do
 
or I quite liked it when I just said it had to complete on their computer
 
then the person with a supercomputer and jelly knowledge would win :p
 
2:42 PM
@dzaima what factor slower is jelly than C?
@dzaima but actually no... a brute force solution is often never going to finish on any computer no matter how fast
2^100 operations ain't happening, for examplle
 
Jelly is written in Python which is written in C, so a fair bit
 
@Lembik Define C.
 
@Adám No :)
Not until you define define
maybe one day we will have a Timeit Online tool
 
@BusinessCat and C is written in Assembly :)
 
@Lembik If you mean the C code that gets run by Jelly, then they have the same speed. If you mean the same algorithm (without unnecessary checking done by Python), but coded straight in C, then considerably, but not a fair comparison. If you mean C written for the same task, by a good C programmer, but with no access to the Jelly or Python code, then C may actually be slower, because the programmer cannot optimise like the Python interpreter does.
 
2:47 PM
isn't C written in C?
or was that C++?
 
@dzaima you mean gcc?
 
@dzaima go write a python interpreter in python, before python exists, and get back to me on that ;)
 
gcc is in C afaik
 
I don't know lol
26
Q: How was the first C compiler written?

Jaskaran S.PIs it true that the first C compiler was written in C itself? Then, how was it executed and compiled? Or, was this compiler written in assembly language?

 
'Lo, all :)
 
2:49 PM
usually when writing a compiler we use either assembly language, or another programming language, and it's common that after first compilation, the compiler is rewritten in it's native language. huh...
 
@Mayube The Dyalog APL interpreter is partially written in Dyalog APL.
@Mayube Yes, you can then use the sub-optimal compiler to make a new compiler.
 
I see no advantage of over and or anyways, except that well-optimized languages get no bonus and noone has to test the submissions
 
@Mayube Pretty sure Java's written in itself
 
I'm beginning to feel bad for this guy! codegolf.stackexchange.com/users/46762
The amount of notifications he must receive from comment pings across the network!
 
@Shaggy You have to be a part of the conversation to get pings
 
2:54 PM
@StepHen That's not nearly as funny :(
 
@Shaggy Sorry to burst your bubble
 
3:13 PM
2
Q: What is the standard scratch?

user69279In golf, the standard scratch of a course is calculated using this formula: (3*num_of_3_par_holes + 4*num_of_4_par_holes + 5*num_of_5_par_holes) - difficulty_rating Your task is to calculate the standard scratch of a golf course, given these 4 inputs. You should take input in any standard for...

 
@NewMainPosts why r u so slow omg
 
I wonder whats the longest it has taken to post a post
 
@StepHen the jvm isn't
 
Okx
What to do about this? codegolf.stackexchange.com/review/suggested-edits/41637 the user is not in chat.
 
ask mod to superping or whatever it's called
why does commenting take that much rep
 
3:22 PM
I thought you could comment ping anyone who had edited a post.
@dzaima To prevent spam.
 
allowing answers from 1 rep is more spammy than comments (comments are way smaller in size)
 
Okx
If I start typing @Theh.. in the comment box, the name doesn't come up in white above as what would usual happen
 
@Okx It may still work, although now you've rejected the edit, it may not work anymore.
 
reply anyway, the person might want to get the answer you know
 
Okx
Okay
 
3:25 PM
@Okx Little late now, but (IIRC) you could have replied in the edit reject comment
 
^
 
Okx
oh :P
 
0
Q: Rectangular difference

Nathan MerrillIn this challenge, you are given two overlapping rectangles, and you need to calculate the rectangles created by removing one from the other. For example, if you remove the red rectangle from the black one: You end up with one of the following two rectangle sets: You'll also need to handl...

 
@NewMainPosts that was fast
 
I think New Main Posts just posts all new posts every half hour or so, so if you post it at the right time you get in fast
 
3:30 PM
It depends on when the RSS feed updates.
 
I did get lucky :)
 
3:46 PM
you could have tried a bit harder with the tags ;)
4
 
oh, I totally forgot about tags
 
I can always try a bit harder with
 
I typed in "code-golf" and then realized I forgot to put the "this is code-golf" in my post
which I then totally forgot about the rest of the tags
I really like the set partitions tag
I had no idea that existed
 
at least we have tag master to help
 
are these the same challenge:
23
Q: Partial factorisations of a positive integer

Peter TaylorA collection of positive integers d_1 d_2 ... d_k is a factorisation of a positive integer n if d_1 * d_2 * ... * d_k = n Each positive integer has a unique prime factorisation, but in general they also have factorisations in which some of the terms are composite. E.g. 12 = 6 * 2 = 4 * 3 = 3 ...

25
Q: List all multiplicative partitions of n

orlpGiven a positive number n, output all distinct multiplicative partitions of n in any convenient format. A multiplicative partition of n is a set of integers, all greater than one, such that their product is n. For example, 20 has the following distinct multiplicative partitions: 2 * 2 * 5 2 * 1...

there's a "related" in the comments
so clearly they aren't
but I don't see the difference
actually...the related is like a month later, so there may not have even been a discussion about it
 
4:10 PM
I just cracked something on the Cops and Robbers Polyglot thread, but I have no clue why it worked 0.o
 
I'm apparently a hero in the office for writing a python script that reads a list of hosts, ssh's into each one, and runs commands from a txt file
 
4:27 PM
0
Q: Print your answer

ChristopherYou must write code to print out your answer. The answer must include the following: Your code, byte count, name of language and the formatting style of TIO (H1 header for bytecount/language name, and formatted code.) Rules Code-golf rules. You may add other items to answer not included here. ...

 
I am jinxed. I thought I have a new idea. Found no dupes and BAM. dupe
@EriktheOutgolfer can you help reopen my challenge? I changed it to bowling so the answers will be different.
Oh wait nvm. (you can still help XD) I thought for some reason that gold-badge can perma close until another gold opens XD
 
of course it can be reopened by vote...also asking people to reopen your challenge is somewhat like asking for upvotes...they will reopen it themselves if they see fit
also if you used the sandbox and no dupe was found there then you can use the titlebox and a "similar questions" thingy will pop up below and that's better than just searching
also I'm now more cautious with dupe close/reopen voting since I have hammer
and no now that this isn't I can't use gold powers anymore
 
hey how much of an achievement is it to out-golf cjam
 
what language?
 
CJam is one of the most verbose golfing languages
 
4:40 PM
@totallyhuman If you're using an ASCII-based lang it's pretty good
 
aw ;-;
 
@StepHen there's also pyth
 
@totallyhuman But if you're using another golfing lang that uses all 256 chars and all that, it's just that your lang does that better than CJam
 
ofc the cjam code looks quite funky
i have no idea how it works
 
well in ,,, it's quite an achievement imo
it was way fewer stuff than cjam afaict
 
4:42 PM
heh well I got 14 bytes with my ASCII-based lang, so ha
 
at the moment, it does have a very low amount of features
 
@EriktheOutgolfer I also have this problem now. Wonder if I could edit away the and then CV, if I'm not certain.
 
that's abuse imo
like, well, questions are not your sandbox
 
@EriktheOutgolfer Why is it abuse? I'm lessening my powers.
 
using questions as your sandboxes is still abuse though as I said above
 
4:46 PM
question: i'm planning on introducing the syntax ~n where n is a number which will push the item at the index n
 
and vice versa (editing the tag in) is one of the worst abuses you can do imo
 
should it pop the item or not?
 
@EriktheOutgolfer I don't understand what you mean by that. Who's using a question as a sandbox, and what does that even mean?
@EriktheOutgolfer Vice versa is of course terrible abuse. But that wasn't my question.
 
well, what do you mean? you wanna change the tags and then cv or something with a valid reason?
or just testing?
 
@EriktheOutgolfer Not testing. Since my CV is a hammer, I'd sometimes want to record my opinion without hammering. By removing the tag, I can CV without hammering.
 
4:49 PM
@EriktheOutgolfer Take off code-golf CV add it back
 
@StepHen Exactly.
 
0
Q: Scoring in non binary language

ChristopherHow would you score a language based off of having 3 voltages 0v 2.5v and 5v AKA not binary but ternary. So how would this be scored?

 
@Adám that's unfortunately doing lots more stuff than just cv...
 
@EriktheOutgolfer So?
 
@EriktheOutgolfer But it doesn't hammer :P
 
4:51 PM
first of all it bumps question to front page...not so important(?)
 
Goldtaggers should have a way to non-hammer CV.
 
there's also waiting until close (4) appears
 
Like a pop-up when CVing that asks "Do you want to hammer?".
 
@EriktheOutgolfer but what if there aren't any CVs, and you want to put it in the queue
 
it doesn't get in the queue like that afaik
 
4:52 PM
@totallyhuman anybody?
 
(ofc you could just meta it or ask chat or something)
 
@EriktheOutgolfer Not an option. I can't sit around like that. I have other things to do, but want to perform my civic duty now that I've noticed a bad post.
@StepHen Ask chat?
 
@Adám Whether or not you should hammer
 
@Adám again I haven't tried doing edit back and forth...
 
@StepHen Isn't that abuse? To let others tell me what to vote?
@EriktheOutgolfer I'd test it if there was a playground.
 
4:54 PM
me too
@Adám I agree
they should vote themselves if they have the privilege if not they should flag to close (that's how it gets in queue)
 
Actually, there should be a mechanism that detects Goldtaggers that add their gold tag and then CV-hammer. In such a case the CV should be an ordinary non-hammering CV.
 
I can now protect questions ÷)
 
> ÷)
 
@Mr.Xcoder Congrats, but I've never seen the need for that.
 
@Adám Well that's easy, just CV before you edit
 
4:57 PM
@Adám that abuse is when you contact mods heh.
but still.
 
@StepHen abuuuuuuuse!
 
@Adám I know, but I like it... I will soon be a "trusted user"
 
@StepHen Wat?
 
you're taking advantage of the fact the tag was already there even though it was mistakenly there
 
@Adám I took it the other way, a question that was a dupe, was code-golf, but wasn't tagged code-golf
 
4:59 PM
@Adám what thomas ward said...that's why we have mods ;)
 
@EriktheOutgolfer Why should mods be busy with things that a computer can easily detect?
 
what if you rightfully added the tag?
 

« first day (2349 days earlier)      last day (2497 days later) »