Anonymous user
Square-free integers: Difference between revisions
→{{header|Kotlin}}: minor improvements
m (→{{header|FreeBASIC}}: changed indents) |
(→{{header|Kotlin}}: minor improvements) |
||
Line 596:
if (p2 > limit) break
for (i in p2..limit step 2 * p) c[i.toInt()] = true
do { p += 2 } while (
}
for (i in
if (!c[i.toInt()])
primes.add(i)
return primes
}
fun squareFree(
val
val results = mutableListOf<Long>()
outer@ for (i in
for (p in primes) {
val p2 = p * p
Line 624 ⟶ 619:
}
const val TRILLION =
fun main(args: Array<String>) {
println("Square-free integers from 1 to 145:")
▲ System.out.printf("%4d", sf[i])
}
println("\n\nSquare-free integers from $TRILLION to ${TRILLION + 145}:")
}
println("\n\nNumber of square-free integers:\n")
out(1, 100)
out(1, 1000)
out(1, 10_000)
out(1, 100_000)
out(1, 1000_000)
}</lang>
|