Added an efficient method to find primes (#8)

Author: AthaSSiN

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