## captain hammer

### Problem

The Hamjet is a true marvel of aircraft engineering. It is a jet airplane with a single engine so powerful that it burns all of its fuel instantly during takeoff. The Hamjet doesn't have any wings because who needs them when the fuselage is made of a special Wonderflonium isotope that makes it impervious to harm.

Piloting the Hamjet is a not a job for your typical, meek-bodied superhero. That's why the Hamjet belongs to Captain Hammer, who is himself impervious to harm. The G-forces that the pilot endures when taking a trip in the Hamjet are legen-dary.

The Hamjet takes off at an angle of θ degrees up and a speed of **V** meters per second. **V** is a fixed value that is determined by the awesome power of the Hamjet engine and the capacity of its fuel tank. The destination is **D** meters away. Your job is to program the Hamjet's computer to calculate θ given **V** and **D**.

Fortunately, the Hamjet's Wondeflonium hull is impervious to air friction. Even more fortunately, the Hamjet doesn't fly too far or too high, so you can assume that the Earth is flat, and that the acceleration due to gravity is a constant 9.8 ^{2}

### Input

The first line of the input gives the number of test cases, **T**. **T** lines follow. Each line will contain two positive integers -- **V** and **D**.

### Output

For each test case, output one line containing "Case #x: θ", where x is the case number (starting from 1) and θ is in degrees up from the the horizontal. If there are several possible answers, output the smallest positive one.

An answer will be considered correct if it is within 10^{-6} of the exact answer, in absolute or relative error. See the FAQ for an explanation of what that means, and what formats of floating-point numbers we accept.

### Limits

Time limit: 60 seconds.

Memory limit: 1 GB.

1 <= **T** <= 4500;

1 <= **V** <= 300;

1 <= **D** <= 10000;

It is guaranteed that each test case will be solvable.

## Sample Input & Output

3 98 980 98 490 299 1234

Case #1: 44.9999993 Case #2: 15.0000000 Case #3: 3.8870928

## Rust Solution

```
use rustgym_util::*;
use std::fmt::Write;
use std::io::*;
fn solve(case_no: usize, reader: &mut impl BufRead, writer: &mut impl Write) {
let args: Vec<f64> = reader.parse_vec();
let v = args[0];
let d = args[1];
let res = degree(v, d);
writeln!(writer, "Case #{}: {:.7}", case_no, res).unwrap();
}
fn degree(v: f64, d: f64) -> f64 {
let mut left = 0.0;
let mut right = 45.0;
let target = d * 9.8 / (2.0 * v * v);
loop {
let mid: f64 = (left + right) / 2.0;
let mid_r: f64 = mid.to_radians();
let val = mid_r.sin() * mid_r.cos();
let diff = (val - target).abs();
if diff < std::f64::EPSILON {
return mid;
}
if val > target {
right = mid;
}
if val < target {
left = mid;
}
}
}
google_test_gen!(test, "input.txt", "output.txt");
```

Having problems with this solution? Click here to submit an issue on github.