UglyNumbers/남훈 - Revision history

imported>nijelprim at 12:31, 16 September 2008

2008-09-16T12:31:58Z

← Older revision		Revision as of 12:31, 16 September 2008
Line 49:		Line 49:

	=== 코드 ===		=== 코드 ===
			def is_ugly2(num):
			while True:
			if num == 1:
			return True
			elif num % 2 == 0:
			num /= 2
			elif num % 3 == 0:
			num /= 3
			elif num % 5 == 0:
			num /= 5
			else:
			return False

			def ugly3(num):
			if num < 1:
			return 0

			prev = iter = 1

			while True:
			if iter == num:
			return prev

			guess = prev + 1

			while True:
			if is_ugly2(guess):
			prev = guess
			break
			guess += 1

			iter += 1


			goal = 1500

			print "The " + `goal` + "(st/nd/th) ugly number is " + `ugly3(goal)`

	=== 문제 ===		=== 문제 ===

2008-09-16T12:08:07Z

@@ Line 40: / Line 40: @@
   print "The " + `goal` + "(st/nd/th) ugly number is " + `ugly2(goal)`
 ----
 [[UglyNumbers]]

2008-09-16T12:05:57Z

← Older revision		Revision as of 12:05, 16 September 2008
Line 1:		Line 1:
			== 처음 ==
	=== 접근 ===		=== 접근 ===
	1500 '번째'		1500 "번째" ugly number 를 알기 위해서는 1499 번째 ugly number 보다 큰 수 중에 해당되는 수가 있는지 조사하면 된다. 그런 간단한 아이디어로 구현

	=== 코드 ===		=== 코드 ===

2008-09-16T11:49:12Z

2008-09-16T11:43:42Z

← Older revision		Revision as of 11:43, 16 September 2008
Line 1:		Line 1:
	...		=== 접근 ===
			1500 '번째'

			=== 코드 ===
			ver. 1
			def exponent(num, div):
			expo = 0
			while True:
			if num % div != 0:
			return expo
			num /= div
			expo += 1

			def is_ugly(num):
			two = exponent(num, 2)
			three = exponent(num, 3)
			five = exponent(num, 5)

			if num == (2 ** two) * (3 ** three) * (5 ** five):
			return True

			return False

			def ugly(num):
			if num <= 0:
			return 0

			prev = ugly(num - 1)
			guess = prev + 1

			while True:
			if is_ugly(guess):
			return guess
			guess += 1


			goal = 1500

			print "The " + `goal` + "(st/nd/th) ugly number is " + `ugly2(goal)`

			----
			[[UglyNumbers]]

2008-09-16T11:38:20Z

New page

...