Hello National Taiwan University of Science and Technology!

Problem 1228. -- 106物件導向程式設計作業 - 01 - ComputSQRT

## 1228: 106物件導向程式設計作業 - 01 - ComputSQRT

Time Limit: 1 Sec  Memory Limit: 128 MB
Submit: 755  Solved: 177
[Submit][Status][Web Board]

## Description

The Babylonian algorithm to compute the square root of a positive number n is as follows:

1. Make a guess at the answer (you can pick n/2 as your initial guess).

2. Compute r = n / guess .

3. Set guess= (guess + r) / 2.

4. Go back to step 2 for as many iterations as necessary. The more steps 2 and 3 are repeated, the closer guess will become to the square root of n.

Write a program that inputs a double for n, iterates through the Babylonian algorithm until the guess subtract the previous guess smaller than 0.01, and outputs the answer as a double to two decimal places. Your answer should be accurate even for large values of n.

391.00

19.77

## Sample Input

```400.5
65189451651.5192165
1894651654984.11318```

```20.01
255322.25
1376463.46```

## Source

[Submit][Status][Web Board]