Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
EJ_2_python_20.068.214-9_20.116.927-5
N=int(input()) if (N < 1) or (N > 101): N=int(input()) listaValores =[] valores=0 for i in range(N): valores = int(input()) listaValores.append(valores) print('LOS',N,'VALORES LEIDOS FUERON: {', end = '') i=0 while i < len(listaValores): if i == 0 : print( listaValores[i], end='') else : print(';', listaValores[i], end ='' ) i +=1 print('}')
run
|
edit
|
history
|
help
0
fb_series
hi
BinarySearchTree implementation in Python 3.5.2
Python3 complete func.
Python.py
shuru8
DuckTyping.py
Интересный Python - Вопрос 1
Faiha - Lesson 8
calucation