@@ -0,0 +1,619 @@
+import java.util.*;%0A%0A@SuppressWarnings(%22unused%22)%0Apublic class P058 implements Puzzle %7B%0A%0A    @Override%0A    public String solve() %7B%0A        final BitSet primes = Util.primesBits(1_000_000_000);%0A%0A        int n = 1;%0A        int primeCount = 0;%0A%0A        for (int i = 0; ; ++i) %7B%0A            final int inc = (i / 4 + 1) * 2;%0A            final double primeRatio = (double) primeCount / (i + 1);%0A%0A            if (primeRatio %3C 0.1 && inc %3E 3 && i %25 4 == 0) %7B%0A                return %22%22 + (inc - 1);%0A            %7D%0A            if (primes.get(n)) %7B%0A                ++primeCount;%0A            %7D%0A            n += inc;%0A        %7D%0A    %7D%0A%7D

add 58