Solution: GoroSort (Google Code Jam 2011 Qualification Round Problem D)

Ds.py

import sys

fin = file(sys.argv[1])
fout = open(sys.argv[2], 'w')
lines = fin.readlines()
goros0 = [map(int, line.split()) for line in lines]
goros = []
tests = goros0.pop(0)

for i in range(1, len(goros0), 2):
	goros.append(goros0[i])

data = []

for i in range(len(goros)):
	sg = list(goros[i])
	sg.sort()
	c0 = 0
	for j in range(len(goros[i])):
		if (sg[j] != goros[i][j]):
			c0 += 1
	data.append(c0)

for i in range(len(data)):
	fout.write("Case #%d: %d\n" % ((i + 1), data[i]))