usinglight

f=open('data2.txt','r')
rows =[]
fsum=0
for line in f:
	row = line.split()
	row=[int(i) for i in row]
	for i in range(len(row)):
		for j in range(len(row)):
			if i!=j:
				if (row[i]/row[j])==(row[i]//row[j]):

usinglight

f=open('data2.txt','r')
rows =[]
fsum=0
for line in f:
	row = line.split()
	row=[int(i) for i in row]
	print(max(row))
	print(min(row))
	fsum+=(max(row)-min(row))
	rows.append(row)

usinglight

Keybase proof

I hereby claim:

• I am usinglight on github.
• I am stefanst (https://keybase.io/stefanst) on keybase.
• I have a public key ASBYvJSaa-PoPywKEqNgXS_PVDV2h8ZW6S77P6Ug6yRG0Qo

To claim this, I am signing this object: