我不想上班：第一道编程题 def findcanci(a): i=0 while(True): if (i+2)>=len(a): break if (a[i]==a[i+1] and a[i+1]!=a[i+2] and a[i]!=a[i+2]): return i+2 if (a[i]!=a[i+1] and a[i+1]!=a[i+2] and a[i]==a[i+2]): return i+1 if (a[i]!=a[i+1] and a[i+1]==a[i+2] and a[i]!=a[i+2]): return i i+=1 if __name__=='__main__': a=[int (i) for i in raw_input().split(' ')] print findcanci(a) 第二道编程题 shuzu = [int(i) for i in raw_input().split(" ")] shuzu.sort() n=shuzu[2]-shuzu[1] m=(shuzu[1]-shuzu[0])%2 if m==0: n=n+(shuzu[1]-shuzu[0])/2 else: n=n+(shuzu[1]-shuzu[0]+1)/2+1 print n