[ create a new paste ] login | about

Link: http://codepad.org/gbpyRRAB    [ raw code | output | fork ]

Ruby, pasted on Jun 22:
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
require "bigdecimal"

#n = gets.to_i
n = 2
max = BigDecimal::new("5.0") # 初期値適当
min = BigDecimal::new("0.0")
for i in 1..20
	mid = (min + max) / 2
	puts mid
	midsq = mid * mid * mid
	if midsq < n
		min = mid
	else
		max = mid
	end
	puts mid
end


Output:
0.25E1
0.25E1
0.125E1
0.125E1
0.1875E1
0.1875E1
0.15625E1
0.15625E1
0.140625E1
0.140625E1
0.1328125E1
0.1328125E1
0.12890625E1
0.12890625E1
0.126953125E1
0.126953125E1
0.1259765625E1
0.1259765625E1
0.12646484375E1
0.12646484375E1
0.126220703125E1
0.126220703125E1
0.1260986328125E1
0.1260986328125E1
0.12603759765625E1
0.12603759765625E1
0.126007080078125E1
0.126007080078125E1
0.1259918212890625E1
0.1259918212890625E1
0.12599945068359375E1
0.12599945068359375E1
0.125995635986328125E1
0.125995635986328125E1
0.1259937286376953125E1
0.1259937286376953125E1
0.12599277496337890625E1
0.12599277496337890625E1
0.125992298126220703125E1
0.125992298126220703125E1


Create a new paste based on this one


Comments: