mikeda https://blog.hatena.ne.jp/mikeda/ mikedaの日記 https://mikeda.hatenablog.com/ ruby http://code.nanigac.com/source/view/709 def primeList num return [] if num < 2 arr = (2..num).to_a primes = [] begin primes << (p = arr.shift) arr.reject!{|i| i%p == 0} end while p**2 < arr.last primes + arr end puts primeList(100) ほんとにこれでだいじょうぶなのか・・・ 190 <iframe src="https://hatenablog-parts.com/embed?url=https%3A%2F%2Fmikeda.hatenablog.com%2Fentry%2F20090131%2F1233419337" title="n以下の素数のリストを作る - mikedaの日記" 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 2009-01-31 01:28:57 rich https://mikeda.hatenablog.com/entry/20090131/1233419337 1.0 100%