Trần Nguyễn Gia Bảo

from math import sqrt
from math import pow
x1=int(input())
y1=int(input())
x2=int(input())
y2=int(input())
res=sqrt(pow(x2-x1,2)+pow(y2-y1,2))
print(res)

from math import sqrt
a=int(input())
b=int(input())
c=int(input())
d=a+b+c
p=d/2
s=sqrt(p*(p-a)*(p-b)*(p-c))
print(d)
print(s)

from math import sqrt
from math import pow
def distance_points(ax ,ay, bx, by):
return sqrt(pow(bx - ax, 2) + pow(by - ay, 2))
x1 = float(input())
y1 = float(input())
x2 = float(input())
y2 = float(input())
x3 = float(input())
y3 = float(input())
dab = distance_points(x1 ,y1 ,x2 , y2)
dbc = distance_points(x2, y2, x3, y3)
dac = distance_points(x1, y1, x3, y3)
print("d_AB={:.3f}".format(dab))
print("d_BC={:.3f}".format(dbc))
print("d_AC={:.3f}".format(dac))

a=int(input())
b=int(input())
x=(a-2)*(b-2)
y=a*b-x
print(x)
print(y)

N=int(input())
S=(N*(N+1))/2
print(S)

N=int(input())
S=(N*(N+1)*(2*N+1))/6
print(S)

n=int(input())
s=n*n*(n+1)*(n+1)*(2*n*n+2*n-1)//12
print(s)

n=int(input())
s=n*(n+1)//2
print(s*s)

n=int(input())
s=n*n*(n+1)*(n+1)*(2*n*n+2*n-1)//12
print(s)

n=int(input())
s=n*(n+1)*(n+2)//3
print(s)

n=int(input())
s=n/(n+1.0)
print(s)

n=int(input())
s=n*(n+3)/(4.0*(n+1)*(n+2))
print(s)

#Tong day so dac biet 1
n=int(input())
s=n*(n+2)/((n+1)**2)
print(s)

#Tong day dac biet 2
p=int(input())
n=int(input())
s=(p**(n+1)-1)//(p-1)
print(s)

#Tong day dac biet 3
p=int(input())
n=int(input())
s=((n+1)*p**(n+1))//(p-1)-(p**(n+1)-1)//((p-1)**2)
print(s)

n=int(input())


if n % 2 ==0:
   print("N la so chan")
else:
   print("N la so le")

n=int(input())
if (n % 3 ==0) and (n % 5 !=0):
   print("True")
else:
   print("False")

a=int(input())
b=int(input())
rmax=a
if rmax<b:
rmax=b
print(rmax)

a=int(input())
b=int(input())
c=int(input())
res=a
if(res>b):
res=b
if(res>c):
res=c
print(res)

a=int(input())
b=int(input())
c=int(input())
m=a+b
n=b+c
p=a+c
rmax=m
if rmax<n:
rmax=n
if rmax<p:
rmax=p
print(rmax)

n = int(input(n: '))
for i in range(1, n + 1):
if(i%2=0) and (i % 3 !=0):
print(i)

n = int(input(n: '))
for i in range(1, n + 1):
if(i%2=0) and (i % 3 !=0):
print(i)

rom math import sqrt
n = int(input())
for i in range(1, int(sqrt(n)) + 1):
if n % i == 0:
print(i)
if n / i != i:
print(n / i)

from math import sqrt
n = int(input())
res = 0
for i in range(1, int(sqrt(n))):
if n % i == 0:
res += 1
if i != n // i:
res += 1
print(res)

from math import sqrt
def prime(u):
if u <= 1:
return False
for i in range(2, int(sqrt(n)) + 1):
if u % i == 0:
return False
return True
n = int(input())
print(prime(n))