Draft of task№139

 program Task139;

var A, B, C, Pmax,

res, S_sq, S_tr,

small_triangles,

S_h, hole_side : Int64;

begin

  writeln ('Hello World');

  res := 0;

  Pmax:=999999;

  for A:=1 to Pmax do

  begin

    for B:=A + 1 to Pmax do

    begin

      for C:=B + 1 to Pmax do

      begin

        if (A + B + C <= Pmax) and (A*A + B*B =C*C) then

        begin

          S_sq:= C*C;

          S_tr:= Trunc(A*B/2);

          small_triangles:=Trunc(S_sq/S_tr);

          S_h:= S_sq - small_triangles*S_tr;

          hole_side := Trunc(sqrt(S_h));

          if C mod hole_side = 0 then inc(res);

        end;

      end;

    end;

  end;

 

 writeln(res);

  Readln;

end.

Pythagorean Tiles (num 139) for next week

Let $(a,b,c)$(A,B,C) represent the three sides of a right angle triangle with integral length sides. It is possible to place four such triangles together to form a square with length $c$C.

For example, $(3,4,5)$(3,4,5) triangles can be placed together to form a 5$5$ by 5$5$ square with 1 a 1$1$ by $1$ hole in the middle and it can be seen that the 5$5$ by 5$5$ square can be tiled with twenty-five $1$1 by 1$1$ squares.

However, if $$(5,12,13)(5,12,13) triangles were used then the hole would measure $7$7 by 7$7$ and these could not be used to tile the 13$13$ by 13$13$ square.

Given that the perimeter of the right triangle is less than one-hundred million, how many Pythagorean triangles would allow such a tiling to take place?

Report fake TikTok recruitment

 Hello , dear support serviceman,

There is a SMS-message from fake TikTok recruiter came to me! It contains a dangerous WhatsApp link: https://wa.me/380972917761?sfs=h8a2G6MlVW

The number where sms came from: 

+224 629 62 18 10

Please, check this link and block it as soon as possible to avoid fraudulency in WhatsApp!

Fake fan of sales

 big_love_to_halyava@ukr.net

Collatz solution's Draft (Project Euler №14)

program Hello;

var n: Int64;

   maxsteps, steps : smallint;

begin

  writeln ('Hello World');

  //steps := 1;

  n := 0;

  maxsteps := 0;

  for n := 2 to 13 do

  begin

    steps := 1;

    while (n <> 1) do

    begin

      if odd(n) then n:= 3*n+1

      else n:= trunc(n/2);

      inc(steps);

    end;

    if steps > maxsteps then maxsteps := steps;

  end;

  writeln(maxsteps);

end.

100325-1603

 синупрет аналоги

Заряд. Зуб, окуляри.

Пластівці , перекус 

Трамвай пумб, моно магаз

овочі, каша

Курси? 

🌽+ 🦀= Салат 🥗 

Блакитний будильник, червоний будильник.

Брелок?

Фото від 1402

Бойлер, балкон

Борщ?

DELPHI Санніков, Вальвачов. Ейлер №139.

зАмок

Київстар. Корисне

 *111# стан рахунку 

*112# залишок хвилин, смс

466 гаряча лінія