does the folowing operations :
- all the elements from aij and bij are multiplied by 100 and the are stored in B06_a, and B06_b ;
- To all the elements from B06_b aplies the transfomation bi-bi%2 ;
- it retains in b (mask) only the last octet ;
- Calculate bi*aij->bi
returns B06_a,B06_b,B06_k
Well I don't believe it's necessary to post you whole problem. No one will just do it for you...
However to * the diagonals I would do something like this:
PSEUDOCODE:
1 2 3 4 5
int end = //whatever your end x or y axis number is
int buffer = //array element in 0,0; //to store the multiplication results
for (int start = 1; start < end; start++){
result *= //array at [start][start]
}