jeneshicc https://blog.hatena.ne.jp/jeneshicc/ 落書き、時々落学 https://jeneshicc.hatenadiary.org/ Project Euler Haskell 前門と同じような考え方。むしろこっちのほうが簡単だと思う。 choose n r = div (product [n-r+1..n]) $ product [1..r] replace m n = sum[choose (n+t-t*m) t | t<-[1..div n m]] main = print.sum.zipWith replace [2,3,4] $ repeat 50 190 <iframe src="https://hatenablog-parts.com/embed?url=https%3A%2F%2Fjeneshicc.hatenadiary.org%2Fentry%2F20081128%2F1227874221" title="Problem 116 - 落書き、時々落学" class="embed-card embed-blogcard" scrolling="no" frameborder="0" style="display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;"></iframe> Hatena Blog https://hatena.blog 2008-11-28 21:10:21 rich https://jeneshicc.hatenadiary.org/entry/20081128/1227874221 1.0 100%