Alex-1: mingtrau that too much you again say something about me
Lachrymosa: I have some questions about the Dwarfs Standing on the shoulders of Giants puzzle, specifically my thought-process. I want to know if what I'm thinking of doing is excessive computation or par
BigFatDecker: haha i cant even find any answers on stack overflow
BigFatDecker: i dont even know whats wrong i didnt even change any code from the download
VizGhar: Lachrymosa - ask
Alex-1: hii VizGhar
VizGhar: yello Alex-1
Alex-1: what was going
Lachrymosa: So the question is asking to give the greatest length of successive nodes. I was wondering if it makes sense to establish all the nodes and then just generate all chains and then take the longest? Like there's gotta be a pruning technique or something right?
VizGhar: hmm I'll have to se my solution
VizGhar: I've made complete graph and then I was looking for solution using recursion. So you wont need much optimization
BigFatDecker: ok so i went to JSON validater i get this error Error: Parse error on line 50252:
...0amplification": 50 mants ": 50254, " \
^
Expecting 'EOF', '}', ',', ']', got 'undefined' but have no idea how to fix it
VizGhar: there is maximum of 10.000 nodes based on Input description. It's not that much
Lachrymosa: So as long as I'm not doing stuff like for looping a bunch of times through all the data it should finish in time
VizGhar: Just don't do unnecessary stuff. I'm telling you, Im using recursion (root of all evil). So you can to
VizGhar: *too
VizGhar: (20 lines of code in kotlin)
Lachrymosa: I know I'll need it for this, at least to walk my nodes. Recursion and node based mapping has been troublesome for me in the past but I think I can tackle it
VizGhar: yup. I've made graph as
Map<Int, Set<Int>>
BigFatDecker: oh my gosh it was all because i had an extra comma
Lachrymosa: bet that caused quite the comma-otion
BigFatDecker: haha very funny lol
Lachrymosa: if I wanted to quickly access my nodes by their ID number without iterating over a list all the time, would it make sense to make a dictionary that has id as the key and the object as the data?
Smelty: .
Smelty: hi?
riseofninja: ./
riseofninja: \./
Lachrymosa: `/\`
VizGhar: Lachrymosa yes... Dictionary and Map are names for same thing I think
Lachrymosa: I'm close, i'm having an off-by-one kind of problem
Lachrymosa: its something in the way I'm counting in my recursion
VizGhar: so you are not running out of time :) thats nice
Veilics: /me
**Veilics slaps around a bit with a large fishbot
Veilics: (╯°□°）╯︵ ┻━┻
VizGhar: laputacr0sx learned something new
Notter: Why is it always satisfying to watch my algorithm do something?
VizGhar: because you made it and it works
Westicles: Because everyone is on the spectrum these days?
jacek: oO
Lachrymosa: can someone tell me how I'm messing up my count of nodes in my recursive function? I'm getting in the weeds
Lachrymosa: https://pastebin.com/W5xduwXj
davilla: I haven't worked this problem yet, but there's something that stands out about your code
davilla: you have a return statement inside of a for loop
davilla: is it intentional that it only ever see the first element of that list?
AriDeve: Hello people o/
VizGhar: Hello to latvia
AriDeve: :D
MINGTRAU: hi
ripcode: where the biddes at?
ANJACE_Z: bodies?
ANJACE_Z: in the basement
DeeAyDan: Good morning
Xeylo: is there something ruby programmers dont know how to solve within 1 minute?
AriDeve: I don't even know anymore :D
DeeAyDan: I'm a c# coder (beginner) and I'm stuck on Horse-racing Duals case 2
Alex-1: yeah DeeAyDan
Alex-1: you solve decent
DeeAyDan: what do you mean?
Alex-1: decent puzzle easy
DeeAyDan: you can see my code?
KiwiTae: horse racing is easy too
DeeAyDan: I got the first part down, but 2nd one not quite
KiwiTae: how do you do it right now?
DeeAyDan: sould I copy the code here?
KiwiTae: yes~ or mp me
DeeAyDan: http://chat.codingame.com/pastebin/2889abca-6c04-4038-a65b-815885a4b73b
DeeAyDan: Oh it sends alink, in that case I send the whole code
DeeAyDan: http://chat.codingame.com/pastebin/9cbf25c7-f77e-4068-a197-e75f45c6e5d9
jacek: you need to compare in all horses
jacek: it wont solve i.e. 2 5 10 6
jacek: or any unordered horses
jacek: firstly you need to read all the input to some array or list
DeeAyDan: so in my guess I need a new array to store the inputs and check from that
jacek: :tada:
DeeAyDan: :grin:
KiwiTae: jacek hint maeister :D
jacek: horse racing is kind of pony problem
DeeAyDan: I found what's the problem. I tried to find the difference between the 2 strongest horses, not the 2 closest in strengths. :sweat_smile:
DeeAyDan: And the first part worked becouse the 2 closest in strength were the 2 strongest ones.
jacek: how about 3. test case
KiwiTae: time out inc
DeeAyDan: I didn't reach it yet, I'm writing the code for case 2 atm
DeeAyDan: case 3 also works
jacek: oO
DeeAyDan: right after case 2
DeeAyDan: http://chat.codingame.com/pastebin/c4edc934-6cbc-4a88-a772-63cabea2ed13
DeeAyDan: here's my code if interested
Pick8chu: 이제 실버 될때 됬다!!!!!!!!!!!!!!!!!!!!
Pick8chu: 제발좀
KiwiTae: DeeAyDan gj
KiwiTae: you even changed how you named variables to smth clean hehe
MINGTRAU: alex-1
datvp1234: https://www.codingame.com/clashofcode/clash/1713704610928e63368e1dd90bbff8d31c6bcf3
DeeAyDan: :sweat_smile:
MINGTRAU: hey
M.Mahdi: hey
MINGTRAU: hey
MINGTRAU: hey
MINGTRAU: hey
T-MP: j co minh
datvp1234: puck
datvp1234: 'puck' you 'pitch'
MINGTRAU: fuuck you datvp1234
MINGTRAU: fuck you
MINGTRAU: you nói so tục tĩu
MINGTRAU: fuck you con lownk
booalgo: kick
OloMola3: hey
wallpaper1: hey
T-MP: hello
T-MP: i'm
T-MP: thinh
T-MP: i com from VietNam
T-MP: VietNam is Best
VizGhar: I wont be so sure assuming it's you on your profile photo
datvp1234: :laughing:
datvp1234: see my avatar
datvp1234: its my country
LOCVP1234: pent
Tadatadatadam: :grinning:
VizGhar: :)
Alex-1: hii all
Alex-1: nice
Alex-1: avatar
Animous: thx
CHXHCHVN: helo everyone
**Alex-1 say hi to CHXHCHVN
LOCVP1234: hello pent
LOCVP1234: fuck you beatch
LOCVP1234: bitch
LOCVP1234: fuck you
LOCVP1234: fuck
LOCVP1234: spent
VizGhar: ban
VizGhar: What a crazy day o.O
jacek: typical monday
struct: Ill just start banning
struct: no warnings
Yurchicnice: It`s spring fever
VizGhar: they don't need warning with such atitude
struct: I just wasnt in time for this guy
struct: He already fled
VizGhar: What is my purpose?
Pass the butter
struct: what do you mean VizGhar?
VizGhar: https://www.youtube.com/watch?v=X7HmltUWXgs
VizGhar: he passes butter, you ban in time :D
VizGhar: Anyway... let's get back to coding (Im sick, so i can)
I'm working on Mars Lander 3 + optimization... I want to make unique solution... I'm trying to precompute working solution before any optimization
Alex-1: when i open codingame i see guys are abusing the chat that not fair in clashes also
VizGhar: I'm closing chat windows in clashes immediately
LOCVP1234: fuck
Alex-1: what again
LOCVP1234: fuck all people
VizGhar: yeey he's back
Alex-1: stop it
VizGhar: hello LOCVP
VizGhar: how are you today?
LOCVP1234: hey alex
Alex-1: hi
Alex-1: but stop abusing all
LOCVP1234: fuck you
VizGhar: struct got him? :D
Alex-1: yeah
Alex-1: LOCVP are you okk today
struct: yes
Alex-1: hii struct
VizGhar: huray... we kept him busy
struct: hi
struct: thanks
Alex-1: hehe
Alex-1: :smile:
VizGhar: I want my reward
Alex-1: they don't give you XP Bro
Alex-1: :p
struct: hmm, they reward will come, you just need to wait
struct: Cant tell you yet
Alex-1: struct is clever
Alex-1: VizGhar
VizGhar: Alex-1 does it snow on christmas island sometimes?
Alex-1: no chance VizGhar
spring0nion: wow poggers XD
spring0nion: :eye:
spring0nion: peepee
spring0nion: ppp
spring0nion: pepe
Alex-1: what do you want to say spring0nion
spring0nion: hohoo...
spring0nion: you're approaching me?
VizGhar: o.O I though mondays only suck at work
VizGhar: im closing chat... not interested
**VizGhar disgusted
ANJACE_Z: #chat2
CWinter703: ello
Unnabhv: f
Alejandro127: hi
Alejandro127: hi
Alejandro127: that's speedy
HTierney703: vizghar is a wetty
ahhhhhhh12345: pp
HTierney703: ur mom
ahhhhhhh12345: no u
Alejandro127: lol
HTierney703: :joy:
ahhhhhhh12345: :0
CWinter703: me when among us :joy:
Alejandro127: XD
ahhhhhhh12345: amogusamogusamogus
HTierney703: if (henry==cool):
HTierney703: 1=1
CWinter703: if(imposta === "sus"){
return console.error("imposters among us")
}
struct: stop spamming
HTierney703: "StOp SpAmMiNg"
HTierney703: sorry
spring0nion: :scream_cat:
CWinter703: guys please stop spamming!
spring0nion: :/
spring0nion: for each in count: http://chat.codingame.com/pastebin/c0da41ed-f80c-4365-bfa6-ae8721eb3aea
ahhhhhhh12345: poggers
HTierney703: g
spring0nion: poggers pepe
spring0nion: poggers pepe
spring0nion: poggers pepe
Unnabhv: wow
HTierney703: rsg
HTierney703: oops sorry
HTierney703: does anyone need any help?
som2_the_dev: yes
som2_the_dev: i recently joined and some formats in which projects are laid are just confusing
ahhhhhhh12345: pp
HTierney703: yeah ikr
HTierney703: you can reformat them
HTierney703: or i would dm the creator
HTierney703: i cant really help with stuff like that, you need to dm the creator
som2_the_dev: oh you can dm creators?
Unnabhv: start
CWinter703: I love this website! So cool, love coding with friends!
CWinter703: Please don't spam guys!!!
HTierney703: no u dont
ANJACE_Z: :joy:
AndyTM: wassupß
MSmits: frenemies :)
MSmits: or fropponents
Astrobytes: oppends
MSmits: i dunno about that one
Astrobytes: enemends
MSmits: sounds like a hygiene product tome
Astrobytes: lol
MSmits: hey did nine mens morris never get approved?
Tadatadatadam: sorry i have question
MSmits: it's ok, i have them sometimes too
Illedan: What is nine mens morris?
MSmits: board game
MSmits: oldest one in existence I think? Or one of the
MSmits: it's solved
struct: it was pending for approval?
AndyTM: how are u?
MSmits: i think so, not sure
Tadatadatadam: http://chat.codingame.com/pastebin/58c20e29-b156-4313-9ddb-5ac9681f5b5f
MSmits: never heard of horse disorder
MSmits: might not be in that big book psychs use to diagnose
Tadatadatadam: puzzle have this 2 validators. ok
MSmits: link the puzzle
Tadatadatadam: https://www.codingame.com/ide/puzzle/horse-racing-duals
Astrobytes: 9-mens-morris.... oh, forgot about that
Wojciech_Krol: how do i make a pastebin of my code?
MSmits: Tadatadatadam what is your question about this puzzle
MSmits: Wojciech_Krol happens automatically
MSmits: with x lines
MSmits: i think 5 or 6
MSmits: only happens in world chat, not in PM
Tadatadatadam: i mark all vali but 5 and 6 not
MSmits: not sure what you mean Tadatadatadam
Tadatadatadam: I don't understand 5 and 6 validators
MSmits: well it doesnt really matter, just sort the horses by strength and calculate the smallest difference between two subsequent horses
MSmits: that should take care of it
Tadatadatadam: ok ty
Wojciech_Krol: pastebin happens automatically when i insert my code in chat?
MSmits: doesnt matter if it is code
MSmits: sometimes people come on here and try to spam a huge message and it becomes pastebin also
Wojciech_Krol: ok thanks
jacek: then how come your texts isnt pastebined :v
MSmits: I submit between messages
MSmits: thats why
MSmits: it doesnt
MSmits: get pastebinned
MSmits: it's a pro thing, you'll learn
Westicles: https://www.codingame.com/contribute/view/61732efac43e2d5a1ab19dcfe7b9afc3b4d0
ANJACE_Z: im having problem in power of thor puzzle. Can anyone help?
KiwiTae: yes
ANJACE_Z: should i share my code here
KiwiTae: sure
ANJACE_Z: http://chat.codingame.com/pastebin/d8b6f0f6-bc9e-4cbe-827c-8a686e5f8944
booalgo: single line ?
booalgo: ouput >
ANJACE_Z: yes we need single single output
Westicles: You need endl for all the couts
Alex-1: yeah
Tadatadatadam: or "\n"
KiwiTae: was gonna type it but im disconnected :/
KiwiTae: :grin:
booalgo: :D
ANJACE_Z: ty guyz
ANJACE_Z: how u know we need endl
ANJACE_Z: coz its written there that we need single line output
Tadatadatadam: cout<<"NW\n";
KiwiTae: one line per turn
Alex-1: Agree with KiwiTae
booalgo: u can make another program to add \n to your code :D
KiwiTae: makes me wanna work on my golf solution
KiwiTae: ah
Alex-1: hehe
AndyTM: 177018
struct: mcts with ept is just stopping early and eval right?
struct: or stopping before game ends
Astrobytes: yep
struct: its fine to prune moves with it right?
struct: on expanding and such
Astrobytes: I would think so
struct: thanks
Astrobytes: np
struct: ill try to finish amazons today
Astrobytes: experiment stopping at different depths btw
struct: I dont think darkhorse64 is around
Astrobytes: He will be later most probably, he's usually online
Marchete: I love when I solve a bug and suddenly the bot has worse winrate
Astrobytes: Standard CG experience no? :)
Marchete: yeah
Illedan: How is Oware going Marchete?
Marchete: as I said, fixed a bug on player 2 and suddenly is worse
Marchete: like wth?
Illedan: :D
Marchete: but is going as all my CG bot, as Astrobytes said
Marchete: one stupid bug over another
Illedan: I can hopefully start to train mine during this week
Marchete: and your NN? or it's on hold?
Illedan: Nah
Illedan: I just managed to use TF to train my Onboarding bot yesterday
Marchete: nice
Marchete: so you can export weights
Illedan: And it worked 99.996 % of the time :)
Illedan: Yeah
Marchete: noice
Illedan: Submited as my C# code in Onboarding if you wanna see :P
Marchete: lol
Marchete: you have some training code left
Illedan: Yeah, that part is not finished
Illedan: And I should throw it away
Marchete: not needed with TF, no?
Illedan: nono
Illedan: I'll remove it if I need more chars :)
Marchete: yes
Astrobytes: Also a little comment in Norwegian
Illedan: Shhh
Astrobytes: :grin:
Marchete: I'd like to convert my NN code in C#
Marchete: but not now
Marchete: until I have some working bot
Marchete: to test it with diff languages
Illedan: This onboarding code uses 1800 weights :D
struct: NN next contest?
Illedan: Yeah, I'm working on my NN arena atm
Astrobytes: Nice
struct: maybe it is NNable
Illedan: I'll force it to be :P
Astrobytes: lol
Illedan: Only problem might be fog of war
struct: I heard its going to be 3d
Illedan: ?
Astrobytes: :rofl:
Illedan: From where?
struct: im joking Illedan
struct: or am I
Astrobytes: btw, did you see on discord Julien is onboard with the idea of a time bank system in the SDK
Illedan: Like on RAIC right?
Astrobytes: I would presume something along those lines
Marchete: I'd rather prefer some kind of space for NN weights
struct: time bank would be nice in some games
struct: I think ive asked about it before
Astrobytes: Yep
Marchete: that won't do the AI creation inherently better
Marchete: I mean, it's ok, but if everyone have NNms each turn
Marchete: I'm ok with that
Illedan: How much can you package your weights Marchete?
Marchete: I imagine I can package around 120KB of code+weights
Marchete: I know others convert float32 to float16
Marchete: or even int discretization
Marchete: I don't thing I'll do it
Marchete: think*
Illedan: Hmm, not using the full 16 bit chars?
Phi999: hi
Marchete: anyways I'm still at training set generations
Marchete: float in 2 bytes, not 4
Marchete: I guess
Marcin_Najman: Ludzie tu nikogo nie ma
Astrobytes: Marcin_Najman: Actually, there are a few people here. Also, English in World channel please
Phi999: wht is this
Phi999: what
Astrobytes: A secret cabal of voodoo practitioners. Why?
Phi999: hi
Phi999: join here a: https://www.codingame.com/clashofcode/clash/1714131444d7c7d00593d7e8c5b46d032d0c044
Phi999: if you want
Astrobytes: no
Phi999: why
Astrobytes: Post that in #clash btw, then ask people to join
Phi999: sry
Phi999: where is 3CLASH
Astrobytes: click on this > #clash
Phi999: sorry, i am not on discord
VizGhar: have you tried to click it?
Astrobytes: It's not discord, you can just post your clash link in there
Phi999: i know
Astrobytes: There's some bots on discord that post links in there from streamers
VizGhar: I've spent whole day trying to do this:
https://ibb.co/njSQVrm
Hope it will help me find optimal solution earlier, then just applying GA on random generation
VizGhar: I don't like purely physics approach, I don't like purely computational approach... hope this is it
Astrobytes: which mars lander is that?
VizGhar: 3
VizGhar: running locally
Astrobytes: ah, yeah, it's an ...interesting... game
Astrobytes: Mildly infuriating at times :)
VizGhar: hmm new word :D Yes I hate it and love it at once
Astrobytes: Sounds about right!
VizGhar: I'm not 5%. I love puzzles and single player games... That's why I started this one
Astrobytes: All good, you don't have to justify your preferences to anyone ;)
Astrobytes: Will you try the contest VizGhar?
Marchete: are you trying to quantize Illedan?
Marchete: or reduce the 32 bits in any way?
NotSureWhyThisWorks: How do you run mars lander locally?
Astrobytes: Write a simulator and run your search algorithm offline
NotSureWhyThisWorks: so you have to recreate it yourself
Astrobytes: Add visualisation if it helps
Astrobytes: Sure
NotSureWhyThisWorks: Ok I wasn't sure if there was some other way I didn't know about
NotSureWhyThisWorks: thanks
Astrobytes: It's not as much work as it sounds, depending how much effort you put into it ofc
NotSureWhyThisWorks: yeah I assume if you are using some kind of simulation you can just reuse that code
Astrobytes: For sure, a basic framework to work from.
Uljahn: https://gym.openai.com/envs/LunarLander-v2/
VizGhar: Astrobytes I'll attend the constest for sure :)
GIPOKE: pf how am i supposed to detect misspelled words using a program without uploading a dictionary
Tadatadatadam: Automaton2000 we have array heights points and point who have coordinate
Automaton2000: used to have a few days ago
ChristianDowns: By uploading a dictionary lol
GIPOKE: !
ChristianDowns: You could send it to a dictionary api
GIPOKE: how
ChristianDowns: not sure if that can be done in this
ChristianDowns: what language
GIPOKE: javascript
Marchete: ok, my bugfix for player2 moves just added 2 new bugs
ChristianDowns: You'll probably have to do a post to a dictionary website
Westicles: Make a DAWG
ChristianDowns: I use AJAX
GIPOKE: and i have to detect missing periods too
Therabidpanther: hello
GIPOKE: each time i get 39 words and i need to find out how many misspelled words and missing periods there are by outputting numbers
struct: Just feed it to Automaton2000
Automaton2000: if u have to wait for the new inputs
Therabidpanther: hi Automaton2000
Automaton2000: maybe it's not a multi
GIPOKE: im just joining a diff one
Marchete: I'm pretty confident I have no idea where my code is broken
GIPOKE: matrix effect
GIPOKE: so i have to make a variable for every letter?
struct: GIPOKE what is this for?
GIPOKE: coc
Therabidpanther: oh coc
struct: clash of code wants to do all this?
struct: o.o
Astrobytes: which clash is the word one?
Therabidpanther: coc EXTREME
GIPOKE: 5 minutes left and no one even attempted it yet
GIPOKE: im doing the matrix binary code one
GIPOKE: and i made a variable for every single letter
Astrobytes: what was the previous one called
GIPOKE: it was some spelling one
GIPOKE: WHAT someone finished with 75%
Astrobytes: you remember the name or anything?
GIPOKE: lemme see
Astrobytes: Was it this one?
https://www.codingame.com/contribute/view/10408cfb32c9e06c94e5f5c9a4ca42d57018
GIPOKE: yes
Astrobytes: You know this is easy af right
GIPOKE: no of course not
Astrobytes: Output description
Two space separated numbers, first the number of misspelled words (words that differ from the problem statement), secondly the number of missing periods.
Astrobytes: Statement
I am not a good speller. Sometimes I mix up the spelling of words and sometimes I even forget to put periods. Please count the number of words I have misspelled and the number of periods I have missed.
GIPOKE: hmm wait a minute
GIPOKE: no not that im reading the comments on it
GIPOKE: there is one perfect sentence on here
GIPOKE: so i need to find how many words/periods differ from the perfect sentence
struct: yes
Astrobytes: Like I said, it's really easy
GIPOKE: i didnt notice there was a perfect sentence
struct: on reverse can be a bit confusing
Astrobytes: Compare the inputs to the problem statement
Therabidpanther: just split and compare? lol
Astrobytes: No reverse mode on this one struct
Therabidpanther: reverse would be very tough lol
Therabidpanther: attempting my first medium puzzle, wish me luck
Astrobytes: good luck
davidloley: good luck
Topazz: good luck
Tadatadatadam: gl
Therabidpanther: not going well
Topazz: rip
TheEpicElliottH: Lol
Therabidpanther: https://www.codingame.com/ide/puzzle/credit-card-verifier-luhns-algorithm
Therabidpanther: Other note, this may be the easiest thing on the site lol
Husoski: @Therabidpanther which puzzle? Some of them really belong in "hard" or "very hard"
Therabidpanther: https://www.codingame.com/training/medium/byte-pair-encoding
this one Husoski, I honestly think it belongs in medium
Husoski: Yep. That's a genuine medium. I used an iterative approach, making compression passes until no shortening happened
ashwin_h26: Hello
Therabidpanther: howdy
Husoski: printf("hello ashwin!\n")
Therabidpanther: C? yuck lol
Husoski: :)
Kitkat260: gm
Lathryx: Learning how to build AIs through the "Coders Strike Back" thing! Can anyone tell me how the `nextCheckpointDist` is calculated?
KiwiTae: distance(A,B) = |AB|
jacek: no need to calculate distance, it is provided to you
Smelty: :0
VizGhar: Or you can get to idk gold league? and compute it from advanced inputs
Smelty: pythagorean theorem bois
KiwiTae: if its the norm2 ah
Lathryx: Thanks! :slight_smile:
Lathryx: Is there a learning center somewhere that will teach me how to use the given inputs effectively?
Lathryx: Cause I feel like I'm missing something...
ZuhairAbid: anyone wants to play escape?
Smelty: well
Smelty: theres a partial guide for csb here:
https://tcourreges.github.io/coders-strike-back
Lathryx: Ah yes! Thank you! :D
Kitkat260: ?
Zihan7749: hi
Zihan7749: anyone here
Zihan7749: ?
Zihan7749: oh
MasterCoderxD: can someone do this for me in c++?
MasterCoderxD: http://chat.codingame.com/pastebin/69377d35-381d-49b9-aeca-ebdd97c83cf1
MasterCoderxD: u have 24 hrs time bye though gtg
Zihan7749: no
Zihan7749: I'm new
Zihan7749: here
Zihan7749: and my main laglig is pyson3
Static_Language_Programmer: i was asking everyone, it's a general post
Static_Language_Programmer: *he not i
Kitkat260: welcome
Zihan7749: what welcome
Zihan7749: ?
jacek: yes
Kitkat260: i am welcomeing u
Zihan7749: who
Kitkat260: u
Zihan7749: me?
Kitkat260: yes
Zihan7749: oh
Zihan7749: thanks
Kitkat260: welcome
Zihan7749: thanks
Westicles: Has CG been advertising on cereal boxes or something?
Kitkat260: no
Digginwings: yello
Kitkat260: hru
Smelty: see gee
VizGhar: Id probably write a bot to automatically hide messages shorter then 3 words. last 20 messages would be down
DefectusPolaris: Make it a browser plugin. People would love you for this.
TheSavages: how you guys train
every problem is hard and i have been coding for longer than most people
how can i become a better problem solver?
ZarthaxX: keep practicing :P
ZarthaxX: google algorithms, read solutions
struct: hi zarthaxx
ZarthaxX: hi structo :*
davilla: google specific algorithms, read good solutions
TheSavages: thanks for the tips
Boogle: sus
kassadin: where to find my clash history?
Boogle: :tv:
kassadin: i haven't finish it
struct: you need to wait for it to finish
struct: then it should show on the notificatiopns
kassadin: can i play it again?
DefectusPolaris: What is your favourite or recommended source of good solutions (website)?
ramezni: StackOverflow
Tadatadatadam: mathematics, physics, 2d, 3d. string methods, using hard structure data but not instant up
Abhinav_sl: hi
Kitkat260: hi
SIM7: hi
SIM7: i will sleep or i will die
luckoff: Hello
Boogle: :wink:
gndz07: heeellloooo
Boogle: :slight_smile::slight_smile:
King_Coda: lol
Saf1997: Could someone help me with one of the exercises please? I don't need a full solution, just a start. https://www.codingame.com/ide/puzzle/temperatures (scala)
VizGhar: well parse input and find the one, that is closest to 0 (absolute value)
VizGhar: Or better find the closest to 0, so that you can pick positive number if necessary
Saf1997: Is the abs() method necessary for the "finding number closest to zero" ?
Saf1997: Thanks @VizGhar
SaulTheBear: Can I view the instructions for a Clash of Code again after it's completed?
Saf1997: Clash of Code ?
SaulTheBear: codingame.com/multiplayer/clashofcode
Saf1997: Ahh okay - that's cool, I'm down. Not sure I will complete the exercise quickly tho.
Zenoscave: Astro you active rn?
Zenoscave: Saf1997 are you doing temperatures?
Kitkat260: probaly not
King_Coda: hello?
Boogle: (╯°□°）╯︵ ┻━┻
King_Coda: (╯°□°）╯︵ ┻━┻
King_Coda: wth
King_Coda: why are people following me
King_Coda: i'm literally not doing anything rn
Illedan: Anyone knows:
string.Split(',').Select(double.Parse).ToArray()
in python?
booalgo: what it do ?
booalgo: *does
Illedan: "0.123,1.52,-1.235" converted to numbers and added to an array
booalgo: s=input().split(',') i think something like this
Illedan: Yeah, that is fine. but the mapping syntax afterwards.
booalgo: oh
Marchete: https://stackoverflow.com/questions/3877209/how-to-convert-an-array-of-strings-to-an-array-of-floats-in-numpy
Marchete: if it's numpy
Marchete: x = np.fromstring( x, dtype=np.float, sep=',' )
booalgo: s="0.123,1.52,-1.235"
s=[float(x) for x in s.split(',')]
struct: map(float, "124432,12412.2352,234124".split(","))
Illedan: Thx booalgo. https://tech.io/snippet/ze2cBj4
worked :)
booalgo: :kissing_heart:
struct: I did a map smh
struct: I dont know py3 sorry
farenheit902: Hello, i'm new here. I'm learning c#.
struct: hi
farenheit902: hi
farenheit902: Happy to learn a new langage :)
gdvsM: siema
Boogle: learn english first
Boogle: :troll:
Zenoscave: Illedan map(float,var_with_nums.split(',')) would work too. map is slightly faster than list comprehensions (booalgo's version) but usually harder to read
Zenoscave: py3 has map struct
struct: So I was right
struct: :D
struct: I even optimize by mistake now
Santjl: my friends
Santjl: can someone make a code to transform from decimal to simplified fraction?
Zenoscave: is it for a clash?
Zenoscave: struct lol "optimize by mistake"
Santjl: was from the clash, but I didn't get it and I'm curious
Zenoscave: what lang you want
Santjl: js
pardouin: decimal -> number / power of 10
pardouin: and then you divide both parts by the gcd
AntiSquid: Automaton2000 set note to self: stop reading politics of any kind @_@
Automaton2000: is there a way to move
Santjl: the point is that the number of decimal places varies
Zenoscave: pardouin is on the right track. just round to precision beforehand if needed
pardouin: ex: 3.007 -> 3007 / 10^3
Santjl: i know this
pardouin: so what's the pb ?
Santjl: but and when the number comes 45467.859
Zenoscave: I think he's missing the gcd
pardouin: 45467859 / 10^3
Santjl: omg
AntiSquid: wtf
Santjl: I'm very dumb
AntiSquid: bbq
AntiSquid: cnn
AntiSquid: bbc
Zenoscave: anti what are you on about
AntiSquid: helping with the acronyms, sorry
pardouin: bbc ? D:
Zenoscave: pardouin wanna share your ruby power of thor with me :D
Santjl: :thinking:
AntiSquid: british broadcasting channel
AntiSquid: corporation *
pardouin: oh, I must have a perverted mind
Zenoscave: just a bit ;)
pardouin: <- ruby beginner
AntiSquid: why? what else does it mean? ok i'll google
pardouin: I spent lot of time reading the whole documentation tho
Zenoscave: ruby-beginner holds 1st place
Zenoscave: any hints for the golf?
pardouin: but I never code in ruby so I never use it in CoC for example
pardouin: caus I would run out of time ^^
Zenoscave: Yeah I'm focusing on the golf
Zenoscave: I use ruby a lot. but golf always escapes me
pardouin: it's basically perl with more features
pardouin: and more verbose for regex
struct: Sometimes is usefull to run bash there too
Zenoscave: true. are you just regex'ing?
Zenoscave: with the backticks struct?
pardouin: depends on the pb
pardouin: CN -> full regex
struct: yes
Smelty: yes
Zenoscave: yeah I sed most of CN
jacek: CN?
AntiSquid: BBC is also used for british born chinese btw
Zenoscave: chucknorris code golf
AntiSquid: CN :
https://imgur.com/a/xVXXcAU
pardouin: Comfortably Numb
pardouin: Clueless Newbie
pardouin: Certified Nurse
AntiSquid: Cute Nematodes
darkhorse64: Cute Nurse :heart_eyes:
Zenoscave: ok brock
Zenoscave: drakhorse64
AntiSquid: ok imagine this, when a patient gets discharged, the relatives gift something often, usually sweets, how cute will the nurses be after x amount of patients darkhorse64 ?
pardouin: https://image.shutterstock.com/image-photo/portrait-experienced-doctor-fat-woman-260nw-1393736579.jpg
pardouin: :x
darkhorse64: Sounds like a CoC
AntiSquid: she looks like she was once cute pardouin
AntiSquid: so it's probably a real nurse
pardouin: https://963kklz.com/wp-content/uploads/sites/69/2020/07/Blink182.jpg
pardouin: made me lol
VizGhar: Do anybody of you remember this game? might be nice optim after some adjustments
https://classicreload.com/pipe-mania.html
Smelty: hmmm
Smelty: true
AntiSquid: Astrobytes ? you there? or your cat at least ?
Astrobytes: Zenoscave: you pinged?
Zenoscave: yup hi
Zenoscave: I forgot why
Astrobytes: FFS :D
Zenoscave: ;)
jacek: :thinking:
AntiSquid: maybe zeno wanted to talk to your cat too
Illedan: From Oware:
If no such move is possible, the current player captures all seeds in his/her own territory, ending the game.
Illedan: How often does this occur?
AntiSquid: rarely but i've seen it happen at least once or twice
AntiSquid: and it's tricky too to do since you are not supposed to leave opponent without moves
Marchete: often enough
Marchete: oware rules are cancer
AntiSquid: yes
Illedan: Yeah, need to sim the whole move to validate it -.--
Marchete: no
Marchete: read the referee
Marchete: the thing is that you need to evaluate moves
Illedan: oh, nvm. That is just some math
Marchete: and then know if you are at endgame or not
Illedan: Where is the link?
Marchete: it's weird
Marchete: https://github.com/MaximeCheramy/cg-oware
Astrobytes: (it's from the forum thread)
Illedan: ty
jacek: i saw it quite often frankly
jacek: and that repo says WIP
struct: https://www.codingame.com/contribute/view/4453926ff1db8392a7c507e6e897e9d616f0
struct: you can download the source code
struct: im not sure if its different fom the github version
Astrobytes: I don't think it's different
Astrobytes: did you talk with darkhorse about amazons change struct?
Astrobytes: I saw he was on earlier
jacek: the darkhorse64 ?
Astrobytes: Are there others? :o
struct: is he still on?
Astrobytes: I think so
darkhorse64: Hii
jacek: lets invite him to clash
darkhorse64: noo
Astrobytes: lol "Hii"
darkhorse64: could not resist
struct: darkhorse64 is your github from clobber updated?
struct: I dont see where you change the moves
darkhorse64: It's up to date, except for the boss code
darkhorse64: Let me see
AntiSquid: :thinking: that hii triggered the ban hammer
struct: ok, Im afk for 5 mins
Tadatadatadam: laser on my eyes) bzzzzzz
karimk123: sup bois
karimk123: im spooderman
karimk123: say hi
Astrobytes: You're not. Get a grip.
Illedan: Hmm, sim doesn't check if my action cleans all enemy houses?
Illedan: (Oware)
karimk123: bruh
karimk123: what did u just say to spooderman>?
jacek: huh
Astrobytes: It does iirc
Illedan: Where? :P
Illedan: oh
Illedan: wait
AntiSquid: Automaton2000 kick spooderman's precious
Automaton2000: i wanna make a nn
Illedan: Thought we got valid moves as input here
jacek: Automaton2000 wheres AutomatonNN
Automaton2000: you have to take into account the fact that a lot of money
Illedan: Wierdly written code this thing
Astrobytes: Yeah, it's a little peculiar
Marchete: enjoy the rules
jacek: thats some code from cg staff
Marchete: I mean, it's the game rules
Marchete: not only how's coded
jacek: game is easy
AntiSquid: ok now tell him to skill up and that the bugs are his fault
struct: back
Astrobytes: wb
AntiSquid: welcome back
struct: tyty
AntiSquid: you broke the awkward silence @_@ good good
jacek: okaeri
jacek: or okairi? hmm
struct: I dont know what you are saying sorry
darkhorse64: struct: if I remember well, there are two tiny changes needed, one in Viewer.java (around line 50-60, look at xG,yG code), the other in Referee.java line 142
AntiSquid: dunno, what are you trying to say?
jacek: 'welcome home'
jacek: in weeb lang
Astrobytes: No one speaks weeb here
AntiSquid: Okaerinasai (お帰りなさい), or “okaeri” for short, is used to welcome someone else home, usually after they say “tadaima”.
struct: ty darkhorse64 ill check
AntiSquid: woah, again the non-weeb supremacists are trying to put us down, jacek
darkhorse64: try a diff with your amazons code
AntiSquid: we need to take to the streets
Astrobytes: :grin:
SimpleNick: gomenasai
SimpleNick: sensei
AntiSquid: finish that off with an UwU
struct: I dont need to change what I read from the player?
AntiSquid: how much japanese can you speak / read / write jacek ?
jacek: i just now random words/phrases from anime
jacek: know even
AntiSquid: only from anime? you need to step it up
AntiSquid: while you're still in the flower of youth
SimpleNick: wakarimakari japan)
darkhorse64: i don't think so but let me check once again
struct: I also changed how I send board
struct: to reverse it
struct: like you did
SimpleNick: if you go to schol language for jap it easy
AntiSquid: i went to London today (for some paperwork stuff, not disclosing) but with this occasion i also went to have some katsu pork sandwich, i know it's not 100% jap tradition, but it was good, i accidentally passed by that cafe (honestly)
darkhorse64: The trick is that moves are generated from squares names and the code look for the squares that match the inputs. Naming properly squares is all you need
SimpleNick: understanding ierogliphic system jap help understand img language
struct: ok I think it works
struct: At least I made Astroboss work
struct: by changing 1 line in output
struct: Thanks for the help darkhorse64
darkhorse64: You are subcontracting boss work :slight_smile:
Astrobytes: I offered :D
darkhorse64: My pleasure
AntiSquid: what's this boss work business all about?
struct: he made boss for amazons
struct: Im lazy
Astrobytes: *busy
darkhorse64: With a proper code base, implementing a board game is not a lot of work. Designing a boss is more difficult
AntiSquid: *planning to build back better
struct: maybe simplify it and replace the tiles with two colors:
⚫ BLACK - disabled
⚪ WHITE - available
struct: What does this mean?
Astrobytes: darkhorse64: mines just a hacked together highly disabled alphabeta mess
Astrobytes: Just to beat/draw with random
darkhorse64: You mean you got inspired with my code ? :slight_smile:
AntiSquid: nine men morris gone from contribs, wonder what happened
Astrobytes: lol
struct: AntiSquid I heard its going to be the next contest, thats why it got removed
Astrobytes: Mine does deepen iteratively though iirc :D
jacek: and whats the eval
AntiSquid: :/ struct
jacek: so i could beat it
AntiSquid: quite sure that would be a lame contest
Astrobytes: You'll beat it jacek
AntiSquid: 100% sure it's solvable or solved
struct: its solved yes
darkhorse64: nine men morris is solved I think
jacek: but try to solve it in 50ms
Astrobytes: Yes, not sure if so under cg constraints? There are other morris versions too
AntiSquid: hard code it .
struct: Maybe next contest is chess with all the hype around it
darkhorse64: jacek does not need an eval, only n-tuple patterns
AntiSquid: it's some gardening flower puff nature hippy stuff for sure
Astrobytes: :D
Marchete: and I add more bugs each time
Marchete: damn
AntiSquid: or maybe it really is "Made in Abyss" inspired
Astrobytes: Marchete: just don't lose your last best good version ;)
Marchete: it's too late
Astrobytes: Ahhh dude
Marchete: nah, it must be on submits
darkhorse64: now, it's don't lose your last brain
karimk123: what do you guys think of my spotify clone website? https://vibify.fepzz.repl.co
karimk123: just tryna get some feedback
AntiSquid: i think it's too risky to not ban you :thinking:
karimk123: noooooooooooo
karimk123: can i delete the message
karimk123: ?
struct: Automaton2000 can
Automaton2000: looks like a very hard puzzle and you get a list of things to learn
Astrobytes: spoderman, spoderman, does whatever spoderman does
struct: ok now i need to fix statement and is done
struct: Im not going to touch this again
Aniboy: Hi
karimk123: hi
struct: hi
Aniboy: new to codinGame
jacek: what about the demo
AntiSquid: hi new to codinGame
struct: you are right jacek
struct: as always
Astrobytes: sometimes he's left
Aniboy: I was trying my hands-on Defibrillators puzzle, were can I review my code or ask for help
Aniboy: I am near to solution
jacek: you can try the forum, chat here, or discord's general
Astrobytes: Check the forum thread Aniboy? Forum link on left of the IDE
Aniboy: thanks guys I'll try forum first :)
struct: Should i move it to ready?
Astrobytes: Outline any changes in a comment
darkhorse64: Maybe you should wait for the contest end for that.
Astrobytes: Not gonna affect the user uptake tbh
struct: I need all the advantage I can get
Astrobytes: lol
struct: I thought I changed how board is sent
Astrobytes: but...
struct: On clobber board is read from top to bottom
struct: or bottom to top?
struct: top being 8
struct: ok is top to bottom
struct: ill change statement only
struct: .......
darkhorse64: top to bottom, the idea is that if you print row after row, you see the board state
IronPostItNote_6196: oh ok thank
struct: Done, I had to make source private due to boss code
struct: Also I changed board to 16x16 so it fits on m256 register
Astrobytes: lol
darkhorse64: how many moves at start ?
struct: I can check it
Astrobytes: Can't even download my own boss :P ;)
struct: ((char) (8 - getY(idx)) + '0');
struct: This is what I changed astro
IronPostItNote_6196: ahaha:laughing:
Astrobytes: Was just kinnding ;)
Astrobytes: *kidding
IronPostItNote_6196: i know
IronPostItNote_6196: :wink:
struct: 8666 moves 1st turn
struct: https://i.imgur.com/zmxahIZ.png
IronPostItNote_6196: wow:grinning:
IronPostItNote_6196: ahah
darkhorse64: The msg keyword is not needed
IronPostItNote_6196: oh
IronPostItNote_6196: okay
Astrobytes: Yeah, I did find that a little odd
IronPostItNote_6196: soo:blushed:
struct: I think I always do that
Astrobytes: IronPostItNote_6196: are you unwell in some way?
struct: I think othello also has it
IronPostItNote_6196: do you guys hear me ?
Astrobytes: can't remember tbh
struct: Is to make sure people read the statement
Astrobytes: Heh heh heh
Astrobytes: Good strategy I guess
IronPostItNote_6196: hehe what
darkhorse64: 8666 moves; it's not a tree search, it's a needle in a haystack
struct: and that is just with 4 units
struct: per player
Astrobytes: thanks AntiSquid
AntiSquid: for what?
struct: Thanks again for the help darkhorse 64
AntiSquid: i was answering his question
struct: and astro for the boss code
darkhorse64: :stuck_out_tongue_winking_eye:
Astrobytes: np
jacek: numpy?
Astrobytes: no pony
King_Coda: Hello Astrobytes
King_Coda: hello jacek
jacek: ohai
King_Coda: ohayoo gozaimasu
huf6fytf6tvgy: what
King_Coda: lol imagine not knowing japanese
King_Coda: ばか
Astrobytes: Ban next time you misbehave IronPostItNote_6196
King_Coda: Ah, hello Astrobytes
King_Coda: Having a great day moderating I see
Astrobytes: hii
King_Coda: Always with the troublemakers it seems
King_Coda: you can never catch a break
Astrobytes: No. They are around all day/night. I am not.
King_Coda: Of course, you are only human
Astrobytes: Bring it on.
King_Coda: i like that attitude
King_Coda: I love how easy this website makes it to get a job
Astrobytes: ...
Astrobytes: Now I can bask in the brief glory of succeeding in the Amazons leaderboard until everyone submits working bots
Smelty: hi
Butanium: rip volcanoes has no approvals
Smelty: f
Astrobytes: Is it due up today?
Smelty: yep
Butanium: just tried it it's actually more fun than what I thought
Butanium: and I did it on python so my program is very slow
Astrobytes: It's a cool game, just there's lots to get through and we try to test thoroughly
Butanium: I want to do something in ocaml to be more optimized
Smelty: hmm
Butanium: what do you mean ? just there's lots to get through
struct: ocaml to optimize?
Butanium: *mean by
Smelty: I do suppose that they can skot can always resubmit it
Butanium: yes python is so slooow
Smelty: breh grammar
struct: There are better choices than ocaml though
struct: or do you already know ocaml?
Butanium: I do
Smelty: butanium: https://www.codingame.com/share-replay/543312664
struct: ah
Butanium: I learn it at school
Astrobytes: France is big on FP huh
Butanium: wait smelty
Butanium: why didn't I win at turn 22?
Butanium: I have both 18
Smelty: idk lol
Butanium: oh ok
Butanium: we have to wait the 6 turns
Smelty: mwahaah https://snipboard.io/Uv6Mh9.jpg
Butanium: like the game is 6 turn for a turn
Butanium: oh no
Butanium: nevermind
Butanium: I'm wrong
jacek: hm
Butanium: N18 and N05 are not linked
Butanium: Smelty: which league is that?
Smelty: 3 xD
Butanium: do you beat the boss?
Smelty: no
Butanium: lol
Smelty: but the boss aint displayed
Smelty: xD
Butanium: also I saw you submitted something on clash of bots
Butanium: but that was the basic stub x)
Smelty: x)
Smelty: which game?
Smelty: sry
Butanium: Lol
WesCraterMadman: Is there a way to see the error feed when you submit a puzzle solution? My program is failing on the validator and I can't figure out why
Butanium: https://www.codingame.com/contribute/view/6587dcc2e3a07bd4696c16a3e63238b4a184
Butanium: this one
Astrobytes: WesCraterMadman: No, but there should be a similar testcase if it's a well-formed puzzle
WesCraterMadman: I pass the similar test case and can't find any errors in the variables
Butanium: which puzzle?
WesCraterMadman: Skynet Revolution 2
Butanium: idk it sorry
WesCraterMadman: My program solves all tests and gets like 83%
Astrobytes: Perhaps efficiency?
WesCraterMadman: No it isn't timing out. It's making the wrong choice
Smelty: hmm
WesCraterMadman: Unless the visual is lying to me
darkhorse64: Astrobytes: your boss is tough judging by the lb
Astrobytes: Nonsense darkhorse64, no one has updated their code
Smelty: butanium supremacy lol https://snipboard.io/DOzbvM.jpg
struct: yeah, people need to change 8 by 1 on their code
struct: only that should be needed
Smelty: kool
Astrobytes: That's all yep
Butanium: lol which game Smelty?
Astrobytes: You didn't make a bot yet darkhorse64? Or you're saving it for the release? :smiling_imp:
Smelty: Butanium it was clash of bots
Smelty: xD
Butanium: lol
Smelty: i submitted a non-functioning code on accident-
WesCraterMadman: son of a businessman
WesCraterMadman: I figured it out
darkhorse64: My usual MCTS code will not make it
Astrobytes: well done WesCraterMadman
WesCraterMadman: lol thanks
Butanium: lol ok smelty
WesCraterMadman: I'd feel better about it if it weren't such a dumb issue
Butanium: I'll go to sleep
Smelty: g n
WesCraterMadman: gn
Smelty: even though its afternoon for me
Butanium: lol thanks
Astrobytes: WesCraterMadman: We are ALL prone to such things at times
Astrobytes: Really darkhorse64?
darkhorse64: I expand all nodes at a time
Astrobytes: Try pruning the moves
Smelty: byte pair encoding..
darkhorse64: I can try but I fear I will play poorly at the beginning. Yep, pruning for the win but it requires more effort than just bitboarding an engine
Astrobytes: Boss doesn't bitboard
Astrobytes: Just forward prunes savagely, uses half the time on turns > 1 and has a crap eval :P
struct: Even on first turn is quite a large ammount of moves
Astrobytes: from the boss or the game?
struct: The game
struct: for mcts
struct: if you dont prune
Astrobytes: Yes. The movecount is ridiculous for some games
Astrobytes: *some starting positions
Astrobytes: Very cool
struct: I cant be sure that the random positions are balanced
struct: but at least both players get it
Astrobytes: It seems to work well
Astrobytes: Anyway, I'm tired as hell. I'll see you all tomorrow
Astrobytes: gn all
struct: gn
SimpleNick: a small question can anyone come across, I want to have a memory profiler, where to start this topic
zarkos: how do i report a cheater in code battle
orangesnowfox: Why do you think whoever it is is cheating?
zarkos: bro his code almost look like binary lol
orangesnowfox: lol?
SimpleNick: binary tree search)
Salted: Cheating on here? Ha! Well did you know the character counter only counts ascii and not unicode. So the script limit doesn't exist if you know that.
Salted: So you can make insanely large neural networks and win competitions that way. Not that it's cheating....
Smelty: :( I haven't gotten a good code for byte pair encoding
Notter: How do I still get timeouts in puzzles without time limits?
Smelty: idk
Smelty: process timed out?
Smelty: p.s. how do I indent an entire section of code
SimpleNick: opencv maybe
SimpleNick: i dont know 100%
Smelty: o
struct: puzzles have time limit
Smelty: http://chat.codingame.com/pastebin/3bef0a18-957d-4c73-8f81-11e9c5900069
Smelty: send help java
Smelty: also i just realized the value of best1 doesnt get updated, but idk why
SimpleNick: it simple algorihm sub string
Smelty: e
SimpleNick: cycle (){
2 array : 1[alphabet] 2[searching string]
}
Smelty: also i think i got it
Smelty: w-
Smelty: *visible confusion*
SimpleNick: pick 1 element array and equal he in string and pick if search ++
Smelty: true
SimpleNick: and 3 array for frequency
Smelty: also i fixed it, i was comparing two strings with ==, not equals()
SimpleNick: but i dont know this alghoritm a pro level i know simple
Smelty: well. next step, convert each symbol of that type into different symbol and save it
Smelty: *sighs*
SimpleNick: may be ye i see - 3 array and end of program simple out 3 array for paste diagram or numbers
Smelty: got the code working for 1, but fails at multiple....
Smelty: debug mode: *on*
SimpleNick: nice start
WesCraterMadman: yo
WesCraterMadman: does anyone know a good starting point to learn about simulation?
Smelty: hmm
WesCraterMadman: If it affects your answer, I'm currently working on cvz
Smelty: https://www.codingame.com/playgrounds/1939/basic-simulation-and-evaluation/welcome
Smelty: idk
WesCraterMadman: ooh thanks
Smelty: i just searched up "simulation" in the hotbar for codingame XD
WesCraterMadman: lol
Smelty: whats wrong with my byte pair encoding ai? https://snipboard.io/AEPKWd.jpg
Smelty: that is the string at each stage
WesCraterMadman: what are you working on?
Smelty: https://www.codingame.com/ide/puzzle/byte-pair-encoding
Smelty: weekly puzzle...
Smelty: it works for test 1 currently
PatrickMcGinnisII: u doing PY Smelty?
Smelty: java
SimpleNick: o mcts idont know ty
Smelty: um weekly puzzle
PatrickMcGinnisII: I just looked at my php code, pretty easy really
Smelty: :(
Smelty: sad face
PatrickMcGinnisII: are you replacing the highest frequency pairs with capital letters?
SimpleNick: wwow ty realy you open my mind
Bomaycatdaumoi: alo
Smelty: yes i did
Smelty: hmm
PatrickMcGinnisII: you just keep doing that from Z to A until the frequency of a pair is only 1
Smelty: i konw
Smelty: i was doing that
Smelty: but it fails
Smelty: TwT
SimpleNick: https://www.codingame.com/playgrounds/1939/basic-simulation-and-evaluation/vectors
SimpleNick: it new chapter in my life
PatrickMcGinnisII: Smelty i guess it depeends on if you are using Collections or not
SimpleNick: i try this algorithm in realy simple works
PatrickMcGinnisII: from collections import defaultdict
Smelty: hm
Smelty: here is my code: https://pastebin.com/V33NnKxc
Smelty: mind if you look over it?
PatrickMcGinnisII: ops sry that was from PY solution
SimpleNick: i see you code i read
Smelty: e
Smelty: well i have to go in a second, so maybe late
Smelty: perhaps message me with suggestions?
PatrickMcGinnisII: you are doubling the work
PatrickMcGinnisII: try k=j+1, then run it
PatrickMcGinnisII: for (int k=j+1;k<m;k++)
PatrickMcGinnisII: ok, whatever
SimpleNick: hm
SimpleNick: we find 1 best
SimpleNick: i think all string all chars on string
SimpleNick: aaabbbccc 3a3b3c
SimpleNick: mcts information on the night
SimpleNick: wow
SimpleNick: it algorithm
SimpleNick: in my high school taught, I even remember with what passion the teacher taught him even though 10 years have passed
PatrickMcGinnisII: I taught my teacher pascal in HS, all they knew was BASIC'
SimpleNick: :grinning:
PatrickMcGinnisII: Back then you had to be careful not to overwrite the BIOS or DOS while doing DMA transfers for graphics and hooking interupt vectors
PatrickMcGinnisII: yall got it easy
SimpleNick: i have book) from 2002 intro to c#)
SimpleNick: :slight_smile:
Monsiur_Minh: and???
SimpleNick: and i remember use it 1 check
Monsiur_Minh: :thumbsup:
SimpleNick: and turn new semestr and starting C++
PatrickMcGinnisII: rofl, I have a C book from the 80s...smh
SimpleNick: yes old book it member
SimpleNick: ]portal
CHXHCHVN: i am finding my GF
nickname--: :flag_vn:
nickname--: i know english
nickname--: very good
CHXHCHVN: Has anyone seen her
CHXHCHVN: Has anyone seen her
nickname--: No
nickname--: I don't know
King_Coda: Dinosaur office
King_Coda: raaaar
davilla: do not all of the past contests become bot programming challenges?
davilla: maybe it just takes time
davilla: missing Spring 2020 and Unleash the Geek
davilla: from the end of 2019
davilla: take that back, just missing the latter
davilla: I guess Unleash didn't turn out to be a very good contest
Alex-1: hi world
booalgo: hui
BigFatDecker: haha i cant even find any answers on stack overflow
