#include <iostream>
#include <vector>
using namespace std;
int main() {
vector<int> b;
vector< vector<int> > a = { {1, 2}, {2, 4, 1, 5} };
int c = 1;
for(int i = 0; i < 2; i++) {
for(int j = 0; j < a[i].size(); j++) {
if(a[i][j] > c) {
b.push_back(a[i][j]);
}
}
}
for(int i = 0; i < b.size(); i++) {
cout << b[i] << (i + 1 == b.size() ? ". " : ", ");
}
cout << "\nТаких чисел - " << b.size();
return 0;
}
отрезок
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)