Open main menu
CDOT Wiki
β
Search
Changes
← Older edit
Newer edit →
BetaT
5 bytes removed
,
18:17, 29 March 2017
→
Optimizing Problems
{
un[k * nx + it - 1] = u[k * nx + it - 1];
}
for (int m = 1; m <= nx - 1; m++)
{
u[0 * nx + it] = un[1 * nx + it - 1];
}
}
}'''
Jadach1
212
edits