Computers in the USSR, 16 years later

NPP "Semiko" is engaged in the most useful business: it promotes the latest development in schools - MK-152.

For those who have forgotten or did not know what the MK-52 is, a small quote from the site:
The program for solving the problem takes 17 bytes :
IP1 B ↑ IP2 × P1 ↔ IP3 + IP4 + P4 FL0 00 6 0 ÷ C / P

Before starting, you need to write the initial values ​​in the memory registers:
R0 = 40 (number of fish);
R1 = 5 (time to catch the first fish);
R2 = 1.05 (time increase factor - 105%);
')
R3 = 2 (time to shift);
R4 = 0 (initial value of time for relocation).

To start the program, press / , / . After 0.5 seconds the result will appear on the indicator - 11.399981 minutes. If there is a need to count the fractions of a minute per second, click on "KG → M" and get approximately 11 minutes 24 seconds.
[...]
A similar C program is not much clearer and will require a compiler to run. For comparison, the text below.

#include <stdlib.h>
main () {int j, r0 = 40; double r1 = 5, r2 = 1.05, r3 = 2, r4 = 0; for (j = 0; j <r0; j ++) {r4 + = r1 + r3; r1 * = r2;} fprint (“Time:% d min. \ n”, r4 / 60); }

PS: I was reminded in the comments and I decided to add about EGOGI, ZGGOGI, darkness and so on. But in the MK-152, the firmware is different, so the monsters will give birth to their own, unique ones.