Return to Answer

added 33 characters in body

edited Jun 24, 2017 at 15:17

edited Jun 24, 2017 at 15:17

Python 3, (削除) 69 (削除ここまで) 63(削除) 63 (削除ここまで) 59 bytes

4 bytes thanks to Dennis.

f=lambda n:n-1and max(j for j in range(1,n)if n%j<1)+f(n-1)or 0

I set the recursion limit to 2000 for this to work for 1000.

f=lambda n:n-1and max(j for j in range(1,n)if n%j<1)+f(n-1)or 0

I set the recursion limit to 2000 for this to work for 1000.

4 bytes thanks to Dennis.

f=lambda n:n-1and max(j for j in range(1,n)if n%j<1)+f(n-1)

I set the recursion limit to 2000 for this to work for 1000.

added 92 characters in body

edited Jun 24, 2017 at 12:17

edited Jun 24, 2017 at 12:17

lambdaf=lambda n:sum(n-1and max(j for j in range(1,in)if i%j<1n%j<1)for i in range+f(2,n+1)n-1)or 0

I set the recursion limit to 2000 for this to work for 1000.

lambda n:sum(max(j for j in range(1,i)if i%j<1)for i in range(2,n+1))

f=lambda n:n-1and max(j for j in range(1,n)if n%j<1)+f(n-1)or 0

I set the recursion limit to 2000 for this to work for 1000.

answered Jun 24, 2017 at 11:30

answered Jun 24, 2017 at 11:30

lambda n:sum(max(j for j in range(1,i)if i%j<1)for i in range(2,n+1))