Thanh Toàn Lê

from math import sqrt
from math import pow
def khoang_cach(ax,ay,bx,by):
    return sqrt(pow(bx-ax,2)+pow(by-ay,2))
x1=float(input("x1"))
y1=float(input("y1"))
x2=float(input("x2"))
y2=float(input("y2"))
x3=float(input("x3"))
y3=float(input("y3"))
dab=khoang_cach(x1,y1,x2,y2)
dbc=khoang_cach(x2,y2,x3,y3)
dac=khoang_cach(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)

# Sum of consecutive intergers caculation program
n=int(input())
s=n*(n+1)//2
print("Result:",s)

# Sum of consecutive intergers caculation program
n=int(input())
s=n*(n+1)*(2*n+1)//6
print("Result:",s)

# Sum of consecutive intergers caculation program
n=int(input())
s=n*n
print("Result:",s)

# Sum of consecutive intergers caculation program
n=int(input())
s=n*(n+1)//2
p=s*s
print("Result:",p)

# Sum of consecutive intergers caculation program
n=int(input("n"))
s=n*n*(n+1)*(n+1)*(2*n*n+2*n-1)//12
print("Result:",s)

# Sum of consecutive intergers caculation program
n=int(input("n"))
s=n*(n+1)*(n+2)//3
print("Result:",s)

# Sum of consecutive intergers caculation program
n=int(input("n"))
s=n/(n+1.0)
print("Result:",s)

# Sum of consecutive intergers caculation program
n=int(input("n"))
s=n*(n+3)/(4.0*(n+1)*(n+2))
print("Result:",s)

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

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

# Tong day so dac biet 3
n=int(input())
p=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("n"))
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())
rmin =a
if rmin>b:
    rmin=b
if rmin>c:
    rmin=c
print(rmin)

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)