20170316

#! /user/bin/env python
# -*- coding:utf-8 -*-


#求和
def s(a,b):
i = 0
if a > 0 and b >0:
while (a <= b):
i = i + a 
a = a + 1
return i


#print s(1,100)




# 阶乘
def n(a):
i = 1
while a:
i = i * a
a = a - 1
return i

#print n(5)

#3个数字比较输出最大
def cmp(x,y,z):
if x > y:
if x > z:
return x
else:
return z 
else:
if y > z:
return y 
else:
return z

#print cmp(-4,-8,-6)


#3个数比较输出最大


def cmpT(x,y,z):
tmp = 0
if x > y:
tmp = x
if tmp > z:
return tmp 
else:
return z 
else:
tmp = y 
if tmp > z:
return tmp
else:
return z 

#print cmpT(1,2,3)


#排序


def cmpS(x,y,z):
max = 0
min = 0
mid = 0
if x > y:
max = x
min = y
else:
max = y 
min = x
#return/print 123456789 
#return 终止执行程序，直接返回数值
#print 打印出数值，并继续执行后续程序
if max > z:
if min > z:
min = z
mid = y
return max,mid,min 
else:
max = z
mid = x
return max,mid,min

print cmpS(-5,8,0)