{"blog_url":"https://tnn-jp.hatenadiary.org/","author_name":"tnn-jp","image_url":null,"type":"rich","url":"https://tnn-jp.hatenadiary.org/entry/20100122/1264110702","blog_title":"tnn-jp.hatenadiary","categories":["AIZU Online Judge","C/C++"],"provider_url":"https://hatena.blog","title":"\u300eACM/ICPC\u56fd\u5185\u4e88\u9078\u7a81\u7834\u306e\u624b\u5f15\u304d\u300f\u3092\u3084\u3063\u3066\u307f\u308b\uff08\uff14\uff09","version":"1.0","author_url":"https://blog.hatena.ne.jp/tnn-jp/","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Ftnn-jp.hatenadiary.org%2Fentry%2F20100122%2F1264110702\" title=\"\u300eACM/ICPC\u56fd\u5185\u4e88\u9078\u7a81\u7834\u306e\u624b\u5f15\u304d\u300f\u3092\u3084\u3063\u3066\u307f\u308b\uff08\uff14\uff09 - tnn-jp.hatenadiary\" class=\"embed-card embed-blogcard\" scrolling=\"no\" frameborder=\"0\" style=\"display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;\"></iframe>","height":"190","provider_name":"Hatena Blog","published":"2010-01-22 06:51:42","width":"100%","description":"ACM/ICPC\u56fd\u5185\u4e88\u9078\u7a81\u7834\u306e\u624b\u5f15\u304d\u201dStep by step\u201d\u306e\u96e3\u6613\u5ea6\uff1a\u2606\u2606\u7d42\u308f\u308a\u3002 Problem 1131 : Unit Fraction Partition \u96e3\u6613\u5ea6 : \u2606\u2606 \u7a2e\u985e : \u63a2\u7d22 \u5206\u6bcd\u306e\u7d44\u307f\u5408\u308f\u305b\u3092\u8a66\u3057\u3066\u3044\u304f\u3002 \u3067\u3082\u3001\u306f\u3058\u3081\u3055\u3063\u3071\u308a\u3060\u3063\u305f\u3002\u89e3\u8aac\u3092\u898b\u3066\u304b\u3089\u5b9f\u88c5\u3002 #include <iostream> using namespace std; int p, q, a, n; int solve( int i, int last, int prod, int c, int d ) { if( c*q == d*p ) return 1; if( i >= n ) return \u2026"}