Determinate,if it's possible,p numbers of n binary digits,so any 2 of this numbers to match in exactly m positions.There must no be positions same digit to appear in all the p numbers.
1 <= p <= 25
1 <= n <= 25
1 <= m <= n
a number can start with 0.
If it's possible ,the result is 1,else 0.
5 5 3 1 //first 3 are p,n,m and the last is result.
8 9 5 0
9 9 7 1
6 10 4 1
12 12 10 1
7 15 11 0
10 20 16 1
Is it that you don't understand what it is you're being asked to do, or that you don't know how to get started with the solution? If you really are completely clueless, and this is homework, you can always talk it over with your instructor. You can get help here, but you're expected to have a go at the solution yourself first.
Bob,this is a homework for me.I found the problem on a website and it looked interesting to me because i'm clueless.I understand what the problem asks,but i'm thinking of backtracking to generate all the solutions till 1 one them complete the requirements.I always make a code when i have an idea.But i don't have a certain idea till now.
The problem asks if it's possible,from all possible combinations,1 to aquire the requirements,so it's not just a check problem,it's about finding solution from all possible combinations of binary numbers.
I have a 2d matrix with dimension (3, n) called A, I want to calculate the normalization and cross product of two arrays (b,z) (see the code please) for each column (for the first column, then the second one and so on).
the function that I created to find the ...
Write a C program that should create a 10 element array of random integers (0 to 9). The program should total all of the numbers in the odd positions of the array and compare them with the total of the numbers in the even positions of the array and indicate ...