Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
ванечка с тебя 200 рублей, жду мой сладкий 🤑
#python 3.6.9 n=10; s=0; i = 1 A = [2,7,3,12,6,10,13,8,3,5] while i <= n-1: if(A[i] > A[i-1]): A[i] = 2*A[i]-A[i-1] s += A[i] i+=1 print(s)
run
|
edit
|
history
|
help
0
My code 4
Game2
Reverse linked-list in-place
Breadth-First Path Finding
Rene
PyTempConvDIP
Swapping.py
Asdf
"Hello,world!"
Simple calculator