Merge branch 'patch-12' of git://github.com/SandersLin/Python

project_euler/problem_12/sol1.py

@@ -30,7 +30,9 @@ def count_divisors(n):
 	for i in xrange(1, int(sqrt(n))+1):
 		if n%i == 0:
 			nDivisors += 2
-
+	#check if n is perfect square 
+	if n**0.5 == int(n**0.5): 
+        	nDivisors -= 1
 	return nDivisors
 
 tNum = 1
@@ -43,4 +45,4 @@ while True:
 	if count_divisors(tNum) > 500:
 		break
 
-print(tNum)
+print(tNum)