Removed outdated comment

2020-08-24 08:06:37 +03:00
parent aa84e27e3d
commit 0a5a74ef89
1 changed files with 0 additions and 4 deletions
@@ -70,10 +70,6 @@ open class EulerBenchmark {
            for (j in minDiv..maxDiv) {
                if (i % j == 0L) {
                    val res = i / j
-                    // Without toLong() here we have a real nightmare...
-                    // in is resolved to Iterable<Int>.contains(Long)
-                    // which has O(N) complexity and always gives false
-                    // See KT-6978, KT-6950, KT-6361
                    if (res in minDiv.toLong()..maxDiv.toLong()) {
                        return i
                    }