The main problem here is not to solve the problem but to understand it !!
If someone could clarify this, it will be usefull for all.
thanks !
what is the question ?
Discussion en cours
Commentaires (2)
- Populaires
- Nouveau
- Anciennes
Tu dois être connecté(e) pour laisser un commentaire
Guadalupe Gagnon
23 janvier, 18:26
Simple, count the rectangles. In the example the 1's are "painted" and the 0's are not. See the attached photo for an example. The first 2 matrixes are pulled directly from the task conditions, then I added 2 additional examples for more clarification.
![]()
The task also specifies that the rectangles DO NOT touch or overlap. This is helpful because now you can determine a triangle simply by figuring out where the edges are or each unique triangle; either a 0 or the edge of the matrix.
The task also specifies that the rectangles DO NOT touch or overlap. This is helpful because now you can determine a triangle simply by figuring out where the edges are or each unique triangle; either a 0 or the edge of the matrix. 0
jpcouturier
24 janvier, 12:16
Yes, I finally got it ! My first approach wasn't so simple lol !
Thanks for help ;)
0