IT, operating systems, maths, and more.
This is the first part of the SAT series. For your convenience you can find other parts using the links below: SAT Part 1 — Boolean logic SAT Part 2 — Arithmetic SAT Part 3 — Reducing ILP to SAT SAT Part 4 — Solving 3CNF with C++ templates Today we are going to implement … Continue reading SAT Part 1 — Boolean logic
This is the seventh part of the Types and Programming Languages series. For your convenience you can find other parts in the table of contents in Part 1 — Do not return in finally When developing an application there are multiple things we should focus on to make our life easier and more pleasant. In … Continue reading Types and Programming Languages Part 7 – Four types of experience in software engineering
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