¶
번 보, 느리.
~cpp
def TreeNPlusOne(aNumber):
print aNumber,
if aNumber == 1:
return
elif aNumber%2 == 0:
aNumber /= 2
else:
aNumber = 3*aNumber+1
TreeNPlusOne(aNumber)
리 ¶
1. 22 22, 11, 34... 는데 22 11, 34등 대 들 배는 능.
2. 범 떤 2 배 는 (는 (x - 1)/3 는 ) 1 는 대 배.
2. 범 떤 2 배 는 (는 (x - 1)/3 는 ) 1 는 대 배.
범(Range)를 는 .
¶
~cpp
def TreeNPlusOne(aNumber, aMin, aMax, aBinaryMap):
count = 1
while(aNumber != 1):
if(IsInRange(aMin, aMax, aNumber) and aBinaryMap[aNumber-aMin]):
aBinaryMap[aNumber-aMin] = False
if(aNumber%2 == 0):
aNumber = aNumber/2
else:
aNumber = aNumber*3+1
count = count + 1
return count
def InputRange():
min, max = input(', 대: ')
while IsCorrectInput(min, max) == False:
min, max = input(', 대: ')
return min, max
def MakeBinaryMap(aMin, aMax):
rangeOfMap = aMax - aMin + 1
binaryMap = range(rangeOfMap)
for i in range(rangeOfMap):
binaryMap[i] = True
return binaryMap
def FindMaxCycleLength(aMin, aMax, aBinaryMap):
maxCycleLength = 0
for i in range(aMin, aMax+1):
if(aBinaryMap[i-aMin]):
cycleLength = TreeNPlusOne(i, aMin, aMax, aBinaryMap)
if(maxCycleLength < cycleLength):
maxCycleLength = cycleLength
return maxCycleLength
def OutputResult(aMin, aMax, aMaxCycleLength):
print aMin, aMax, aMaxCycleLength
def IsInRange(aMin, aMax, aNumber):
if(aMin <= aNumber and aMax >= aNumber):
return True
else:
return False
def PreInspection(aMin, aMax, aBinaryMap):
for i in range(aMin, aMax/2+1):
tempI = i
while(IsInRange(aMin, aMax, 2*tempI)):
aBinaryMap[tempI-aMin] = False
tempI = 2*tempI
def IsCorrectInput(aMin, aMax):
if(aMin > 0 and aMax < 1000000 and aMin < aMax):
return True
else:
print 'Not Accept'
return False
if __name__ == '__main__':
min, max = InputRange()
binaryMap = MakeBinaryMap(min, max)
PreInspection(min, max, binaryMap)
OutputResult(min, max, FindMaxCycleLength(min, max, binaryMap))
