Problem:
Score : 500 points

Problem Statement

#nck {
width: 30px;
height: auto;
}

Snuke received a triangle as a birthday present.
The coordinates of the three vertices were (x_1, y_1), (x_2, y_2), and (x_3, y_3).

He wants to draw two circles with the same radius inside the triangle such that the two circles do not overlap (but they may touch).
Compute the maximum possible radius of the circles.

Constraints

0 ≤ x_i, y_i ≤ 1000

The coordinates are integers.

The three points are not on the same line.

Input

The input is given from Standard Input in the following format:

x_1 y_1
x_2 y_2
x_3 y_3

Output

Print the maximum possible radius of the circles.
The absolute error or the relative error must be at most 10^{-9}.

Sample Input 1

0 0
1 1
2 0

Sample Output 1

0.292893218813

Sample Input 2

3 1
1 5
4 9

Sample Output 2

0.889055514217

Solution in Rust (1.42.0) (judge verdict: Wrong Answer)

pub trait Zero: PartialEq + Sized {
    fn zero() -> Self;
    #[inline]
    fn is_zero(&self) -> bool {
        self == &Self::zero()
    }
}
pub trait One: PartialEq + Sized {
    fn one() -> Self;
    #[inline]
    fn is_one(&self) -> bool {
        self == &Self::one()
    }
}
macro_rules !zero_one_impls {($({$Trait :ident $method :ident $($t :ty ) *,$e :expr } ) *) =>{$($(impl $Trait for $t {#[inline ] fn $method () ->Self {$e } } ) *) *} ;}
zero_one_impls !({Zero zero u8 u16 u32 u64 usize i8 i16 i32 i64 isize u128 i128 ,0 } {Zero zero f32 f64 ,0. } {One one u8 u16 u32 u64 usize i8 i16 i32 i64 isize u128 i128 ,1 } {One one f32 f64 ,1. } ) ;
pub trait IterScan: Sized {
    type Output;
    fn scan<'a, I: Iterator<Item = &'a str>>(iter: &mut I) -> Option<Self::Output>;
}
pub trait MarkedIterScan: Sized {
    type Output;
    fn mscan<'a, I: Iterator<Item = &'a str>>(self, iter: &mut I) -> Option<Self::Output>;
}
#[derive(Clone, Debug)]
pub struct Scanner<'a> {
    iter: std::str::SplitAsciiWhitespace<'a>,
}
mod scanner_impls {
    use super::*;
    impl<'a> Scanner<'a> {
        #[inline]
        pub fn new(s: &'a str) -> Self {
            let iter = s.split_ascii_whitespace();
            Self { iter }
        }
        #[inline]
        pub fn scan<T: IterScan>(&mut self) -> <T as IterScan>::Output {
            <T as IterScan>::scan(&mut self.iter).expect("scan error")
        }
        #[inline]
        pub fn mscan<T: MarkedIterScan>(&mut self, marker: T) -> <T as MarkedIterScan>::Output {
            marker.mscan(&mut self.iter).expect("scan error")
        }
        #[inline]
        pub fn scan_vec<T: IterScan>(&mut self, size: usize) -> Vec<<T as IterScan>::Output> {
            (0..size)
                .map(|_| <T as IterScan>::scan(&mut self.iter).expect("scan error"))
                .collect()
        }
        #[inline]
        pub fn iter<'b, T: IterScan>(&'b mut self) -> ScannerIter<'a, 'b, T> {
            ScannerIter {
                inner: self,
                _marker: std::marker::PhantomData,
            }
        }
    }
    macro_rules !iter_scan_impls {($($t :ty ) *) =>{$(impl IterScan for $t {type Output =Self ;#[inline ] fn scan <'a ,I :Iterator <Item =&'a str >>(iter :&mut I ) ->Option <Self >{iter .next () ?.parse ::<$t >() .ok () } } ) *} ;}
    iter_scan_impls !(char u8 u16 u32 u64 usize i8 i16 i32 i64 isize f32 f64 u128 i128 String ) ;
    macro_rules !iter_scan_tuple_impl {($($T :ident ) *) =>{impl <$($T :IterScan ) ,*>IterScan for ($($T ,) *) {type Output =($(<$T as IterScan >::Output ,) *) ;#[inline ] fn scan <'a ,It :Iterator <Item =&'a str >>(_iter :&mut It ) ->Option <Self ::Output >{Some (($(<$T as IterScan >::scan (_iter ) ?,) *) ) } } } ;}
    iter_scan_tuple_impl!();
    iter_scan_tuple_impl!(A);
    iter_scan_tuple_impl !(A B ) ;
    iter_scan_tuple_impl !(A B C ) ;
    iter_scan_tuple_impl !(A B C D ) ;
    iter_scan_tuple_impl !(A B C D E ) ;
    iter_scan_tuple_impl !(A B C D E F ) ;
    iter_scan_tuple_impl !(A B C D E F G ) ;
    iter_scan_tuple_impl !(A B C D E F G H ) ;
    iter_scan_tuple_impl !(A B C D E F G H I ) ;
    iter_scan_tuple_impl !(A B C D E F G H I J ) ;
    iter_scan_tuple_impl !(A B C D E F G H I J K ) ;
    pub struct ScannerIter<'a, 'b, T> {
        inner: &'b mut Scanner<'a>,
        _marker: std::marker::PhantomData<fn() -> T>,
    }
    impl<'a, 'b, T: IterScan> Iterator for ScannerIter<'a, 'b, T> {
        type Item = <T as IterScan>::Output;
        #[inline]
        fn next(&mut self) -> Option<Self::Item> {
            <T as IterScan>::scan(&mut self.inner.iter)
        }
    }
}
pub mod marker {
    use super::*;
    use std::{iter::FromIterator, marker::PhantomData};
    #[derive(Debug, Copy, Clone)]
    pub struct Usize1;
    impl IterScan for Usize1 {
        type Output = usize;
        #[inline]
        fn scan<'a, I: Iterator<Item = &'a str>>(iter: &mut I) -> Option<Self::Output> {
            Some(<usize as IterScan>::scan(iter)?.checked_sub(1)?)
        }
    }
    #[derive(Debug, Copy, Clone)]
    pub struct Chars;
    impl IterScan for Chars {
        type Output = Vec<char>;
        #[inline]
        fn scan<'a, I: Iterator<Item = &'a str>>(iter: &mut I) -> Option<Self::Output> {
            Some(iter.next()?.chars().collect())
        }
    }
    #[derive(Debug, Copy, Clone)]
    pub struct CharsWithBase(char);
    impl MarkedIterScan for CharsWithBase {
        type Output = Vec<usize>;
        #[inline]
        fn mscan<'a, I: Iterator<Item = &'a str>>(self, iter: &mut I) -> Option<Self::Output> {
            Some(
                iter.next()?
                    .chars()
                    .map(|c| (c as u8 - self.0 as u8) as usize)
                    .collect(),
            )
        }
    }
    #[derive(Debug, Copy, Clone)]
    pub struct Collect<T: IterScan, B: FromIterator<<T as IterScan>::Output>> {
        size: usize,
        _marker: PhantomData<fn() -> (T, B)>,
    }
    impl<T: IterScan, B: FromIterator<<T as IterScan>::Output>> Collect<T, B> {
        pub fn new(size: usize) -> Self {
            Self {
                size,
                _marker: PhantomData,
            }
        }
    }
    impl<T: IterScan, B: FromIterator<<T as IterScan>::Output>> MarkedIterScan for Collect<T, B> {
        type Output = B;
        #[inline]
        fn mscan<'a, I: Iterator<Item = &'a str>>(self, iter: &mut I) -> Option<Self::Output> {
            Some(
                (0..self.size)
                    .map(|_| <T as IterScan>::scan(iter).expect("scan error"))
                    .collect::<B>(),
            )
        }
    }
}
#[macro_export]
macro_rules !min {($e :expr ) =>{$e } ;($e :expr ,$($es :expr ) ,+) =>{std ::cmp ::min ($e ,min !($($es ) ,+) ) } ;}
#[macro_export]
macro_rules !chmin {($dst :expr ,$($src :expr ) ,+) =>{{let x =std ::cmp ::min ($dst ,min !($($src ) ,+) ) ;$dst =x ;} } ;}
#[macro_export]
macro_rules !max {($e :expr ) =>{$e } ;($e :expr ,$($es :expr ) ,+) =>{std ::cmp ::max ($e ,max !($($es ) ,+) ) } ;}
#[macro_export]
macro_rules !chmax {($dst :expr ,$($src :expr ) ,+) =>{{let x =std ::cmp ::max ($dst ,max !($($src ) ,+) ) ;$dst =x ;} } ;}
/// binary search helper
pub trait Bisect: Copy {
    /// return between two elements
    fn halve(self, other: Self) -> Self;
    /// the end condition of binary search
    fn section_end(self, other: Self) -> bool;
}
mod bisect_impl {
    use super::*;
    macro_rules !impl_bisect_unsigned {($($t :ty ) *) =>{$(impl Bisect for $t {fn halve (self ,other :Self ) ->Self {if self >other {other +(self -other ) /2 } else {self +(other -self ) /2 } } fn section_end (self ,other :Self ) ->bool {(if self >other {self -other } else {other -self } ) <=1 } } ) *} ;}
    macro_rules !impl_bisect_signed {($($t :ty ) *) =>{$(impl Bisect for $t {fn halve (self ,other :Self ) ->Self {(self +other ) /2 } fn section_end (self ,other :Self ) ->bool {(self -other ) .abs () <=1 } } ) *} ;}
    macro_rules !impl_bisect_float {($($t :ty ) *) =>{$(impl Bisect for $t {fn halve (self ,other :Self ) ->Self {(self +other ) /2. } fn section_end (self ,other :Self ) ->bool {(self -other ) .abs () <=1e-8 } } ) *} ;}
    impl_bisect_unsigned !(u8 u16 u32 u64 usize ) ;
    impl_bisect_signed !(i8 i16 i32 i64 isize ) ;
    impl_bisect_float !(f32 f64 ) ;
}
pub fn binary_search<T: Bisect, F: Fn(T) -> bool>(f: F, ok: T, err: T) -> T {
    let mut ok = ok;
    let mut err = err;
    while !ok.section_end(err) {
        let m = ok.halve(err);
        if f(m) {
            ok = m;
        } else {
            err = m;
        }
    }
    ok
}
pub fn lower_bound<T: Bisect + Ord>(v: &[T], x: T) -> usize {
    binary_search(|i| v[i as usize] >= x, v.len() as i64, -1) as usize
}
pub fn upper_bound<T: Bisect + Ord>(v: &[T], x: T) -> usize {
    binary_search(|i| v[i as usize] > x, v.len() as i64, -1) as usize
}
pub trait Float:
    Copy
    + Default
    + std::fmt::Display
    + std::str::FromStr
    + PartialEq
    + PartialOrd
    + Zero
    + One
    + std::ops::Add<Output = Self>
    + std::ops::Sub<Output = Self>
    + std::ops::Mul<Output = Self>
    + std::ops::Div<Output = Self>
    + std::ops::Neg<Output = Self>
    + std::ops::Rem<Output = Self>
{
    fn floor(self) -> Self;
    fn ceil(self) -> Self;
    fn round(self) -> Self;
    fn trunc(self) -> Self;
    fn fract(self) -> Self;
    fn abs(self) -> Self;
    fn signum(self) -> Self;
    fn copysign(self, sign: Self) -> Self;
    fn mul_add(self, a: Self, b: Self) -> Self;
    fn div_euclid(self, rhs: Self) -> Self;
    fn rem_euclid(self, rhs: Self) -> Self;
    fn powi(self, n: i32) -> Self;
    fn powf(self, n: Self) -> Self;
    fn sqrt(self) -> Self;
    fn exp(self) -> Self;
    fn exp2(self) -> Self;
    fn ln(self) -> Self;
    fn log(self, base: Self) -> Self;
    fn log2(self) -> Self;
    fn log10(self) -> Self;
    fn cbrt(self) -> Self;
    fn hypot(self, other: Self) -> Self;
    fn sin(self) -> Self;
    fn cos(self) -> Self;
    fn tan(self) -> Self;
    fn asin(self) -> Self;
    fn acos(self) -> Self;
    fn atan(self) -> Self;
    fn atan2(self, other: Self) -> Self;
    fn sin_cos(self) -> (Self, Self);
    fn exp_m1(self) -> Self;
    fn ln_1p(self) -> Self;
    fn sinh(self) -> Self;
    fn cosh(self) -> Self;
    fn tanh(self) -> Self;
    fn asinh(self) -> Self;
    fn acosh(self) -> Self;
    fn atanh(self) -> Self;
    fn is_nan(self) -> bool;
    fn is_infinite(self) -> bool;
    fn is_finite(self) -> bool;
    fn is_normal(self) -> bool;
    fn classify(self) -> std::num::FpCategory;
    fn is_sign_positive(self) -> bool;
    fn is_sign_negative(self) -> bool;
    fn recip(self) -> Self;
    fn to_degrees(self) -> Self;
    fn to_radians(self) -> Self;
    fn max(self, other: Self) -> Self;
    fn min(self, other: Self) -> Self;
    fn to_bits(self) -> u64;
    fn from_bits(v: u64) -> Self;
    fn total_cmp(&self, other: &Self) -> std::cmp::Ordering;
    const RADIX: u32;
    const MANTISSA_DIGITS: u32;
    const DIGITS: u32;
    const EPSILON: Self;
    const MIN: Self;
    const MIN_POSITIVE: Self;
    const MAX: Self;
    const MIN_EXP: i32;
    const MAX_EXP: i32;
    const MIN_10_EXP: i32;
    const MAX_10_EXP: i32;
    const NAN: Self;
    const INFINITY: Self;
    const NEG_INFINITY: Self;
    const PI: Self;
    const TAU: Self;
    const FRAC_PI_2: Self;
    const FRAC_PI_3: Self;
    const FRAC_PI_4: Self;
    const FRAC_PI_6: Self;
    const FRAC_PI_8: Self;
    const FRAC_1_PI: Self;
    const FRAC_2_PI: Self;
    const FRAC_2_SQRT_PI: Self;
    const SQRT_2: Self;
    const FRAC_1_SQRT_2: Self;
    const E: Self;
    const LOG2_E: Self;
    const LOG10_E: Self;
    const LN_2: Self;
    const LN_10: Self;
}
macro_rules !primitive_float_impls {($({$t :ident $i :ident $u :ident $e :expr } ) *) =>{$(impl Float for $t {fn floor (self ) ->Self {self .floor () } fn ceil (self ) ->Self {self .ceil () } fn round (self ) ->Self {self .round () } fn trunc (self ) ->Self {self .trunc () } fn fract (self ) ->Self {self .fract () } fn abs (self ) ->Self {self .abs () } fn signum (self ) ->Self {self .signum () } fn copysign (self ,sign :Self ) ->Self {self .copysign (sign ) } fn mul_add (self ,a :Self ,b :Self ) ->Self {self .mul_add (a ,b ) } fn div_euclid (self ,rhs :Self ) ->Self {self .div_euclid (rhs ) } fn rem_euclid (self ,rhs :Self ) ->Self {self .rem_euclid (rhs ) } fn powi (self ,n :i32 ) ->Self {self .powi (n ) } fn powf (self ,n :Self ) ->Self {self .powf (n ) } fn sqrt (self ) ->Self {self .sqrt () } fn exp (self ) ->Self {self .exp () } fn exp2 (self ) ->Self {self .exp2 () } fn ln (self ) ->Self {self .ln () } fn log (self ,base :Self ) ->Self {self .log (base ) } fn log2 (self ) ->Self {self .log2 () } fn log10 (self ) ->Self {self .log10 () } fn cbrt (self ) ->Self {self .cbrt () } fn hypot (self ,other :Self ) ->Self {self .hypot (other ) } fn sin (self ) ->Self {self .sin () } fn cos (self ) ->Self {self .cos () } fn tan (self ) ->Self {self .tan () } fn asin (self ) ->Self {self .asin () } fn acos (self ) ->Self {self .acos () } fn atan (self ) ->Self {self .atan () } fn atan2 (self ,other :Self ) ->Self {self .atan2 (other ) } fn sin_cos (self ) ->(Self ,Self ) {self .sin_cos () } fn exp_m1 (self ) ->Self {self .exp_m1 () } fn ln_1p (self ) ->Self {self .ln_1p () } fn sinh (self ) ->Self {self .sinh () } fn cosh (self ) ->Self {self .cosh () } fn tanh (self ) ->Self {self .tanh () } fn asinh (self ) ->Self {self .asinh () } fn acosh (self ) ->Self {self .acosh () } fn atanh (self ) ->Self {self .atanh () } fn is_nan (self ) ->bool {self .is_nan () } fn is_infinite (self ) ->bool {self .is_infinite () } fn is_finite (self ) ->bool {self .is_finite () } fn is_normal (self ) ->bool {self .is_normal () } fn classify (self ) ->std ::num ::FpCategory {self .classify () } fn is_sign_positive (self ) ->bool {self .is_sign_positive () } fn is_sign_negative (self ) ->bool {self .is_sign_negative () } fn recip (self ) ->Self {self .recip () } fn to_degrees (self ) ->Self {self .to_degrees () } fn to_radians (self ) ->Self {self .to_radians () } fn max (self ,other :Self ) ->Self {self .max (other ) } fn min (self ,other :Self ) ->Self {self .min (other ) } fn to_bits (self ) ->u64 {self .to_bits () .into () } fn from_bits (v :u64 ) ->Self {use std ::convert ::TryInto ;$t ::from_bits (v .try_into () .unwrap () ) } fn total_cmp (&self ,other :&Self ) ->std ::cmp ::Ordering {let mut left =self .to_bits () as $i ;let mut right =other .to_bits () as $i ;left ^=(((left >>$e ) as $u ) >>1 ) as $i ;right ^=(((right >>$e ) as $u ) >>1 ) as $i ;left .cmp (&right ) } const RADIX :u32 =std ::$t ::RADIX ;const MANTISSA_DIGITS :u32 =std ::$t ::MANTISSA_DIGITS ;const DIGITS :u32 =std ::$t ::DIGITS ;const EPSILON :Self =std ::$t ::EPSILON ;const MIN :Self =std ::$t ::MIN ;const MIN_POSITIVE :Self =std ::$t ::MIN_POSITIVE ;const MAX :Self =std ::$t ::MAX ;const MIN_EXP :i32 =std ::$t ::MIN_EXP ;const MAX_EXP :i32 =std ::$t ::MAX_EXP ;const MIN_10_EXP :i32 =std ::$t ::MIN_10_EXP ;const MAX_10_EXP :i32 =std ::$t ::MAX_10_EXP ;const NAN :Self =std ::$t ::NAN ;const INFINITY :Self =std ::$t ::INFINITY ;const NEG_INFINITY :Self =std ::$t ::NEG_INFINITY ;const PI :Self =std ::$t ::consts ::PI ;const TAU :Self =std ::$t ::consts ::PI *2.0 ;const FRAC_PI_2 :Self =std ::$t ::consts ::FRAC_PI_2 ;const FRAC_PI_3 :Self =std ::$t ::consts ::FRAC_PI_3 ;const FRAC_PI_4 :Self =std ::$t ::consts ::FRAC_PI_4 ;const FRAC_PI_6 :Self =std ::$t ::consts ::FRAC_PI_6 ;const FRAC_PI_8 :Self =std ::$t ::consts ::FRAC_PI_8 ;const FRAC_1_PI :Self =std ::$t ::consts ::FRAC_1_PI ;const FRAC_2_PI :Self =std ::$t ::consts ::FRAC_2_PI ;const FRAC_2_SQRT_PI :Self =std ::$t ::consts ::FRAC_2_SQRT_PI ;const SQRT_2 :Self =std ::$t ::consts ::SQRT_2 ;const FRAC_1_SQRT_2 :Self =std ::$t ::consts ::FRAC_1_SQRT_2 ;const E :Self =std ::$t ::consts ::E ;const LOG2_E :Self =std ::$t ::consts ::LOG2_E ;const LOG10_E :Self =std ::$t ::consts ::LOG10_E ;const LN_2 :Self =std ::$t ::consts ::LN_2 ;const LN_10 :Self =std ::$t ::consts ::LN_10 ;} ) *} ;}
primitive_float_impls !({f32 i32 u32 31 } {f64 i64 u64 63 } ) ;
macro_rules !ord_float_impls {($({$t :ident $n :ident } ) *) =>{$(#[derive (Debug ,Copy ,Clone ,PartialEq ,PartialOrd ,Default ) ] pub struct $n (pub $t ) ;impl std ::fmt ::Display for $n {fn fmt (&self ,f :&mut std ::fmt ::Formatter <'_ >) ->std ::fmt ::Result {<$t as std ::fmt ::Display >::fmt (&self .0 ,f ) } } impl std ::str ::FromStr for $n {type Err =std ::num ::ParseFloatError ;fn from_str (s :&str ) ->Result <Self ,Self ::Err >{<$t as std ::str ::FromStr >::from_str (s ) .map (Self ) } } impl From <$t >for $n {fn from (x :$t ) ->Self {Self (x ) } } impl Zero for $n {fn zero () ->Self {Self (<$t as Zero >::zero () ) } } impl One for $n {fn one () ->Self {Self (<$t as One >::one () ) } } impl std ::ops ::Add for $n {type Output =Self ;fn add (self ,rhs :Self ) ->Self ::Output {Self (<$t as std ::ops ::Add >::add (self .0 ,rhs .0 ) ) } } impl std ::ops ::Sub for $n {type Output =Self ;fn sub (self ,rhs :Self ) ->Self ::Output {Self (<$t as std ::ops ::Sub >::sub (self .0 ,rhs .0 ) ) } } impl std ::ops ::Mul for $n {type Output =Self ;fn mul (self ,rhs :Self ) ->Self ::Output {Self (<$t as std ::ops ::Mul >::mul (self .0 ,rhs .0 ) ) } } impl std ::ops ::Div for $n {type Output =Self ;fn div (self ,rhs :Self ) ->Self ::Output {Self (<$t as std ::ops ::Div >::div (self .0 ,rhs .0 ) ) } } impl std ::ops ::Neg for $n {type Output =Self ;fn neg (self ) ->Self ::Output {Self (<$t as std ::ops ::Neg >::neg (self .0 ) ) } } impl std ::ops ::Rem for $n {type Output =Self ;fn rem (self ,rhs :Self ) ->Self ::Output {Self (<$t as std ::ops ::Rem >::rem (self .0 ,rhs .0 ) ) } } impl Eq for $n {} impl Ord for $n {fn cmp (&self ,other :&Self ) ->std ::cmp ::Ordering {self .total_cmp (other ) } } impl Float for $n {fn floor (self ) ->Self {Self (<$t as Float >::floor (self .0 ) ) } fn ceil (self ) ->Self {Self (<$t as Float >::ceil (self .0 ) ) } fn round (self ) ->Self {Self (<$t as Float >::round (self .0 ) ) } fn trunc (self ) ->Self {Self (<$t as Float >::trunc (self .0 ) ) } fn fract (self ) ->Self {Self (<$t as Float >::fract (self .0 ) ) } fn abs (self ) ->Self {Self (<$t as Float >::abs (self .0 ) ) } fn signum (self ) ->Self {Self (<$t as Float >::signum (self .0 ) ) } fn copysign (self ,sign :Self ) ->Self {Self (<$t as Float >::copysign (self .0 ,sign .0 ) ) } fn mul_add (self ,a :Self ,b :Self ) ->Self {Self (<$t as Float >::mul_add (self .0 ,a .0 ,b .0 ) ) } fn div_euclid (self ,rhs :Self ) ->Self {Self (<$t as Float >::div_euclid (self .0 ,rhs .0 ) ) } fn rem_euclid (self ,rhs :Self ) ->Self {Self (<$t as Float >::rem_euclid (self .0 ,rhs .0 ) ) } fn powi (self ,n :i32 ) ->Self {Self (<$t as Float >::powi (self .0 ,n ) ) } fn powf (self ,n :Self ) ->Self {Self (<$t as Float >::powf (self .0 ,n .0 ) ) } fn sqrt (self ) ->Self {Self (<$t as Float >::sqrt (self .0 ) ) } fn exp (self ) ->Self {Self (<$t as Float >::exp (self .0 ) ) } fn exp2 (self ) ->Self {Self (<$t as Float >::exp2 (self .0 ) ) } fn ln (self ) ->Self {Self (<$t as Float >::ln (self .0 ) ) } fn log (self ,base :Self ) ->Self {Self (<$t as Float >::log (self .0 ,base .0 ) ) } fn log2 (self ) ->Self {Self (<$t as Float >::log2 (self .0 ) ) } fn log10 (self ) ->Self {Self (<$t as Float >::log10 (self .0 ) ) } fn cbrt (self ) ->Self {Self (<$t as Float >::cbrt (self .0 ) ) } fn hypot (self ,other :Self ) ->Self {Self (<$t as Float >::hypot (self .0 ,other .0 ) ) } fn sin (self ) ->Self {Self (<$t as Float >::sin (self .0 ) ) } fn cos (self ) ->Self {Self (<$t as Float >::cos (self .0 ) ) } fn tan (self ) ->Self {Self (<$t as Float >::tan (self .0 ) ) } fn asin (self ) ->Self {Self (<$t as Float >::asin (self .0 ) ) } fn acos (self ) ->Self {Self (<$t as Float >::acos (self .0 ) ) } fn atan (self ) ->Self {Self (<$t as Float >::atan (self .0 ) ) } fn atan2 (self ,other :Self ) ->Self {Self (<$t as Float >::atan2 (self .0 ,other .0 ) ) } fn sin_cos (self ) ->(Self ,Self ) {let (sin ,cos ) =<$t as Float >::sin_cos (self .0 ) ;(Self (sin ) ,Self (cos ) ) } fn exp_m1 (self ) ->Self {Self (<$t as Float >::exp_m1 (self .0 ) ) } fn ln_1p (self ) ->Self {Self (<$t as Float >::ln_1p (self .0 ) ) } fn sinh (self ) ->Self {Self (<$t as Float >::sinh (self .0 ) ) } fn cosh (self ) ->Self {Self (<$t as Float >::cosh (self .0 ) ) } fn tanh (self ) ->Self {Self (<$t as Float >::tanh (self .0 ) ) } fn asinh (self ) ->Self {Self (<$t as Float >::asinh (self .0 ) ) } fn acosh (self ) ->Self {Self (<$t as Float >::acosh (self .0 ) ) } fn atanh (self ) ->Self {Self (<$t as Float >::atanh (self .0 ) ) } fn is_nan (self ) ->bool {<$t as Float >::is_nan (self .0 ) } fn is_infinite (self ) ->bool {<$t as Float >::is_infinite (self .0 ) } fn is_finite (self ) ->bool {<$t as Float >::is_finite (self .0 ) } fn is_normal (self ) ->bool {<$t as Float >::is_normal (self .0 ) } fn classify (self ) ->std ::num ::FpCategory {<$t as Float >::classify (self .0 ) } fn is_sign_positive (self ) ->bool {<$t as Float >::is_sign_positive (self .0 ) } fn is_sign_negative (self ) ->bool {<$t as Float >::is_sign_negative (self .0 ) } fn recip (self ) ->Self {Self (<$t as Float >::recip (self .0 ) ) } fn to_degrees (self ) ->Self {Self (<$t as Float >::to_degrees (self .0 ) ) } fn to_radians (self ) ->Self {Self (<$t as Float >::to_radians (self .0 ) ) } fn max (self ,other :Self ) ->Self {Self (<$t as Float >::max (self .0 ,other .0 ) ) } fn min (self ,other :Self ) ->Self {Self (<$t as Float >::min (self .0 ,other .0 ) ) } fn to_bits (self ) ->u64 {<$t as Float >::to_bits (self .0 ) } fn from_bits (v :u64 ) ->Self {Self (<$t as Float >::from_bits (v ) ) } fn total_cmp (&self ,other :&Self ) ->std ::cmp ::Ordering {<$t as Float >::total_cmp (&self .0 ,&other .0 ) } const RADIX :u32 =<$t as Float >::RADIX ;const MANTISSA_DIGITS :u32 =<$t as Float >::MANTISSA_DIGITS ;const DIGITS :u32 =<$t as Float >::DIGITS ;const EPSILON :Self =Self (<$t as Float >::EPSILON ) ;const MIN :Self =Self (<$t as Float >::MIN ) ;const MIN_POSITIVE :Self =Self (<$t as Float >::MIN_POSITIVE ) ;const MAX :Self =Self (<$t as Float >::MAX ) ;const MIN_EXP :i32 =<$t as Float >::MIN_EXP ;const MAX_EXP :i32 =<$t as Float >::MAX_EXP ;const MIN_10_EXP :i32 =<$t as Float >::MIN_10_EXP ;const MAX_10_EXP :i32 =<$t as Float >::MAX_10_EXP ;const NAN :Self =Self (<$t as Float >::NAN ) ;const INFINITY :Self =Self (<$t as Float >::INFINITY ) ;const NEG_INFINITY :Self =Self (<$t as Float >::NEG_INFINITY ) ;const PI :Self =Self (<$t as Float >::PI ) ;const TAU :Self =Self (<$t as Float >::TAU ) ;const FRAC_PI_2 :Self =Self (<$t as Float >::FRAC_PI_2 ) ;const FRAC_PI_3 :Self =Self (<$t as Float >::FRAC_PI_3 ) ;const FRAC_PI_4 :Self =Self (<$t as Float >::FRAC_PI_4 ) ;const FRAC_PI_6 :Self =Self (<$t as Float >::FRAC_PI_6 ) ;const FRAC_PI_8 :Self =Self (<$t as Float >::FRAC_PI_8 ) ;const FRAC_1_PI :Self =Self (<$t as Float >::FRAC_1_PI ) ;const FRAC_2_PI :Self =Self (<$t as Float >::FRAC_2_PI ) ;const FRAC_2_SQRT_PI :Self =Self (<$t as Float >::FRAC_2_SQRT_PI ) ;const SQRT_2 :Self =Self (<$t as Float >::SQRT_2 ) ;const FRAC_1_SQRT_2 :Self =Self (<$t as Float >::FRAC_1_SQRT_2 ) ;const E :Self =Self (<$t as Float >::E ) ;const LOG2_E :Self =Self (<$t as Float >::LOG2_E ) ;const LOG10_E :Self =Self (<$t as Float >::LOG10_E ) ;const LN_2 :Self =Self (<$t as Float >::LN_2 ) ;const LN_10 :Self =Self (<$t as Float >::LN_10 ) ;} ) *} ;}
ord_float_impls !({f32 Float32 } {f64 Float64 } ) ;
fn main() {
    #![allow(unused_imports, unused_macros)]
    use std::io::{stdin, stdout, BufWriter, Read as _, Write as _};
    let mut _in_buf = Vec::new();
    stdin().read_to_end(&mut _in_buf).expect("io error");
    let _in_buf = unsafe { String::from_utf8_unchecked(_in_buf) };
    let mut scanner = Scanner::new(&_in_buf);
    macro_rules !scan {() =>{scan !(usize ) } ;(($($t :tt ) ,*) ) =>{($(scan !($t ) ) ,*) } ;([$t :ty ;$len :expr ] ) =>{scanner .scan_vec ::<$t >($len ) } ;([$t :tt ;$len :expr ] ) =>{(0 ..$len ) .map (|_ |scan !($t ) ) .collect ::<Vec <_ >>() } ;([$t :ty ] ) =>{scanner .iter ::<$t >() } ;({$e :expr } ) =>{scanner .mscan ($e ) } ;($t :ty ) =>{scanner .scan ::<$t >() } ;}
    let _out = stdout();
    let mut _out = BufWriter::new(_out.lock());
    macro_rules !print {($($arg :tt ) *) =>(::std ::write !(_out ,$($arg ) *) .expect ("io error" ) ) }
    macro_rules !println {($($arg :tt ) *) =>(::std ::writeln !(_out ,$($arg ) *) .expect ("io error" ) ) }
    macro_rules! echo {
        ($iter :expr ) => {
            echo!($iter, '\n')
        };
        ($iter :expr ,$sep :expr ) => {
            let mut iter = $iter.into_iter();
            if let Some(item) = iter.next() {
                print!("{}", item);
            }
            for item in iter {
                print!("{}{}", $sep, item);
            }
            println!();
        };
    }
    let xy = scan!([(f64, f64); 3]);
    let e: Vec<_> = (0..3)
        .map(|i| (xy[i].0 - xy[(i + 1) % 3].0).powi(2) + (xy[i].1 - xy[(i + 1) % 3].1).powi(2))
        .map(|e| (e as f64).sqrt())
        .collect();
    let mx = e
        .iter()
        .max_by(|x, y| x.total_cmp(y))
        .cloned()
        .unwrap_or_default();
    let s = ((xy[1].0 - xy[0].0) * (xy[2].1 - xy[0].1) - (xy[2].0 - xy[0].0) * (xy[1].1 - xy[0].1))
        .abs()
        / 2.;
    let r = 2. * s / e.iter().sum::<f64>();
    let ans = binary_search(|x| x * 2. <= mx * (1. - x / r), 0., 1000.);
    println!("{}", ans);
}