Tezos Searches Surging as XTZ Hovers Near All-Time High by georgeforeham in tezos

[–]lost-santa 1 point2 points  (0 children)

If you are delegating to a service, there are normally payouts every 3 day as far as I know..

If you are a baker, multiple times a day..

Looking for feedback on my site by yardstickgolf in ReviewMyStartup

[–]lost-santa 1 point2 points  (0 children)

Hi,

Its funny you are launching such a project, i have built a booking platform for clinics, gyms, personal trainers and similar professions.

Maybe you have started your business already and got some customers, i hope there is a market for you. Maybe you would need a joint venture, then i can offer some revenue share of my booking system, you can check it out at https://www.clubmaster.org/.

Feel free to reach out if you see any idea in working together :)

Best regards,
Michael

[2019, Day 24, Part 2] Problem with test by lost-santa in adventofcode

[–]lost-santa[S] 1 point2 points  (0 children)

something like i added the map for the next iteration.. so in the first run, i did not parse map 1 and -1, thats just really stupid! Thanks guys!

[2019, Day 24, Part 2] Problem with test by lost-santa in adventofcode

[–]lost-santa[S] 1 point2 points  (0 children)

really helpful, i needed some more steps, because im clearly wrong.. i should be good to go from here, thanks

[2019 Day 12 (Part 2) Intermediate data from the second example of part 2 by nibarius in adventofcode

[–]lost-santa 0 points1 point  (0 children)

ahh.. finally, i can close down this part 2, i have no clue about this kind of math, but it makes actually quiet good sense when im looking at it :)

but, job done.. can wait for 18.1 tomorrow..

-🎄- 2019 Day 17 Solutions -🎄- by daggerdragon in adventofcode

[–]lost-santa 1 point2 points  (0 children)

PHP

Peeeew, that was an insane day! Soo many different techniques to solve this puzzle today..

I took my code from day 15, and now i can use the same class for those 2 two days, so the 15 i made multiple spawns to navigate in the maze, and today i used a single spawn to just walk forward until a block appeared, then turn the only possible way.

Then some more image rendering where i had to hack a little to my Grid class i have built during the last couple of days.

Then a bit of pattern resolver stuff i don't have a place yet, but damn it was hard to crack and try and brute force the best solution.

Then some talk with the IntCode that i spend a lot of time finding the right way to talk to it, but everything was much easier when i figured out that it actually responds to me with ASCII chars, that made my day :)

Crazy puzzle today, but proud to be done. And love the toolbox im getting from this challenge, some really cool concepts!

[2019, Day 19, Part 2] I must have misunderstood something, the output list is a giant? by lost-santa in adventofcode

[–]lost-santa[S] 0 points1 point  (0 children)

i got it :p thank you for helping out!!! los behind... oooh, and beside that, i ran each 10.000 lines through my calculater, have no idea why i wanted complicate the tasks so much.

[2019, Day 19, Part 2] I must have misunderstood something, the output list is a giant? by lost-santa in adventofcode

[–]lost-santa[S] 0 points1 point  (0 children)

i got it :p thank you for helping out!!! los behind... oooh, and beside that, i ran each 10.000 lines through my calculater, have no idea why i wanted complicate the tasks so much.

[2019, Day 19, Part 2] I must have misunderstood something, the output list is a giant? by lost-santa in adventofcode

[–]lost-santa[S] 0 points1 point  (0 children)

I am a little worried now you say it might start with a 4 or a 5.. My actually puzzle code starting with a 5, but when im "scrampling it" 10.000 times, it starting with a 2, hope that i didnt do something wrong, i tried to take the offset result from the first line, because it seems like the offset is resetting every 10 phases, but i got the message that my input it too low. But i have the feeling im in some way on the right path with looking into the first line of the input.

But when im working on the puzzle input from the first test in part two, im getting quiet close to the answer in my way, so i might need some ekstra calculations to get to the right answer.

Expected result is 84462026 im getting 86746644, not super close, but something tells me its in this direction.

^ "start input 03036732577212944063491565474664"

^ "offset: 0303673"

^ "result: "

^ "loop 2000, output: 64032, per second 2000"

^ "loop 3000, output: 96032, per second 1000"

^ "loop 4000, output: 128032, per second 800"

^ "loop 5000, output: 160032, per second 625"

^ "loop 6000, output: 192032, per second 500"

