Advertisement
Guest User

Untitled

a guest
Jun 25th, 2019
107
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.36 KB | None | 0 0
  1. unsigned int Findpairs(const std::vector<std::vector<unsigned int>>& A) {
  2. unsigned int count = 0;
  3.  
  4. for (unsigned int i = 0; i < (A.size()-1); i++) {
  5. for (unsigned int j = 0; j < (A[i].size()-1); j++){
  6. if(A[i][j]==1 && A[i+1][j]==1 && A[i+1][j+1]==1){
  7. count++;
  8. }
  9. }
  10. }
  11.  
  12. return (count);
  13. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement