Improved Code and removed Warnings (#483)

Project Euler/Problem 07/sol1.py

@@ -16,7 +16,7 @@ def isprime(n):
             if(n%i==0):
                 return False
     return True
-n = int(input())
+n = int(raw_input())
 i=0
 j=1
 while(i!=n and j<3):

Project Euler/Problem 07/sol2.py

@@ -4,7 +4,7 @@ def isprime(number):
 		if number%i==0:
 			return False
 	return True
-n = int(input('Enter The N\'th Prime Number You Want To Get: ')) # Ask For The N'th Prime Number Wanted
+n = int(raw_input('Enter The N\'th Prime Number You Want To Get: ')) # Ask For The N'th Prime Number Wanted
 primes = []
 num = 2
 while len(primes) < n: