Well "we" could try reading the algorithm description on wikipedia, then attempt some code to calculate the current row based on the previous row.
Eg.
Code:
int oldRow[10] = { 1 };
int newRow[10] = { 0 }; // make this contain { 1, 1, 0, 0, 0, 0, 0, 0, 0, 0 }
Then with some more iterations of the code.
Code:
int oldRow[10] = { 1, 3, 3, 1 };
int newRow[10] = { 0 }; // make this contain { 1, 4, 6, 4, 1, 0, 0, 0, 0, 0 }
I mean, once you have the algorithm in place, and an initialised row to work from, the rest is pretty easy.