fork download
copy 
  1. x = [1,0,1,2,10,5]
  2. k = 3
  3. prefix = [0] * len(x)
  4.  
  5. prefix[0] = x[0]
  6.  
  7. for i in range(1, len(x)):
  8. 	prefix[i] = prefix[i-1]+x[i]
  9.  
  10. count = 0
  11. for j in range(1, len(x)):
  12. 	for i in range(0, j):
  13. 		if prefix[i] == prefix[j]-k:
  14. 			count+=1
  15. print(count)
Success #stdin #stdout 0.07s 14052KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
2
https://ideone.com/PFCDEg
language:
Python 3 (python  3.12)
created:
7 hours 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!