From 454aedd51fb335315ac1bee11123b9395e8190f6 Mon Sep 17 00:00:00 2001 From: AthaSSiN Date: Mon, 7 Oct 2019 18:37:23 +0530 Subject: [PATCH] Added an efficient method to find primes --- .../HackerEarth/Basics_Of_Input_Output/P04_PrimeNumber.py | 6 ++++-- 1 file changed, 4 insertions(+), 2 deletions(-) diff --git a/CompetitiveProgramming/HackerEarth/Basics_Of_Input_Output/P04_PrimeNumber.py b/CompetitiveProgramming/HackerEarth/Basics_Of_Input_Output/P04_PrimeNumber.py index 28d4de9..050e516 100644 --- a/CompetitiveProgramming/HackerEarth/Basics_Of_Input_Output/P04_PrimeNumber.py +++ b/CompetitiveProgramming/HackerEarth/Basics_Of_Input_Output/P04_PrimeNumber.py @@ -12,10 +12,12 @@ # Constraints # 1 <= N <=1000 +import math + userInput = int(input()) -for i in range(2, userInput): +for i in range(2, userInput + 1): check = 0 - for j in range(2, i): + for j in range(2, int(math.sqrt(i))+ 1): if i % j == 0: check = 1 break