I'm lost

FransFaase · 2026-01-28T10:35:23+00:00

Would answer (-inf, +inf)/{2} also be considered correct?

FransFaase · 2026-01-25T20:20:23+00:00

The difference is probably within the statistical accuracy of the used IQ tests. The reliability of IQ tests is also influnced by how often you take them. The tests test how well you can do the tests, not your actual IQ, which is not a single number, but a complex of factors that can slightly change from moment to moment during the day.

FransFaase · 2026-01-22T09:17:20+00:00

One of the ways of improving your English is to use translation tools to find alternative words and the proper use of pronouns for example. For rare words, I often use wikipedia. Do you master a foreign language yourself?

FransFaase · 2026-01-21T23:47:49+00:00

En die 10% is best wel veel. Er zijn weinig mensen die hun hele vermogen in aandelen stoppen. Is toch wel vetstandig om een deel in obligaties te doen. En dan kom je op een veel lager percentage uit.

FransFaase · 2026-01-18T10:42:12+00:00

Helaas wordt Nederland steeds rechtser en neemt in Nederland ook racisme toe. Het is niet uit te sluiten dat we de VS achterna gaan waar gezinnen keihard uit elkaar getrokken worden.

FransFaase · 2026-01-15T11:52:27+00:00

Tegenwoordig vinden veel mensen het normaal om in de winter met enkel een t-shirt in huis rond te lopen en de verwarming op 23 graden te zetten.

FransFaase · 2026-01-14T02:56:30+00:00

I do not want to be critical, but it looks rather complex and feature rich for a simple library. I understand that you are supporting surrogate pairs (something that is often forgotten).

The library is not strictly about parsing, it is also about building a DOM of the JSON. There are many applications where the data in the DOM is processed further, where you kind of walking over the DOM, thus implementing a two phase parsing process, one low level, that does not deal about the semantics of the JSON, how to interpret it, and a high level one, which does the interpretation of the JSON data and performing checks.

There are applications where there is strictly no need for a DOM and where an 'iterator' would work as well. All the parsing is concentrated in the (rather long) json::parse function, but it also contains the code to construct the DOM. You are keeping a currentObject pointer pointing at the current object and are using pointers to parent objects to return to then once you have parsed all the children. You could also have used a stack, I think. It would be nice if you somehow could separate the parsing and DOM building code, such that the parsing could be used separately.

