package main

import "fmt"

func main() {
    a := 19019
    b := 8439284
    ret := minStep2(a, b)
    fmt.Println(ret)
}

func minStep2(a, b int) int {
    if a == b {
        return 0
    }
    s := a - b
    if s < 0 {
        s = -s
    }
    // 找到sum >= s, 最小的i
    begin := best(s << 1)
    for (begin*(begin+1)/2-s)%2 != 0 {
        begin++
    }
    return begin
}

func best(s2 int) int {
    L := 0
    R := 1
    for R*(R+1) < s2 {
        L = R
        R *= 2
    }
    ans := 0
    for L <= R {
        M := (L + R) / 2
        if M*(M+1) >= s2 {
            ans = M
            R = M - 1
        } else {
            L = M + 1
        }
    }
    return ans
}