Update solution for 소수_구하기 w/ id 6711667

Time: 792ms
MemUsage: 46608KB

baekjoon/소수_구하기/solution_6711667.py

@@ -0,0 +1,7 @@
+M,N = map(int,input().split())
+bool_prime= [False]*2 + [True]*(N-1)
+for idx,b in enumerate(bool_prime[:int(N**0.5)+1]) :
+    if b :
+        for j in range(idx**2,N+1,idx) :
+            bool_prime[j]=False
+print("\n".join(str(idx+M) for idx,b in enumerate(bool_prime[M:]) if b))