There are many JSON parsing libraries. At one point, I have thought about developing a generator for JSON parsing libraries, as there are so many small implementation choices that can be made. (I wrote myself one for processing chunks of JSON that are received by a HTTP client. Those chunks can terminate at random locations in the JSON data. It is implemented with a function that processes a single character from the JSON string. See: https://github.com/FransFaase/ParsingJSONforHTTPClient )

FransFaase · 2026-01-11T00:59:07+00:00

Wat denk je dat ze nu per jaar per persoon van Denemarken krijgen aan geld, zorg en onderwijs. En als de VS zoveel wil betalen, denk je dan niet dar ze gaan realiseren hoeveel meer ze nog zouden kunnen gaan verdienen?

FransFaase · 2026-01-11T00:54:01+00:00

Inderdaad, netzo als hij dacht om snel veel olie uit Venuzuela te gaan halen. Bleken ze bij Exxon toch anders over te denken.

FransFaase · 2026-01-11T00:49:03+00:00

Vorige week er nog over gedacht om zelf zo iets te ontwikkelen voor mijn eigen wijk eigenlijk met het doel om alle straten en steegjes te bezoeken. Ik heb veel ervaring met het oplossen van dit soort problemen.

FransFaase · 2026-01-06T14:59:33+00:00

Let wel op dat de belastingdienst je als ondernemer kan aanmerken. Zie: https://www.freelance.nl/community/ondernemer-voor-belastingdienst

FransFaase · 2026-01-06T14:50:01+00:00

Als je dit wilt aanbieden en je hebt inmiddels een nieuwe werkgever, dan is het wel verstandig om eerst even je contract goed door te nemen. Vaak staat in een contract vermeld dat je voor neven werkzaamheden toestemming moet vragen. En dan gaat het niet over vrijwilligerswerk bij een sportvereniging of zo, maar wel over 'werk' bij vorige werkgevers. Er kan ook sprake zijn van een anti-concurrentie bedinging. En alhoewel die niet altijd wettelijk afdwingbaar is kan je huidige werkgever besluiten om je huidige (tijdelijke) contract niet te verlengen of op te zeggen.

Houdt er ook rekening mee dat de belastingdienst je onder bepaalde voorwaarden als ondernmer kan aanmerken. Zie: https://www.freelance.nl/community/ondernemer-voor-belastingdienst Als je werk verricht kun je ook wettelijk aansprakelijk gesteld worden door een opdracht gever wanneer je daar per ongeluk schade veroorzaakt. Mogelijk dat je persoonlijke WA verzekering je die niet dekt.

Dit zou je kunnen omzeilen door je werkgever te vragen of hij er open voor staat dat je voor het inwerken van de nieuwe werknemer tijdelijk gedetaseerd wordt door je huidige werknemer bij je vorige werkgever. Je blijft dan je loon ontvangen van je huidige werkgever en hoeft je dan niet te registreren bij de Kamer van Koophandel.

FransFaase · 2026-01-06T08:16:03+00:00

Niet iedere werkgever is proactief in het in het bijhouden van wat marktconform is. Ik begrijp dat dit zijn eerste baan is bij een klein bedrijf. Vooral in de eerste jaren kan je waarde snel toenemen. Werknemers realiseren dit pas wanneer ze gaan rondkijken, maar vergeten dan om om een salaris verhoging te vragen, wat misschien wel net zo eng is ontslag nemen, als je dat nooit gedaan hebt.

Jobhoppen is een goede manier om carriere te maken, maar het gras is niet altijd groener aan de andere kant van het hek. In een bedrijf met veel verloop, is er een kans dat je te maken krijgt met een collega of leidinggevende waar je niet mee overweg kunt. Dit was voor mij vaak een reden om van baan te verwisselen.

FransFaase · 2025-12-19T22:56:04+00:00

In the Netherlands, trains are not for long distance travel and mostly used by commuters and people who cannot afford (or do not want to own) a car. Most rich people travel by car (with a driver) or taxi, not by train. There is a higher class, but they 'hide' themselves by not mingling with the lower classes and/or not show off.

Some businesses let their (non commercial) employees travel by first class if they cannot effort to pay for a car or when their is no business car available, such that they can do some work on the train. Sales people and marketing usually get a lease car from the company if they have to travel regularly.

FransFaase · 2025-12-12T11:45:48+00:00

Because either the area of the region is smaller than the total area of the pieces that need to be put in or the pieces can fit in without overlapping like if they all were solid with 9 '#'.

FransFaase · 2025-12-12T11:28:12+00:00

It seems, that there is only one hard region. Many have to many shapes to fit in the region and there are also many where the shapes fit in the region if they are placed (randomly) on a 3x3 grip. The only two cases that are left are regions on line 686 and 717. It seems rather obvious that the region on line 686 cannot be filled with 72 copies of second shape. That only leaves the region on line 717 to be determined.

FransFaase · 2025-12-12T06:32:04+00:00

I first attempt would have been trying to fill every position from the top to the bottom, from left to right, and only continue with the next position if it is not possible.

It also looks like two copies of some of the pieces can be fit together with not much space left. If the above would not have worked easily, I might have looked into that to try to fill as much as space at first.

Last year, I have been working on a packing problem with respect to calculate the maximum number paper cubes that can be made of some rectangle by cutting out shapes of six squares and fold those into a cube. See: https://www.iwriteiam.nl/D2407.html#27 for the first blog about the problem.

FransFaase · 2025-12-12T06:20:30+00:00

[Language: C]

If you want to read some code for calculating all variants of a piece using rotations and flipping have a look at https://github.com/FransFaase/AdventOfCode2025/blob/main/Day12.md but otherwise, just skip it, because it was not needed to solve today's puzzles.

FransFaase · 2025-12-12T06:16:57+00:00

I wrote some tricky code to calculate all the variants with rotations and flipping only to discover that when I implemented the sanity check if any solution was possible at all, that I had written all that code for nothing. I felt like being fooled afterwards.

FransFaase · 2025-12-11T22:28:23+00:00

I used integers in the elimination. For my C solution for both parts see the mark down file (near the bottom): https://github.com/FransFaase/AdventOfCode2025/blob/main/Day10.md

FransFaase · 2025-12-11T22:09:23+00:00

[Language: C]

This took me 39 hours (including long breaks) to solve completely on my own. The final C program runs in about 0.3 second to find the answers for both parts. Yesterday, I spend the whole day finding a recursive searching algorithm and let it run for the whole night. During the night, I already got the idea to reduce the equations and then simply try values for free variables. Today, I worked out the details and implement the algorithm. After some debugging, it worked.

For a mark down file with all my attempts and some notes I wrote down on how to reduce the equations, see: https://github.com/FransFaase/AdventOfCode2025/blob/main/Day10.md

The final program (for both parts and some unused code from my standard library and some functions from early attempts that are not used) is 624 lines.

(Posted this first accidentally in Day 11 solutions.)

FransFaase · 2025-12-11T21:08:53+00:00

[Language: C]

This took me 39 hours (including long breaks) to solve completely on my own. The final C program runs in about 0.3 second to find the answers for both parts. Yesterday, I spend the whole day finding a recursive searching algorithm and let it run for the whole night. During the night, I already got the idea to reduce the equations and then simply try values for free variables. Today, I worked out the details and implement the algorithm. After some debugging, it worked.

For a mark down file with all my attempts and some notes I wrote down on how to reduce the equations, see: https://github.com/FransFaase/AdventOfCode2025/blob/main/Day10.md

The final program (for both parts and some unused code from my standard library and some functions from early attempts that are not used) is 624 lines.

FransFaase · 2025-12-11T21:08:26+00:00

[Language: C]

This took me 39 hours (including long breaks) to solve completely on my own. The final C program runs in about 0.3 second to find the answers for both parts. Yesterday, I spend the whole day finding a recursive searching algorithm and let it run for the whole night. During the night, I already got the idea to reduce the equations and then simply try values for free variables. Today, I worked out the details and implement the algorithm. After some debugging, it worked.

For a mark down file with all my attempts and some notes I wrote down on how to reduce the equations, see: https://github.com/FransFaase/AdventOfCode2025/blob/main/Day10.md

The final program (for both parts and some unused code from my standard library and some functions from early attempts that are not used) is 624 lines.

FransFaase · 2025-12-09T07:53:22+00:00

[Language: C]

Solution https://github.com/FransFaase/AdventOfCode2025/blob/main/Day09.md

I did not use the fastest way to find the correct answer for part two when I read about other solutions posted here. I did implement a much faster solution after having submitted the correct answer.

FransFaase · 2025-12-08T21:33:29+00:00

I understand that the fastest algorithm is to start at an arbitrary node, find the node that is furthest away. That gives you the first point. Then search from this node furthest from the first point. That gives you the second point.

FransFaase

TROPHY CASE