You are viewing a single comment's thread. Return to all comments →
def divisors(n): i=1 c=0 while(i*i<=n): if n%i == 0: if i%2==0: c+=1 if i*i !=n: if((n/i)%2==0): c+=1 i+=1 return c
Seems like cookies are disabled on this browser, please enable them to open this website
Sherlock and Divisors
You are viewing a single comment's thread. Return to all comments →
def divisors(n): i=1 c=0 while(i*i<=n): if n%i == 0: if i%2==0: c+=1 if i*i !=n: if((n/i)%2==0): c+=1
i+=1
return c