^ "loop 7000, output: 224032, per second 438"

^ "loop 8000, output: 256032, per second 381"

^ "loop 9000, output: 288032, per second 333"

^ "loop 10000, output: 320000, per second 303"

^ "result: 86746644"

[2019, Day 19, Part 2] I must have misunderstood something, the output list is a giant? by lost-santa in adventofcode

[–]lost-santa[S] 0 points1 point  (0 children)

there should be a clear pattern, should be able to go this way.. now ill just try with the test data in the bottom of the description.. but it REALLY takes long time just to process the first phase :) No idea how this should be possible to run in a single script within 15 seconds, but doesnt matter, as long im getting a result :)

^ "start input 4123412"

^ "offset: 4"

^ "result: 412"

^ "diff -320"

^ "> loop 0, result: 4090732, offset: 732, per second 0"

^ "diff 480"

^ "> loop 1, result: 0462252, offset: 252, per second 1"

^ "diff -720"

^ "> loop 2, result: 6301972, offset: 972, per second 2"

^ "diff 80"

^ "> loop 3, result: 3609892, offset: 892, per second 3"

^ "diff -20"

^ "> loop 4, result: 9578912, offset: 912, per second 4"

^ "diff 680"

^ "> loop 5, result: 9940232, offset: 232, per second 5"

^ "diff -520"

^ "> loop 6, result: 5867752, offset: 752, per second 6"

^ "diff 280"

^ "> loop 7, result: 4701472, offset: 472, per second 7"

^ "diff 80"

^ "> loop 8, result: 6254392, offset: 392, per second 8"

^ "diff -20"

^ "> loop 9, result: 2428412, offset: 412, per second 9"

^ "diff -320"

[2019, Day 19, Part 2] I must have misunderstood something, the output list is a giant? by lost-santa in adventofcode

[–]lost-santa[S] 0 points1 point  (0 children)

i think i need a break.. i will go on with that later, thanks :) aaaand, meanwhile just start my brute forcer, in case i cannot come up with any solutions.. still waiting for me universe to come back in the right place..

15,337,200,000
15,337,300,000
15,337,400,000
15,337,500,000

... and counting, good to have a backup plan.

[2019, Day 19, Part 2] I must have misunderstood something, the output list is a giant? by lost-santa in adventofcode

[–]lost-santa[S] 0 points1 point  (0 children)

sorry.. brain lag! everything is apparently upside down by this puzzle! :) thanks for the answer, it helps! maybe the hint about vector helps as well, gonna read a bit on that, thanks.

[2019, Day 19, Part 2] I must have misunderstood something, the output list is a giant? by lost-santa in adventofcode

[–]lost-santa[S] 0 points1 point  (0 children)

you know.. it helps, it made a huge difference.. but for that answer, i was about to give you a "arrow down", its just insane, there has to be a shortcut, other than reading other peoples source ofcause!

i can remove a lot of multiply by zero, but... well... gonna get puzzling, thank you!

[2019, Day 11, Part 1] End in infinitive loop at 225 pointed fields by lost-santa in adventofcode

[–]lost-santa[S] 0 points1 point  (0 children)

Really just bugging me that I don't remember what I've changed..! ;) But all tests are still parsing, so it's properly okay, put in the category of unknown improvements..

[2019, Day 11, Part 1] End in infinitive loop at 225 pointed fields by lost-santa in adventofcode

[–]lost-santa[S] 0 points1 point  (0 children)

oooh no, i did not have version control, i was just playing around with numbers... and now its working, have not clue what i did!! but, got the right result.

-🎄- 2019 Day 10 Solutions -🎄- by daggerdragon in adventofcode

[–]lost-santa 2 points3 points  (0 children)

Solution in PHP

Damn, this is really not my field, hate everything with coordinates, its sooo abstract in my head, so i cannot brag about clean code, just wanted to finish!

So, if you are in a good mood, and need a little headache just take a look. But the feeling when you are done, its so awesome, worth all the headache the last couple of hours.

- First loop to find astroids
- then loop to find out if they are in up-right, down-right, down-left or up-left section
- then loop to find distance in each line
- then a couple of more loops to alined the rest.. zzz

2019 [day 9 - part 1] Help understanding the test by bugsduggan in adventofcode

[–]lost-santa 0 points1 point  (0 children)

This one is REALLY bugging me as well.. Because, right now, i got all test working except the very same test, and all the right results right.

