{"published":"2023-02-14 07:54:00","categories":[],"height":"190","blog_title":"inamori\u2019s diary","author_url":"https://blog.hatena.ne.jp/inamori/","url":"https://inamori.hateblo.jp/entry/2023/02/14/075400","provider_url":"https://hatena.blog","width":"100%","author_name":"inamori","title":"\u30a2\u30eb\u30b4\u30ea\u30ba\u30e0\u3068\u6570\u5b66 034","description":"https://atcoder.jp/contests/math-and-algorithm/tasks/math_and_algorithm_af\u7dcf\u5f53\u305f\u308a\u3067OK\u3067\u3059\u306d\u3002 f64\u306fmin\u3092\u53d6\u308b\u306e\u304c\u9762\u5012\u3067\u3001fold\u3092\u4f7f\u3048\u3070\u53ef\u80fd\u3067\u3059\u304c\u3001 fold(f64::MAX, f64::min) \u304cAtCoder\u3067\u306f\u901a\u3089\u306a\u304f\u3066\u3001f64::MAX\u306e\u4ee3\u308f\u308a\u306b1e7\u3068\u3057\u307e\u3057\u305f\u3002 // Nearest Points #![allow(non_snake_case)] use std::ops::Sub; //////////////////// library //////////////////// fn rea\u2026","type":"rich","provider_name":"Hatena Blog","image_url":null,"html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Finamori.hateblo.jp%2Fentry%2F2023%2F02%2F14%2F075400\" title=\"\u30a2\u30eb\u30b4\u30ea\u30ba\u30e0\u3068\u6570\u5b66 034 - inamori\u2019s diary\" class=\"embed-card embed-blogcard\" scrolling=\"no\" frameborder=\"0\" style=\"display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;\"></iframe>","version":"1.0","blog_url":"https://inamori.hateblo.jp/"}