Информатика1270: 9

https://matworld.ru/calculator/perevod-chisel.php
program x2;

var n, m, t, x : integer;

begin

readln(n);

readln(m);

readln(t);

x:=0;

while((n*2*x+(m-2*x)*2*x)<m*n) and ((n*2*x+(m-2*x)*2*x)<=t ) do
x:=x+1;

writeln(x-1);

program x1;
var a, b, m, n, a1, a2, b1, b2, tmin, tmax: integer;
begin
readln(a);
readln(b);
readln(n);
readln(m);
a1:=1*n+a*(n-1);
a2:=a*(n+1) +1*n;
b1:=1*m+b*(m-1);
b2:=b*(m+1) +1*m;

tmin:=max(a1, b1);
tmax:=min(a2, b2);
if tmin>tmax then writeln(-1) else begin
writeln(tmin);
writeln(tmax);
end

end.

https://inf-oge.sdamgia.ru/test?theme=1

https://drive.google.com/drive/folders/1aC8pgeKppygYlS78WQ6AZsiQLLSHWKnL?usp=sharing

Максим

Садык

Алиса

Витя

Глеб

Данила

Наташа

Ярослава

https://sites.google.com/site/fizmatinf1041/home

1 часть

https://sites.google.com/site/fizmatinf1041/news/19

https://sites.google.com/site/fizmatinf1041/home

https://sites.google.com/site/fizmatinf1041/news/19

https://docs.google.com/document/d/1z_ku4y3mRe5ALO91wA-7tMs6-tvrJ2FNnOePzFATSjw/edit?usp=sharing

program a1;
var x, y: integer;
begin
readln(x);
y:=x+1;
if x mod 10 = 2 then y:=y+2;
if x mod 10 = 3 then y:=y+1;
writeln(y);
end.

11111
var A, B, N: longint;
begin
readln(A); readln(B);
if a mod 2 <> 0 then a:=a+1;
if b mod 2 <> 0 then b:=b+1;
N :=abs(a-b) div 2;
writeln(N);

end.

22222
var a:array[1..3] of longint;
var max1, max2:longint; i:integer;
begin
for i:=1 to 3 do
readln(a[i]);
max1:=0; max2:=0;
for i:=1 to 3 do
begin
if a[i] > max1 then
begin
max2:=max1; max1:=a[i];
end
else
if a[i] > max2 then
begin
max2:=a[i]; max1:=max1;
end;
end;
writeln(max2);

end.

4444
var N, s, k: longint; i:integer; z:string;
begin
readln(N);
for i:=1 to N do
s:=s+i;
if s mod 2 =0 then
begin
k:=0;
i:=0;
z:='';
while i < n do
if k+(n-i) <= s div 2 then
begin
k:=k + (n-i);
z:='+' + z;
i:=i+1;
end
else
begin
z:='-' + z;
i:=i+1;
end;
write(z) ;
end
else
write('IMPOSSIBLE')

end.

4444_7
var N, s, k, i,j: longint;
begin
readln(N);
s:=(1+N) * (n div 2);
if n mod 2 <> 0 then
s:=s + (n div 2+1);
if s mod 2 =0 then
begin
k:=0;
i:=0;
  while (i < n) and (k+(n-i) <= s div 2) do
begin
k:=k + (n-i);
  i:=i+1;
   end;
for j:=1 to s div 2 - k -1 do write('-');
if (s div 2 - k)<>0 then write('+');
for j:=s div 2 - k +1 to n-i do write('-');
for j:=n-i+1 to n do write('+');
  end
else
write('IMPOSSIBLE')
end.

3
--+
-1-2+3

8
--+---++

-1-2+3-4-5-6+7+8

15
-----+-----++++

-1-2-3-4-5+6-7-8-9-10-11+12+13+14+15

40
------------------------+----+++++++++++

-1-2-3-4-5-6-7-8-9-10-11-12-13-14-15-16-17-18-19-20-21-22-23-24+25-26-27-28-29+30+31+32+33+34+35+36+37+38+39+40

4. Задание 8 № 3239