jrke: what a map
JakeCubes: UN OWEN, u wanna play with me?
Imsure1200q: why is code of rings abt optimization but there's useless rendering in the display
minhluan2292: anayone did complete https://www.codingame.com/ide/puzzle/light-bulbs?
Imsure1200q: still doing it lol
minhluan2292: you reply me Imsure1200q ?
abt8601: I completed it
jacek: github down?
Wangpy: I also completed light-bulbs puzzle, i think it is a variant of hanoi-tower problem
Imsure1200q: didnt notice that :(
minhluan2292: for 4 days, it not work :(
DomiKo: helo ;)
jacek: hows wybory? :F
DomiKo: in what sense?
DomiKo: for me? or in general
jacek: just chatting
no39mz: I want to sleep
jacek: congratulations, now youre expert on C++
Astrobytes: Go forth and make games.
Astrobytes: jacek, not the best result eh
Astrobytes: I see...
Astrobytes: Off you go then.
eulerscheZahl: hacking the NASA? did you mean NSA?
jacek: at least i rekt smits in oware
Astrobytes: Ah nice placement!
**Anonymous33 slaps Astrobytes around a bit with a large fishbot
Astrobytes: Your profile->Settings->Language
eulerscheZahl: or bottom of the start page
Astrobytes: Or fix your French.
eulerscheZahl: whatever is easier
eulerscheZahl: community puzzles only have an English statement btw
eulerscheZahl: if it says "by XYZ", then odds are good that it's English only
eulerscheZahl: for SDK contributions it's possible to have a bilingual statement. but most contributors me included don't care
eulerscheZahl: mon dieu
Astrobytes: hon hon baguette
Astrobytes: choucroute not sauerkraut!!!
Schwase: ive been trying to figure out BFS for the maze/pathfinding application, but im still a bit stuck, ive created a class named "Node" with a List field and a Node field and created methods to construct a path using open and closed lists, but i dont think im really getting the actual object "Node" part of this, should the list be the Node's neighbors? also, how is iterator used?
eulerscheZahl: A node has the neighbors as a list of nodes
eulerscheZahl: you start with a queue of nodes, initially only containing your target node
eulerscheZahl: when, as long as there are nodes in this queue: dequeue a node n
eulerscheZahl: for each neighbor of n, which you haven't visited before: visit it and put it in the queue
eulerscheZahl: and save the path, how you reached that node. can be a class member "from" for instance
Astrobytes: Don't forget to break when you reach the target (if you have one)
eulerscheZahl: oh, France has a public holiday tomorrow
eulerscheZahl: Bastille Day
Astrobytes: yeah Bastille DAy
eulerscheZahl: that explains why i saw close to no staff online today
eulerscheZahl: taking an extra day off
Astrobytes: Yeah, they'll probably go on strike or a protest on Wednesday just to make it 3 in a row :P
Astrobytes: It's the French way!
jacek: so its time to break cg server
Astrobytes: Someone upload an optim with loads of validators, where's Illedan when you need him
Masterpiece: Is there anyone who would like to do contest with me in code forces ?
DomiKo: wow finally
DomiKo: legend on hypersonic :D
Astrobytes: good job
DomiKo: now only 3:30H waiting....
jacek: hows uttt going
DomiKo: not good...
DomiKo: right now iam stuck with my performence
DomiKo: so today was a chill day
DomiKo: and i did hypersonic
DomiKo: but tommorow i will try again
**Anonymous33 slaps PexN around a bit with a large fishbot