We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent 5959958 commit 0039a4eCopy full SHA for 0039a4e
divisors.py
@@ -0,0 +1,8 @@
1
+def find(n):
2
+ z = 0
3
+ for i in range(1, n+1):
4
+ if i % 3 == 0 or i % 5 == 0:
5
+ z += i
6
+ return z
7
+
8
+find(10)
0 commit comments