Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- bool underpopulation (bool M[][n], int i, int j)
- {
- int cont=0;
- if (M[i-1][j-1])
- cont++;
- if (M[i-1][j])
- cont++;
- if (M[i-1][j+1])
- cont++;
- if (M[i][j-1])
- cont++;
- if (M[i][j+1])
- cont++;
- if (M[i+1][j-1])
- cont++;
- if (M[i+1][j])
- cont++;
- if (M[i+1][j+1])
- cont++;
- if(cont < 2)
- return true;
- return false;
- }
- bool overpopulation (bool M[][n], int i, int j)
- {
- int cont=0;
- if (M[i-1][j-1])
- cont++;
- if (M[i-1][j])
- cont++;
- if (M[i-1][j+1])
- cont++;
- if (M[i][j-1])
- cont++;
- if (M[i][j+1])
- cont++;
- if (M[i+1][j-1])
- cont++;
- if (M[i+1][j])
- cont++;
- if (M[i+1][j+1])
- cont++;
- if(cont > 3)
- return true;
- return false;
- }
- bool reproduction (bool M[][n], int i, int j)
- {
- int cont=0;
- if (M[i-1][j-1])
- cont++;
- if (M[i-1][j])
- cont++;
- if (M[i-1][j+1])
- cont++;
- if (M[i][j-1])
- cont++;
- if (M[i][j+1])
- cont++;
- if (M[i+1][j-1])
- cont++;
- if (M[i+1][j])
- cont++;
- if (M[i+1][j+1])
- cont++;
- if(cont == 3)
- return true;
- return false;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement