Gamblers Problem

See zju acm problem 1101 , the begin problem of each volumn seems have some warm up meanning and

feels it easier then those follwing.

 

I continue tried it in my ubuntu vm, quite confortable to coding here and the Gedit hight the python code quite well.

installed the code lite for c++ , tried it and feel good for debugging and out put standard c++ code, cool.

 

while i still continue coding in python, it's a langual you once begin will have magic can not get rid of any more..

by the way, today is my last day work in dnv, and afterwords I can have almost half month holiday, before begin my next job.

 

the story of gambling is a list of people wager a number, if the number is the sum of other poeple's number, then the sum

number owner win, if two possible way to get the sum, then the bigger sum owner win.

 

 

see code, below. can use list =[2,3,5,7,8] or list =[2,3,5,7,12] have a test.

 

def findmax(list): if len(list)==0: return None; else: maxV=list[0]; for i in range(len(list)): if maxV<list[i]: maxV=list[i]; return maxV; def Clone(list): l=[]; for i in range(len(list)): l.append(list[i]); return l; def seeIfFit(maxV,list): print list; print maxV; for i in range(len(list)): if maxV==list[i]: return 'yes'; for i in range(len(list)): if maxV>list[i]: temp=Clone(list); temp.remove(list[i]); maxV=maxV-list[i]; subfit=seeIfFit(maxV,temp); if subfit=='yes': return 'yes'; maxV=maxV+list[i]; return 'no'; list =[2,3,5,7,8]; maxValue=findmax(list); list.remove(maxValue); fit=seeIfFit(maxValue,list) print fit;