Matrix in C language

```c
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
main() {
long *matrice[3];
int i;
for(i=0; i<3; i++) {
int taille = sizeof(long[5]);
matrice[i] = (long *)malloc(taille);
int j;
for(j=0; j<5; j++) {
matrice[i][j] = ((j+1) & (int)pow(2,i)) >> i;
}
}
for(i=0; i<3; i++) {
int j;
for(j=0; j<5; j++) {
printf("%d ", matrice[i][j]);
}
printf("\n");
}
for(i=0; i<3; i++) {
free(matrice[i]);
}
}
```</math.h></stdlib.h></stdio.h>

Hello,

Here is a version without math.h

 #include <stdio.h> #define N_LINES 3 #define N_COLUMNS 5 int main() { unsigned int iLine; unsigned int iColumn; unsigned int matrix[N_LINES][N_COLUMNS]; // Initialization for ( iColumn = 0 ; iColumn < N_COLUMNS ; iColumn++ ) { for ( iLine = 0; iLine < N_LINES ; iLine++ ) { matrix[iLine][iColumn] = ((iColumn+1) >> iLine) & 1; } } // Display for ( unsigned int iLine = 0; iLine < N_LINES ; iLine++ ) { for ( unsigned int iColumn = 0 ; iColumn < N_COLUMNS ; iColumn++ ) { printf("%d ", matrix[iLine][iColumn]); } printf("\n"); } } 

matrix[iLine][iColumn] = ((iColumn+1) >> iLine) & 1;

We shift the column number bit to the least significant bit position using a right shift, and we remove the other bits with a binary AND.
No need for a math library for operations that almost every processor can do natively.

M.