fork download
copy 
  1. # your code goes here
  2. def InversionCount(a,n):
  3. 	count = 0
  4. 	for i in range(len(a)):
  5. 		for j in range(i+1,len(a)):
  6. 			if a[i]>a[j]:
  7. 				count+=1
  8. 	return count
  9. a = list(map(int,input().split()))
  10. print(InversionCount(a,len(a)))
  11.  
  12.  
Success #stdin #stdout 0.09s 14164KB
comments (?)
stdin
copy 
5 5 5 5 5 5
stdout
copy 
0
https://ideone.com/2bdPgL
language:
Python 3 (python  3.12)
created:
9 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!