{"author_url":"https://blog.hatena.ne.jp/peryaudo/","blog_url":"https://peryaudo.hatenablog.com/","published":"2010-08-16 21:27:59","url":"https://peryaudo.hatenablog.com/entry/20100816/1281961679","width":"100%","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Fperyaudo.hatenablog.com%2Fentry%2F20100816%2F1281961679\" title=\"AOJ 0046 Differential - \u30da\u30ea\u30e3\u30a6\u30c9\u306e\u65e5\" class=\"embed-card embed-blogcard\" scrolling=\"no\" frameborder=\"0\" style=\"display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;\"></iframe>","image_url":null,"provider_url":"https://hatena.blog","title":"AOJ 0046 Differential","description":"404 Not Found #include <vector> #include <cstdio> #include <algorithm> using namespace std; int main() { double n; vector<double> v; while(~scanf(\"%lf\", &n)) v.push_back(n); sort(v.begin(), v.end()); printf(\"%.1lf\\n\", *v.rbegin() - *v.begin()); return 0; }","height":"190","provider_name":"Hatena Blog","type":"rich","version":"1.0","categories":["Programming","Algorithm","AOJ"],"blog_title":"\u30da\u30ea\u30e3\u30a6\u30c9\u306e\u65e5","author_name":"peryaudo"}