Program Zn;
uses CRT;
type mas=array [1..20, 1..20] of real;
var A:mas; i,j,g,b,n,m,o:integer; l:real;
Begin
clrscr;
write ('Введите диапазон массива: ');
readln (g,b);
write ('Введите размер массива: ');
readln (n,m);
Randomize;
For i:=1 to n do
Begin
For j:=1 to m do
Begin
A[i,j]:=random(b-g)+g;
write (A[i,j]:5:0, ' ');
End;
writeln;
End;
O:=0;
For i:=1 to n do
Begin
For j:=1 to m do
Begin
A[3,j]:=O;
End;
End;
For i:=1 to n do
Begin
For j:=1 to m do
If i=1 then
Begin
L:=l+A[i,j];
End;
End;
writeln ('Новый массив');
For i:=1 to n do
Begin
For j:=1 to m do
Begin
write (A[i,j]:5:0, ' ');
End;
writeln
End;
writeln ('Сумма элементов первой строки= ',l:5:0);
readln;
End.
Вообщем вот.
отрезок
x1, y1,x2,y2 = map(int, input().split())
def nod(a, b):
--if b > 0:
return nod(b, a%b)
--else:
return a
a = abs(x1 - x2)
b = abs(y1 - y2)
d = nod(a, b)
print(d * (a//d + b//d - 1))
уравнение
def gcd(a, b):
while a != 0 and b != 0:
if a < b:
b = b % a
else:
a = a % b
return a + b
def qwer(a, b):
x = 1
x1 = 0
y = 0
y1 = 1
while b != 0:
q = a // b
r = a % b
x2 = x - q * x1
y2 = y - q * y1
a, b = b, r
x, x1 = x1, x2
y, y1 = y1, y2
return str(a), str(x), str(y)
a, b, c = list(map(int, input().split()))
x, y = 0, 0
gcds = 0
if c % gcd(a, b) != 0:
print('-1')
else:
gcds, x, y = map(int, qwer(a, b))
x *= c // gcds
y *= c // gcds
q = x // (b // gcds)
x %= b // gcds
y += a // gcds * q
print(x, y)