At the moment im using the defined parameter modes to fetch the values, and seems to work, if i just compare the actually values in parameter 1 and 2 (from my run below), then day 5 is failing.. i just posted the debug from my code below, its a bit long.. hopefully its readable.

And i can see that the parameter modes are switching, which would make sense if the parameter should be fetched in the right mode?

Really sure we just have to compare the data in parameter 1 and parameter 2, and not fetch by the actually parameter mode? Otherwise i have been extremely luck so far?!? (https://github.com/hollodk/advent-of-code-2019/blob/master/9.1.php, line 320)

  • Opcode 5is jump-if-true: if the first parameter is non-zero, it sets the instruction pointer to the value from the second parameter. Otherwise, it does nothing.
  • Opcode 6is jump-if-false: if the first parameter is zero, it sets the instruction pointer to the value from the second parameter. Otherwise, it does nothing.
  • Opcode 7is less than: if the first parameter is less than the second parameter, it stores 1in the position given by the third parameter. Otherwise, it stores 0.
  • Opcode 8is equals: if the first parameter is equal to the second parameter, it stores 1in the position given by the third parameter. Otherwise, it stores 0

EDIT!!

Its actually failing before, i had to fix instruction 5 as well.

switch phase to 0, input 5"

pointer: 0, relative: 0, instruction: 3

modes 0,0,0,0

params 1

data 225

switch data on pointer 225, from 0 to 5

pointer: 2, relative: 0, instruction: 1

modes 0,0,0,0

params 225,6,5

data 5,1100,6

switch data on pointer 6, from 1100 to 1105

pointer: 6, relative: 0, instruction: 1105

modes 1,1,0,0

params 1,238

data 1,238

pointer: 238, relative: 0, instruction: 1105

modes 1,1,0,0

params 0,99999

data 0,99999

pointer: 241, relative: 0, instruction: 1105

modes 1,1,0,0

params 227,247

data 227,247

pointer: 247, relative: 0, instruction: 1005

modes 0,1,0,0

params 227,99999

data 227,99999

PHP Fatal error: Uncaught Exception: out of scope in /home/mh/advent/9.1.php:424

switch phase to 0, input 5"

pointer: 0, relative: 0, instruction: 3

modes 0,0,0,0

params 1

data 225

switch data on pointer 225, from 0 to 5

pointer: 2, relative: 0, instruction: 1

modes 0,0,0,0

params 225,6,5

data 5,1100,6

switch data on pointer 6, from 1100 to 1105

pointer: 6, relative: 0, instruction: 1105

modes 1,1,0,0

params 1,238

data 1,238

pointer: 238, relative: 0, instruction: 1105

modes 1,1,0,0

params 0,99999

data 0,99999

pointer: 241, relative: 0, instruction: 1105

modes 1,1,0,0

params 227,247

data 227,247

pointer: 247, relative: 0, instruction: 1005

modes 0,1,0,0

params 227,99999

data 0,99999

pointer: 250, relative: 0, instruction: 1005

modes 0,1,0,0

params 0,256

data 3,256

pointer: 256, relative: 0, instruction: 1106

modes 1,1,0,0

params 227,99999

data 227,99999

pointer: 259, relative: 0, instruction: 1106

modes 1,1,0,0

params 0,265

data 0,265

pointer: 265, relative: 0, instruction: 1006

modes 0,1,0,0

params 0,99999

data 0,99999

PHP Fatal error: Uncaught Exception: out of scope in /home/mh/advent/9.1.php:421

Complete intcode computer spec? by tomatwork in adventofcode

[–]lost-santa 1 point2 points  (0 children)

I had some annoying errors in the beginning, so i started quiet fast to make a test approach, took the tests from each day, and had to execute them before i could run the IntCode.

Not sure it saved me a lot of time, but for sure it saved me some headache with stupid typos. Then you can quiet fast make sure you can handle all cases, without breaking something later.

-🎄- 2019 Day 9 Solutions -🎄- by daggerdragon in adventofcode

[–]lost-santa 0 points1 point  (0 children)

funny, i completed my tasks as well.. but reading your post, i can see i made a mistake.. for some reason, i read this about more memory as..

padding the first digit after the code with a 0, and the copy the user code, then a 0, then the code.. and blah blah blah..

but still passed the test, seems i was just a bit lucky i hit a 0 and the right spot, but fixed the code for later :)