отрезок
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)
#include "stdafx.h" #include "stdio.h" #include <time.h> #include <stdlib.h> class vector { private: int* m; int size; public : vector(int n = 0); vector(const vector &vector2); ~vector(); }; vector::vector( int n ) { if (n < 0) n = 0; size = n; m = new int[n]; if(!m) printf("Error"); else m = NULL; } vector::vector(const vector &vector2) { size = vector2.size; m = new int [size]; for(int i = 0; i<size;i++) m[i] = vector2.m[i]; printf("kopia stvorena !"); } vector::~vector() { delete[] m; } vector(int *m, int size) { srand(time(NULL)) if(!m) printf("error") else for(int i = 0; i < size; i++) m[i] = rand()% 99; } int main() { vector v1(45), system("pause"); return 0; }
по моему 3 ведь я проходил это на уроках
Объяснение: