fork download
  1. n = 4562;
  2. rev = 0
  3. new= []
  4. m = 0
  5.  
  6. def convert(n,m):
  7. print "round #:", m,"n :", n
  8. a = ((n+1) % 3)-1
  9. if n:
  10. new.append(a); print 'new :', new
  11. convert((n+1)//3,m+1)
  12. else:
  13. print 'n==',n, 'new: ::: ', new
  14. return new
  15.  
  16. print convert(n,m), "<<---- None returned ? "
  17.  
  18. sum = 0
  19.  
  20. def value(l):
  21. sum = 0
  22. for i in range(0, len(new),1):
  23. sum += new[i]*(3**i)
  24. print "sum :" , sum
  25. return sum
  26.  
  27. print value(new), "<<---- Value is returned "
  28.  
  29.  
Success #stdin #stdout 0.02s 7284KB
stdin
Standard input is empty
stdout
round #: 0 n : 4562
new : [-1]
round #: 1 n : 1521
new : [-1, 0]
round #: 2 n : 507
new : [-1, 0, 0]
round #: 3 n : 169
new : [-1, 0, 0, 1]
round #: 4 n : 56
new : [-1, 0, 0, 1, -1]
round #: 5 n : 19
new : [-1, 0, 0, 1, -1, 1]
round #: 6 n : 6
new : [-1, 0, 0, 1, -1, 1, 0]
round #: 7 n : 2
new : [-1, 0, 0, 1, -1, 1, 0, -1]
round #: 8 n : 1
new : [-1, 0, 0, 1, -1, 1, 0, -1, 1]
round #: 9 n : 0
n== 0 new: :::  [-1, 0, 0, 1, -1, 1, 0, -1, 1]
[-1, 0, 0, 1, -1, 1, 0, -1, 1] <<---- None returned ? 
sum : -1
sum : -1
sum : -1
sum : 26
sum : -55
sum : 188
sum : 188
sum : -1999
sum : 4562
4562 <<---- Value is returned