Page 1 of 1
difficult problem
Posted: Wed Nov 20, 2002 3:22 pm
by nghiank
test?
Don't understand your statement of the problem
Posted: Thu Nov 21, 2002 5:03 am
by Miguel Angel
Tell how many 2x2 matrix there are with the condition above or
Tell how many AxB matrix there are such that doesn't contain a 2x2 matrix with the condition above?
Posted: Sun Nov 24, 2002 11:29 am
by Shahab
Hi, nghiank
I can't understand your definition of the problem. Can you have some example matrices that satisfy this condition and that don't satisfy it?
Sincerely yours,
Shahab Tasharrofi
Posted: Mon Nov 25, 2002 4:36 pm
by junjieliang
Ok, this is how I understand it (but I can't solve it):
You have a matrix n*m, containing either 0 or 1. Out of the 2^(n*m) matrices, how many do not contain a 2*2 square with all 1s or 0s?
E.g.:
011
011
101
Contains a 2*2 square with 1s...
Which is why for same input, output is 14 (16 - all 1s and all 0s).
Does this help?