IT, operating systems, maths, and more.
This is the eightieth fourth 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 Na koń. Code: First, we create variables in line 3. We define one binary digit for each field of the … Continue reading ILP Part 84 — Na koń
This is the eightieth third 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 Dolepki. We have some natural number for which we know that a sum of an arithmetic progression is equal to … Continue reading ILP Part 83 — Concatenation
This is the eightieth second 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’re going to solve S and P. The idea is: we start with two non-negative integers and . We calculate and . Now we take … Continue reading ILP Part 82 — S and P
This is the sixteenth 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 I was recently asked if it’s possible to hijack the new operator in Linux. We’ve already seen that we can do it … Continue reading Custom memory allocation in C# Part 16 — Hijacking new on Linux with .NET 5
This is the eightieth first 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 Kakuro: Code: Should be self explanatory now. Solution: