- 3N+1Problem/Leonardong
def getMaximumCycleLength(self, aFrom, aTo):
cycleLength = self.getCycleLength(i)
if max < cycleLength:
max = cycleLength
def getCycleLength( self, aStart ):
cycleLength = 1
cycleLength = cycleLength + 1
return cycleLength
print self.getMaximumCycleLength(numFrom, numTo)
def testGetMaximumCycleLength(self):
self.assertEquals( 1, self.runner.getMaximumCycleLength( 1, 1 ) )
self.assertEquals( 20, self.runner.getMaximumCycleLength( 1, 10 ) )
self.assertEquals( 125, self.runner.getMaximumCycleLength( 100, 200 ) )
self.assertEquals( 89, self.runner.getMaximumCycleLength( 201, 210 ) )
self.assertEquals( 174, self.runner.getMaximumCycleLength( 900, 1000) )
def testGetCycleLength(self):
self.assertEquals( 1, self.runner.getCycleLength(1) )
self.assertEquals( 5, self.runner.getCycleLength(16) )
self.assertEquals( 16, self.runner.getCycleLength(22) )
* MAX(100000)개의 원소를 가진 리스트에 계산했던 CycleLength를 저장한다.
Found 1 matching page out of 7540 total pages
You can also click here to search title.