(I) Опровержение гипотез

public
yeskendir.sultanov Apr 26, 2024 Never 143
Clone
Python 41.py 18 lines (15 loc) | 432 Bytes
1
def gcd(a, b):
2
while a > 0 and b > 0:
3
if a > b:
4
a %= b
5
else:
6
b %= a
7
return a + b
8
9
l, r = map(int, input().split())
10
11
for i in range(l, r + 1):
12
for j in range(i + 1, r + 1):
13
for k in range(j + 1, r + 1):
14
if gcd(i, j) == 1 and gcd(j, k) == 1 and gcd(i, k) > 1:
15
print(i, j, k)
16
exit(0)
17
18
print(-1)