python_5

5.1

def inverse_int(a):
	b = list(str(a))
	c = []
	for i in b:
    	c.insert(0,i)
	#print(c)
	d = len(c)
	#print(d)
	result = 0
	for i in c:
    	result += int(i) * (10 ** (d-1))
    	#print(result)
    	d = d - 1
		return result

4.2

def m(n):
	result = 0
	for i in range(1, n+1):
		result += i/i+1
	return result

4.3

def surf_area((x1,y1),(x2,y2),(x3,y3)):
	d1 = ((x1-x1)**2 + (y2 - y2)**2)**0.5
	d2
	d3
	a = min(d1,d2,d3)
	c = max(d1,d2,d3)
	b = d1 + d2 + d3 - a - c
	p = 1/2 * (a +  b  +c)
	if a + b > c:
		S=(p(p-a)(p-b)(p-c)])** 0.5
		return S
	else:
		return " Not Triangle."