Simplified Sudoku

#include <iostream>
#include <vector>
using namespace std;
int main (){
	int n;
	int m = 0;
	int f;
	cin >> n;
	vector <vector<int>> grid (n, vector<int>(n));
	for (int q = 1;q <= n;q++){
		m = m + q;
	}
	for (int i = 0;i < n;i++){
		f = 0;
		for (int j = 0;j < n;j++){
			cin >> grid[i][j];
			f += grid[i][j];
		}
		if (f != m) {
			cout << "NO";
			exit(0);
		}
	}
	for (int k = 0;k < n;k++) {
		f =0;
		for (int l = 0;l < n;l++){
			f += grid[l][k];
		}
		if (f != m) {
			cout << "NO";
			exit(0);
		}
	}
	cout << "YES";
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED