fork download
copy 
  1. # 0JvQtdGJ0LXQvdC60L4=
  2. def dec_converter(val, base=16):
  3.     digits = '0123456789ABCDEFGH'
  4.     dig = list(digits)
  5.     out = ''
  6.  
  7.     if val == 0:
  8.         return '0'
  9.  
  10.  
  11.     while val > 0:
  12.         val, zal = divmod(val, base)
  13.         out = dig[zal] + out
  14.     return out
  15.  
  16.  
  17. print(dec_converter(5000, 64))
  18.  
  19. # програма яка шукає таку цифру, яка буде дорівнювати сумі цифр отриманого квадрату цієї цифри
  20.  
  21. for n in range(1, 100):
  22.     n_str = str(n)
  23.     digits = []
  24.     for d in n_str:
  25.         digits.append(int(d))
  26.     s = 0
  27.     for digit in digits:
  28.         s += digit
  29.     if n == s**2:
  30.         print('num is founded!',n)
  31.  
  32. ######
  33.  
  34. def flatten(L):
  35. 	for val in L:
  36. 		if (isinstance(val, list)):
  37. 			flatten(val)
  38. 		else:
  39. 			print(val)
  40.  
  41. ar =[[2,3,4], [3,[22, 55, [333]]]]
  42. flatten(ar)
  43.  
  44. # числа фібоначі
  45.  
  46. def fib(n):
  47. 	if n==1 or n==2:
  48. 		return(1)
  49. 	else:
  50. 		return (fib(n-1)+fib(n-2))
  51.  
  52.  
  53. print(fib(4))	
  54.  
  55.  
  56. #Оладьи
  57.  
  58. def ne(i,j):
  59. 	s=i+j
  60. 	if k>3:
  61. 		return 6-k
  62. 	return k
  63. def task (n,i,j):
  64. 	if n==1:
  65. 		print("(",i,"->",j,") ",end=" ")
  66. 		return()
  67. 	return(task(n-1,i,ne(i,j))+task(1,i,j)+task(n-1,ne(i,j),j))
  68.  
  69.  
  70.  
  71.  
Success #stdin #stdout 0.09s 14036KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
1E8
num is founded! 1
num is founded! 81
2
3
4
3
22
55
333
3
https://ideone.com/D8H5FF
language:
Python 3 (python  3.12)
created:
2 days ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!