Crazy Rows(2009 Round2 A)

#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <cstring>
#include <set>
#include <cmath>
#include <map>
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
const int MN = 65005;
const int MAXN = 1000005;
const int INF = 0x3f3f3f3f;
#define IOS ios::sync_with_stdio(false);
typedef pair<int, int> P;


int n;
int s[100];
int a[50][50];
void solve() {
	int cnt = 0;
	for (int i = 0; i < n; i++) {
		s[i] = -1;
		for (int j = 0; j < n; j++) {
			if (a[i][j] == 1) {
				s[i] = j;
			}
		}
	}
	for (int i = 0; i < n; i++) {
		int	pos = -1;
		for (int j = i; j < n; j++) {
			if (s[j] <= i) {
				pos = j;
				break;
			}
		}
		if (pos != -1) {
			for (int j = pos; j > i; j--) {
				swap(s[j], s[j - 1]);
				cnt++;
			}
		}
	}
	printf("%d", cnt);
}

int main() {
	scanf("%d", &n);
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < n; j++) {
			scanf("%d", &a[i][j]);
		}
	}
	solve();
	return 0;
}