I’ve been trying for a while but maybe me being a novice might be the issue.
The code is :
import sys
import numpy
def magic_summation(n, seed = None):
### DO NOT REMOVE OR CHANGE THE COMMAND BELOW
### AS IT WON'T BE POSSIBLE TO CORRECTLY GRADE YOUR SOLUTION
numpy.random.seed(seed)
if n <= 2:
raise ValueError('n cannot be less than or equal to 2')
elif not isinstance(n,int):
raise TypeError("n must be an integer")
magic_list = range(1,n+1)
indices_to_remove = set([int(numpy.random.random() * n) + 1 for _ in range(int(numpy.random.random() * n) + 1)])
if len(indices_to_remove) == len(magic_list):
print "Magic summation is equal to 0."
return 0
def iterator():
for idx in indices_to_remove:
if idx < len(magic_list):
del magic_list[idx]
for i in range(len(magic_list)):
if i < len(magic_list) - 1:
magic_list[i] = magic_list[i+1]/magic_list[i]
for el in magic_list:
yield el
it = iterator()
magic_summation = 0
while True:
try:
magic_summation += it.next()
except StopIteration:
break
print "Magic summation is equal to: {0}.".format(magic_summation)
return magic_summation
I tried different things but in the end the code’s logic change whatsoever. I kept the code restricted to Integer based structure, but the code deviated completely from the expected result. I gave it different arguments, for instance n = 15 and seed = 46. The parent (above) returns 25, while my code returns 22.
