Count all Possible Path.cpp

#include<bits/stdc++.h>
using namespace std;

class Solution {
public:
	int isPossible(vector<vector<int>>paths){
	    int n = paths.size();
	    for(int i=0;i<n;i++){
	        int degree = 0;
	        for(int j=0;j<n;j++){
	            if(paths[j][i]==1){
	                degree++;
	            }
	        }
	        if(degree%2==1){
	            return 0;
	        }
	    }
	    return 1;
	}
};
int main(){
	int tc;
	cin >> tc;
	while(tc--){
		int n;
		cin >> n;
		vector<vector<int>>paths(n, vector<int>(n, 0));
		for(int i = 0; i < n; i++){
			for(int j = 0; j < n; j++)
				cin >> paths[i][j];
		}
		Solution obj;
		int ans = obj.isPossible(paths);
		cout << ans <<"\n";
	}
	return 0;
}