IT, operating systems, maths, and more.
This is the sixtieth part of the ILP series. For your convenience you can find other parts in the table of contents in Part 1 – Boolean algebra Today we are going to solve Fencing Match. We have a board with some numbers on it. Each number indicates how many edges of that field must … Continue reading ILP Part 60 – Fencing Match
This is the fifty ninth part of the ILP series. For your convenience you can find other parts in the table of contents in Part 1 – Boolean algebra Today we are going to solve Pętliczek. We have a chessboard of any size. Each column and row has a number associated which indicates how many … Continue reading ILP Part 59 – Pętliczek
This is the fifty eighth part of the ILP series. For your convenience you can find other parts in the table of contents in Part 1 – Boolean algebra Today we are going to solve kantoriiroodo riddle. Refer to the link to see how it works. Basically, we have a board of any size (like … Continue reading ILP Part 58 – Kantoriiroodo
This is the fifteenth part of the Custom memory allocation series. For your convenience you can find other parts in the table of contents in Part 1 — Allocating object on a stack Last time we saw how to do unsafe operations without the unsafe keyword. This time we’ll allocate some reference type on a … Continue reading Custom memory allocation in C# Part 15 — Allocating object on a stack without unsafe
This is the fourteenth part of the Custom memory allocation series. For your convenience you can find other parts in the table of contents in Part 1 — Allocating object on a stack This whole series is about unsafe operations and manual memory managing. However, all the things I’ve shown can be done with no … Continue reading Custom memory allocation in C# Part 14 — Unsafe code without unsafe keyword