« first day (2038 days earlier)      last day (2791 days later) » 

halp
in my JPanel: this.addKeyListener(this.manager);
in spritemanager:
@Override
    public void keyTyped(KeyEvent e) {
        System.out.println("A");
        this.sprites.stream().forEach((s) -> {
            s.on_keyboard(EventType.K_TYPE, e);
        });
    }
    @Override
    public void keyPressed(KeyEvent e) {
        System.out.println("A");
        this.sprites.stream().forEach((s) -> {
            s.on_keyboard(EventType.K_PRESS, e);
        });
    }
    @Override
    public void keyReleased(KeyEvent e) {
        System.out.println("A");
        this.sprites.stream().forEach((s) -> {
but no message is printed on the console/received by the sprites ;_;
 
@TùxCräftîñg add it to the encompassing frame
@LeakyNun is there a good way to create a noop command?
 
A reminder that my bounty on this question expires in 3 days and there are currently no valid answers except for my own. I've outlined a method for doing the problem in my answer, so hopefully someone can get a valid answer in before the bounty expires. (I'll probably post a couple more messages to this effect over the next couple days, if that's alright.)
 
@Liam I'll take a look if I get some time to do it. What is the issue with the current submissions?
 
@RohanJhunjhunwala My submission is valid. There is one other submission, in Mathematica, which is not golfed, and therefore not valid per site rules. However, since it is in Mathematica, I haven't been able to decide whether or not it violates any of the challenge specific rules (because I can't tell what the code is actually doing, nor can I even run it).
 
1:11 PM
@Liam so, if the Mathematica answer gets golfed would it be considered valid?
@Liam or is it valid only if the interpreter/compiler is free?
 
Can someone here give me an integer?
 
Perhaps. Without understanding it, I'd have to err on the side of validity. Something else I've been meaning to ask is for someone to check (1) that it works and (2) that it doesn't violate the number storing rules of the challenge
@ΛεγίωνΜάμμαλϠΨΠʹ 1828819
 
@Sp3000 @TùxCräftîñg I think you're looking for a bounding volume hierarchy
 
According to the current site rules it should be deleted until it is golfed, and then someone can check it after that
 
1:14 PM
Which answer? I know/own Mathematica
 
@trichoplax I know. It's been sitting there for months. I haven't flagged it for deletion (which I did for the other answer which basically just used arbitrary integers) because I respect that the problem was hard and I didn't want to actually golf my answer either.
@ΛεγίωνΜάμμαλϠΨΠʹ codegolf.stackexchange.com/a/72049/45459
 
@Liam The other option would be to change the scoring method, since it wouldn't invalidate any of the work done so far apart from your own. I don't have another scoring method in mind though
 
Yeah, I asked about that in chat awhile ago
The only other thing I could think of would be 'first valid answer'
a true code-challenge, but that doesn't really work either
 
3
Q: Where are Champernowne's zeroes?

Helka HombaConsider the infinite string of all nonnegative decimal integers concatenated together in order (akin to Champernowne's constant): 0123456789101112131415161718192021222324252627282930...979899100101102103... Write a program or function that takes in a nonnegative integer that indexes (0-based)...

 
Seems to use some Mma 10.3/11.0 features, so I can't test it, but it looks correct
 
1:16 PM
Is it storing values larger than 2^64-1?
 
I don't see a problem with a substantial problem being golf though. It just means fewer people will get around to answering, but once that work has been done, sufficient golfing to make the solution valid isn't a huge amount of extra work.
 
My "sufficient golfing" was to remove all the whitespace
 
I think removing unnecessary whitespace and making variable names single character would be enough to avoid downvotes and delete votes
I don't think that's unreasonable to expect
 
I spent like 8+ hours developing the method and writing the code. I really didn't feel like going through the thing and changing variable names, but I would if people get mad at it for being ungolfed
And the main point was just to prove that it was possible
so that other people could attempt it as well.
 
Perhaps it would work better broken down into a linked series of related challenges?
 
1:22 PM
How do you mean?
 
In principle you still have the option of doing that since the only answer which isn't your own can be flag deleted
 
The only problem is that then I would be precluding other methods for solving the problem?
I would be hand holding people through my solution
 
Depends where you split it I suppose - I'm not familiar with the problem as I've only seen it when you linked it today
Does it benefit from having all three operations combined in a single challenge?
 
So that kind of depends.
Performing the operations is easy enough in most cases
The only tricky part might be that with subtraction, you can end up using less residues than either of the inputs.
However that puts us back again at "how many residues do I use" which is the truly hard part of the problem.
 
Would that make a stand alone challenge?
Is it "find the smallest primorial larger than n"?
 
1:25 PM
Kind of.
 
I know sometimes having several parts to a golf gives the opportunity for saving bytes by sharing code between parts. I don't know which is best - separate challenges or a combined one. I'm just wondering
 
It is find the smallest i such that the product of the first i-1 primes is larger than x WITHOUT calculating that product and perhaps without even storing x as an integer. (no use of integers stored larger than 2^64-1)
I don't believe it would be well-received on its own because the restrictions wouldn't make that much sense out of context.
 
@Liam Without the without part it would make an interesting challenge in rings other than the integers.
 
Ah I see - the restrictions are only implicitly imposed because it would require arbitrary precision otherwise?
 
(0@@Join@@IntegerDigits@Range[9#])[[#]]<1&
 
1:29 PM
@LeakyNun added a NOOP command
 
The restrictions are explicit in my question because we are essentially developing another representation for arbitrary precision integers. It is cheating to use a prebuilt infinite precision integer class and then just convert to our representation.
 
@MartinEnder ^^^ What's the problem with the above code? ;)
 
// implies a comment now
 
@flawr you mean like over polynomial rings? I'm trying to think of how that would go (ring theory is several years behind me).
 
@Liam AAAAAA RINGS HIDE document.getElementById`input`.disabled=1
 
1:32 PM
@Liam Yes, for example. You'd need to define "greater" however.
 
Haha exactly. @flawr yeah that's what I was just thinking about. Is there a "usual" ordering on polynomials?
 
You can consider a polynomial (in X) as an integer in "base X"
But then it is just a matter of having an order in the base ring.
 
@ΛεγίωνΜάμμαλϠΨΠʹ ...did you have bad experiences playing Sonic or something?
 
The ring would have to be infinite?
 
@Liam Why?
What prevents you from considering polynomials over e.g. finite fields?
 
1:35 PM
I'm not sure, off the cuff, it seems that the ordering would go kaput.
Let's think about F[x], polynomials over a field (finite or infinite), then the primes are irreducible polynomials, right?
 
Right.
 
Assuming we have an ordering on F, then we have an ordering on F[x], order of the polynomial followed by comparison of coefficients?
 
Yep=)
 
@TùxCräftîñg patch for comment syntax uploaded
 
Oh duh. Now I think you're right.
I was thinking that you could get situations where f*f < f, f in F[x].
but the way the order of a polynomial would work, that wouldn't be possible.
 
1:38 PM
You probably could if the ring is not an integral domain.
 
@RohanJhunjhunwala a better thing would be to ignore comments
 
oh yeah, f*g = 0 or something
 
because noops slow down the VM
 
@TùxCräftîñg thats what I do
@TùxCräftîñg the issue is removing comments at compilation would bork the jump table
 
1:39 PM
F[x] is always an integral domain though, right?
Assuming F is a field.
 
Yes. (If R is an integral domain, so is R[X])
 
@RohanJhunjhunwala create a 2-pass compiler: first pass, remove comments; second pass, compile
 
I'll have to think about it, that is a question that I would definitely have to sandbox.
 
The One (Polynomial) Ring:
 
lol
The best color matching I've ever seen.
4
 
Anyways, I'm going to clean my house. Dueces
 
@TùxCräftîñg it doesn't really slow it down too much though. Since there is a switch statement. WHen the noop gets passed nothing gets run and th next go at the loop is run
 
i wurkd 20 hourz on dis
 
@RohanJhunjhunwala true
 
@TùxCräftîñg the only issue now is that if you have a variable named / it cant be used in divided
 
1:43 PM
ಠ_ಠ
 
@Adnan I don't recognize you.
 
@Liam You say you go cleaning your house as an excuse to leave TNB? You're wrong. It is the opposite way how things work here.
 
@TùxCräftîñg you have to use withespace to divide it
 
Well, your avatar.
 
Oh hahaha
 
1:43 PM
@TuxCrafting / / x
 
Multiple people have changed their avatar
 
How exactly?
 
@Adnan Nah, that is a disease spreading.
@zyabin101 profile > settings > avatar
 
@Adnan I like the one I have right now.
 
1:45 PM
okay
 
(PS:Look closer.)
 
HAHAHAHAHAHA
 
@flawr No, how exactly their avatar changed?
 
I didn't see that
 
flawr -> flowr -> flowy -> flowey
FLAWR IS FLOWEY CONFURMED
 
1:46 PM
@flawr Woah. Totally undetectable at small scales.
 
@El'endiaStarman How punny=)
@zyabin101 Ask adnan
 
@flawr ...I love it when a pun is unintentional. :P
 
@zyabin101 deepdreamgenerator.com
 
Great to see a modified avatar that is still easily recognisable when small
 
@Adnan Requires registration.
 
1:48 PM
@ΛεγίωνΜάμμαλϠΨΠʹ Who's that?
 
@zyabin101 Yeah, I just filled in some bogus account info
Something like adsuwqehu@jdqiwojdqw.com
 
@ΛεγίωνΜάμμαλϠΨΠʹ Should I really know that stuff?
 
I don't know Flowey either.
 
@flawr Well, you should have known it a few to several months ago
Back then the Undertale community was exploding
 
1:54 PM
Using dreamdeeply.com, and... Failure, photo is not usable. Please choose a different photo.
 
@zyabin101 on what photo?
 
On Unipants, which is a PNG photo.
 
Seems to work here.
 
Nope, it's the waiting picture.
 
 
1:57 PM
Thanks :3
7 hours ago, by zyabin101
First paste in the "Failures". Today: Code written well, but working bad just because.
 
 
I'm sure the problem could be solved. :3
(Note for solutions of this problem: codepad uses Digital Mars D Compiler v1.026 for D.)
 
@RohanJhunjhunwala ok
 
2:11 PM
aftrenoon
 
Easterly Irk, Helium Nuclei?! You deep dreamed, too ? Q_Q
17:11 heer.
 
17:11 heer too
 
@zyabin101 adnan forced me to
 
@ΛεγίωνΜάμμαλϠΨΠʹ don't know?
what do you need the 9 for?
 
.....holy crap...you can't see deleted messages in chat unless you're logged in.
 
@ΛεγίωνΜάμμαλϠΨΠʹ the 0@@ is really neat though :)
 
Well, there goes my hope of being able to count the number of deleted messages per user. :P
But again, the TNBDE is only meant to have the most public data, so I'll not pursue this further.
 
@MartinEnder that's what I meant ;)
My (abridged) thoughts: "Mathematica is one-indexed... but the challenge is zero-indexed... but then what happens if you try zero-indexing anyway?" and so I put the initial 0 in the Head
 
2:41 PM
yeah that's actually a reasonably common trick, but I hadn't seen using n@@ to prepend a value yet (just things like constant a[b,c][[i]] to select a, b or c conditionally based on i 0, 1 or 2)
 
2:52 PM
0
Q: Finding digits from 0 to 9

Amir KhasruSuppose we have a number N. Now we multiply the number by 1 2 3.....n until we get all digits. The upper bound of n is 10^6. But can we minimize the number of multiplication and can we early predict if it is possible to get all digits? Example: If N = 1 ( we get digits 1) 2*N = 2 (we get digi...

 
Stack overflows "NAA" flags are really dumb.
 
not if u repeat them a lot
naa naa naa naa naa naa naa naa
batman
 
question: how do you indent multiline ternaries?
(
    foo ?
    bar :
    baz
)
 
3:09 PM
@Downgoat if I see ternaries that are too long, I turned them into if statements
 
but.. but.. golf?
 
@Downgoat when you golf you don't indent
 
@Downgoat don't
{foo ? Bar : Baz}
 
3:22 PM
ugh spaces?
{foo?Bar:Baz}
 
@DJMcMayhem ;_; y u do dis
 
@Dennis Can you please pull MATL?
 
"Yes, after flags"
 
@Dennis and SILOS
 
"Yes to both."
 
3:37 PM
@DJMcMayhem Do you have any (main) challenges?
(not CMCs)
 
@LuisMendo Done.
 
@ConorO'Brien the thing where you do `arr[n] = foo` idk if I can do that :/ basically variables are stored as their value itself, but they have a property saying what scope they are in, and what their variable name is. Array items don't have "variable names", neither do they have a "scope" they are in. I could make a custom setter and set a `n` property on the item but if the array is mutated, this would result in weird behavior unless the reference is immediately destroyed, which interpreter can't do.
 
@Dennis Thank you!
 
@RohanJhunjhunwala Pulled and compiled. Let me know if there are any issues.
 
@Dennis looks good
 
3:42 PM
@Dennis thanks
 
@RohanJhunjhunwala Time to update your examples to remove the whitespace dependencies
 
@LeakyNun yeah, I still need to test it
 
@RohanJhunjhunwala I've tested some
 
@LeakyNun ok, thanks
@LeakyNun the primes example is a great example of the efficiency of the new compiler. It used to not finish within the minute TIO alloted. Now it runs in a second
 
:31961146 ?
 
3:44 PM
@RohanJhunjhunwala thanks
 
:)
@LeakyNun I messed with the whitespace on TIO different combos and the equals operator still has whitespace dependency
 
@RohanJhunjhunwala I tested it
it doesn't have whitespace dependency
 
oops, I forgot that case
 
@LeakyNun unfortunately Not right now. There's one I've been thinking about posting, but I know V will be very competitive once I add a feature, so I'm waiting on that one.
 
3:49 PM
@DJMcMayhem alright
 
@Downgoat I love your new avatar!
 
:D thx
 
Eighth paste in the "Hello, What's Your Name?" series.
 
@Downgoat u changed ur profile pic :O
 
@RohanJhunjhunwala new answer in silos
 
3:54 PM
question: can only professional cyclist participate in tour de france?
 
@LeakyNun link me?
 
i think
 
Today: Haskell! The most awesome functional programming language!
 
@Downgoat if your not professional you would probably lose
 
3:54 PM
0
A: Excessive Integers

Leaky NunS.I.L.O.S, 113 bytes readIO t=2 lbla e=0 GOTO b lblc i/t e+1 lblb m=i m%t n=1 n-m if n c d=e d/d e-d r+e A=i A-1 t+1 if A a printInt r Try it online! A port of my answer in C.

 
@RohanJhunjhunwala yes but i gotta answer true or false for french HW
 
I changed mine too but it's not apparent in the small icon
 
@RohanJhunjhunwala You might want to do this
 
3:56 PM
@LeakyNun I'm afraid of triggering serial upvoting
@LeakyNun I upvote all these SILOS answers
 
Does anyone know anything about serial upvoting algorithm?
@RohanJhunjhunwala You might want to do this:
11
Q: Visible Buildings

moo_we_all_doThis puzzle is derived from CodinGame SamSi's "Heart of the City" puzzle. Description You decide to take a walk in an n * n tile city and go to the center tile. All of the buildings are infinitely small, but you have super vision and can see everything close up and far away. Constraints n is ...

(and then I will out-golf you haha)
 
@LeakyNun let me take a look at it. I don't really understand the goal
 
@Downgoat I see. You could always do ruby'a method and have a getter and setter defined for []
 
CMC: write something complicated in S.I.L.O.S without spaghetti code.
 
@RohanJhunjhunwala tyvm
@ConorO'Brien >_> seems hard. I guess I could try
 
3:59 PM
@ReleasingHeliumNuclei chat mega challenge. But do take a look at the game.txt example
imho its readable and a reasonably interesting game
 
What's with everyone, people are switch to the Deep Dream side? crying
 
@LeakyNun you go for it. I don't want to go down a rabbit hole of SILOS programming. I have to still do summer reading
 
@RohanJhunjhunwala alright
 
ping me when your done I would love to see the output though @LeakyNun
And of course upvote it
 
@zyabin101 its like small caps, everyone is trying to be different in the same way
8
 
4:01 PM
Also, I have a problem with D on codepad.
 
@LeakyNun do you think you'll get a minute to patch that whitespace dependency?
 
Everyone is trying to be different in exactly the same way
 
@LeakyNun I don't want to bork the code.
 
@RohanJhunjhunwala i may
 
@LeakyNun ok, if you do get to it, than ping me, and I'll merge
 
4:03 PM
@RohanJhunjhunwala ok
 
question: what season is tour de france held?
 
@Downgoat not really. It may be easier once you have classes well-defined
@Downgoat are you cheating here and not on Google? :/
 
@ConorO'Brien i tri but nothign relevant shows up ;_;
 
@Downgoat Summer.
 
@zyabin101 thx
 
wat how do we provide reason for "Le Tour de France est une course cycliste?" i mean if it is a bycile race it just is .____.
 
@Downgoat parce qu'il est pour les cyclistes
 
._.
 
@Downgoat is this for school? :P
 
4:09 PM
question, does this sound right?: "il ont eu lieu en ete depuis le début"
@ConorO'Brien :| maybe
 
@Downgoat I'm just wondering :P which level of french are you in, if your school does that thing
 
@Downgoat Depends on what you're talking about
 
@Downgoat il ont -> ils ont
@Downgoat ete -> été
 
@Fatalize I'm trying to see "it has taken place in summer since it's debut"
maybe I should use possive its intead of le
 
what is "it"?
 
4:16 PM
@Fatalize Tour de France
 
Il s'est toujours déroulé en été depuis son début
depuis sa création might be better
 
@Fatalize "s'est" == "se est"?
 
yes
the verb is se dérouler
passé composé is s'est déroulé
 
Brb, playing Minecraft on XBox 360. :)
 
Il a toujours eu lieu en été depuis sa création is also possible, if you don't want to use se dérouler
 
4:21 PM
@Fatalize ah, ok, tyvm :)
 
@zyabin101 ಠ_ಠ
 
@zyabin101 ^
 
@RohanJhunjhunwala
0
A: Visible Buildings

Leaky NunS.I.L.O.S, 236 bytes GOTO s funcg if q p r=p return lblp t=p t%q p=q q=t GOSUB g return lbls readIO m=i m/2 a=i lbla a-1 a-m b=i lblb b-1 b-m p=a p| q=b q| GOSUB g r-1 A=r A| r/A r*-1 r+1 p=r r*r r*6 p*4 r+p r+32 printChar r b+m if b b printLine a+m if a a Try it online!

 
4:23 PM
near everyone in this room have a dreamed avatar ._.
 
New PPCG meme
 
@Doorknob @EᴀsᴛᴇʀʟʏIʀᴋWhat are your biggest complaints with dgamelaunch?
 
idk
haven't tried running it myself
 
I will be designing my Nethack to have a local broadcast/spectate feature via FIFOs so I figure I might also make a simple replacement for it
 
4:26 PM
fifo?
 
first in first out - a queue
 
i don't think that's what he means
 
Unix FIFOs
 
So qnethack --broadcast will create /usr/games/qnethack/quartata and qnethack --tv PATH will read game events from it
 
4:29 PM
qnethack?
very selfless name
 
I know, right?
I couldn't think of anything better at least for now
 
@Adnan WOAH!
 
@Downgoat this one is better
 
@Adnan i agree
@EᴀsᴛᴇʀʟʏIʀᴋ i also agree
 
@quartata plaintext passwords, maximum password length :P
 
Relevant xkcd:
 
@Doorknob I hate it when companies store plaintext but I really have to sign up
 
@EᴀsᴛᴇʀʟʏIʀᴋ ok
 
no stars for me :(
 
no
no stars ever again
 
we need deep dream generator challenge
but idk what our stance is on art contests atm
it keeps changing
 
4:50 PM
@LeakyNun I love this output silos.tryitonline.net/…
 
irrelevant xkcd
 
@RohanJhunjhunwala lol
 
:/ the keyboard input is not working correctly in my game and idk why
 
Out of curiosity
What programming languages are made in 2016?
 
4:56 PM
Neoscript
 
@TùxCräftîñg Thanks, adding it to my list
 
@Adnan cheddar technically
you can choose to include all of my crazy languages
 
Yes please
 
but you might not want to :P
 
<jk>PokemonGoCalculatiorian? :P
 
4:59 PM
Huh, was Cheddar born in 2016?
 
If you make the explanation a little clearer and sert code golf as winning criterion, I think this can be a nice challenge — Luis Mendo 42 secs ago
^^ don't you think?
 

« first day (2038 days earlier)      last day (2791 days later) »