Triangle and Circle
Limits: 2 sec., 256 MiB
Given a non-degenerate triangle with side lengths A, B, C and a circle or radius R. Print two characters in a single line:
Print + if the triangle can be contained in the circle possible touching it or - otherwise.
Print + if the circle can be contained in the triangle possible touching it or - otherwise.
Input
Four integer numbers A, B, C, R separated with single spaces.
Output
Two characters in a single line.
Constraints
\(1 \le \mathbf{A, B, C, R} \le 111.\)
Samples
Input (stdin) | Output (stdout) |
---|---|
3 4 5 1 | -+ |
Source: LNU United Contest 2
Submit a solution
Element Type | Created | Who | Problem | Compiler | Result | Time (sec.) | Memory (MiB) | # | Actions |
---|
Element Type | Created | Who | Problem | Compiler | Result | Time (sec.) | Memory (MiB) | # | Actions |
---|