fork(1) download 
  1. import time
  2. N = 1
  3. while N < 20000:
  4. 	A = [0]*N
  5. 	b = []
  6. 	start_time = time.time()
  7. 	for i in range(N):
  8. 		A[:] = A[-1:]+A[:-1]
  9. 		b.append(A[0]+A[N-1])
  10. 	end_time = time.time()
  11. 	print(max(b),N,end_time-start_time)
  12. 	N *= 2
Success #stdin #stdout 5.86s 9668KB
comments (?)
stdin 
Standard input is empty
stdout 
0 1 4.0531158447265625e-06
0 2 3.5762786865234375e-06
0 4 4.0531158447265625e-06
0 8 6.198883056640625e-06
0 16 1.239776611328125e-05
0 32 3.409385681152344e-05
0 64 8.344650268554688e-05
0 128 0.0002963542938232422
0 256 0.0010156631469726562
0 512 0.0037641525268554688
0 1024 0.014406681060791016
0 2048 0.05715584754943848
0 4096 0.23920106887817383
0 8192 1.0144805908203125
0 16384 4.532206058502197
https://ideone.com/yKN3Qe
language:
Python 3 nbc (python 3.7.3)
created:
3 years ago
visibility:
secret

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!